Which of the following is non-liner data structure?
List
Stacks
Trees
Strings
Also checkout these categories
Course of Action MCQ Idioms & Phrases MCQ Rearrangement Set 9 MCQ Phylum - Amphibia MCQ Plants Physiology MCQ Respiratory System MCQ Change of State MCQ Blood Relation MCQ Phylum - Coelentrata MCQ Skin Anatomy and Physiology MCQ Boats and Streams MCQ Circulatory System MCQ
- Which of the following data structure can't store the non-homogeneous data elements?
- _______ level is where the model becomes compatible executable code
- Herder node is used as sentinel in ____
- Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…
- Which of the following data structure cant store the non-homogeneous data elements?
- Which of the following data structures are indexed structures?
- To represent hierarchical relationship between elements, Which data structure is suitable?
- The elements of an array are stored successively in memory cells because
- Linked list are not suitable data structure of which one of the following problems ?
- Binary search algorithm can not be applied to
- The complexity of Bubble sort algorithm is
- The difference between linear array and a record is
- When determining the efficiency of algorithm, the space factor is measured by
- Which of the following is not the part of ADT description?
- Which of the following data structure is linear type?
- Which of the following is non-liner data structure?
- Which of the following data structure store the homogeneous data elements?
- The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…
- The complexity of linear search algorithm is
- Which data structure allows deleting data elements from and inserting at rear?
- The complexity of merge sort algorithm is
- The term push and pop is related to the
- When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
- A data structure where elements can be added or removed at either end but not in the middle
- The memory address of fifth element of an array can be calculated by the formula
- In linear search algorithm the Worst case occurs when
- Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…
- When new data are to be inserted into a data structure, but there is no available space; this situation…
- The memory address of the first element of an array is called
- Which of the following case does not exist in complexity theory