download Mastguru Android App

Question Detail

Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings

Answer: Option B

Similar Questions :

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

  • linear list
  • tree
  • stack
  • queue

Answer: Option C

2. ++i is equivalent to

  • i = i + 2
  • i = i + 1
  • i = i + i
  • i = i - 1

Answer: Option B

3. Deletion from one end and insertion from other end is

  • stack
  • branch
  • tree
  • queue

Answer: Option D

4. Preorder is

  • depth first order
  • breadth first order
  • topological order
  • linear order

Answer: Option A

5. What are the minimum number of queues needed to implement the priority queue?

  • One
  • Two
  • Three
  • Four

Answer: Option B

Explanation:

One queue is used for the actual storing of data, and the other one is used for storing the priorities.

Read more from - Data Structure Questions Answers - Chapter 1
Post a comment

    Mastguru Youtube Channel

    Videos @mastguru

    Free useful videos - Subscribe Mastguru
     

    Get Free Current Affairs and Govt Jobs Alerts in your mailbox

    To Appreciate Our Effort, Please Like Us

    Quantitative Aptitude
    English Aptitude
    Reasoning Aptitude
    Computer Awareness
    General Knowledge
    Current Affairs
    IT Officer Aptitude
    Programming Aptitude
    Latest Govt Jobs