adplus-dvertising
frame-decoration

Question

Which data structure is used for implementing recursion?

a.

Queue

b.

Stack

c.

Arrays

d.

List

Answer: (b).Stack

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Which data structure is used for implementing recursion?

Similar Questions

Discover Related MCQs

Q. The equivalent prefix expression for the following infix expression (A+B)-(C+D*E)/F*G is

Q. The result of evaluating the postfix expression 5, 4, 6, +, *, 4, 9, 3, /, +, * is

Q. In Reverse Polish notation, expression A*B+C*D is written as

Q. __________is a linear data structure in which an element can be added or removed only at one end.

Q. In stack terminology, the __________operations are known as push and pop operations respectively.

Q. A stack works on the principle of____________.

Q. A common example of a queue is people waiting in line at a__________.

Q. What is one of the common examples of a stack?

Q. When a stack is organized as an array, a variable named Top is used to point to the top element of the stack. Initially, the value of Top is set to_______to indicate an empty stack.

Q. What happens when the stack is full and there is no space for a new element, and an attempt is made to push a new element?

Q. The total number of elements in a stack at a given point of time can be calculated from the value of______.

Q. Jan Lukasiewicz, who suggested two alternative notations to represent an arithmetic expression belonged to which nationality?

Q. In a computer system, when an __________ expression in an infix notation needs to be evaluated, it is first converted into its postfix notation?

Q. The postfix form of the following infix notation is :

(A + B)* (C*D − E)* F

Q. What are the sequence of popped out values if the sequence of operations - push(1), push(2), pop, push(1), push(2), pop, pop, pop, push(2), pop are performed on a stack.

Q. In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is ............

Q. push() and pop() functions are found in ...............

Q. The result of evaluating the following postfix expression is
5, 7, 9, *, +, 4, 9, 3, /, +, -

Q. An infix expression can be converted to a postfix expression using a .................

Q. A data structure in which an element is added and removed only from one end, is known as