Graphs - Study Mode

Show All Answers

[#81] If a Graph Structured Stack contains {1, 2, 3, 4} {1, 5, 3, 4} {1, 6, 7, 4} and {8, 9, 7, 4}, what would be the source and sink vertices of the DAC?

(A) Source - 1, 8 Sink - 7,4

(B) Source - 1 Sink - 8,4

(C) Source - 1, 8 Sink - 4

(D) Source - 4, Sink - 1,8

Correct Answer

(C) Source - 1, 8 Sink - 4

[#82] For the given conditions, which of the following is in the correct order of increasing space requirement? i. Undirected, no weight ii. Directed, no weight iii. Directed, weighted iv. Undirected, weighted

(A) ii, iii, I, iv

(B) I, iii, ii, iv

(C) iv, iii, I, ii

(D) I, ii, iii, iv

Correct Answer

(A) ii, iii, I, iv

[#83] With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?

(A) (V*(V-1))/2

(B) (V*(V+1))/2

(C) (V+1)C2

(D) (V-1)C2

Correct Answer

(A) (V*(V-1))/2

[#84] MultiGraphs having self-loops are called PseudoGraphs?

(A) True

(B) False

Correct Answer

(A) True

[#85] Dijkstra's Algorithm will work for both negative and positive weights?

(A) True

(B) False

Correct Answer

(B) False