vu cs502 Mid Term - Quiz No.4
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: Analysis of Selection algorithm ends up with,
T(n / 2)
T(1 / 1 + n)
T(n)
T((n / 2) + n)
Question 2: For Chain Matrix Multiplication we can not use divide and conquer approach because,
Size of data is not given
We use divide and conquer for sorting only
We do not know the optimum k
We can easily perform it in linear time
Question 3: Floor and ceiling are __________ to calculate while analyzing algorithms.
Very easy
Usually considered difficult
Question 5: Slow sorting algorithms run in,
T(n^2)
T(n)
T( log n)
Question 6: Due to left complete nature of binary tree, the heap can be stored in
Stack
Link Lis
Arrays
Structures
Question 8: What is the solution to the recurrence T(n) = T(n/2)+n .
O(nlogn)
O(logn)
O(n)
O(n2)
Question 9: Quick sort is
Not stable but in place
Stable but not in place
Some time stable & some times in place
Stable & in place
Question 10: In Heap Sort algorithm, the total running time for Heapify procedure is __________
O (1) i.e. Constant time
Order (log n)
Theta (log n)
Omega (log n)
