MCQ IN COMPUTER SCIENCE & ENGINEERING

COMPUTER SCIENCE AND ENGINEERING

DATA STRUCTURES

Please wait while the activity loads.
If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If loading fails, click here to try again

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]

Which data structure is mainly used for implementing the recursive algorithm?

A	Queue
B	Stack
C	Array
D	List

Explanation:

Detailed explanation-1: -Explanation: Since function calls are executed in Last In First Out order, stack is the data structure for converting recursive to iterative implementation.

Detailed explanation-2: -Array: In array implementation, the stack is formed using an array. All the operations are performed using arrays. You will see how all operations can be implemented on the stack in data structures using an array data structure.

Detailed explanation-3: -In short, the Data Structure used for Recursion is Stack (LIFO) Data Structure.

Detailed explanation-4: -Explanation-Stacks are used for the implementation of Recursion.

There is 1 question to complete.