Which scheme provides good performance?

Related MCQs

• Which scheme uses a randomization approach?
• ………. sorting is good to use when alphabetizing a large list of names.
• Suppose implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?
• Consider a standard Circular Queue 'q' implementation (which has the same condition for Queue Full and Queue Empty) whose size is 11 and the elements of the queue are q[0], q[1], q[2].....,q[10]. The front and rear pointers are initialized to point at q[2] . In which position will the ninth element be added?
• For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
• Which if the following is/are the levels of implementation of data structure
• Which of the following is not the part of ADT description?
• ……………. Is a pile in which items are added at one end and removed from the other.
• Which data structure allows deleting data elements from and inserting at rear?
• Which of the following data structure can’t store the non-homogeneous data elements?