vu cs502 Mid Term - Quiz No.5
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 Mid 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: If there are Θ (n2) entries in edit distance matrix then the total running time is
Θ (n2)
Θ (n log n)
Θ (n)
Θ (1)
Question 2: The time assumed for each basic operation to execute on RAM model of computation is__________
Continuous
Variable
Infinite
Constant
Question 3: Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivot element and:
No work is needed to combine the sub-arrays, the array is already sorted
Merging the sub arrays
There is explicit combine process as well to conquer the solution.
None of above.
Question 4: __________ is one of the few problems, where provable lower bounds exist on how fast we can sort.
Sorting
Both Searching & Sorting
Searching
Graphing
Question 5: Which sorting algorithm is faster
O (n+k)
O n^2
O (n log n)
O n^3
Question 8: While solving Selection problem, in Sieve technique we partition input data __________w
In decreasing order
According to Pivot
Randomly
In increasing order
Question 9: The sieve technique works in __________ as follows
numbers
Phases
routines
integers
Question 10: __________ is a graphical representation of an algorithm
Asymptotic notation
Flowchart
notation
