Question Detail

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

stack
queue
deque
tree

Answer: Option C

Similar Questions :

1. Merge sort uses

Divide and conquer strategy
Backtracking approach
Heuristic search
Greedy approach

Answer: Option A

2. O log(n) can be conneted with

Selection sort
Insertion sort
Binary sort
Merge sort

Answer: Option C

3. What are the minimum number of queues needed to implement the priority queue?

One
Two
Three
Four

Answer: Option B

Explanation:

One queue is used for the actual storing of data, and the other one is used for storing the priorities.

4. Recursive problems are implemented by

queues
stacks
linked lists
strings

Answer: Option B

5. Which statement we should ignore in structure programming

WHILE-DO
GO-TO
IT-ELSE
SWITCH

Answer: Option B

Read more from - Data Structure Questions Answers - Chapter 1