McqMate

Q. |
## In BFS, how many times a node is visited? |

A. | once |

B. | twice |

C. | equivalent to number of indegree of the node |

D. | thrice |

Answer» C. equivalent to number of indegree of the node |

1.4k

0

Do you find this helpful?

1

View all MCQs in

High Performance Computing (HPC)No comments yet

- If the heuristic is admissible, the BFS finds the optimal solution.
- Best-first search (BFS) algorithms can search both graphs and trees.
- important component of best-first search (BFS) algorithms is
- In a eight node ring, node ____ is source of broadcast
- In the scatter operation ____ node send message to every other node
- In a three-cube structure, node 101 cannot communicate directly with node?
- In which of the following operation, a single node sends a unique message of size m to every other node?
- if "X" is the message to broadcast it initially resides at the source node
- Each node first sends to one of its neighbours the data it need to....
- every node on the linear array has the data and broadcast on the columns with the linear array algorithm in _____