Scribd
Upload
3 views2 pages

Set B

This document outlines the instructions and structure for the End Term Examination for the Introduction to Algorithm Design course, scheduled for December 2025 to January 2026. It includes details on the examination format, rules regarding conduct, and a list of questions from various units that students must attempt. The exam consists of five questions, with each question covering different topics related to algorithms and their applications.

Uploaded by

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

Set B

This document outlines the instructions and structure for the End Term Examination for the Introduction to Algorithm Design course, scheduled for December 2025 to January 2026. It includes details on the examination format, rules regarding conduct, and a list of questions from various units that students must attempt. The exam consists of five questions, with each question covering different topics related to algorithms and their applications.

Uploaded by

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

END TERM EXAMINATION (December, 2025 - January, 2026)

Roll No. ………………..


Programme Code: 1209 Semester: V
Paper Code: 503 Paper: Introduction to Algorithm Design
Instructions to the Candidates: Read the question paper very carefully.
Do not write anything except your Roll No. on question paper.
Possession of mobile phones or any kind of written material, arguments with the invigilator or
discussing anything with other candidates will lead to unfair means case.
_____________________________________________________________________________________
Time: 3 Hrs Max. Marks: 70

Note: - Attempt five questions in all, selecting one question from each unit. All questions carry
equal marks.
_________________________________________________________________________________
_

UNIT-I
Q1. a) Describe different types of asymptotic notation.
b) Solve recurrence using Iteration method:
T(n) = 8T(n/2) + 10n2 (CO1, L2)

Q2. a) Write an algorithm to check a prime number.


b) Discuss difference between Substitution and Master Theorem methods for solving a
recurrence relation. (CO1, L2)

UNIT-II
Q3. Write algorithm of Horner’s method to solve a polynomial. Also solve the following
equation
P(x) = 2x4-3x3+x+7 for x=4
using the same method.
(CO2, L2)

Q4. a) Write algorithm of Bubble sort with an example.


b) Perform step wise binary search for element 5 on the following array:
1 5 8 9 10 13 15 17 20 23 27 (CO2 ,L2)

UNIT-III
Q5. a) Define Greedy Algorithms. What are the elements of Greedy Algorithm?
b) Given following activities with their start and finishing time. Compute
execution schedule having maximum number of non-conflicting activities:

(CO3, L2)
Q.6. a) Calculate maximum earned profit by arranging the jobs in the schedule, such that
only one job can be done at a time:

b) Solve all the three cases for Fractional Knapsack problem:


(m= number of objects, n= knapsack weight). (m=7, n=15kgs)

(CO3, L2)
UNIT-IV
Q7. What do you mean quick sort? Perform quick sort on following elements of an array:
30, 21, 12, 15, 6, 24, 3, 19, 07 (CO4, L2)
Q8. a) Write down code of binary search along with its complexities.
b) Explain the concept of Integer Multiplication. (CO4, L2)
UNIT-V
Q9. Explain the following: (any two)
a) BFS
b) DFS
c) Topological Sorting (CO5, L2)

Q10. Define: (any four)


a) Cyclic Graph
b) Complete Graph
c) Null Graph
d) Biparite Graph
e) Hamiltonian Graph (CO5, L2)

You might also like