Navigate

Question Detail

Deletion from one end and insertion from other end is

  • stack
  • branch
  • tree
  • queue

Answer: Option D

Similar Questions :

1. How many divisions are there in COBOL language

  • Two
  • Three
  • Four
  • Five

Answer: Option C

2. Merge sort uses

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

Answer: Option A

3. The complexity of Bubble sort algorithm is

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

Answer: Option C

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

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

Answer: Option C

5. The complexity of merge sort algorithm is

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

Answer: Option D

Read more from - Data Structure Questions Answers - Chapter 1