- Computer Science Engineering (CSE)
- Data Structure (DS)
- Which of the following data structure is...

Q. |
## Which of the following data structure is linear type? |

A. | graph |

B. | trees |

C. | binary tree |

D. | stack |

Answer» D. stack |

View all MCQs in:
Data Structure (DS)

- Which of the following data structure is not linear data structure?
- Which of the following data structure is non linear type?
- Which of the following data structure is non-linear type?
- Which of the following data structure is linear type?
- Which of the following data structure is linear type?
- 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?
- A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
- A ……………….. is a linear list in which insertions and deletions are made to from either end of the structure.
- Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?

Login to Continue

It will take less than 2 minutes

Report MCQ