## Overall Stats

## Answers

Serkie Mekonnen from Dessie, Ethiopia is saying **Depth first search can be used to find connected components of a graph.** is correct answer

Marem Husen from Al Musayyib, Iraq is saying **Optimal binary search tree construction can be performed efficiently using dynamic programming.** is correct answer

deepak kumar is saying **Breath first search cannot be used to find converted components of a graph.** is correct answer

Uga Balu from Chennai, India is saying **Depth first search can be used to find connected components of a graph.** is correct answer

uma from Hindupur, India is saying **Breath first search cannot be used to find converted components of a graph.** is correct answer

## Related Questions

### Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?

- [A] mn
- [B] max(m,n)
- [C] min(m,n)
- [D] m+n-1

### What is the result of the following operation Top (Push (S, X))

- [A] X
- [B] null
- [C] s
- [D] none of these