## Overall Stats

## Answers

Ail Cass from Iraq is saying **Optimal binary search tree construction can be performed efficiently using dynamic programming.** is correct answer

Lets Know from Pakistan is saying **Depth first search can be used to find connected components of a graph.** is correct answer

Rohan Bhosale from Pune, India is saying **Depth first search can be used to find connected components of a graph.** is correct answer

Sangeetha A from Chennai, India is saying **Optimal binary search tree construction can be performed efficiently using dynamic programming.** is correct answer

Muhammad Asghar from Vehari, Pakistan is saying **Optimal binary search tree construction can be performed efficiently using dynamic programming.** is correct answer

## Related Questions

### Merge sort uses ?

- [A] Divide and conquer strategy
- [B] Backtracking approach
- [C] Heuristic search
- [D] Greedy approach

### An IP address is a numeric quantity that identifies -

- [A] a network adapter to other devices on the network
- [B] the manufacturer of a computer
- [C] the physical location of a computer
- [D] none of the above

### Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?

- [A] 3,4,5,1,2
- [B] 3,4,5,2,1
- [C] 1,5,2,3,4
- [D] 5,4,3,1,2

### 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