CS502 Current Quiz

Quiz Start Time: 05:02 PM
Time Left 31
sec(s)
Question # 2 of 10 ( Start time: 05:03:27 PM ) Total Marks: 1
What general property of the list indicates that the graph has an isolated vertex?
Select correct option:
There is Null pointer at the end of list.
The Isolated vertex is not handled in list.
Only one value is entered in the list.
There is at least one null list.
Click here to Save Answer & Move to Next Question
Quiz Start Time: 05:02 PM
Time Left 16
sec(s)
Question # 3 of 10 ( Start time: 05:04:40 PM ) Total Marks: 1
Which statement is true?
Select correct option:
If a dynamic-programming problem satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.
If a greedy choice property satisfies the optimal-substructure property, then a locally optimal solution is globally optimal.
Both of above
None of above
Click here to Save Answer & Move to Next Question
Quiz Start Time: 05:02 PM
Time Left 37
sec(s)
Question # 10 of 10 ( Start time: 05:13:51 PM ) Total Marks: 1
Forward edge is:
Select correct option:
(u, v) where u is a proper descendent of v in the tree.
(u, v) where v is a proper descendent of u in the tree.
(u, v) where v is a proper ancesstor of u in the tree.
(u, v) where u is a proper ancesstor of v in the tree.
Click here to Save Answer & Move to Next Question
Quiz Start Time: 05:45 PM
Time Left 71
sec(s)
Question # 2 of 10 ( Start time: 05:46: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
Click here to Save Answer & Move to Next Question
Quiz Start Time: 05:45 PM
Time Left 72
sec(s)
Question # 3 of 10 ( Start time: 05:47:12 PM ) Total Marks: 1
Cross edge is :
Select correct option:
(u, v) where u and v are not ancestor of one another
(u, v) where u is ancesstor of v and v is not descendent of u.
(u, v) where u and v are not ancestor or descendent of one another
(u, v) where u and v are either ancestor or descendent of one another.
Click here to Save Answer & Move to Next Question
Quiz Start Time: 05:45 PM
Time Left 73
sec(s)
Question # 4 of 10 ( Start time: 05:47:37 PM ) Total Marks: 1
Forward edge is:
Select correct option:
(u, v) where u is a proper descendent of v in the tree.
(u, v) where v is a proper descendent of u in the tree.
(u, v) where v is a proper ancesstor of u in the tree.
(u, v) where u is a proper ancesstor of v in the tree.
Click here to Save Answer & Move to Next Question
Quiz Start Time: 05:45 PM
Time Left 69
sec(s)
Question # 6 of 10 ( Start time: 05:49:21 PM ) Total Marks: 1
Using ASCII standard the string “abacdaacacwe” will be encoded with __________ bits
Select correct option:
64
128
96
120
Click here to Save Answer & Move to Next Question
Quiz Start Time: 05:45 PM
Time Left 13
sec(s)
Question # 7 of 10 ( Start time: 05:49:48 PM ) Total Marks: 1
Suppose that a graph G = (V,E) is implemented using adjacency lists. What is the complexity of a breadth-first
traversal of G?
Select correct option:
O(|V |^2)
O(|V | |E|)
O(|V |^2|E|)
O(|V | + |E|)
Click here to Save Answer & Move to Next Question
Quiz Start Time: 05:45 PM
Time Left 86
sec(s)
Question # 9 of 10 ( Start time: 05:52:43 PM ) Total Marks: 1
A dense undirected graph is:
Select correct option:
A graph in which E = O(V^2)
A graph in which E = O(V)
A graph in which E = O(log V)
All items above may be used to characterize a dense undirected graph
Click here to Save Answer & Move to Next Question