Computer Science, asked by jegdeshvar1414, 2 months ago

1.0 marks
Breadth first search uses
as an auxiliary to hold for future processing.
Graph
Queue
Linked List
Stack

Answers

Answered by hasritha57

Answer:

1.0 marks

Breadth first search uses

as an auxiliary to hold for future processing.

Graph

Queue

Linked List

Stack

Reason:

Queue is the data structure used by breadth first search as an auxiliary structure to hold nodes for future processing. 136. Reason: In the Kruskal’s algorithm, for the construction of minimal spanning tree for a graph, the selected edges always form a forest.

Previous Question

Next Question

Similar questions

English, 1 month ago

There was a brother and a sister, the brother was 21 years old and the sister was 16 years old. After 4 years the sis was 20 but the bro was still 21. What do you think in which month the bro was born? ( this is not a required question, so if you don't know the ans then pls leave it )...

Science, 1 month ago

what is science?????????

Math, 1 month ago

If x^2+1/x^2=51;find the value of x^3-1/x^3 Explain it clearly...

Math, 2 months ago

3/4 - 2/5subtract please give answer...

Science, 2 months ago