download Mastguru Android App

Question Detail

Preorder is

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

Answer: Option A

Similar Questions :

1. Information about an array used in a program will be stored in

  • symbol table
  • activation record
  • dope vector
  • system table

Answer: Option C

2. Which sorting method is slowest

  • Quick sort
  • Heap sort
  • Shell sort
  • Bubble sort

Answer: Option D

3. ++i is equivalent to

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

Answer: Option B

4. 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.

5. Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings

Answer: Option B

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

  • Manish K Verma 11 years ago

    How 'Depth First Ord' ??
    Plz Explain..!!

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