Which data structure is used for implementing recursion?
Asked in APSC 66 12/ Junior Manager (Electrical / Mechanical / IT/ INSTRUMENTATION) , in Assam Power Generation Corporation Limited (APGCL) (Advt. No. 12/, dtd 25-04-) ELECTRICAL ENGINEERING ME 2023
Show answer
Answer: A. Stack
More APSC Prelims previous year questions questions
- Level of node is distance from root to that node. For example, level of root is 1 and level of left and right children of root is 2. The maximum number of nodes on level i of a binary tree is
- Suppose we are sorting an array of eight integers using quicksort, and we have just finished the first partitioning with the array looking like 2 5 1 7 9 12 11 10 Which of the following statements is correct?
- Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum one or two elements are misplaced)?
- Consider a B+ tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?
- The data structure required to check whether an expression contains a balanced parenthesis is
- Which data structure is needed to convert infix notation to postfix notation?
- What is the value of the postfix expression 6324+_*?
- Which type of data structure is a ternary heap?