- Computer Science Engineering (CSE)
- Data Structure (DS)
- In ___ Data Structure data can be proces...

Q. |
## In ___ Data Structure data can be processed one by one sequentially |

A. | array |

B. | linked list |

C. | tree |

D. | none of these |

Answer» B. linked list |

View all MCQs in:
Data Structure (DS)

- Which of the following data structure is not linear data structure?
- A ……. is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
- Which of the following data structure can’t store the non-homogeneous data elements?
- Which of the following data structure can’t store the non-homogeneous data elements?
- Which data structure allows deleting data elements from and inserting at rear?
- Which data structure allows deleting data elements from front and inserting at rear?
- A data structure where elements can be added or removed at either end but not in the middle is called …
- A data structure where elements can be added or removed at either end but not in the middle is called …
- Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
- The data structure which is one ended is ………………

Login to Continue

It will take less than 2 minutes

Report MCQ