Which data structure is used for implementing recursion?

Related MCQs

• Consider the following statements:i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices. iv. Last-in-first-out type of computations are efficiently supported by QUEUES.Which of the following is correct?
• Which of following data structure is more appropriate for implementing quick sort iteratively?
• Which of the following data structure is not linear data structure?
• Which of the following data structure is linear data structure?
• Given an input arr = {2,5,7,99,899}; key = 899; What is the level of recursion?
• Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid values(corresponding array elements) in the first and second levels of recursion?
• What is the worst case complexity of binary search using recursion?
• What is the average case time complexity of binary search using recursion?
• 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?