download Mastguru Android App

Question Detail

The complexity of linear search algorithm is

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

Answer: Option A

Similar Questions :

1. O log(n) can be conneted with

  • Selection sort
  • Insertion sort
  • Binary sort
  • Merge sort

Answer: Option C

2. Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings

Answer: Option B

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

  • stack
  • branch
  • tree
  • queue

Answer: Option D

4. Which is problem oriented language

  • BASIC
  • PL/I
  • FORTRAN
  • none of above

Answer: Option D

5. Which is having highest precedence in C

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

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