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

lec 14 to 23.....

+ Click Here To Join also Our facebook study Group.

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

See Your Saved Posts Timeline

Views: 2411


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


no sharing 

today my quiz of cs502


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


2,3,9 wrong hain noor sis


Today Top Members 

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

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