CS502 QUIZ NO 1 SOLVED || 100% VERIFIED BY ADMIN || VURANK

CS502 QUIZ NO 1 SOLVED 100% VERIFIED BY ADMIN (MID TERM SYLLABUS)

Q1: In Fibonacci Sequence, unnecessary repetitions do not exist at all.
A) True
B) False (100% Sure)

Q2: Following is not the application of Edit Distance problem.
A) Speech recognition
B) Spelling Correction
C) Ascending Sort (100% Sure)
D) Computational Molecular Biology

Q3: In Dynamic Programming approach, solution is modified/changed __________.
A) Always once
B) At each stage (100% Sure)
C) Only for specific problems
D) At 4th stage only

Q4: Dynamic Programming strategy is useful when sub-problems are independent.
A) True.
B) False. (100% Sure)

Q5: In __________ Knapsack Problem, limitation is that an item can item can either be put in the bad or not. Fractional item are not allowed.
A) 0
B) 1
C) 0/1 (100% Sure)
D) Fractional

Q6: Dynamic Programming comprises of __________.
A) Recursion only
B) Repetition only
C) Recursion with Repetition
D) No Repetition but Recursion (100% Sure)

Q7: Dynamic Programming is a problem-solving approach in which __________.
A) Problem is solved in Zero time
B) Solution is developed only at final stage
C) Both are correct
D) Both are incorrect (100% Sure)

Q8: For comparison-based sorting algorithms, it is __________ possible to sort more efficiently than Omega nlog(n) time.
A) Always
B) Not (100% Sure)
C) Sometimes
D) Sometimes not

Q9: We can make __________ recursive calls in Fibonacci Sequence.
A) Infinite (100% Sure)
B) Finite