cs502, mid term, final term, quizes mcq's, new mcq, help for final term and quiz

[admin]

cs502, mid term, final term, quizes mcq's, new mcq, help for final term and quiz

Quiz Start Time: 06:56 PM
Time Left
84
sec(s)

Question # 1 of 10 ( Start time: 06:56:28 PM )
Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:









 




Quiz Start Time: 06:56 PM
Time Left
86
sec(s)

Question # 2 of 10 ( Start time: 06:56:41 PM )
Total Marks: 1
What algorithm technique is used in the implementation of Kruskal solution for the MST?
Select correct option:









 




Quiz Start Time: 06:56 PM
Time Left
85
sec(s)

Question # 3 of 10 ( Start time: 06:56:51 PM )
Total Marks: 1
Which is true statement in the following.
Select correct option:









 




Quiz Start Time: 06:56 PM
Time Left
85
sec(s)

Question # 4 of 10 ( Start time: 06:57:02 PM )
Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim’s algorithm?
Select correct option:









 




Quiz Start Time: 06:56 PM
Time Left
87
sec(s)

Question # 5 of 10 ( Start time: 06:57:14 PM )
Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T ?
Select correct option:









 




Quiz Start Time: 06:56 PM
Time Left
85
sec(s)

Question # 6 of 10 ( Start time: 06:57:26 PM )
Total Marks: 1
A digraph is strongly connected under what condition?
Select correct option:









 




Quiz Start Time: 06:56 PM
Time Left
86
sec(s)

Question # 7 of 10 ( Start time: 06:57:37 PM )
Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is,
Select correct option:









 




Quiz Start Time: 06:56 PM
Time Left
86
sec(s)

Question # 8 of 10 ( Start time: 06:57:47 PM )
Total Marks: 1
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?
Select correct option:









 
MC080408597 : Muhammad Asif



Quiz Start Time: 06:56 PM
Time Left
39
sec(s)

Question # 9 of 10 ( Start time: 06:57:58 PM )
Total Marks: 1
Dijkstra’s algorithm :
Select correct option:









 




Quiz Start Time: 06:56 PM
Time Left
85
sec(s)

Question # 10 of 10 ( Start time: 06:58:57 PM )
Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option: