SHRIMATHI DEVKUNVAR NANALAL BHATT VAISHNAV COLLEGE FOR WOMEN

M.Sc. (CS) DEGREE – Continuous Assessment Test- I

April- 2021-22.

Course Code & Title: 20PCSCT2004 & Design & Analysis of Algorithm Date: 04/04/22
Semester: II Max Mark: 35
Section B
(3X5=15 Marks)

S.No Answer any THREE Bloom’s Course

Level Outcome

1 Define Algorithm and list out the criteria’s which satisfy K2 CO1
an algorithm.
2 Discuss about pseudo conventions. K3 CO1

3 What are Best case, Worst case and Average case K3 CO1
notations. Explain with example.

4 Describe randomized algorithms and state the difference K5 CO1

between them.
5 Illustrate the general method of Divide & Conquer K3 CO1
strategy.

Section - C
Part A (1x10 = 10 marks)

S.NO Answer any ONE Bloom’s Course

level outcome

6 Find maximum and minimum of N numbers using Divide & K3 CO1

Conquer technique. Illustrate with an example

7 Describe Quick sort algorithm with an example. K3 CO2

Part B (1X10=10 Marks)

Compulsory questions

8 Apply and illustrate Merge sort algorithm for the K4 CO2

following array of numbers.

38, 27, 43, 3, 9, 82, 10