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

Overall Stats

Attempted 388
Correct 92
Incorrect 92
Viewed 204

Answers

Guest
Guest
Sai Raj
Sai Raj - 3 days ago

Sai Raj is saying Set is correct answer

Marem Husen
Marem Husen - 1 month ago

Marem Husen from Al Musayyib, Iraq is saying Queue is correct answer

Uga Balu
Uga Balu - 1 month ago

Uga Balu from Chennai, India is saying Queue is correct answer

uma
uma - 1 month ago

uma from Hindupur, India is saying Queue is correct answer

Priya
Priya - 1 month ago

Priya from Hyderabad, India is saying Queue is correct answer

Related Questions

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

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

Sparse matrices have ?

  • [A] no zero
  • [B] many zero
  • [C] higher dimenstion
  • [D] none