download Mastguru Android App

Question Detail

Preorder is

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

Answer: Option A

Similar Questions :

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

  • linear list
  • tree
  • stack
  • queue

Answer: Option C

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

  • stack
  • branch
  • tree
  • queue

Answer: Option D

3. The complexity of linear search algorithm is

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

Answer: Option A

4. Which of the following name does not relate to stacks

  • FIFO lists
  • LIFO list
  • Piles
  • Push-down lists

Answer: Option A

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

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

Answer: Option D

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

  • Manish K Verma 12 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