MCQ 1 When new data are to be inserted into a data structure, but there is not available space; this situation is usually called ______________.
MCQ 2 A linear collection of data elements where the linear node is given by means of pointer is called
MCQ 3 Which of the following data structure is not linear data structure?
MCQ 4 Two main measures for the efficiency of an algorithm are ________________.
MCQ 5 The operation of processing each element in the list is known as ____________.
MCQ 6 Each array declaration need not give, implicitly or explicitly, the information about
MCQ 7 The complexity of Binary search algorithm is
MCQ 8 Any node is the path from the root to the node is called?
MCQ 9 The word "Stack" is also known as ______________.
MCQ 10 The Average case occur in linear search algorithm.
MCQ 11 The advantage of ________________ is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists.
MCQ 12 Other name for directed graph is ______________ .
MCQ 13 The condition ______________ indicate the queue is empty.
MCQ 14 The various operations that can be performed on stacks is/are
MCQ 15 Very slow way of sorting is _____________.
MCQ 16 Reversing a great deal of space for each stack in memory will be.
MCQ 17 Link fields holds pointers to the ____________ element in the linked representation of stack.
MCQ 18 The data structure which is one ended is _____________.
MCQ 19 Which indicates pre-order traversal?
MCQ 20 ____________ sorting is good to use when alphabetizing large list of names.
MCQ 21 The total number of comparisons in a bubble sort is ______________.
MCQ 22 The easiest sorting is _________________.
MCQ 23 Quick sort is also known as _________________
MCQ 24 Sorting a file F usually refers to sorting F with respect to a particular key called _______________
MCQ 25 Which of the following sorting algorithm is of priority queue sorting type?