We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
lec 14 to 23.....
+ Click Here To Join also Our facebook study Group...How to Join Subject Study Groups & Get Helping Material?..
.+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)
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.
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.
2: For comparison-based sorting algorithms, it is _____ possible to sort more efficiently than Omega nlog(n) time.
3: The knapsack problem do not belong to the domain of optimization problems.
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.
5: A sorting algorithm is called as ________ if duplicate elements remain in the same relative position after sorting.
6: A greedy algorithm sometimes works well for optimization problems.
7: A greedy algorithm does not work in phases.
8: It is not a Fibonacci Sequence. 1,1,1,2,3,5,8,13,21,34,55,……
9: Radix sort performs sorting the numbers ______ digit(s) at a time.
10: In greedy algorithm, at each phase, you take the________ you can get right now, without regard for future consequences.
today my quiz.see attach file.mj se bus itny he save ho sky
2,3,9 wrong hain noor sis