Navigate

Question Detail

Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings

Answer: Option B

Similar Questions :

1. The complexity of linear search algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)

Answer: Option A

2. minimum number of stacks of size n required to implement a queue of size n

  • One
  • Two
  • Three
  • Four

Answer: Option B

3. Sort which compares adjacent elements in a list and switches where necessary is

  • Insertion sort
  • Heap sort
  • Quick sort
  • Bubble sort

Answer: Option D

4. Which is ALGOL based simulation language

  • FORTRAN
  • SIMSCRIPT
  • GASP IV
  • none of above

Answer: Option B

5. Which data structure is needed to convert infix notations to postfix notations

  • linear list
  • tree
  • stack
  • queue

Answer: Option C

Read more from - Data Structure Questions Answers - Chapter 1