COURSE FILE

FACULTY NAME : Ms. Srinkhala Maddhesia

SEMESTER : V

PROGRAM : B.Tech (CSE)

COURSE : Design & Analysis of Algorithms

COURSE CODE : KCS-503

ACADEMIC YEAR : 2023-24

START DATE : 01-09-2023

END DATE : 20-12-2023

 Course File Index

S.NO. CONTENT Remarks

1. Vision and Mission of the Institute and Department
2. Program Outcomes (POs)
3. Lecture Plan
4. Syllabus with Text and Reference Books
5. Course Outcomes (COs) and Mapping of COs and POs
6. Time Table
7. Academic Calendar
8. Unit wise Tutorial Sheets and Assignments

Previous Years University Papers, Sessional Papers and Model

9.
Question Paper

10. List of Students

CO & PO Attainment Analysis
11. A. Award List of Internal Marks Uploaded at the University Portal
B. Award List of the External Semester Exam
Vision and Mission of the Institute and Department
Program Outcomes (POs)
 Lecture Plan

Faculty Ms. Srinkhala Maddhesia SESSION 2023-24

Program
B. TECH COURSE Design & Analysis of Algorithm (KCS-503)
Name

Planned
Actual
Pedagogy Delivery
Unit Class Topics Delivery References Remark
Lecture of Class Date
Date
No
07/09/23 Udit Agarwal, “Algorithms
Board &
Analyzing Algorithms, 08/09/23 Design & Analysis”
Marker/PPT
UNIT-1 1 Complexity of Algorithms 1 to 10
Board & 10/09/23 11/09/23 Udit Agarwal, “Algorithms
Growth of Functions, Marker/PPT Design & Analysis”
2 Performance Measurements 11 to 46
Board & 11/09/23 12/09/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
3 Sorting and Order Statistics 47 to 74
Board & 12/09/23 13/09/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”

4 Shell Sort, Heap sort 75 to 128

Board & 13/09/23 14/09/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
5 Quick Sort 133 to 152
14/09/23 15/09/23 Udit Agarwal, “Algorithms
Board &
Marker
Design & Analysis”
6 Merge sort 95 to 108
Board & 17/09/23 18/09/23 Udit Agarwal, “Algorithms
7 Revision Class Marker Design & Analysis”
Problem Solving Class & Board & 18/09/23 19/09/23 Udit Agarwal, “Algorithms
8 Assignment-2 Marker Design & Analysis”
Board & 19/09/23 20/09/23 Udit Agarwal, “Algorithms
9 Class Test Marker Design & Analysis”
Board & 20/09/23 21/09/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
UNIT-2 10 B – Trees 257 to 284
Board & 21/09/23 22/09/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
11 Binomial Heaps 285 to 306
Board & 24/09/23 25/09/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
12 Fibonacci Heaps 307 to 322
Board & 25/09/23 26/09/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
13 Tries and Skip List 153 to 160
Board & 26/09/23 27/09/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
14 Red-Black Trees 221 to 256
Board & 27/09/23 28/09/23 Udit Agarwal, “Algorithms
Revision Class Marker Design & Analysis”
15
 Board & 28/09/23 29/09/23 Udit Agarwal, “Algorithms
Problem Solving Class &
Marker Design & Analysis”
16 Assignment-2
Board & 02/10/23 03/10/23 Udit Agarwal, “Algorithms
Marker Design & Analysis”
17 Class Test
Board & 03/10/23 04/10/23 E. Horowitz & S Sahni,
Divide and Conquer with Marker "Fundamentals of Computer
Examples Such as Sorting, Algorithms".
UNIT-3 18 Bellman Ford Algo. 467 to 469
Board & 04/10/23 05/10/23 . Horowitz & S Sahni,
Marker/PPT "Fundamentals of Computer
Algorithms".
19 Matrix Multiplication 475 to 476
Board & 05/10/23 06/10/23 E. Horowitz & S Sahni,
Marker/PPT "Fundamentals of Computer
Algorithms".
20 Convex Hull and Searching. 571 to 572
Board & 08/10/23 09/10/23 . Horowitz & S Sahni,
Greedy Methods with Marker/PPT "Fundamentals of Computer
Examples, Fractional Algorithms".
21 Knapsack Problem 363 to 382
Board & 09/10/23 10/10/23 E. Horowitz & S Sahni,
Marker/PPT "Fundamentals of Computer
Algorithms".
22 0/1 Knapsack Problem 331 to 362
Board & 10/10/23 11/10/23 . Horowitz & S Sahni,
Marker/PPT "Fundamentals of Computer
Minimum Spanning Trees- Algorithms".
23 Kruskal’s Algorithm 443 to 444
11/10/23 12/10/23 E. Horowitz & S Sahni,
Prism Algorithm, Single Board & "Fundamentals of Computer
Source Shortest Paths - Marker Algorithms".
24 Dijkstra’s 447 to 458
Board & 12/10/23 13/10/23 . Horowitz & S Sahni,
Marker "Fundamentals of Computer
25 Revision Class Algorithms".
Board & 15/10/23 16/10/23 E. Horowitz & S Sahni,
Problem Solving Class & Marker "Fundamentals of Computer
26 Assignment-5 Algorithms".
Board & 16/10/23 17/10/23 . Horowitz & S Sahni,
Marker "Fundamentals of Computer
27 Class Test Algorithms".
Board & 17/10/23 18/10/23 Udit Agarwal, “Algorithms
All Pair Shortest Paths – Marker/PPT Design & Analysis”
UNIT-4 28 Floyd-Warshal’s Algorithm 475 to 476
Dynamic Programming Vs Board & 18/10/23 19/10/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
29 Greedy approach
Board & 19/10/23 20/10/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
30 Backtracking 383 to 385
Board & 24/10/23 25/10/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
31 Sum of Subsets 390
25/10/23 26/10/23 Udit Agarwal, “Algorithms
Board &
Marker
Design & Analysis”
32 Hamiltonian cycle 386 to 389
Board & 26/10/23 27/10/23 Udit Agarwal, “Algorithms
33 Graph Coloring, n-Queen
 Marker Design & Analysis”
Problem 391 to 396
Branch and Bound with Board & 29/10/23 30/10/23 Udit Agarwal, “Algorithms
Examples Such as Travelling Marker Design & Analysis”
34 Salesman Problem. 397 to 416
Board & 30/10/23 31/10/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
35 Revision Class
Board & 31/10/23 01/11/23 Udit Agarwal, “Algorithms
Problem Solving Class &
Marker/PPT Design & Analysis”
36 Assignment-4
Board & 01/11/23 02/11/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
37 Class test
Board & 02/11/23 03/11/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
UNIT-5 38 Algebraic Computation 547 to 549
Board & 05/11/23 06/11/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
39 Fast Fourier Transform 550 to 551
Board & 06/11/23 07/11/23 Udit Agarwal, “Algorithms
Marker/PPT Design & Analysis”
40 String Matching 555 to 568
07/11/23 08/11/23 Udit Agarwal, “Algorithms
Board &
Marker
Design & Analysis”
41 Theory of Incompleteness 569 to 582
Board & 08/11/23 09/11/23 Udit Agarwal, “Algorithms
Marker Design & Analysis”
42 Approximation Algorithms 601 to 609
Board & 09/11/23 10/11/23 Udit Agarwal, “Algorithms
Marker Design & Analysis”
43 Randomized Algorithms 611 to 619
Board & 14/11/23 15/11/23 Udit Agarwal, “Algorithms
Marker Design & Analysis”
44 Revision Class
15/11/23 16/11/23 Udit Agarwal, “Algorithms
Problem Solving Class & Board &
Assignment-5 Marker Design & Analysis”
45
Board & 16/11/23 17/11/23 Udit Agarwal, “Algorithms
Class Test Marker Design & Analysis”
46

Topic Covered Beyond the University Syllabus.

Textbooks:
1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms”, Printice Hall of India.
2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms",
3. Aho, Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Pearson Education, 2008.
4. LEE "Design & Analysis of Algorithms (POD)”, McGraw Hill
5. Richard E.Neapolitan "Foundations of Algorithms" Jones & Bartlett Learning .

References Book:
1. Udit Agarwal, “Algorithms Design & Analysis”
2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms".
 University Syllabus

KCS-503 DESIGN AND ANALYSIS OF ALGORITHM 4-0-0

UNIT TOPIC PROPOSED

LECTURE
1 Introduction: Algorithms, Analyzing Algorithms, Complexity of Algorithms, Growth of 08
Functions, Performance Measurements, Sorting and Order Statistics - Shell Sort, Quick Sort,
Merge Sort, Heap Sort, Comparison of Sorting Algorithms, Sorting in Linear Time
2 Advanced Data Structures: Red-Black Trees, B – Trees, Binomial Heaps, Fibonacci 08
Heaps, Tries, Skip List
3 Divide and Conquer with Examples Such as Sorting, Matrix Multiplication, Convex Hull 08
and Searching. Greedy Methods with Examples Such as Optimal Reliability Allocation,
Knapsack, Minimum Spanning Trees – Prim’s and Kruskal’s Algorithms, Single Source
Shortest Paths - Dijkstra’s and Bellman Ford Algorithms
4 Dynamic Programming with Examples Such as Knapsack. All Pair Shortest Paths – 08
Warshal’s and Floyd’s Algorithms, Resource Allocation Problem. Backtracking, Branch and
Bound with Examples Such as Travelling Salesman Problem, Graph Coloring, n-Queen
Problem, Hamiltonian Cycles and Sum of Subsets.
5 Selected Topics: Algebraic Computation, Fast Fourier Transform, String Matching, Theory 08
of Incompleteness, Approximation Algorithms and Randomized Algorithms
Textbooks:
1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, “Introduction to Algorithms”, Printice Hall of India.
2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms",
3. Aho, Hopcraft, Ullman, “The Design and Analysis of Computer Algorithms” Pearson Education, 2008.
4. LEE "Design & Analysis of Algorithms (POD)”, McGraw Hill
5. Richard E.Neapolitan "Foundations of Algorithms" Jones & Bartlett Learning
6. Jon Kleinberg and Éva Tardos, Algorithm Design, Pearson, 2005.
7. Michael T Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis, and Internet Examples,
Second Edition, Wiley, 2006.
8. Harry R. Lewis and Larry Denenberg, Data Structures and Their Algorithms, Harper Collins, 1997
9. Robert Sedgewick and Kevin Wayne, Algorithms, fourth edition, Addison Wesley, 2011.
10. Harsh Bhasin,”Algorithm Design and Analysis”,First Edition,Oxford University Press.

References Book:
1. Udit Agarwal, “Algorithms Design & Analysis”
2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms".
 Course Outcomes (COs)

Course Outcome (CO) Bloom’s

Knowledge
Level (KL)
At the end of course, the student will be able to understand
K 4, K 6
CO1
Design new algorithms, prove them correct, and analyze their asymptotic
and absolute runtime and memory demands.
K 5, K 6
CO2
Find an algorithm to solve the problem (create) and prove that the
algorithm solves the problem correctly (validate).
Understand the mathematical criterion for deciding whether an K 2, K 5
CO3
algorithm is efficient and know many practically important problems
that do not admit any efficient algorithms.
CO 4 K2, K4
Apply classical sorting, searching, optimization and graph algorithms.
CO 5 K2, K3
Understand basic techniques for designing algorithms, including the
techniques of recursion, divide-and-conquer, and greedy
 Mapping of COs and POs

Course Name: Design and Analysis of Algorithm Course Code: KCS-503

Faculty Name:
S.No. CO'S COURSE OUTCOMES POs PSOs
Design new algorithms, prove them correct, and analyze their
1 CO1 asymptotic and absolute runtime and memory demands. 1,2,4,12 1,2,3
Find an algorithm to solve the problem (create) and prove that
2 CO2 the algorithm solves the problem correctly (validate). 1,2,4,5,12 1,2,3
Understand the mathematical criterion for deciding whether an
algorithm is efficient and know many practically important
3 CO3 problems that do not admit any efficient algorithms. 1,2,3,5,10,12 1,2,3
Apply classical sorting, searching, optimization and graph
4 CO4 algorithms. 1,2,9,12 1,2,3
Understand basic techniques for designing algorithms,
including the techniques of recursion, divide-and-conquer, and
5 CO5 greedy. 1,3,4,5,12 1,2,3

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO

DAA
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO1 3 3 - 3 - - - - - - - 3 3 3 3

CO2 2 3 - 2 3 - - - - - - 3 3 3 3

CO3 3 2 2 - 2 - - - - 1 - 3 3 3 3

CO4 3 3 - - - - - - 2 - - 3 3 3 3

CO5 2 - 2 3 3 - - - - - - 3 3 3 3
Averag
2.6 2.75 2.0 2.6 2.6 2.0 1.0 3 3 3 3
e
 IV
Lecture I II III V VI VII VIII IX

01:1
9:40- 10:30- 11:20- 12:20- 0- 02:00- 02:50- 03:40-
Day 11:30-12:20
10:30 11:20 11:30 01:10 02:0 02:50 03:40 04:30
0

DBMS LAB-3(G1)/DAA
Monday CD MLT/AI OOSD DAA COI
LAB-2(G2)
DBMS LAB-3(G2)/DAA MLT/

LUNCH BREAK
SHORT BREAK

Tuesday DBMS OOSD CD/AI DAA

LAB-2(G1) AI
MLT/ CD LAB-3(G1)/AI
Wednesday DBMS DAA CD/AI COI
AI LAB-4(G2)
CD LAB-3(G2)/AI MLT/
Thursday DBMS CD DAA OOSD
LAB-4(G1) AI
MLT/ MINI
Friday CD DAA COI OOSD DBMS
AI PROJ.
CLASS TIME TABLE
Academic Calendar
 Unit Wise Tutorial Sheets

Tutorial Sheet-1(CO1) (K4, K6)

COURSE NAME: - DAA (KCS-503) PROGRAM: - B.TECH (V SEM)

1. Solve the recurrence.
T (n) =3T (n/4) + cn2 using recursion tree method.

2. Solve the recurrence.

T (n) = n + 2T (n/2) using Iteration method. (Given T(1)=1)

3. Define Binomial Heap and divide & conquer approach?

4. Write down the algorithm for Decrease key operation in Binomial Heap also
write its time complexity.

5. Explain merge sort algorithm with example.

 Tutorial Sheet - 2(CO2) (K5, K6)

COURSE NAME: - DAA (KCS-503) PROGRAM: - B.TECH (V SEM)

1. Write an algorithm for insertion of key in the Red-Black Tree.

2. Discuss the various cases for insertion of key in red-black tree for given
sequence.

3. Discuss skip list. Explain the Search operation in Skip list.

4. Write down the properties of Fibonacci Heap.

5. Explain right rotation in RB tree.

 Tutorial Sheet - 3(CO3) (K2, K5)

COURSE NAME: - DAA (KCS-503) PROGRAM: - B.TECH (V SEM)

1. Explain the Kruskal algorithm.

2. What is N queens’ problem?

3. Draw a state space tree for 4 queens problem using backtracking.

4. Find Kruskal algorithm for the given graph.

5. Difference between Prism and Kruskal algorithm.

 Tutorial Sheet - 4(CO4) (K2, K4)

COURSE NAME: - DAA (KCS-503) PROGRAM: - B.TECH (V SEM)

1. Define the term sum of subsets problem.

2. Find all possible subsets of w that sum to m using recursive backtracking algorithm
for it w= {5,7,10,12,15,18,20} and m=35. Draw the portion of the state-space tree.

3. Explain the method of finding Hamiltonian cycles in a graph using backtracking

method with suitable example.

4. Explain Floyd warshall.

5. Define dynamics programming.

 Tutorial Sheet - 5(CO5) (K2, K3)

COURSE NAME: - DAA (KCS-503) PROGRAM: - B.TECH (V SEM)

1. Write Rabin Karp string matching algorithm.

2. Explain Randomized algorithm in brief.

3. Explain NP-complete and NP-Hard.

4. Working modulo q=11, how many spurious hits does the Rabin karp
matcher in the text T= 3141592653589793, when looking for the pattern
P=26.

5. What is the application of Fast Fourier Transform (FFT)? Also write the
recursive algorithm for FFT.
 Assignment 1 (CO 1) (K4, K6)
COURSE NAME (CODE): -DAA(KCS-503) PROGRAM: - B.TECH (V SEM)
GIVEN DATE: SUBMISSION DATE:

Q-1 What is an algorithm? Discuss the basic steps in complete development of

algorithm?

Q-2 Explain and compare best and worst time complexity of quick sort.

Q-3. Explain merge sort algorithm and sort the following {23,11,6,15,68,31,4,17}.
Derive the time complexity of merge sort.

Q-4 What do you mean by asymptotic notation ? Explain Big O, Omega & Theta
notation and draw their diagram.

Q-5 Show that 5n3 + 2n2 + n + 106 = O(n3).

 Assignment 2 (CO 2) (K5, K6)
COURSE NAME (CODE): -DAA(KCS-503) PROGRAM: - B.TECH (V SEM)
GIVEN DATE: SUBMISSION DATE:

Q.1 Insert the following given F,S,Q,K,C,L,H,T,V,W,M,R,N,P,A,B,X,Y,D,Z,E,G,I.

Into an empty B-tree with degree t=3.

Q.2 Discuss the various cases for insertion of key in red-black tree for given sequence
of key in an empty red-black tree- {15, 13, 12, 16, 19, 23, 5, 8}.

Q.3 Discuss skip list. Explain the Search operation in Skip list with suitable example
also write its algorithm.

Q.4 Write down the properties of Fibonacci Heap.

Q.5 Explain left rotation in RB tree.

 Assignment 3 (CO 3) (K2, K5)
COURSE NAME (CODE): -DAA(KCS-503) PROGRAM: - B.TECH (V SEM)
GIVEN DATE: SUBMISSION DATE:

Q-1 Define minimum spanning tree (MST). Write Prim’s algorithm to

generate an MST for any given weighted graph. Generate MST for
the following graph using Prim’s algorithm.

Q-2 Explain Dijkstra’s algorithm to solve single source shortest path problem
with suitable example.

Q-3 What is the Knapsack problem? Solve 0/1 knapsack problem using greedy
programming for the following four items with their weights w = {3, 5, 9, 5}
and values P = {45, 30, 45, 10} with knapsack capacity is 16 and n=4.

Q-4 Write and explain the Kruskal algorithm to find the Minimum Spanning
Tree of a graph with suitable example.
Q-5 Write the short note on convex hull?
 Assignment 4 (CO 4) (K2, K4)
COURSE NAME (CODE): -DAA(KCS-503) PROGRAM: - B.TECH (V SEM)
GIVEN DATE: SUBMISSION DATE:

Q-1 What is the sum of subsets problem? Let w= {5,7,10,12,15,18,20} and

m=35. Find all possible subsets of w that sum to m using recursive
backtracking algorithm for it. Draw the portion of the state-space tree that is
generated.

Q-2 Illustrate n queen’s problem. Examine 4 queen’s problem using

backtracking method.

Q-3 Give Floyd-Warshall algorithm to find the shortest path for all pairs of
vertices in a graph.

Q-4 Define the term sum of subsets problem. Let w= {5,7,10,12,15,18,20} and m=35.
Find all possible subsets of w that sum to m using recursive backtracking algorithm
for it. Draw the portion of the state-space tree.

Q-5 Explain the method of finding Hamiltonian cycles in a graph using backtracking
method with suitable example.
 Assignment 5 (CO 5) (K2, K3)
COURSE NAME (CODE): -DAA(KCS-503) PROGRAM: - B.TECH (V SEM)
GIVEN DATE: SUBMISSION DATE:

Q-1 What is string matching algorithm? Explain Rabin-Karp method with

examples.

Q-2 Explain and Write the Naïve-String string matching algorithm:

Suppose the given pattern p= aa b and given text
T = a c a a b c. Apply Naïve-String Matching algorithm on
above Pattern (P) and Text (T) to find the number of
occurrences of P in T.

Q-3 What is the application of Fast Fourier Transform (FFT)? Also write the
recursive algorithm for FFT.
Q-4 Write Rabin Karp string matching algorithm. Working
modulo q=11, how many spurious hits does the Rabin karp
matcher in the text T= 3141592653589793, when looking
for the pattern P=26.

Q-5 Discuss the problem classes P, NP and NP –complete. with class relationship.
 Previous Years University Papers
B.TECH. (SEM V)
THEORY EXAMINATION 2022-23
DESIGN & ANALYSIS OF ALGORITHM
Time: 3 Hours Total Marks: 100
Note: Attempt all Sections. If you require any missing data, then choose suitably.

SECTION A

Attempt all questions in brief. 2x10 = 20

(a) Discuss the basic steps in the complete development of an algorithm.
(b) Explain and compare best and worst time complexity of Quick Sort.
(c) Discuss Skip list and its operations.
(d) Discuss the properties of binomial trees.
(e) Illustrate the applications of Graph Coloring Problem
(f) Define the principle of optimality.
(g) Differentiate Backtracking and Branch and Bound Techniques.
(h) Discuss backtracking problem solving approach.
(i) Define NP, NP hard and NP complete. Give an example of each.
(j) Explain Randomized algorithms.

SECTION B

Attempt any three of the following: 10x3

= 30
(a) Explain Merge sort algorithm and sort the following sequence {23, 11, 5, 15,
68,31, 4, 17} using merge sort.
(b) What are the various differences in Binomial and Fibonacci Heap? Explain.
(c) Prove that if the weights on the edge of the connected undirected graph are
distinct then there is a unique Minimum Spanning Tree. Give an example in
this regard. Also discuss Kruskal’s Minimum Spanning Tree in detail.
(d) Discuss LCS algorithm to compute Longest Common Subsequence of two
given strings and time complexity analysis.
(e) Explain and Write the Naïve-String string matching algorithm:
Suppose the given pattern p= aa b and given text T = a c a a b c. Apply
Naïve-String Matching algorithm on above Pattern (P) and Text (T) to find
the number of occurrences of P in T.
 SECTION C

Attempt any one part of the following: 10x1

= 10
(a) Examine the following recurrence relation:
(i) T (n) = T (n-1) + n 4
(ii) T (n) = T (n/4) + T (n/2) + n 2
(b) Explain algorithm for counting sort. Illustrate the operation of counting sort on the
following array: A={0,1,3,0,3,2,4,5,2,4,6,2,2,3}.

Attempt any one part of the following: 10 *1

= 10
(a) Discuss the various cases for insertion of key in red-black tree for given sequence of
key in an empty red-black tree- {15,13,12,16,19,23,5,8}. Also show that a red-black
tree with n internal nodes has height at most 2lg(n+1).
(b) Explain and write an algorithm for union of two binomial heaps and write its time
complexity.

Attempt any one part of the following: 10*1

= 10
(a) Explain “greedy algorithm” Write its pseudo code to prove that fractional Knapsack
problem has a greedy-choice property.
(b) What are single source shortest paths? Write down Dijkstra’s algorithm for it.

Attempt any one part of the following: 10*1

= 10
(a) What is the sum of subsets problem? Let w= {5,7,10,12,15,18,20} and m=35. Find all
possible subsets of w that sum to m using recursive backtracking algorithm for it.
Draw the portion of the state-space tree that is generated.
(b) Illustrate n queen’s problem. Examine 4 queen’s problem using back tracking
method.
Attempt any one part of the following: 10*1
= 10
(a) What is string matching algorithm? Explain Rabin-Karp method with examples.
(b) Explain approximation algorithm. Explore set cover problem using approximation
algorithm.

B. TECH.
(SEM V) THEORY EXAMINATION 2021-22 DESIGN
AND ANALYSIS OF ALGORITHM
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data, then choose suitably.
2. Any special paper specific instruction.
 SECTION A

1. Attempt all questions in brief. 2 x 10 = 20

a. How do you analyze the performance of an algorithm in different cases?
b. Derive the time complexity of Merge sort.
c. Explain left rotation in RB tree.
d. Write down the properties of Fibonacci Heap.
e. Explain Greedy programming in brief.
f. What do you mean by convex hull?
g. Write down the Floyd Warshal algorithm.
h. Explain Branch and Bound method in brief.
i. Explain Randomized algorithm in brief.
j. Explain NP-complete and NP-Hard.

SECTION B
2. Attempt any three of the following: 10 x 3 = 30
a. Solve the recurrence.
i) T (n) =3T (n/4) + cn2 using recursion tree method. ii) T (n) = n
+ 2T (n/2) using Iteration method. (Given T(1)=1)
b. What is Binomial Heap? Write down the algorithm for Decrease key operation in
Binomial Heap also write its time complexity.
c. Write and explain the Kruskal algorithm to find the Minimum Spanning Tree of a
graph with suitable example.
d. What is N queens’ problem? Draw a state space tree for 4 queens problem using
backtracking.
e. Write Rabin Karp string matching algorithm. Working modulo q=11, how many
spurious hits does the Rabin karp matcher in the text T= 3141592653589793, when
looking for the pattern P=26.

SECTION C
3. Attempt any one part of the following: 10 x 1 = 10
(a) Write Merge sort algorithm and sort the following sequence {23, 11, 5, 15, 68, 31, 4,
17} using merge sort.
(b) What do you understand by stable and unstable sorting? Sort the following sequence
{25, 57, 48, 36, 12, 91, 86, 32} using heap sort.
4. Attempt any one part of the following: 10 x 1 = 10
 (a) Discuss the various cases for insertion of key in red-black tree for given sequence of
key in an empty red-black tree- {15, 13, 12, 16, 19, 23, 5, 8}.

(b) What is skip list? Explain the Search operation in Skip list with suitable example
also write its algorithm.

5. Attempt any one part of the following: 10 x 1 = 10

(a) What is the Knapsack problem? Solve Fractional knapsack problem using greedy
programming for the following four items with their weights w = {3, 5, 9, 5} and
values P = {45, 30, 45, 10} with knapsack capacity is 16.
(b) Write down the Bellman Ford algorithm to solve the single source shortest path
problem also write its time complexity.
6. Attempt any one part of the following: 10 x 1 = 10
(a) What is travelling salesman problem (TSP)? Find the solution of following TSP using
Branch & Bound method.

0 2 3 1 1
0 0 0 1
1 0 1 4 2
5 6
3 5 0 2 4
1 6 1 0 3
9 8
(b) Explain the method of finding Hamiltonian cycles in a graph using
backtracking method with suitable 1 4 7 1 0 example
6 6

7. Attempt any one part of the following:

Explain and write the Knuth-Morris-Pratt algorithm for pattern matching also.

(a) approximation algorithm.

(b) write its time complexity.
B. TECH.
(SEM-V) THEORY EXAMINATION 2020-21 DESIGN
AND ANALYSIS OF ALGORITHM
Time: 3 Hours Total Marks: 100
 Note: 1. Attempt all Sections. If require any missing data, then choose suitably.
SECTION A

1. Attempt all questions in brief. 2 x 10 = 20

Q no. Question Marks CO
a. What is recurrence relation? How is a recurrence solved using master’s 2
theorem?
b. What is asymptotic notation? Explain Omega (Ω) notation? 2
c. Write down the properties of binomial tree. 2
d. Differentiate Backtracking algorithm with branch and bound algorithm. 2
e. Solve the recurrence T (n) = 4T(n/2) + n2 2
f. Explain Fast Fourier Transform in brief. 2
g. Write an algorithm for naive string matcher? 2
h. Explain searching technique using divide and conquer approach. 2
i. Explain Skip list in brief. 2
j. Explain how algorithms performance is analyzed? 2
SECTION B

2. Attempt any three of the following:

Q no. Question Marks CO
a. Write an algorithm for counting sort? Illustrate the operation of counting 10
sort on the following array: A= {4, 0, 2, 0, 1, 3, 5, 4, 1, 3, 2, 3}
b. Show the results of inserting the keys F, S, Q, K, C, L, H, T, V, W, M, 10
R, N, P, A, B, X, Y, D, Z, E in order into an empty B-tree. Use t=3,
where t is the minimum degree of B- tree.
c. Discuss greedy approach to an activity selection problem of scheduling 10
several competing activities. Solve following activity selection problem
S = {A1, A2, A3, A4, A5, A6, A7, A8, A9, A10}
Si = {1, 2, 3, 4, 7, 8, 9, 9, 11, 12} Fi = {3, 5, 4, 7, 10, 9, 11, 13, 12, 14}
d. What is sum of subset problem? Draw a state space tree for Sum of 10
subset problem using backtracking? Let n=6, m=30 and w [1:6] = {5, 10,
12, 13, 15, 18}
e. Write KMP algorithm for string matching? Perform the KMP algorithm 10
to search the occurrences of the pattern abaab in the text string
abbabaabaabab.

SECTION C
3. Attempt any one part of the following:
Q no. Question Marks CO
a. Solve the following recurrence relation: 10
i. T (n) = T (n-1) + n4
ii. T (n) = T (n/4) + T (n/2) + n2
b. Write an algorithm for insertion sort. Find the time complexity of 10
Insertion sort in all cases.

4. Attempt any one part of the following:

Q no. Question Marks CO
a. Write an algorithm for insertion of key in the Red-Black Tree. Discuss 10
the various cases for insertion of key in red-black tree for given sequence
of key in an empty red-black tree- 5, 16, 22, 25, 2, 10, 18, 30, 50, 12, 1.
b. Explain and write an algorithm for union of two binomial heaps and also 10
write its time complexity?

5. Attempt any one part of the following:

Q no. Question Marks CO
a. Define minimum spanning tree (MST). Write Prim’s algorithm to 10
generate a MST for any given weighted graph. Generate MST for the
following graph using Prim’s algorithm.

b. Explain Dijkstra’s algorithm to solve single source shortest path problem 10

with suitable example.

6. Attempt any one part of the following:

Q no. Question Marks CO
a. What is travelling salesman problem (TSP)? Find the solution of 10
following TSP using dynamic programming.
0 1 15 6
2 0 7 3
9 6 0 12
10 4 8 0
b. Discuss n queen’s problem. Solve 4 queen’s problem using backtracking 10
method?

7. Attempt any one part of the following:

Q no. Question Marks CO
a. Write short notes on following: 10
(i.) Randomized algorithm.
(ii.) NP- complete and NP hard.
b. What is an approximation algorithm? Explain set cover problem using 10
approximation algorithm.
 Seesional-1

Name: ………………………………… Roll No: ……………………….

Mangalmay Institute of Engineering and Technology, Gr. Noida

Subject Machine learning &
Subject Code:- KCS-055
Name:- techniques
YEAR:- 3rd Branch:- CSE
1st SESSIONAL EXAMINATION (ODD SEMESTER 2023-24)
[Time: 1.5 Hours] [Total Marks: 30]
COURSE OUTCOMES

CO1 To understand the need for machine learning for various problem solving
To understand a wide variety of learning algorithms and how to evaluate
CO2
models generated from data
CO3 To understand the latest trends in machine learning
To design appropriate machine learning algorithms and apply the
CO4
algorithms to a real-world problem
To optimize the models learned and report on the expected accuracy that
CO5
can be achieved by applying the models

SECTION-A
Q.1. Attempt all parts: (2×5=10)

(a)a) Solve the recurrence relation using Master Theorem. (CO1)

T(n)=3T(n1/3) + log3n
(b)b) What is the importance of ‘Average-case analysis of (CO1)
algorithm?
(c)c) Discuss asymptotic notation in brief. (CO1)
(d)d) Explain and compare best and worst time complexity (CO1)
of Quick Sort.
(e)e) What is a Fibonacci heap? (CO2)

SECTION-B
NOTE: Attempt any three parts (3x5=15)
Q.2. What is heap sort write its algorithm? Apply heap sort algorithm for (CO1)
sorting 1, 2, 3, 4, 5, 6, 7, 8, 9, 10.
Q.3. QSolve the recurrence relation using Master Theorem. (CO1)
T(n)=3T(n1/3) + log3n
Q.4. Sort the elements of the given array A using shell sort algorithm: (CO1)
A= [20, 35, 18, 8, 14, 41, 3, 39]
 Q.5. Solve the following recurrences: (CO1)
(i) T(n)=T(n/2) +T(n/4)+T(n/8) +n
T(n)=T(√n) + O (lg n)
SECTION-C
NOTE: Attempt any one parts: (1x5=5)

Q.6. Explain Merge sort algorithm and sort the following sequence {23, 11, 5, 15, (CO1)
68,31, 4, 17} using merge sort.

Q.7. Show the result of inserting the keys. (CO2)

F, S, Q, K, C, L, H, T, V, W, M, R, N
in order into an empty B-Tree with minimum degree 2.
 Model Question Paper

Mangalmay Institute of Engineering and Technology, Gr. Noida

Subject Code: KCS-503 Subject Name: Design & Analysis of Algorithm

Year: 3rd Branch: CSE

(ODD SEM. 2023-24)

[Time: 3 Hours] [Total Marks: 100]

SECTION-A

1. Attempt all parts: 2×10=20

a. Explain and compare best and worst time complexity of Quick Sort. CO1
b. Elaborate asymptotic notation in brief. CO1
c. Explain left rotation in RB tree. CO2
d. Write down the properties of Fibonacci Heap. CO2
e. Explain Greedy programming in brief. CO3
f. Write the short note on convex hull? CO3
g. Explain Backtracking with example. CO4
h. Define Graph Coloring. CO4
i. Define NP and NP hard. CO5
j Define fast Fourier Transform (FFM). CO5

SECTION-B

3. Attempt any three parts: 10x3=30

a. Solve the following By Recursion Tree Method CO1

T(n)=n+T(n/5) +T(4n/5)
b. Insert the following information F, S, CO2
Q,K,C,L,H,T,V,W,M,R,N,P,A,B,X,Y,D,Z,E,G,I. Into an empty
B-tree with degree t=3.
c. Write and explain the Prism’s algorithm to find the Minimum Spanning CO3
Tree of a graph with suitable example.
d. Explain the method of finding Hamiltonian cycles in a graph using CO4
backtracking method with suitable example.
e. Explain and Write the Naïve-String string matching algorithm: CO5
Suppose the given pattern p= aab and given text T = a c a a b c.
Apply Naïve-String Matching algorithm on above Pattern (P)
and Text (T) to find the number of occurrences of P in T.
 SECTION-C

3. Attempt any one 10x1=10

a. Explain Merge sort algorithm and sort the following sequence CO1
{23, 11, 5, 15, 68,31, 4, 17} using merge sort.

b. What do you understand by stable and unstable sorting? Sort the CO1
following sequence {25, 57, 48, 36, 12, 91, 86, 32} using heap sort.

4. Attempt any one 10x1=10

Discuss skip list. Explain the Search operation in Skip list with suitable
a. example also write its algorithm. CO2

b. Discuss the various cases for insertion of key in red-black tree for given CO2
sequence of key in an empty red-black tree- {15, 13, 12, 16, 19, 23, 5,
8}.

5. Attempt any one 10x1=10

a. Explain Kruskal’s Algorithm and Find MST of the Graph. Also write its CO3
Time-Complexity

b Find the shortest path in the below graph from the source vertex 1 to all CO3
. other vertices by using Dijkstra’s algorithm.
6. Attempt any one 10x1=10

a. Define the term sum of subsets problem. Let CO4

w= {5,7,10,12,15,18,20} and m=35. Find all possible subsets of w that
sum to m using recursive backtracking algorithm for it. Draw the
portion of the state-space tree.
b. Illustrate n queen’s problem. Examine 4 queen’s problem using back tracking CO4
method

7. Attempt any one 10x1=10

a. Discuss the problem classes P, NP and NP –complete. with class CO5

relationship.
b. Write Rabin Karp string matching algorithm. Working modulo q=11, CO5
how many spurious hits does the Rabin karp matcher in the text T=
3141592653589793, when looking for the pattern P=26.
 List of Students
Branch - CSE
Sr. No. RollNo Name
1 1907860100047 MANISH KUMAR
2 2007860100016 ARJUN
3 2007860100023 BHARAT SHARMA
4 2007860100039 MD AFJAL ALI
5 2007860100052 NEHA SINGH
6 2007860100056 PIYUSH SHARMA
7 2007860100067 SAHIL KUMAR
8 2107860100001 ABHAY SINGH
9 2107860100002 ABHISHEK
10 2107860100003 ABHISHEK JAISWAL
11 2107860100005 ADITYA PANDEY
12 2107860100006 ADITYA SINGH
13 2107860100007 AHYAAN
14 2107860100009 AMAN KUMAR
15 2107860100010 AMAN KUMAR
16 2107860100011 AMAN RAI
17 2107860100012 AMAN SAGAR
18 2107860100015 AMIYA KUMAR
19 2107860100016 ANAMIKA KUMARI
20 2107860100017 ANIKET KUMAR
21 2107860100018 ANISHA DAS
22 2107860100019 ANSHU DIXIT
23 2107860100020 ANSHUL KOTIYA
24 2107860100021 ANUJ KUMAR
25 2107860100022 ARUN KUMAR
26 2107860100023 ASHWANI PATEL
27 2107860100024 AYAN MAITY
28 2107860100027 AYUSH VERMA
29 2107860100028 BHAVYA JAIN
30 2107860100030 DEVESH SINGH NEGI
31 2107860100031 DIPANSHU KUMAR PANDEY
32 2107860100032 DIWAKAR KUMAR
33 2107860100035 FIRDAUSH KHAN
34 2107860100036 HARSH SANJEEVKUMAR
 SHRIVASTAVA
35 2107860100037 HARSHIT BHARDWAJ
36 2107860100038 HARSHIT RANA
37 2107860100041 HIMANSHU DHIMAN
38 2107860100042 HIMANSHU TONGER
39 2107860100043 HRITHIK RAJ
40 2107860100045 JATIN SEN
41 2107860100047 KAMLESH KUMAR YADAV
42 2107860100048 KRATI SAXENA
43 2107860100050 LAVISH
44 2107860100053 MANISH NEGI
45 2107860100055 MAYANK MAURYA
46 2107860100056 MD ALFAZ KHAN
47 2107860100057 MD DANISH
48 2107860100058 MD HAMMAD WASIF
49 2107860100059 MD SAHIL ZAHIR
50 2107860100063 MINAKSHI TRIPATHI
51 2107860100065 MOHD AHAD KHAN
52 2107860100066 MOHD DILSHAD
53 2107860100067 MOHD SAIF
54 2107860100068 MOHD SAJID
55 2107860100069 MUKUL PANDEY
56 2107860100070 MUSKAN GUPTA
57 2107860100071 NADEEM AHMAD
58 2107860100072 NAGAD NARAYAN
59 2107860100073 NAVED KHAN
60 2107860100074 NAVEEN KUMAR
61 2107860100075 NEELAM
62 2107860100076 NEERAJ PATEL
63 2107860100077 NIBHA KUMARI
64 2107860100078 NITIN SHARMA
65 2107860100079 PIYUSH DUBEY
66 2107860100080 PRAKHAR SHARMA
67 2107860100081 PRANJAL PANDEY
68 2107860100082 PRANJAL SHARMA
69 2107860100083 PRAVEEN KUMAR
70 2107860100084 RADHIKA TAYAL
71 2107860100085 RAHUL PRAJAPATI
 72 2107860100087 RAKSHIT VARSHNEY
73 2107860100088 RISHAV KUMAR
74 2107860100089 RITIK KUMAR
75 2107860100095 SAURABH PANDEY
76 2107860100096 SAURAV KUMAR
77 2107860100097 SHABES
78 2107860100099 SHAHZEB KHAN
79 2107860100100 SHIVAM DEOLIYA
80 2107860100101 SHIVAM RAJ
81 2107860100102 SHIVANSHU SNGH
82 2107860100104 SHREYA SHARMA
83 2107860100105 SHUBH DIXIT
84 2107860100106 SHUBHAM RAJ
85 2107860100107 SHUBHRANSHU KANNOJIYA
86 2107860100109 SRISHTI CHAUHAN
87 2107860100110 SUHAIL
88 2107860100111 SULTAN SALAHUDDIN
89 2107860100112 SUMIT KUMAR SINGH
90 2107860100113 SUMIT RAWAT
91 2107860100114 SUNDRAM KUMAR
92 2107860100116 TAHAR KHAN
93 2107860100117 TANISHA VARSHNEY
94 2107860100118 TANYA GROVER
95 2107860100120 TUSHAR CHAUHAN
96 2107860100122 VIDYA SAGAR PANDEY
97 2107860100123 VIKAS YADAV
98 2107860100124 VIKASH
99 2107860100127 VIVEK
100 2107860100129 VIVEK KUMAR MISHRA
101 2107860100130 YOGESH SHARMA
102 2207860109001 ADITYA KUMAR
103 2207860109002 Akash
104 2207860109003 AKASH RANA
105 2207860109004 Aman Singh
106 2207860109005 ARIF ALI
107 2207860109006 ARSHLAN ISLAM
108 2207860109007 ARVIND SAINI
109 2207860109009 AVINASH SHUKLA
 110 2207860109010 BHUPENDRA KUMAR RAY
111 2207860109011 GAURAV PANDEY
112 2207860109012 GAUTAM KUMAR
113 2207860109013 KM KRASHNA
114 2207860109014 MURLEE MANOHAR
115 2207860109015 NIKHIL BINAY
116 2207860109016 NIKHIL SINGH
117 2207860109017 NILESH KUMAR
118 2207860109018 NISHANT KUMAR DIXT
119 2207860109019 Pramod Kumar
120 2207860109020 ROSHAN KUMAR BARNWAL
121 2207860109021 SAURABH SINGH
122 2207860109022 SHIVA SAINI
123 2207860109023 VIVEK KUMAR
124 2207860109024 VIVEK SINGH

CO, PO, PSO Attainment of DAA– (KCS-503)

CO, PO, PSO Attainment of DAA– (KCS-503)
CO, PO, PSO Mapping of DAA– (KCS-503)
 Course Name: Design and Analysis of Algorithm Course Code: KCS-503
Faculty Name:
S.No. CO'S COURSE OUTCOMES POs PSOs
Design new algorithms, prove them correct, and analyze their
1 CO1 asymptotic and absolute runtime and memory demands. 1,2,4,12 1,2,3
Find an algorithm to solve the problem (create) and prove that the
2 CO2 algorithm solves the problem correctly (validate). 1,2,4,5,12 1,2,3
Understand the mathematical criterion for deciding whether an
algorithm is efficient and know many practically important
3 CO3 problems that do not admit any efficient algorithms. 1,2,3,5,10,12 1,2,3
Apply classical sorting, searching, optimization and graph
4 CO4 algorithms. 1,2,9,12 1,2,3
Understand basic techniques for designing algorithms, including
5 CO5 the techniques of recursion, divide-and-conquer, and greedy. 1,3,4,5,12 1,2,3

Programme Outcomes & Programme Specific Outcomes

PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
DAA
1 2 3 4 5 6 7 8 9 0 1 2 1 2 3
CO1 3 3 - 3 - - - - - - - 3 3 3 3

CO2 2 3 - 2 3 - - - - - - 3 3 3 3

CO3 3 2 2 - 2 - - - - 1 - 3 3 3 3

CO4 3 3 - - - - - - 2 - - 3 3 3 3

CO5 2 - 2 3 3 - - - - - - 3 3 3 3
Averag
2.6 2.75 2.0 2.6 2.6 2.0 1.0 3 3 3 3
e

Course Outcomes Attainment Level – Setting Target Values (Threshold Values)

Assessment Attainment Level
Methods
 Pre-University Level -1 60 to 79% students obtaining 70% marks(70 Marks out of 100)
Exams
Level-2 80 to 89% students obtaining 70% marks(70 Marks out of 100)

Level -3 90% above students obtaining 70% marks(70 Marks out of 100)

End Semester Level -1 40 to 49% students obtaining 33% marks(33Marks out of 100)
Final Exams
Level-2 50 to 59% students obtaining 33% marks(33Marks out of 100)

Level -3 60 % above students obtaining 33% marks(33Marks out of 100)

Computation of Director Attainment – 20% of Internal Sessional Marks + 80% of End semester Final
Exam Marks.
Computation of Overall attainment – 90% of Direct Attainment + 10% of Indirect Attainment

CO, PO, PSO Attainment of DAA– (KCS-503)

Computation of Direct Attainment of the Course DAA
Sr. No. Name of the Marks in Total Marks End Semester End Semester
Students Sessional and in Sessional Marks (100 Marks)
PUT and PUT Obtained
1. ARJUN 50 100
0 0
2. BHARAT 50 100
36 37
SHARMA
3. MD AFJAL ALI 50 100
38 22
4. NEHA SINGH 50 100
40 18
5. PIYUSH 50 100
33 18
SHARMA
6. SAHIL KUMAR 50 100
33 52
7. ABHAY SINGH 50 100
32 52
8. ABHISHEK 50 100
39 72
9. ABHISHEK 50 100
32 51
JAISWAL
10. ADITYA 50 100
46 42
PANDEY
11. ADITYA SINGH 50 100
35 33
12. AHYAAN 50 100
33 42
13. AMAN KUMAR 50 100
35 21
14. AMAN KUMAR 50 100
39 54
15. AMAN RAI 50 100
34 51
16. AMAN SAGAR 50 100
40 16
17. AMIYA KUMAR 50 100
38 41
18. ANAMIKA 50 100
49 52
KUMARI
19. ANIKET KUMAR 50 100
39 41
20. ANISHA DAS 50 100
36 43
21. ANSHU DIXIT 50 100
35 48
22. ANSHUL 50 100
32 21
KOTIYA
23. ANUJ KUMAR 50 100
41 40
24. ARUN KUMAR 50 100
45 48
25. ASHWANI 50 100
36 33
PATEL
26. AYAN MAITY 50 100
36 65
27. AYUSH VERMA 50 100
39 53
28. BHAVYA JAIN 50 100
43 49
29. DEVESH SINGH 50 100
41 44
NEGI
30. DIPANSHU 50 100
34 42
KUMAR PANDEY
31. DIWAKAR 50 100
39 52
KUMAR
32. FIRDAUSH 50 100
34 46
KHAN
33. HARSH 50 100
SANJEEVKUMAR 38 36
SHRIVASTAVA
34. HARSHIT 50 100
39 30
BHARDWAJ
35. HARSHIT RANA 50 100
37 43
36. HIMANSHU 50 100
45 45
DHIMAN
37. HIMANSHU 50 100
38 37
TONGER
38. HRITHIK RAJ 50 100
39 22
39. JATIN SEN 50 100
39 30
40. KAMLESH 50 100
37 38
KUMAR YADAV
41. KRATI SAXENA 50 100
46 51
42. LAVISH 50 100
48 56
43. MANISH NEGI 50 100
32 18
44. MAYANK 50 100
34 30
MAURYA
45. MD ALFAZ 50 100
39 51
KHAN
46. MD DANISH 50 100
47 30
47. MD HAMMAD 50 100
35 37
WASIF
48. MD SAHIL 50 100
37 38
ZAHIR
49. MINAKSHI 50 100
45 55
TRIPATHI
50. MOHD AHAD 50 100
33 50
KHAN
51. MOHD DILSHAD 50 100
48 62
52. MOHD SAIF 50 100
36 44
53. MOHD SAJID 50 100
47 45
54. MUKUL PANDEY 50 100
45 67
55. MUSKAN GUPTA 50 100
37 54
56. NADEEM 50 100
47 38
AHMAD
57. NAGAD 50 100
38 34
NARAYAN
58. NAVED KHAN 50 100
33 33
59. NAVEEN 50 100
32 37
KUMAR
60. NEELAM 50 100
45 68
61. NEERAJ PATEL 50 100
33 20
62. NIBHA KUMARI 50 100
37 69
63. NITIN SHARMA 50 100
47 62
64. PIYUSH DUBEY 50 100
36 22
65. PRAKHAR 50 100
36 13
SHARMA
66. PRANJAL 50 100
33 64
PANDEY
67. PRANJAL 50 100
34 38
SHARMA
68. PRAVEEN 50 100
33 42
KUMAR
69. RADHIKA 50 100
46 63
TAYAL
70. RAHUL 50 100
32 20
PRAJAPATI
71. RAKSHIT 50 100
35 50
VARSHNEY
72. RISHAV KUMAR 50 100
35 46
73. RITIK KUMAR 50 100
34 47
74. SAURABH 50 100
32 53
PANDEY
75. SAURAV 50 100
32 31
KUMAR
76. SHABES 50 100
41 48
77. SHAHZEB KHAN 50 100
33 30
78. SHIVAM 50 100
46 50
DEOLIYA
79. SHIVAM RAJ 50 100
37 54
80. SHIVANSHU 50 100
39 47
SNGH
81. SHREYA 50 100
39 61
SHARMA
82. SHUBH DIXIT 50 100
33 34
83. SHUBHAM RAJ 50 100
40 67
84. SHUBHRANSHU 50 100
42 61
KANNOJIYA
85. SRISHTI 50 100
39 51
CHAUHAN
86. SUHAIL 50 100
37 45
87. SULTAN 50 100
33 57
SALAHUDDIN
88. SUMIT KUMAR 50 100
33 59
SINGH
89. SUMIT RAWAT 50 100
36 59
90. SUNDRAM 50 100
35 16
KUMAR
91. TAHAR KHAN 50 100
38 33
92. TANISHA 50 100
38 51
VARSHNEY
93. TANYA GROVER 50 100
34 62
94. TUSHAR 50 100
39 55
CHAUHAN
95. VIDYA SAGAR 50 100
42 52
PANDEY
96. VIKAS YADAV 50 100
39 33
97. VIKASH 50 100
48 80
98. VIVEK 50 100
32 52
99. VIVEK KUMAR 50 100
47 70
MISHRA
100. YOGESH 50 100
SHARMA 37 35

101. ADITYA KUMAR 50 100

36 45

102. Akash 50 100

36 52

103. AKASH RANA 50 100

34 63

104. Aman Singh 50 100

43 39

105. ARIF ALI 50 100

46 68

106. ARSHLAN 50 100

ISLAM 39 46

107. ARVIND SAINI 50 100

42 41

108. AVINASH 50 100

SHUKLA 37 52

109. BHUPENDRA 50 100

KUMAR RAY 34 44

110. GAURAV 50 100

PANDEY 34 12
 111. GAUTAM 50 100
KUMAR 33 46

112. KM KRASHNA 50 100

35 12

113. MURLEE 50 100

MANOHAR 33 20

114. NIKHIL BINAY 50 100

0 0

115. NIKHIL SINGH 50 100

0 0

116. NILESH KUMAR 50 100

36 19

117. NISHANT 50 100

KUMAR DIXT 39 46

118. Pramod Kumar 50 100

47 33

119. ROSHAN 50 100

KUMAR 43 76
BARNWAL
120. SAURABH 50 100
SINGH 48 32

121. SHIVA SAINI 50 100

41 47

122. VIVEK KUMAR 50 100

32 7

123. VIVEK SINGH 50 100

37 45

124. MANISH KUMAR 0 50 32 100

Threshold 70% (35 Marks 70% (33 %)
Values Marks)
% of Students 87 students 96 students
obtained
Threshold 70% 77%
Values
Attainment 1 3
Level
Calculation 20% of 1= 0.2 80% of 3 = 2.4 Overall COs
Attainment =
2.6

CO, PO, PSO Attainment of DAA– (KCS-503)

Computation of Indirect Attainment of the Course

DAA – Questionnaire
Question Course Outcomes Level -1 Level – 2 Level -3
No. (Slight) (Moderate) (Substantial)

CO-1 Do you agree that the curriculum is designed to 24 50 50

understand the growth of function in design & analysis
of algorithm?
CO-2 Do you agree that the curriculum explains the basics 15 30 79
concepts of algorithms & complexity of algorithm?

CO-3 Do you agree that the course curriculum is able to 30 24 70

apply Dynamic Programming with Knapsack problem
also find all Pair Shortest Paths – Warshal’s and
Floyd’s Algorithms?
CO-4 Do you agree that the implementation of statistical 35 45 44
tools and used online platform for implementation?
CO-5 Do you agree that the curriculum discusses the 22 60 42
algorithm for finding research skills creation in the
 researchers?

Computation of Indirect Attainment Level from Feedback taken in every

particular class from students

CO-1 CO-2 CO-3 CO-4 CO-5

Level -1 24 15 30 35 22
Level-2 50 30 24 45 60
Level-3 50 79 70 44 42
Total No. 124 124 124 124 124
Students
Attainment 2.20 2.51 2.32 2.07 2.16
Level.

Formula – (1XLevel-1) +(2XLevel-2) +(3XLevel-3)

No. of Students.

CO-1 = (1X24) + (2X50) + (3X50) = 24+100+150 /124 = 2.20

CO-2 = (1 X 15) + (2 X 30) + (3 X 79) = 15+60+237/124 = 2.51
CO-3 = (1 X30) + (2 X 24) + (3 X 70) = 30+48+210/124 = 2.32
CO-4 = (1 X 35) + (2 X 45) + (3 X 44) = 35+90+132/124 = 2.07
CO-5 = (1 X22) + (2 X60) + (3 X 42) = 22+120+126/124 = 2.16

Indirect COs Attainment = 2.20+2.51+2.32+2.07+2.16/5=11.26/5=2.252

CO, PO, PSO Attainment of DAA– (KCS-503)

Computation of Overall CO Attainment

Attainment Calculative % Results

Attained
Direct 90% of 2.6 2.34
Attainment
Indirect 10% of 2.25 0.225
Attainment
Total 2.56 = 85%
CO, PO, PSO Attainment of DAA– (KCS-503)
Programme Outcomes (POs) Attainment Results

Course PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO- PO- PO- Overall
10 11 12

DAA- (KCS- 18.55

2.6 2.75 2.0 2.6 2.6 - - - 2.0 1.0 - 3
503)
Programmed 2.21 2.34 1.70 2.21 2.21 1.70 0.85 2.56 15.78
Attainment
Level

Formula of Programme Attainment Level (POs attainment level) = 85%

Attainment Level = Weighted Average of POs ( X) Overall average of Course Outcomes
Attainment Level of End Term Exams ie (3)

POs Attainment
Level of POs
PO-1 (2.6X2.56)/3 2.21
 PO-2 (2.75X2.56)/3 2.34
PO-3 (2.0X2.56)/3 1.70
PO-4 (2.6X2.56)/3 2.21
PO-5 (2.6X2.56)/3 2.21
PO-9 (2.0X2.56)/3 1.70
PO-10 (1.0X2.56)/3 0.85
PO-12 (3X2.56)/3 2.56

CO, PO, PSO Attainment of DAA– (KCS-503)

PSOs Attainment Results
Course PSO- PSO- PSO- Overall
1 2 3
Weighted 3 3 3 9
Average of
PSOs

Programmed 2.56 2.56 2.56 7.68

Specific
Attainment
Level Result

Formula of Programme Attainment Level (POs attainment level) = 85%

Attainment Level = Weighted Average of POs X Overall Course Outcomes Attainment Level/
Attainment Level of End Term Exams ie (3)

POs Result Attainment

Level of PSOs
PSO-1 (3X2.56)/3 2.56
PSO-2 (3X2.56)/3 2.56
PSO-3 (3X2.56)/3 2.56