**Davinder Singh**- 4 years ago in Data Structure

# The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?

Loading...

#### Related Questions

**Davinder Singh**- 4 years ago in Data Structure

Which of the following statement is true ?

- [A] Optimal binary search tree construction can be performed efficiently using dynamic programming.
- [B] Breath first search cannot be used to find converted components of a graph.
- [C] Given the prefix and post fix walks over a binary tree.The binary tree cannot be uniquely constructe
- [D] Depth first search can be used to find connected components of a graph.

**Davinder Singh**- 4 years ago in Data Structure

Which of the following is useful in implementing quick sort?

- [A] Stack
- [B] Set
- [C] List
- [D] Queue

**Davinder Singh**- 4 years ago in Data Structure

Which of the following algorithm design technique is used in the quick sort algorithm?

- [A] Dynamic programming
- [B] Backtracking
- [C] Divide and conquer
- [D] Greedy method

**Davinder Singh**- 4 years ago in Data Structure

Which of the following is useful in traversing a given graph by breadth first search?

- [A] Stack
- [B] Set
- [C] List
- [D] Queue

**Davinder Singh**- 4 years ago in Data Structure