7 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.
Loading...
Next Question

Overall Stats

Attempted 244
Correct 30
Incorrect 56
Viewed 158

Answers

Guest
Guest
Ail Cass
Ail Cass - 6 months ago

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

Lets Know
Lets Know - 4 years ago

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

Rohan Bhosale
Rohan Bhosale - 4 years ago

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
Sangeetha A - 4 years ago

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

Muhammad Asghar
Muhammad Asghar - 4 years ago

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