Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

Oriental College of Technology,

Bhopal

Department
Of
Computer Science & Engineering
Course File:JAN JUN 2022

Subject: Analysis& Design of Algorithms

Prepared By: Submitted To:

MR. SUJEET KUMAR
Associate Professor HOD (CSE)
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

COURSE FILE
Course Bachelor Of Technology (B.TECH)
Branch CSE
Subject Analysis & Design of Algorithm
Subject Code CS-402
Semester IV
Session JAN-JUN 2022
Faculty Name MR. SUJEET KUMAR
Scheme New Scheme B.TECH (w.e.f. July, 2018)

Credit Structure L: Lecture T: Tutorial P: Practical Total Credits

3 1 2 6
NOTE: One credit refers to one hour teaching in theory, Tutorial and in practical.

CBGS-
Maximum Marks Allotted
Theory Practical
Marks Allotted End Mid Quiz, End Lab Assignment Total
Structure Sem Sem. Assignmen Sem Work / Quiz/Term Marks
MST t paper
70 20 10 30 10 10 150
NOTE: MST: Minimum of two mid semester tests to be conducted.

Index
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
S. No. Particulars Page No.
1. Vision and Mission of the Institute
2. Vision and Mission of the Department
3. Programme Specific Outcomes (PSOs)
4. Programme Outcomes (POs)
5. Course Outcomes (COs)
6. CO-PSO Matrix
7. CO-PO Matrix
8. University Scheme
9. Syllabus
10. Academic Calendar
11. Lecture Plan Outcome Based
12. Time Table (Individual & Class)
13. * Mid Sem I and II (Question Papers Outcome Based)
14. * Tutorial Sheets I ,II, III, IV and V
15. * Quiz Sheet I ,II, III IV and, V
16. * Assignment Sheets I ,II, III, IV and V
17. Mid Sem I and II (Marks)
18. Tutorial I ,II, III, IV and V (Marks)(for CBCS only)
19. Quiz I ,II, III IV and, V (Marks)
20. Assignment I ,II, III, IV and V (Marks)
21. Previous University Question Papers (last 5 years)
22. List of Reference Books/ Websites/ Other Material
23. Internal Assessment Record of attainment of Course
Outcomes (CO).
24. Measurement of CO attainment through Internal Assessments.
25. Tutorial Attendance Record
26. Lecture Attendance Record
* Each sheet should mention the Course outcome no. to which the given problems are related.
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

Vision And Mission of The Department

Vision of
The department commits to adopt latest development in the field
the
of technology and industry to make undergraduates employable
Department
and excel in the field of research and entrepreneurship.

Create awareness of latest knowledge and technology amongst

undergraduates for their professional growth.

Develop the art of logical thinking to solve complex industrial

Mission of
problems related to Computer Science and Engineering
the
resulting in research and innovation.
Department

Seek cooperation of industry to make undergraduates aware of

industrial work culture and its environment.

Programme Educational Objective (PEOs)

PEO 1:
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
Student will graduate with underlying concepts of mathematics, science and
engineering that help them for advance studies.

PEO 2: Students will develop professional skills for immediate employment.

Student will acquire multidisciplinary knowledge as well as leadership qualities

PEO 3: for entrepreneurship and technological innovation.

Student will be able to analyze problems and design a solution by applying

PEO 4: collaborative knowledge through research.

Programme Specific Outcomes (PSOs)

PSO1: Develop skills to analyze problems, design algorithms and

Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
implement those using recent computer languages

Impart skill to describe web intelligence, cloud computing, cyber

PSO2:
security, machine learning, data science & analytics in order to
design systems.

Programme Outcomes (POs)

Engineering Graduates will be able to:

1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and
an engineering specialization to the solution of complex engineering problems.
2. Problem analysis: Identify, formulate, reviewer search literature, and analyze complex engineering
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
problems reaching substantiated conclusions using first principles of mathematics, natural sciences, and
engineering sciences.
3. Design/development of solutions: Design solutions for complex engineering problems and design
system components or processes that meet the specified needs with appropriate consideration for the public
health and safety, and the cultural, societal, and environmental considerations.
4. Conduct investigations of complex problems: Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information to
provide valid conclusions.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering
and IT tools including prediction and modeling to complex Engineering activities with an understanding of
the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal,
health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional
engineering practice.
7. Environment and sustainability: Understand the impact of the professional engineering solutions in
societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development.
8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
engineering practices.
9. Individual and teamwork: Function effectively as an individual, and as a member or leader in diverse
teams, and in multidisciplinary settings.
10. Communication: Communicate effectively on complex engineering activities with the engineering
community and with society at large, such as, being able to comprehend and write effective reports and design
documentation, make effective presentations, and give and receive clear instructions.
11. Project management and finance: Demonstrate knowledge and understanding of the engineering and
management principles and apply these to one’s own work, as a member and leader in a team, to manage
projects and in multidisciplinary environments.
12. Life-long learning: Recognize the need for, and have the preparation and ability to engage in
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
independent and life-long learning in the broadest context of technological change.

Course Outcomes (COs)

NAME OF SUBJECT: -Analysis Design of Algorithm

SUBJECT CODE: -CS402
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
Students will be able to
CO1 Discuss asymptotic notations for analyzing the complexity of algorithm and divide and
conquer technique.
CO2
Evaluate the greedy strategy and its applications for solving various problems.
CO3
Apply the dynamic programming strategy for knapsack problem, multi-stage graph etc.
CO4 Analyze backtracking and branch & bound techniques for knapsack, N-queens and job
assignment problems.
CO5
Apply various Tree and Graph traversal techniques for problem solving.

CO vs. PSO Mapping

Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
Course Name: Analysis & Design of Algorithm(CS402)
Year of Study: 2020-21 (IV Semester)

PSO1 PSO2
CO1 3 2
CO2 2 2
CO3 2 2
CO4 2 2
CO5 2 2
AVG 2.2 2

Course PSO1 PSO2

CS402 2.2 2

CO vs. PO Mapping

PO Attainment- Direct Subject Name: CS-402

Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
- -
CO1 2.00 2.00 3.00 2.00 2.00 2.00 2.00 2.00 2.00 3.00
-
CO2 2.00 2.00 3.00 2.00 3.00 2.00 2.00 2.00 2.00 2.00 2.00
-
CO3 3.00 3.00 1.00 2.00 2.00 2.00 2.00 3.00 2.00 3.00 2.00
- - -
CO4 1.00 2.00 2.00 3.00 2.00 2.00 2.00 2.00 2.00
- - - - -
CO5 2.00 3.00 2.00 2.00 2.00 2.00 2.00
-
Avg 2.00 2.25 2.25 2.50 2.20 2.00 2.00 2.20 2.00 2.33 2.20
-
Direct PO Attainment 2.20 2.25 2.25 2.50 2.20 2.00 2.00 2.40 2.00 2.67 2.40

Course PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CS402
3 3 2.8 2 - 1 - - 1 - - 2

University Scheme
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

Syllabus
Unit 1
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
Algorithms, Designing algorithms, analyzing algorithms, asymptotic notations, heap and heap sort.
Introduction to divide and conquer technique, analysis, design and comparison of various algorithms
based on this technique, example binary search, merge sort, quick sort, strassen’s matrix multiplication.

Unit 2
Study of Greedy strategy, examples of greedy method like optimal merge patterns, Huffman coding,
minimum spanning trees, knapsack problem, job sequencing with deadlines, single source shortest path
algorithm

Unit 3
Concept of dynamic programming, problems based on this approach such as 0/1 knapsack, multistage
graph, reliability design, Floyd-Warshall algorithm

Unit 4
Backtracking concept and its examples like 8 queen’s problem, Hamiltonian cycle, Graph coloring
problem etc. Introduction to branch & bound method, examples of branch and bound method like
traveling salesman problem etc. Meaning of lower bound theory and its use in solving algebraic problem,
introduction to parallel algorithms.

Unit 5
Binary search trees, height balanced trees, 2-3 trees, B-trees, basic search and traversal techniques for
trees and graphs (In order, preorder, postorder, DFS, BFS), NP-completeness.

References:
1. Coremen Thomas, Leiserson CE, Rivest RL; Introduction to Algorithms; PHI.
2. Horowitz & Sahani; Analysis & Design of Algorithm
3. Dasgupta; algorithms; TMH
4. Ullmann; Analysis & Design of Algorithm;
5. Michael T Goodrich, Robarto Tamassia, Algorithm Design, Wiely India
6. Rajesh K Shukla: Analysis and Design of Algorithms: A Beginner's Approach; Wiley
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
Academic Calendar

Academic Calendar for Even Sem, Session January-June, 2022

BE II, IV, VI & VIII Semester
Note: 1. Students should clear their semester fees before the commencement of semester & latest by date of registration.
2. 75% attendance compulsory for appearing in Mid Semester examination and also for forwarding of
Examination & Scholarship forms.
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
Lecture Plan Outcome Based

Department: CSE Session: Jan – Jun, 2022

Name of Semester: IV
MR. SUJEET KUMAR
Faculty:
Subject: Analysis & Design of Algorithm Sub Code: CS402
Total expected Extra Lectures 10
50
Lectures (if required)
S. Topic to be Covered Date of Date of References Teaching Referen
No plan Completio Methodol ce to
n ogy* Course
Outcom
es
UNIT I
Introduction to Chalk
1 R1,R2,R3 CO1
Algorithms 24-Feb-22 24-Feb-22 &Board
Designing & Analyzing Chalk &
2 R2,R3 CO1
algorithms 25-Feb-22 25-Feb-22 Board
Chalk &
3 Asymptotic notations R1,R2 CO1
26-Feb-22 26-Feb-22 Board
Chalk &
4 Heap and heap sort R2,R3 CO1
02-Mar-22 02-Mar-22 Board
Introduction to divide and Chalk &
5 R2 CO1
conquer technique 03-Mar-22 03-Mar-22 Board
Analysis, design and
comparison of various Chalk &
6 R2 CO1
algorithms based on this Board
technique 04-Mar-22 04-Mar-22
Chalk &
7 Binary search R1 CO1
05-Mar-22 05-Mar-22 Board
Chalk &
8 Merge sort R2 CO1
07-Mar-22 07-Mar-22 Board
Chalk &
9 Quick sort R2 CO1
09-Mar-22 09-Mar-22 Board
Strassen’s matrix Chalk &
10 R2 CO1
multiplication 10-Mar-22 10-Mar-22 Board
UNIT II
Introduction to Greedy Chalk &
11 R1,R2 CO2
strategy 11-Mar-22 11-Mar-22 Board
Examples of greedy Chalk &
12 R1,R2 CO2
method 12-Mar-22 12-Mar-22 Board
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
16 Chalk &
Minimum spanning trees R2 CO2
23-Mar-22 23-Mar-22 Board
17 Numericals based on Chalk &
R2,R3 CO2
Minimum spanning trees 24-Mar-22 24-Mar-22 Board
18 Chalk &
knapsack problem R2,R4 CO2
28-Mar-22 28-Mar-22 Board
19 job sequencing with Chalk &
R2,R4 CO2
deadlines 30-Mar-22 30-Mar-22 Board
20 Single source shortest Chalk &
R2 CO2
path algorithm 31-Mar-22 31-Mar-22 Board
UNIT III
Concept of dynamic Chalk &
21 R2 CO3
programming 01-Apr-22 01-Apr-22 Board
Chalk &
22 0/1 knapsack R2,R3 CO3
02-Apr-22 02-Apr-22 Board
Chalk &
23 Multistage graph R1,R2 CO3
06-Apr-22 06-Apr-22 Board
Problems of Multistage Chalk &
24 R1,R2 CO3
graph 07-Apr-22 07-Apr-22 Board
Chalk &
25 Reliability design R2 CO3
08-Apr-22 08-Apr-22 Board
Problems on Reliability Chalk &
26 R2 CO3
design 08-Apr-22 08-Apr-22 Board
Floyd-Warshall Chalk &
27 R2,R3 CO3
algorithms 11-Apr-22 11-Apr-22 Board
Longest Common Chalk &
28 R1 CO3
Subsequence 11-Apr-22 11-Apr-22 Board
Matrix Chain Chalk &
29 R1 CO3
Multiplication 19-Apr-22 19-Apr-22
Board
Longest Repeated Chalk &
30 R1 CO3
Subsequence 19-Apr-22 19-Apr-22
Board
UNIT IV
Backtracking concept Chalk &
31 R2,R3 CO4
and its examples 27-Apr-22 27-Apr-22
Board
Chalk &
32 8 queen’s problem R2 CO4
27-Apr-22 27-Apr-22 Board
Chalk &
33 Hamiltonian cycle R1,R2 CO4
02-May-22 02-May-22 Board
Chalk &
34 Graph coloring problem R1,R2,R3 CO4
02-May-22 02-May-22 Board
Introduction to branch & Chalk &
35 R2,R4 CO4
bound method 04-May-22 04-May-22 Board
 Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
Chalk &
36 Job Assignment Problem R2,R4 CO4
04-May-22 04-May-22 Board
Traveling salesman
Chalk &
37 problem of branch & R2 CO4
Board *Note:
bound 08-Apr-22 08-Apr-22
Meaning of lower bound Chalk & Teaching
38 R2,R3 CO4
theory 11-Apr-22 11-Apr-22 Board
Use of lower bound
Chalk &
39 theory in solving R2,R3 CO4
Board
algebraic problem 19-Apr-22 19-Apr-22
Introduction to parallel Chalk &
40 R1,R2,R3 CO4
algorithms 27-Apr-22 27-Apr-22 Board
UNIT V
Chalk &
41 Computation Ability R1,R2 CO5
05-May-22 05-May-22 Board
Chalk &
42 Binary search trees R2 CO5
05-May-22 05-May-22 Board
Chalk &
43 Height balanced tree R2,R3 CO5
05-May-22 05-May-22 Board
Chalk &
44 2-3 trees R2,R3 CO5
07-May-22 07-May-22 Board
Chalk &
45 B-trees R2 CO5
07-May-22 07-May-22 Board
Basic search and
Chalk &
46 traversal techniques for R2 CO5
Board
trees 07-May-22 07-May-22
Basic search techniques Chalk &
47 R2 CO5
for trees for graphs 09-May-22 09-May-22 Board
Basic traversal
Chalk &
48 techniques for trees for R2 CO5
Board
graphs 11-May-22 11-May-22
Chalk &
49 NP-completeness R2 CO5
12-May-22 12-May-22 Board
Chalk &
50 Computation Ability R1,R2 CO5
13-May-22 13-May-22 Board
methodology implies use of any one of the following:
1. Chalk/Board
2. Overhead projector for ppts/videos
3. Interactive Sessions
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

References
PUBLISHER /
S.No. TITLE AUTHOR YEAR
EDITION
Coremen Thomas,
PHI Learning Private
R1 Introduction to Algorithms Leiserson CE, Rivest
Limited
RL
Analysis & Design of
R2 Horowitz & Sahani
Algorithm
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
R3 Algorithms Dasgupta TMH

Analysis & Design of

R4 Ullmann
Algorithm
Michael T Goodrich,
R5 Algorithm Design Wiely India
Robarto Tamassia

Time Table (Class)

Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

Time Table (Individual )

Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

Mid Sem Exam Syllabus

Unit-1: (Full Unit)

Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
Algorithms, Designing algorithms, analyzing algorithms, asymptotic notations, heap and
heap
sort. Introduction to divide and conquer technique, analysis, design and comparison of
various
algorithms based on this technique, example binary search, merge sort, quick sort,
strassen’s matrix
multiplication.

Unit-2: (Full Unit)

Study of Greedy strategy, examples of greedy method like optimal merge patterns,
Huffman
coding, minimum spanning trees, knapsack problem, job sequencing with deadlines,
single source
shortest path algorithm

Unit-3 (Half Unit)

Concept of dynamic programming, problems based on this approach such as 0/1 knapsa

ORIENTAL COLLEGE OF TECHNOLOGY, BHOPAL

Mid Semester Examination-I

April 2022
Programme B.Tech Semester IV
Subject ADA Subject code CS-402
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
Max. Marks 40 Min. Marks 14
Duration 2 hrs Set A
Note (i) Q.1 consists three parts, attempt any two.
(ii) Q.2 consists three parts, attempt any two.
(iii) Q.3 consists two parts, attempt any one.
(iv) Each part carries 08 marks

S.No Question Marks

Describe performance analysis of an Algorithm and also explain the

a 8
Significance of asymptotic notation.
1
Solve the Recurrence relation.
b T(n) = 8T(n/2) + n2 ………….. For all n< 2. 8
T(n) = 1 ………………………….. n=2
c Give an algorithm for the Quick sort and also analyze your algorithm. 8
Find the Binary Search algorithm that can be solved by divide and conquer.
a 8
Find out the complexity of the given program :
X=0;
For(i=1 to n)
{
J=1;
2 While(J<n)
b 8
{
X=X+1;
J=J*2;
}
}

c Find the complexity of Recursive Binary Search algorithm. 8

Define Omega notation and convert the given function in the Omega notation:
a F(n)=2n+6n2+3n 8
3
The forward substitution and backward substitution methods are used to find the
b complexity of recursive algorithm and explain them. 8

Mid Sem Exam Syllabus

Unit-3: (Half Unit)

Multistage graph, reliability design, Floyd-Warshall algorithm

Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
Unit-4:
(Full
Unit)

Backtracking concept and its examples like 8 queen’s problem, Hamiltonian cycle,
Graph
coloring problem etc. Introduction to branch & bound method, examples of branch and
bound
method like traveling salesman problem etc. Meaning of lower bound theory and its use
in solving algebraic problem, introduction to parallel algorithms.

Unit-5 (Full Unit)

Binary search trees, height balanced trees, 2-3 trees, B-trees, basic search and traversal
techniques for trees and graphs (In order, preorder, postorder, DFS, BFS), NP-
completeness.

ORIENTAL COLLEGE OF TECHNOLOGY, BHOPAL

Mid Semester Examination-II

May 2021
Programme B.Tech Semester IV
Subject ADA Subject code CS402
Max. Marks 40 Min. Marks 14
Duration 2 hrs Set A
Note (i) Q.1 consist three parts and students will have to attempt any two.
(ii) Q.2 consist three parts and students will have to attempt any two.
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
(iii) Q.3 consist two parts and students will have to attempt any one.
(iv) Each part carry 08 marks
S.No Question Marks

Find the huffman’s code for ten files whose lengths are:- 64 ,20, 34 ,25, 46, 51, 27, 84 ,1
a and 12. Also find its total bits required.
8

Explain the Multistage graph problem, Also find out the optimal path from
source to destination vertex in following graph.

1
b 8

c Describe the term lower bound theory with suitable example. 8

Construct B-Tree of order-5 for the following numbers- 3, 14, 7, 1, 8, 5, 11,17,
a 13, 6, 23, 12, 20, 26, 4, 16, 18, 24, 25, 19. 8
2 b Describe P, NP, NP-hard and NP-Complete Problems. 8
Describe the algorithm of Prim’s and kruskal’s.
c 8
Solve following Knapsack instances using Dynamic Programming.n=4, M=30,
a (p1,p2,p3,p4)=(30, 35,17,42), (w1,w2,w3,w4)=(7,15,18,12) 8

3 Explain Reliability Design and Design a three stage system with device types
D1, D2, D3. The costs are Rs. 30, Rs. 15 and Rs. 20 respectively. The cost of the
b 8
system is to be no more than Rs. 105. The reliability of each device type is 0.9,
0.8 and 0.5 respectively.

Assignment-I

Semester: IV
Subject Name: Analysis & Design of Algorithm Subject Code: CS402
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
SN Reference to Course
Questions
o Outcome
1 What is an Algorithm? Discuss the criteria for analysis of algorithms CO1

Discuss the time and space complexity of an algorithm. Also CO1

2
explain the notations used.

Assignment-II

Semester: IV
Subject Name: Analysis & Design of Algorithm Subject Code: CS402

S. No Questions Reference to
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
Course Outcome
1 Explain Greedy strategy. Write down its algorithm. CO2

2 What is optimal merge patterns explain? CO2

Assignment-III
Semester: IV
Subject Name: Analysis & Design of Algorithm Subject Code: CS402

Reference to
S. No Questions
Course Outcome
1 Explain Dynamic programming. What is the principle of CO3
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
Optimality? Compare Dynamic programming with Greedy
method.

2 What is 0/1 knapsack problem write its algorithm? CO3

Assignment-IV
Semester : IV
Subject Name: Analysis & Design of Algorithm Subject Code: CS402

Reference to
SNo Questions
Course Outcome
1 What is backtracking concept for designing an algorithm CO4
Use backtracking formulation to solve 4-Queen and 8- CO4
2
Queen problem.
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

Assignment-V
Semester : IV
Subject Name: Analysis & Design of Algorithm Subject Code: CS402

Reference to
SNo Questions
Course Outcome
What is Binary Search Tree? Explain various tree traversal CO5
1
techniques.
2 The following keys are to be inserted in the order shown into an CO5
AVL tree :A, Z, B, Y, C, X, D, W, E, V, F
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
Show how the tree appears after each insertion.

Tutorial-I
Semester : IV
Subject Name: Analysis & Design of Algorithm Subject Code: CS402

Reference to
SNo Questions
Course Outcome
1 Write an algorithm for Heap sort and analyze its time requirements CO1
What do you understand by priori and posteriori analysis. Explain CO1
2
the RAM model to analyze an algorithms time complexity.
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

Tutorial-II
Semester : IV
Subject Name: Analysis & Design of Algorithm Subject Code: CS402

Reference to
SNo Questions
Course Outcome
1 What is Huffman coding explain with example? CO1

2 What is minimum spanning tree? Explain. CO1

 Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

Tutorial-III
Semester : IV
Subject Name: Analysis & Design of Algorithm Subject
Code: CS402

Reference to
SN
Questions Course
o
Outcome
1 What is Multistage graph? Explain CO3
2 What is Multistage graph problem? Discuss its solution based on Dynamic CO3
programming approach. Give a suitable algorithm and find its computing
time.
 Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

Tutorial-IV
Semester : IV
Subject Name: Analysis & Design of Algorithm Subject Code: CS402

Reference to Course
SNo Questions
Outcome
What is graph coloring problem? How it can be solved using back CO4
1
tracking ?
What are Hamiltonian cycles? Write the algorithm which finds all CO4
2
Hamiltonian cycles in a graph
 Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

Tutorial-V
Semester : IV
Subject Name: Analysis & Design of Algorithm Subject Code: CS402

Reference to Course
SNo Questions
Outcome
What is 2-3 trees? Explain with example. CO5
1

Define B-tree. Prove that if n>=1, then for any n-key, B-tree of height h CO5
2 and minimum degree t>=2 , h<=log t {(n+1)/2 } .
Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

Quiz-[1] (Session: Jan-June 2022)

 Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.

Mid Semester Exam Marks

S
No Enrollment No Name of Student Marks MST I Marks MST II
1 0126CS201001 Aanchal Thantrahatay 15 7
2 0126CS201002 Aayush Gautam 13 15
3 0126CS201003 Aayush Parashar 14 12
4 0126CS201004 Abhimanyu Srivastava 11 19
5 0126CS201005 Abhishat Tiwari 12 16
6 0126CS201006 Abhishek Gour 16 14
7 0126CS201007 Abhishek Mahajan 17 17
8 0126CS201008 Abhishek Pandey 18 6
9 0126CS201009 Abhishek Tiwari 11 11
10 0126CS201010 Aditi Sharma 10 18
11 0126CS201011 Aditya Pandey 10 20
12 0126CS201012 Aditya Sharma 14 14
13 0126CS201013 Ajay Kumar 12 12
14 0126CS201014 Alok Kumaryadav 18 6
15 0126CS201015 Alzeb Khan 14 16
16 0126CS201016 Amaan Khan 11 15
17 0126CS201017 Aman Bisen 15 7
18 0126CS201018 Anand Mishra 12 12
19 0126CS201019 Anand Patel 15 13
20 0126CS201020 Aniket Gour 14 14
21 0126CS201021 Ankit Kumar Pandey 13 13
22 0126CS201022 Anmol Rinayat 18 6
23 0126CS201023 Anubhav Shivhare 16 10
 Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
24 0126CS201024 Anurag Agrawal 17 17
25 0126CS201025 Arsh Bisen 11 17
26 0126CS201026 Arunoday Ruhel 16 6
27 0126CS201027 Arya Taloker 12 14
28 0126CS201028 Aryan Tiwari 16 10
29 0126CS201029 Ashish Kumar 14 14
30 0126CS201030 Ashok . 18 14
31 0126CS201031 Ashvi Gupta 18 14
32 0126CS201032 Ashwini Kumar Gupta 18 14
33 0126CS201033 Avani Jain 17 19
34 0126CS201034 Avinash Kumarsingh 16 16
35 0126CS201035 Ayush Tripathi 10 18
36 0126CS201036 Bhagwan Singhmehar 4 16
37 0126CS201037 Bharat Bharat 13 13
38 0126CS201038 Bharat Barapatre 19 19
39 0126CS201039 Chandan Gour 10 16
40 0126CS201040 Chirag Shukla 14 8
41 0126CS201041 Dhiraj Kumar 17 15
42 0126CS201042 Divisha Shrivastava 15 15
43 0126CS201043 Gajendra Singh 14 12
44 0126CS201044 Gaurav Sahu 16 16
45 0126CS201045 Gaurav Singh 18 14
46 0126CS201046 Geneet Gautam 1 19
47 0126CS201047 Harshit Gour 17 15
48 0126CS201048 Harshit Shrivastava 16 20
49 0126CS201049 Hiteaishi Bawankar 17 19
50 0126CS201050 Kanchan Parashar 12 14
51 0126CS201051 Khushi Khare 19 19
52 0126CS201052 Khushi Mandal 17 17
53 0126CS201053 Khushi Tiwari 16 16
54 0126CS201054 Kishlay Kumar 16 14
55 0126CS201055 Koustubh Dubey 16 16
56 0126CS201056 Lakshya Bisen 18 16
57 0126CS201057 Madhur Raverkar 17 17
58 0126CS201058 Manshi Singh 18 12
59 0126CS201059 Mayank Gupta 16 16
60 0126CS201060 Md Mahtabraja 12 16
61 0126CS201061 Mohammed Murshidrizwan 16 16
62 0126CS201062 Mohan Kumar 16 20
63 0126CS201063 Mohd Ayazansari 17 9
64 0126CS201064 Mohd Saif Ali 10 14
65 0126CS201065 Mourya Pratap 10 10
66 0126CS201066 Muskan Chaturvedi 17 15
67 0126CS201067 Muskan Ganwani 12 14
 Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
68 0126CS201068 Muskan Mk 18 16
69 0126CS201069 Muskan Yadav 18 18
70 0126CS201070 Navin Patel 18 12
71 0126CS201071 Nihal Yaduwanshi 14 16
72 0126CS201072 Om Bhushan 15 13
73 0126CS201073 Pallavi Bhardwaj 15 15
74 0126CS201074 Pallavi Rajput 16 20
75 0126CS201075 Pankaj Kumarsahu 14 16
76 0126CS201076 Piyush Panchabhai 16 16
77 0126CS201077 Poonam Mishra 15 7
78 0126CS201078 Prakash Kumar 11 19
79 0126CS201079 Pratham Paonarkar 19 19
80 0126CS201080 Pratyush Sachan 17 19
81 0126CS201081 Priyanshu Dwivedi 12 18
82 0126CS201082 Pushpendra Kumardubey 11 17
83 0126CS201083 Rajan Kumar 17 9
84 0126CS201084 Rajendra Kumarsahu 16 16
85 0126CS201085 Rajkumar Patel 15 11
86 0126CS201086 Raunak Sharma 16 18
87 0126CS201087 Rinky Verma 16 16
88 0126CS201088 Ritesh Kumarjha 16 16
89 0126CS201089 Rocky Kumar 14 12
90 0126CS201090 Rohan Deovaishnav 4 16
91 0126CS201091 Rohit Bakalwar 18 16
92 0126CS201092 Rudransh Sharma 18 18
93 0126CS201093 Sahil Singh Parihar 10 20
94 0126CS201094 Sahil Soni 15 13
95 0126CS201095 Sanjana Changwal 18 18
96 0126CS201096 Sanyami Tiwari 20 18
97 0126CS201097 Saurabh Mishra 11 15
98 0126CS201098 Saurabh Singh 17 19
99 0126CS201099 Shivam Sinha 17 15
100 0126CS201100 Shivani Malviya 18 18
101 0126CS201101 Shivani Singh 15 11
102 0126CS201102 Shivansh Tripathi 11 19
103 0126CS201103 Shivanshu Tiwari 16 16
104 0126CS201104 Shreeja Joshi 17 19
105 0126CS201105 Shruti Gayakwad 11 17
106 0126CS201106 Shubh Gupta 17 15
107 0126CS201107 Shubham Shukla 15 15
108 0126CS201108 Shubhank Shrivastava 15 11
109 0126CS201109 Somil Namdev 18 18
110 0126CS201110 Sonam Patidar 16 18
111 0126CS201111 Sudhanshu Ranjan 16 6
 Analysis & Design of Algorithm 2022

Oriental College of Technology, Bhopal

Department of Computer Science & Engg.
112 0126CS201112 Sumit Parate 17 19
113 0126CS201113 Suveer Rajrahangdale 17 15
114 0126CS201114 Tanu Sahu 16 18
115 0126CS201115 Tanveer Singh 1 9
116 0126CS201116 Urvashi Thakur 14 16
117 0126CS201117 Vaishnavi V 13 17
118 0126CS201118 Vaishnavi Deoskar 17 7
119 0126CS201119 Vanshika Kandya 17 19
120 0126CS201120 Vedant Dalal 16 16
121 0126CS201121 Vicky Kumar 17 13
122 0126CS201122 Vikas Dhakad 11 17
123 0126CS201123 Vikas Rajpoot 16 16
124 0126CS201124 Vinayak Agarwal 16 16
125 0126CS201125 Vipul Hayaran 12 12
126 0126CS201126 Vishakha Pathak 17 13
127 0126CS201127 Vivek Kumar Singh 18 16
128 0126CS201128 Yash Barapatre 10 16
129 0126CS201129 Yash Das 16 18
130 0126CS201130 Yesh Shankushal 10 20
131 0126CS213D01 Akanksha Kumari 18 10
132 0126CS213D02 Anuradha Patel 18 8
133 0126CS213D03 Ashutosh Pandey 2 8
134 0126CS213D04 Hariom Koli 17 9
135 0126CS213D05 Md Uvesh Anwar 15 13
136 0126CS213D06 Rajni Kachhap 1 9
137 0126CS213D07 Shivam Kumar 18 14
138 0126CS213D08 Simant Ishwar 12 16
139 0126CS213D09 Smriti Kumari 5 9
Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.
Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.

Previous University Question Papers

Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.
Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.
Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.
Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.

List of Additional Reference Books/Websites/Other Material

Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.
Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.

Quiz Semester Exam Marks

S Enrollment UT-2 UT-3 UT-4 UT-

No No Name of Student UT-1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.
136

Attendance Semester Exam Marks

S No Enrollment No Name of Student Att %
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
Analysis & Design of Algorithm 2022-
2023
Oriental College of Technology, Bhopal
Department of Computer Science & Engg.
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136