Roll No. leaxx6uy Total No.

of Pages: |3
00¬0E 3C3002
MCA II - Sem, (Main /Back) Exam., - 2023
MCA -302 (N) Analysis and Design of Algorithm

Time:3 Hours Maximum Marks: 70

Min. Pasing Marks: 28

Instructions to Candidates:
Altempt all ten questions from Part A. All fivequestions from Part Band three
questions out offive from Part C.
Schematic diagrams must be shown wherever necessary. Any data you feel missing
may suitably be assumed and stated clearly. Units of quantities used lcalculated
must be stated clearly.
Use of following supporting material is permitted during examination.
(Mentioned in form No. 205)
1. NIL 2. NIL

PART -A [10×2=20]

(Answershould be given up to 25 words only)

All questions are compulsory
Q.1 How do you measure efficiency or algorithm?
Q.2 State the Principle of Optimality.
Q.3 State the Principle of Duality.
Q.4 What is the time and space complexity of merge sort?
Q.5 Define Dominance Rule.

[3C3002] Page 1 of 3 [1010]

Q.6 Give two examples of stack.

Q.7 What are disjoint set?

Q.8 Define NP completeness.

Q.9 What do you mean by State Space Tree?

Q.10 Define Asymptotic Notations.
[5x4=20]
PART -B

(Analytical/Problem solving questions)

Attempt all five questions

Q.1 Answer in detail:

(a) Write Dijkastra Algorithm. Analyze this algorithm.

(b) Explain Big Oh notations.

Q.2 Explain followings :

)Priority Queue
fü) Spanning Tree

Q.3 Write algorithm for graph coloring using backtracking.

Q4 Explain :
)Explain travelling salesman problem.
(ii) Define flow chop scheduling.
problem solving. What types of
Q.5 Explain dynamic programming method of
problem can be solved?

Page 2 of3 [1010]

[3C3002]
 [3x10=301
PART -C
(Descriptive/Analytical/Problem Solving/Design Questions)
Atempt any three questions

Q.1 Discuss 8- queen problem. Write the steps to solve 8- queen problem by
backtracking.

Q.2 Prove that SAT problem is NP - completeness problem.

Q.3 Define followings :

i) Quantifier

(i) Theta Notation

(iii)Big Omega Notation

Q.4 Explain Kruskal's algorithm for finding minimum cost spanning tree.
Q.5 Explain :

(i)) Branch and Bound method

(i) How to solve sum of subset problem using backtracking? Explain.

[3C3002] Page 3 of 3 [1010]