Question

You are managing a large scale construction project with hundreds of subprojects, some which have to be completed before others can begin whereas some subprojects can be carried out simultaneously. The project and its subprojects, and the presence of dependencies between subprojects (which subprojects have to be done before which), can be modeled as a connected unweighted directed graph with nodes representing subprojects and directed edges representing dependencies. 42. Which of the following algorithms will allow you to determine if there is a cycle of dependencies among subprojects in this large project that will prevent you from completing the project? A. Depth-first search B. Any algorithm to find a Hamiltonian Circuit C. Topological sort D. Any algorithm to find a Vertex Cover E. Any algorithm to find a Clique 43. Which of the following algorithms will allow you to determine a way to do the subprojects one after the other so that the construction project can be completed while ensuring that no subproject is started before all subprojects that have to be done before it are completed? A. Depth-first search B. Any algorithm to find a Hamiltonian Circuit C. Topological sort D. Any algorithm to find a Vertex Cover E. Any algorithm to find a Clique 44. You have designed and built a wired computer network for the Pentagon. The top brass gives you a list of key commanders and asks you to check whether their computers are connected in such a way that even if any one commander's computer is taken down by a cyber attack, the computer of any other commander will be able to communicate with the computer of any other commander (except the one whose computer is down) over a direct network connection linking the two computers. Which algorithm can you use to check this? A. Depth-first search B. Any algorithm to find a Hamiltonian Circuit C. Topological sort D. Any algorithm to find a Vertex Cover E. Any algorithm to find a Clique 45. The top brass then asks you to check whether there is a set of computers on the network such that if a cyber attack takes all of those down, then none of the remaining working computers will be able to communicate with any other working computer on the network. Which algorithm can you use to check this? A. Depth-first search B. Any algorithm to find a Hamiltonian Circuit C. Topological sort D. Any algorithm to find a Vertex Cover E. Any algorithm to find a Clique 46. The top brass then asks you to verify whether all computers on the network are in working order once every day by sending a packet from your computer and routing it so that it goes to every other computer in the network and returns to your computer (if the packet returns to your computer you know all computers are working) with every other computer in the network receiving the packet and sending it to another computer only once which algorithm can you use to decide how to route the packet? A. Depth-first search B. Any algorithm to find a Hamiltonian Circuit

Answer 1

42. A.Depth-first search.

43. C.Topological sort.

44. E.Any algorithm to find a clique.

45. D.Any algorithm to find vertex cover.

46. B.Any algorithm to find a Hamiltonian circuit.

47. True.

48. B

49. True.