download Mastguru Android App

Question Detail

Preorder is

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

Answer: Option A

Similar Questions :

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

2. The complexity of Bubble sort algorithm is

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

Answer: Option C

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. A graph with one or more edges is at least

  • 1-chromatic
  • 2-chromatic
  • 3-chromatic
  • 4-chromatic

Answer: Option B

5. The memory address of the first element of an array is called

  • floor address
  • first address
  • foundation address
  • base address

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