https://sikshapath.in/question/write-a-top-level-program-for-creating-a-graph-instance-and-running-both-prims-and-kruskals-algorithms-on-it-and-printing-out-the-respective-msts-returned-along-with-the-total-cost/#comments

Write a top-level program for creating a GRAPH instance and running both Prim’s and Kruskal’s algorithms on it, and printing out the respective MSTs returned, along with the total cost and runtime (in milliseconds) for each one. The input to this top-level program should be an n × n cost matrix for a graph, n being the number of vertices (assume the diagonal elements will always be 0, and elements corresponding to unconnected vertices will be set to −1); this can be read in from a text file. A sample input file is provided at http://web.iitd.ac.in/~sumeet/input_graph.txt, which corresponds to the graph depicted.

See less

- 0
Share
Share

Sign Up

Sign In

Forgot Password

Consider the following transactions with data items P and Q initialized to zero: T1 : read (P) ; read (Q) ; if P = 0 then Q : = Q + 1 ; write (Q). T2 : read (Q) ; read (P) if Q = 0 then P : = P + 1 ; write (P). Give sequence of non-serial interleaving of T1 and T2 for concurrent execution.

IF the system recovers from a crash, it constructs an undo-list and a redo-list. Explain why log records for transactions on the undo-list must be processed in reverse order while those log records for transactions on the redo-list are processed in a forward direction.

If we have database, then how can we tell the data in the “database is secured”. Also what is meant by “data validation”

Can database Backup & Recovery from Catastrophic Failure is provided how? Illustrate with an example and possible recovery techniques.

Determine the normal Form of given Relation

Write a top-level program for creating a GRAPH instance and running both Prim’s and Kruskal’s algorithms on it, and printing out the respective MSTs returned, along with the total cost and runtime (in milliseconds) for each one