Question:

What is the data structure used for converting a recursive program into the non-recursive version of the same?

Show Hint

The stack data structure is essential for managing function calls in recursive algorithms.

Updated On: May 3, 2025

Stack
Queue
Tree
Graph

Hide Solution

Verified By Collegedunia

The Correct Option is A

Solution and Explanation

A stack is used for storing the function calls and local variables during recursion. By simulating the recursive calls using a stack, we can convert a recursive program into an iterative one. This is done by using the stack to manage the execution flow and keeping track of the intermediate results.
Thus, the correct answer is \( \text{Stack} \).

Was this answer helpful?

Top Questions on Data Structures

Consider a directed graph \( G = (V,E) \), where \( V = \{0,1,2,\dots,100\} \) and
\[ E = \{(i,j) : 0 < j - i \leq 2, \text{ for all } i,j \in V \}. \] Suppose the adjacency list of each vertex is in decreasing order of vertex number, and depth-first search (DFS) is performed at vertex 0. The number of vertices that will be discovered after vertex 50 is:
- GATE DA - 2025
- Computer Science
- Data Structures
View Solution

Consider the following pseudocode.

Create empty stack S
Set x = 0, flag = 0, sum = 0
Push x onto S
while (S is not empty){
    if (flag equals 0){
        Set x = x + 1
        Push x onto S
    }
    if (x equals 8):
        Set flag = 1
    if (flag equals 1){
        x = Pop(S)
        if (x is odd):
            Pop(S)
        Set sum = sum + x
    }
}
Output sum

The value of \( sum \) output by a program executing the above pseudocode is:

View Solution

View More Questions

Questions Asked in AP PGECET exam

View More Questions