download Mastguru Android App

Question Detail

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

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

Answer: Option D

Similar Questions :

1. The complexity of Bubble sort algorithm is

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

Answer: Option C

2. The complexity of linear search algorithm is

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

Answer: Option A

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

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

Answer: Option C

4. Preorder is

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

Answer: Option A

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

  • stack
  • branch
  • tree
  • queue

Answer: Option D

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