MCQ 1 The deletion operation in stack is called _____________.
MCQ 2 Which of the following is not the required condition for binary search algorithm?
MCQ 3 If the number of record to be sorted large and the key is short, then ____________ sorting can be efficient.
MCQ 4 Before deletion condition into stack ______________ has to be checked.
MCQ 5 A terminal node in a binary tree is called ?
MCQ 6 In a extended-binary tree nodes with 2 children are called ?
MCQ 7 Which of the following data structure is not linear data structure?
MCQ 8 The situation when in a linked list START = NULL is ______________.
MCQ 9 The term push and pop is related to the
MCQ 10 Representation of data structure in memory is known as _______________.
MCQ 11 Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
MCQ 12 To represent hierarchical relationship between elements, Which data structure is suitable?
MCQ 13 Which of the statement(s) about stack data structure is/are NOT correct?
MCQ 14 In a graph if E = (u, v) means ____________
MCQ 15 Binary trees with threads are called as _____________.
MCQ 16 If the elements A, B, C and D are placed in a stack and are deleted one at a time, what is the order of removal?
MCQ 17 A directed graph is _______________ if there is a path from each vertex to every other vertex in the digraph.
MCQ 18 Every node N in a binary tree T except the root has a unique parent called the __________ of N.
MCQ 19 Selection sort first finds the ____________ element in the list and put it in the first position.
MCQ 20 The operation that combines the element is of A and B in a single sorted list C with n = r + s element is called ____________.
MCQ 21 The function used to modify the way of sorting the keys of records is called _____________.
MCQ 22 If the number of records to be sorted is small, then _____________ sorting can be efficient.
MCQ 23 Complexity of linear search algorithm is ____________.
MCQ 24 _____________ is putting an element in the appropriate place in a sorted list yields a larger sorted order list.
MCQ 25 _____________ is rearranging pairs of elements which are out of order, until no such pairs remain.
