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

Create your Digital Resume For FREE on your name's sub domain "yourname.wcard.io". Register Here!


Overall Stats

Attempted 239
Correct 29
Incorrect 56
Viewed 154

Answers

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

Sajan S Jabbar
Sajan S Jabbar - 4 years ago

Sajan S Jabbar from United Arab Emirates is saying Depth first search can be used to find connected components of a graph. is correct answer

Related Questions

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 ?

  • [A] 2 deletions and 3 additions
  • [B] 3 additions and 2 deletions
  • [C] 3 deletions and 3 additions
  • [D] 3 deletions and 4 additions

Queue can be used to implement ?

  • [A] quick sort
  • [B] merge sort
  • [C] heap sort
  • [D] insertion sort

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