vu cs502 Final Term - Quiz No.2
vu cs502 Fundamentals of Algorithms Quiz
This quiz belongs to book/course code vu cs502 Fundamentals of Algorithms of vu organization. We have 9 quizzes available related to the book/course Fundamentals of Algorithms. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Final Term. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: In Dynamic Programming, our approach is to __________.
Develop the solution in a top-down fashion
Express the problem non-recursively
Build the solution in a bottom-up fashion
Input several sub-problems simultaneously
Question 2: Chain matrix multiplication problem can be solved through __________ strategy.
Dynamic programming
Greedy
Divide and conquer
Sorting
Question 3: If a graph has v vertices and e edges then to obtain a spanning tree we have to delete
v edges.
v – e + 5 edges
v + e edges.
None of the given
Question 6: Counting sort assumes that the numbers to be sorted are in the range __________.
k to n where n is large
1 to k where k is small
k to n where k is small
k to n where n is small
Question 7: Dynamic Programming is a problem-solving approach in which __________.
Problem is solved in Zero time
Solution is developed only at final stage
Both are correct
Both are incorrect
Question 8: If there are Θ (n2) entries in edit distance matrix then each entry E (i, j) takes __________ time to compute.
Θ (n)
Θ (n2)
Θ (1)
Θ (n log n)
