Navigate

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. Merge sort uses

  • Divide and conquer strategy
  • Backtracking approach
  • Heuristic search
  • Greedy approach

Answer: Option A

2. The memory address of the first element of an array is called

  • floor address
  • first address
  • foundation address
  • base address

Answer: Option D

3. Which statement we should ignore in structure programming

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

Answer: Option B

4. ++i is equivalent to

  • i = i + 2
  • i = i + 1
  • i = i + i
  • i = i - 1

Answer: Option B

5. Which of the following name does not relate to stacks

  • FIFO lists
  • LIFO list
  • Piles
  • Push-down lists

Answer: Option A

Read more from - Data Structure Questions Answers - Chapter 1