download Mastguru Android App

Question Detail

The complexity of merge sort algorithm is

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

Answer: Option D

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. Which is having highest precedence in C

  • relational operators
  • equality operator
  • logical operator
  • arithmetic operator

Answer: Option D

3. The complexity of Binary search algorithm is

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

Answer: Option B

4. Which statement we should ignore in structure programming

  • WHILE-DO
  • GO-TO
  • IT-ELSE
  • SWITCH

Answer: Option B

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

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

Answer: Option C

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