- Computer Science Engineering (CSE)
- Data Structures (DS)
- Linear Data Structures -Stacks and Queue...
- What data structure would you mostly lik...

Q. |
## What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm? |

A. | Linked List |

B. | Stack |

C. | Queue |

D. | Tree |

Answer» B. Stack |

View all MCQs in:
Data Structures (DS)

- Which of the following data structure is linear data structure?
- Consider the usual algorithm for determining whether a sequence of parentheses is balanced. Suppose that you run the algorithm on a sequence that contains 2 left parentheses and 3 right parentheses (in some order). The maximum number of parentheses that appear on the stack AT ANY ONE TIME during the computation?
- Which of the following data structure is non-linear type?
- Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
- The efficient searching algorithm for algorithm for a sorted array is _________.
- What is the space complexity of the post-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
- What is the space complexity of the in-order traversal in the recursive fashion? (d is the tree depth and n is the number of nodes)
- What is the advantage of recursive approach than an iterative approach?
- New data are to be inserted into a data structure, but there is no available space; this situation is usually called__________.
- Which data structure allows deleting data elements from front and inserting at rear?

Login to Continue

It will take less than 2 minutes

Report MCQ