Registration No -:......................
JECRC UNIVERSITY
Summer Semester End Sem Examination
July - 2025
Subject: Design and Analysis of Algorithms (BCO023A)
Time: 3 hrs Maximum Marks: 100
Course Outcome(CO):
After study of this subject student will be able to know
CO1: Various methods of calculating complexity
CO 2: Finding out the best method for different algorithms
CO3: Knowledge of Graph and its algorithm. Knowledge of String Matching Algorithms.
CO4: About computational geometry, like Lower bound theory, modular arithmetic and CRT
CO5: Various Decision Problems like NP Complete, NP hard
Section – A (2 × 5 = 10 Marks)
Each question carries 2 marks.
1. Define time and space complexity.
2. State max-flow min-cut theorem.
3. What is the greedy strategy? How is it different from dynamic programming?
4. What is the vertex cover problem? Why it falls under the category of approximate algorithms.
5. Write the difference between P and NP problems.
Section – B (5 × 7 = 35 Marks)
Each question carries 7 marks.
1. Solve the recurrence relation T(n) = 2T(n/2) + nlogn using the Master Theorem.
2. Write the short note of the following along with examples for each:
1) P Class,
2) NP Class
3) NP-Hard Class
4) NP-Complete class.
3. Given the matrices A(20x30), B(30x50), C(50x10) and D(10x5) determine and illustrate the optimal parenthesization
to minimize multiplications. Provide a step-by-step numerical solution and justify your approach.
4. Use the Chinese Remainder Theorem to find an x for the given system of equations
2x ≡ 6 (mod 14)
3x ≡ 9 (mod 15)
5 x ≡ 20(mod 60)
5. Write the Naïve algorithm of string matching with code/pseudo code.
Section – C (5 × 11 = 55 Marks)
Each question carries 11 marks.
1. Using the divide and conquer approach, write and explain an algorithm to find the maximum and minimum element
in an array with the minimum number of comparisons.
2. Solve the 0/1 Knapsack problem using dynamic programming for the following:
Weights = [2, 3, 4, 5], Profits = [3, 4, 5, 6], Capacity = 5.
Find the maximum profit.
3. Find the optimal vertex cover for the below given graph and also write the approximate algorithm for vertex cover.
4. Explain the Ford-Fulkerson algorithm and apply it to the below given graph to find the maximum flow in a suitable
network.
5. Prove that the Vertex Cover problem is NP-Complete using polynomial-time reduction.
