MCQ 1 The number of comparisons done by sequential search is _______________.
MCQ 2 In a circular queue the value of r will be ____________ .
MCQ 3 State true or false.
MCQ 4 A data structure where elements can be added or removed at either end but not in the middle is called ______________.
MCQ 5 Which of the following data structure is non-linear type?
MCQ 6 Which of the following data structure is linear type?
MCQ 7 When does top value of the stack changes?
MCQ 8 The disadvantage in using a circular linked list is ____________.
MCQ 9 Which of the following data structure is not linear data structure?
MCQ 10 A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..
MCQ 11 A list which displays the relationship of adjacency between elements is said to be
MCQ 12 A connected graph T without any cycles is called _____________.
MCQ 13 Which of the following data structures are indexed structures?
MCQ 14 _____________ is a pile in which items are added at one end and removed from the other.
MCQ 15 Which of the following is not the part of ADT description?
MCQ 16 The use of pointers to refer elements of a data structure in which elements are logically adjacent is _______________.
MCQ 17 A _____________ does not keep track of address of every element in the list.
MCQ 18 In a priority queue, insertion and deletion takes place at ______________
MCQ 19 Which of the following data structure is linear data structure?
MCQ 20 Graph G is ______________ if for any pair u, v of nodes in G there is a path from u to v or path from v to u.
MCQ 21 Trees are said ________________ if they are similar and have same contents at corresponding nodes.
MCQ 22 Sequential representation of binary tree uses ______________.
MCQ 23 The depth of complete binary tree is given by _____________.
MCQ 24 In ____________ search start at the beginning of the list and check every element in the list.
MCQ 25 Which of the following is not the internal sort?