naveedabbas17: br latest quiz cs502 mila
naveedabbas17: whr r u
wafiullah: g br
Quiz Start Time: 10:49 PM
Time Left 74
sec(s)
Question # 1 of 10 ( Start time: 10:49:41 PM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
Kruskal's algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV)
Both of above
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best Tree edge) when the graph has relatively few edges.
naveedabbas17: tell ans
wafiullah: Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best Tree edge) when the graph has relatively few edges.
wafiullah: have found
naveedabbas17: BC090200044 : Naveed Abbas
Quiz Start Time: 10:49 PM
Time Left 87
sec(s)
Question # 2 of 10 ( Start time: 10:50:58 PM ) Total Marks: 1
Which is true statement.
Select correct option:
Breadth first search is shortest path algorithm that works on un-weighted graphs
Depth first search is shortest path algorithm that works on un-weighted graphs.
Both of above are true.
None of above are true.
wafiullah: Breadth first search is shortest path algorithm that works on un-weighted graphs
naveedabbas17: BC090200044 : Naveed Abbas
Quiz Start Time: 10:49 PM
Time Left 87
sec(s)
Question # 3 of 10 ( Start time: 10:52:18 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim's algorithm?
Select correct option:
log (V)
V.V
E.E
log (E)
wafiullah: log (V)
naveedabbas17: BC090200044 : Naveed Abbas
Quiz Start Time: 10:49 PM
Time Left 88
sec(s)
Question # 4 of 10 ( Start time: 10:53:03 PM ) Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is,
Select correct option:
Both are equal
Back edges are half of cycles
Back edges are one quarter of cycles
There is no relationship between no. of edges and cycles
naveedabbas17: BC090200044 : Naveed Abbas
Quiz Start Time: 10:49 PM
Time Left 86
sec(s)
Question # 5 of 10 ( Start time: 10:54:28 PM ) Total Marks: 1
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the graph has relatively few edges.
Select correct option:
True
False
naveedabbas17: BC090200044 : Naveed Abbas
Quiz Start Time: 10:49 PM
Time Left 68
sec(s)
Question # 6 of 10 ( Start time: 10:55:28 PM ) Total Marks: 1
In digraph G=(V,E) ;G has cycle if and only if
Select correct option:
The DFS forest has forward edge.
The DFS forest has back edge
The DFS forest has both back and forward edge
BFS forest has forward edge
naveedabbas17: BC090200044 : Naveed Abbas
Quiz Start Time: 10:49 PM
Time Left 80
sec(s)
Question # 7 of 10 ( Start time: 10:57:01 PM ) Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option:
Both are equal.
Cycles are half of back edges.
Cycles are one fourth of back edges.
There is no relationship between back edges and number of cycles.
naveedabbas17: BC090200044 : Naveed Abbas
Quiz Start Time: 10:49 PM
Time Left 64
sec(s)
Question # 8 of 10 ( Start time: 10:57:27 PM ) Total Marks: 1
A digraph is strongly connected under what condition?
Select correct option:
A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .
A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v and vice versa.
A digraph is strongly connected if for at least one pair of vertex u, v e V, u can reach v and vice versa.
A digraph is strongly connected if at least one third pair of vertices u, v e V, u can reach v and vice versa.
naveedabbas17: BC090200044 : Naveed Abbas
Quiz Start Time: 10:49 PM
Time Left 44
sec(s)
Question # 9 of 10 ( Start time: 10:58:50 PM ) Total Marks: 1
If you find yourself in maze the better traversel approach will be :
Select correct option:
BFS
BFS and DFS both are valid
Level order
DFS
wafiullah: BFS
naveedabbas17: BC090200044 : Naveed Abbas
Quiz Start Time: 10:49 PM
Time Left 85
sec(s)
Question # 10 of 10 ( Start time: 11:00:12 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:
(V+E)
V.E
V
E
wafiullah: bcz u have chkd it
naveedabbas17: done
Quiz Start Time: 11:07 PM
Time Left 87
sec(s)
Question # 1 of 10 ( Start time: 11:07:45 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:
(V+E)
V.E
V
E
naveedabbas17: (V+E)
naveedabbas17: ans
wafiullah: (V+E)
wafiullah: yes
naveedabbas17: BC090200783 : Wafiullah
Quiz Start Time: 11:07 PM
Time Left 87
sec(s)
Question # 2 of 10 ( Start time: 11:08:28 PM ) Total Marks: 1
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the graph has relatively few edges.
Select correct option:
True
False
naveedabbas17: true
wafiullah: True
naveedabbas17: BC090200783 : Wafiullah
Quiz Start Time: 11:07 PM
Time Left 87
sec(s)
Question # 3 of 10 ( Start time: 11:09:01 PM ) Total Marks: 1
The relationship between number of back edges and number of cycles in DFS is,
Select correct option:
Both are equal
Back edges are half of cycles
Back edges are one quarter of cycles
There is no relationship between no. of edges and cycles
wafiullah: u see it
naveedabbas17: both r equal
wafiullah: ok br
naveedabbas17: BC090200783 : Wafiullah
Quiz Start Time: 11:07 PM
Time Left 87
sec(s)
Question # 4 of 10 ( Start time: 11:09:41 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim's algorithm?
Select correct option:
log (V)
V.V
E.E
log (E)
naveedabbas17: log(v)
naveedabbas17: ans
wafiullah: log (V)
wafiullah: ye
naveedabbas17: BC090200783 : Wafiullah
Quiz Start Time: 11:07 PM
Time Left 87
sec(s)
Question # 5 of 10 ( Start time: 11:10:14 PM ) Total Marks: 1
Which is true statement in the following.
Select correct option:
Kruskal algorithm is multiple source technique for finding MST.
Kruskal's algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV)
Both of above
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best Tree edge) when the graph has relatively few edges.
naveedabbas17: Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best Tree edge) when the graph has relatively few edges. ans
wafiullah: yes
wafiullah: b r
naveedabbas17: BC090200783 : Wafiullah
Quiz Start Time: 11:07 PM
Time Left 87
sec(s)
Question # 6 of 10 ( Start time: 11:10:56 PM ) Total Marks: 1
What is the time complexity to extract a vertex from the priority queue in Prim's algorithm?
Select correct option:
O (log E)
? (V)
? (V+E)
O (log V)
wafiullah: ? (V+E)
wafiullah: see it
wafiullah: O (log V)
naveedabbas17: BC090200783 : Wafiullah
Quiz Start Time: 11:07 PM
Time Left 85
sec(s)
Question # 7 of 10 ( Start time: 11:12:16 PM ) Total Marks: 1
What algorithm technique is used in the implementation of Kruskal solution for the MST?
Select correct option:
Greedy Technique
Divide-and-Conquer Technique
Dynamic Programming Technique
The algorithm combines more than one of the above techniques
naveedabbas17: Greedy Technique ans
wafiullah: Greedy Technique
naveedabbas17: BC090200783 : Wafiullah
Quiz Start Time: 11:07 PM
Time Left 87
sec(s)
Question # 8 of 10 ( Start time: 11:12:45 PM ) Total Marks: 1
A digraph is strongly connected under what condition?
Select correct option:
A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v .
A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v and vice versa.
A digraph is strongly connected if for at least one pair of vertex u, v e V, u can reach v and vice versa.
A digraph is strongly connected if at least one third pair of vertices u, v e V, u can reach v and vice versa.
naveedabbas17: A digraph is strongly connected if for every pair of vertices u, v e V, u can reach v and vice versa. ans
wafiullah: yes
wafiullah: br
naveedabbas17: BC090200783 : Wafiullah
Quiz Start Time: 11:07 PM
Time Left 86
sec(s)
Question # 9 of 10 ( Start time: 11:13:31 PM ) Total Marks: 1
There is relationship between number of back edges and number of cycles in DFS
Select correct option:
Both are equal.
Cycles are half of back edges.
Cycles are one fourth of back edges.
There is no relationship between back edges and number of cycles.
wafiullah: see it
naveedabbas17: both are equal .i think
wafiullah: yes
naveedabbas17: BC090200783 : Wafiullah
Quiz Start Time: 11:07 PM
Time Left 85
sec(s)
Question # 10 of 10 ( Start time: 11:14:45 PM ) Total Marks: 1
Back edge is:
Select correct option:
(u, v) where v is an ancestor of u in the tree.
(u,v) where u is an ancesstor of v in the tree.
(u, v) where v is an predcessor of u in the tree.
None of above
naveedabbas17: (u, v) where v is an ancestor of u in the tree.
wafiullah: yes
naveedabbas17: dne
wafiullah: thanks
On Sun, Sep 25, 2011 at 10:16 AM, Adnan Majeed <mc100202206@vu.edu.pk> wrote:
AOA
I NEED MIDTERM SOLVED SUBJECTIVE AS WELL MCQ PORTION SOLVED PAPER IS REQUIRED FOR MIDTERM PREPARATION THERE IS A LITTLE BIT TIME FOR MIDTERM EXAMS PL SEND ME VU SENIORS URGENTLY
THANKS IN ADVANCE WITH COMPLIMENTS--Best RegardsAdnan MajeedMCS(Virtual University of Pakistan Lahore)
--
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To post to this group, send email to pak-youth@googlegroups.com.
To unsubscribe from this group, send email to pak-youth+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/pak-youth?hl=en.
--
You received this message because you are subscribed to the Google Groups "Pak Youth" group.
To post to this group, send email to pak-youth@googlegroups.com.
To unsubscribe from this group, send email to pak-youth+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/pak-youth?hl=en.
No comments:
Post a Comment