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

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

# cs502 quiz # 2 opening date 29-01-2015

lec 14 to 23.....

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

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?

Views: 3106

.

+ 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.

ahan

no sharing

today my quiz of cs502

Attachments:

Thanksssssssssss Anmol Maha

Anmol Maha gud keep it up & thanks for sharing

1:     In ______ Knapsack Problem, limitation is that an item can either be put in the bag or not-fractional items are not allowed.

1. 0
2. 1
3. 0/1           (not sure)
4. fractional

2:  For comparison-based sorting algorithms, it is _____ possible to sort more efficiently than Omega nlog(n) time.

1. Always       (not sure)
2. not
3. sometime not
4. sometime

3:  The knapsack problem do not belong to the domain of optimization problems.

1. true
2. false

4:    In Knapsack Problem, the thief’s goal is to put items in the bag such that the ______ of the items does not exceed the limit of the bag.

1. Value
2. Weight
3. Length
4. Balance

5:     A sorting algorithm is called as ________ if duplicate elements remain in the same relative position after sorting.

1. Parallel
2. O(n) algorithm
3. Stable
4. complex

6: A greedy algorithm sometimes works well for optimization problems.

1. true
2. false

7:      A greedy algorithm does not work in phases.

1. true
2. false (not sure)

8:        It is not a Fibonacci Sequence. 1,1,1,2,3,5,8,13,21,34,55,……

1. true
2. false

9:  Radix sort performs sorting the numbers ______ digit(s) at a time.

1. one
2. two
3. three
4. All(not sure)

10:    In greedy algorithm, at each phase, you take the________ you can get right now, without regard for future consequences.

1. Worst
2. Minimum
3. Good
4. Best

today my quiz.see attach file.mj se bus itny he save ho sky

Attachments:

2,3,9 wrong hain noor sis

## Latest Activity

1 minute ago
Alone Struggler liked + "αяsαℓ " Ќąƶµяɨ •"'s discussion cut, copy, & paste
3 minutes ago
5 minutes ago
Alone Struggler liked ♦_"Tooba"_♦'s discussion "Don't cry at your loss"
5 minutes ago
Alone Struggler liked ♦_"Tooba"_♦'s discussion "Trust"
6 minutes ago
Alone Struggler replied to ♦_"Tooba"_♦'s discussion "Trust"
7 minutes ago
Alone Struggler liked ♦_"Tooba"_♦'s discussion "Trust"
9 minutes ago
10 minutes ago
10 minutes ago
Alone Struggler liked ♦_"Tooba"_♦'s discussion Maafi
11 minutes ago
Alone Struggler replied to ♦_"Tooba"_♦'s discussion Maafi
11 minutes ago
Alone Struggler liked ♦_"Tooba"_♦'s discussion Maafi
16 minutes ago

1

2

3