download Mastguru Android App

Question Detail

The complexity of Binary search algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)
Similar Questions :

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

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

2. Which of the languages is often translated to the pseudo code

  • PASCAL
  • FORTRAN
  • PL/I
  • BASIC

3. Repeated execution of simple computation may cause compounding of

  • round off errors
  • syntax errors
  • run time errors
  • logic errors

4. A linear list from which elements can be added or removed from either end is called

  • stack
  • queue
  • deque
  • tree

5. Recursive problems are implemented by

  • queues
  • stacks
  • linked lists
  • strings
Read more from - Data Structure Questions Answers - Chapter 1
Post a comment