We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>


Looking For Something at vustudents.ning.com? Click Here to Search

Quiz No. 02 of CS502 is scheduled on Tuesday, February 16, 2016 and will be closed on Wednesday, February 17, 2016.

This quiz would cover lectures 23-40. Total number of questions in the quiz is 10 and you had to attempt that quiz within 10 minutes time.

+ Click Here To Join also Our facebook study Group.

..How to Join Subject Study Groups & Get Helping Material?..


See Your Saved Posts Timeline

Views: 1885

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

Replies to This Discussion

Please all students related this subject Share your online Quizzes here to help each other.thanks

 

Please share the question and their answers of this quiz if anyone has done.
Thanks. 

dear felloooos all quiz questions from handouts...so easy

CS502 Past Quiz Lecture 23 to 45
Enjoy
http://bkserv3.net/smiley/101.gif

Attachments:

thanks.

CS502 Quiz #2 Lecture 23 to 40 17 feb 2016
Question # 1 of 10 ( Start time: 09:31:10 PM ) Total Marks: 1
For a digraph G = (V, E), Sum of in-degree(v) ____________
Select correct option

Not equal to Sum of out-degree(v)

= Sum of out-degree(v) ok

< Sum of out-degree(v)

> Sum of out-degree(v)
Question # 2 of 10 ( Start time: 09:32:33 PM ) Total Marks: 1
We say that two vertices u and v are mutually not reachable if u can reach v and vice versa.
Select correct option

True ok

False
Question # 4 of 10 ( Start time: 09:35:01 PM ) Total Marks: 1
In ________ problem, we want to find the best solution.
Select correct option

Minimization

Averaging

Optimization ok

Maximization
Question # 5 of 10 ( Start time: 09:35:50 PM ) Total Marks: 1
Timestamp structure of __________ is used in determining the strong components of a digraph.
Select correct option

DFS

BFS

Both DFS & BFS ok

None

Question # 6 of 10 ( Start time: 09:36:53 PM ) Total Marks: 1
The Huffman codes provide a method of _________ data efficiently.
Select correct option

Reading

Encoding ok

Decoding

Printing
Question # 7 of 10 ( Start time: 09:37:46 PM ) Total Marks: 1
In greedy algorithm, at each phase, you take the________ you can get right now, without regard for future consequences.
Select correct option

Worst

Minimum

Good

Best ok
Question # 8 of 10 ( Start time: 09:38:38 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 ok

The DFS forest has both back and forward edge

BFS forest has forward edge
Question # 9 of 10 ( Start time: 09:39:38 PM ) Total Marks: 1
In Activity selection (using Greedy approach), intuitively _________.
Select correct option

Short activities are not preferable

There are always short activities as input

We do not like long activities ok

It does not matter about the length of activities
Question # 10 of 10 ( Start time: 09:40:50 PM ) Total Marks: 1
Breadth-first search begins at a root node and inspects all the nodes except neighboring ones.
Select correct option

True

False ok

Attachments:

Attachments:

Attachments:

Attachments:

RSS

© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service