download Mastguru Android App

Question Detail

++i is equivalent to

  • i = i + 2
  • i = i + 1
  • i = i + i
  • i = i - 1
Similar Questions :

1. The complexity of merge sort algorithm is

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

2. O log(n) can be conneted with

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

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

  • stack
  • queue
  • deque
  • tree

4. Which is problem oriented language

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

5. Merge sort uses

  • Divide and conquer strategy
  • Backtracking approach
  • Heuristic search
  • Greedy approach
Read more from - Data Structure Questions Answers - Chapter 1
Post a comment