Scribd
Upload
8 views2 pages

CMAACOR13T

The document outlines the examination structure for the B.A./B.Sc. Honours 6th Semester in Computer Application at West Bengal State University, specifically focusing on Design and Analysis of Algorithms. It includes various questions related to algorithms, sorting methods, and graph theory, requiring students to demonstrate their understanding and problem-solving skills. Students are instructed to submit their answer scripts electronically within one hour after the exam concludes.

Uploaded by

jajantidas1980
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views2 pages

CMAACOR13T

The document outlines the examination structure for the B.A./B.Sc. Honours 6th Semester in Computer Application at West Bengal State University, specifically focusing on Design and Analysis of Algorithms. It includes various questions related to algorithms, sorting methods, and graph theory, requiring students to demonstrate their understanding and problem-solving skills. Students are instructed to submit their answer scripts electronically within one hour after the exam concludes.

Uploaded by

jajantidas1980
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CBCS/B.A./B.Sc./Hons./6th Sem.

/CMAACOR13T/2022

WEST BENGAL STATE UNIVERSITY


B.A./B.Sc. Honours 6th Semester Examination, 2022

CMAACOR13T-COMPUTER APPLICATION (CC13)


DESIGN AND ANALYSIS OF ALGORITHM

Time Allotted: 2 Hours Full Marks: 40


The figures in the margin indicate full marks.
Candidates should answer in their own words and adhere to the word limit as practicable.
All symbols are of usual significance.

1. Answer any four questions from the following: 2×4 = 8


(a) What are the different characteristics of an algorithm?
(b) Define f (n) O( g (n)) where f (n) and g (n) are two functions of n .
(c) What do you mean by a Spanning Tree?
(d) What are the different characteristics of divide and conquer method?
(e) Why quick sort is called in-place sorting?
(f) What do you mean by an internal sorting?
(g) When do we use branch and bound method?
(h) What do you mean by a Decision Tree?

Answer any four questions 8×4 = 32


2. (a) Solve the following Recurrence Relation: 5+3
⎧2T (n 2)  n if n ! 1
T (n) ⎨
⎩ 1 if n 1

(b) Prove that the worst case time complexity of bubble sort algorithm is O(n 2 ) .

3. (a) Define heap. What are the minimum and maximum number of elements in a heap 1+2+2+3
of height h?
(b) Is the sequence < 23; 17; 14; 6; 13; 10; 1; 5; 7; 12 > a heap?
(c) Sort the above sequence of elements using HeapSort algorithm.

4. (a) Write the Quick Sort algorithm to sort a list of integers in ascending order 5+3
considering the first element as the partitioning element.
(b) Find out the best case and worst case time complexity of the above algorithm.

6036 1 Turn Over


CBCS/B.A./B.Sc./Hons./6th Sem./CMAACOR13T/2022

5. (a) Compare Divide and Conquer and Dynamic Programming Methodologies. 4+4
(b) Write an algorithm to merge two sorted arrays into a single sorted array.

6. (a) Write Prim’s algorithm to find the minimum spanning tree of a given graph. 3+5
(b) Show the execution trace of the above algorithm for the following graph.

2
10 50
25
1 45
3
30
5 35
4 55
15
20
6

7. (a) Distinguish between DFS and BFS algorithm. 2+(3+3)


(b) Trace the following graph using DFS and BFS

2 4

1 6

3 5

8. (a) State KMP pattern matching algorithm. 4+4


(b) Verify the above algorithm for the following:
T = bacbabababacbb & P = ababa.

N.B. : Students have to complete submission of their Answer Scripts through E-mail / Whatsapp to
their own respective colleges on the same day / date of examination within 1 hour after end
of exam. University / College authorities will not be held responsible for wrong submission
(at in proper address). Students are strongly advised not to submit multiple copies of the
same answer script.

——×——

6036 2

You might also like