COURSE FILE

Subject: DESIGN AND ANALYSIS OF ALGORITHMS

Subject Code: CS603PC

Academic Year:2020-21

Name of the Faculty :K DEVADAS

Department :CSE
Branch & Year : CSE3-2
 Check List of the Course File
Department:CSE Date:
Subject Code: CS603PC
Title of the subject:Design and Analysis of Algorithms
S.No Attributes Yes/No
1 Vision and Mission of institute
2 Course handout& its contents
a) Vision and Mission of department
b) PEOs of the program
c) Program Outcomes (POs)
d) Prerequisites
e) Course Outcomes (COs)
f) Detailed syllabus
g) Course Plan
h) Evaluation scheme
3 CO-PO mapping
4 Course material
5 Teaching diary for the course
6 Question bank prepared by faculty (unit wise)
7 Descriptive question bank for assignment
8 Sets of copies of old question papers
9 Analysis of student performance
10 Answer book copies
11 a) Internal books (Excellent/Good/Fail) = 3 Nos
b) Assignment Copies (Excellent/Good/Fail) = 3 Nos
c) Laboratory records (if any) (Excellent/Good/Fair) = 3 Nos.
Whether remedial measures were taken by faculty members after
completion of first module (with supporting documents)

12 IQAC review report

HOD
 Review Report
Department:CSE Date:
Subject Code: CS603PC
Title of the subject:Design and Analysis of Algorithms
S. No Observations Excellent/Good/Fair Suggestions/Remarks

1 Subject coverage alignment

with the academic calendar
2 Quality of the question bank
a) Quiz question bank -NA-
b) Descriptive assignment
3 Correlation between Course
Outcomes (C.O.), Program
Outcomes (POs) and
Program Specific Outcomes
(PSOs).
4 Rate the alignment of the
course content in bridging
the gap for achieving
Program Outcomes (POs)
and Program-Specific
Outcomes (PSOs) through
meaningful Course Outcomes
(C.O.)
5 Faculty-initiated remedial
measures and the resulting
outcomes achieved for
improvement

Name and Signature of the Members

1. Subject Expert :

2. IQAC Coordinator1 :

3. IQAC Coordinator 2 :
 COURSE FILE
COURSE DESCRIPTION / COURSE INFORMATION SHEET

Name of the Dept: COMPUTER SCIENCE AND ENGINEERING

Course Title Design and Analysis of Algorithms

Course Code CS603PC Programme B.Tech

Regulation R18 Year/Semester III-II

Lectures Tutorials Practical Credits

Course Structure
3 1 0 4

Course Teacher K DEVADAS

Email devadas.iisc@gmail.com

Phone No 9700640067

No of Hours Allotted Lectures Tutorial Practical

per Week 5 1 3

I. COURSE OVERVIEW:
 1. Vision & Mission of the Institution

Imparting Knowledge and instilling skills to the aspiring students in

Vision the field of Engineering, Technology, Science and Management to face
the emerging challenges of the society.

Mission  Encouraging scholarly activities that transfer knowledge in the

areas of Engineering, Technology, Science and Management.

 Ensuring students of all levels, well trained to meet the needs of

education and their future endeavors. Inculcating human values
and ethics into the education system for the all-round
development of the students

2. Course Handout
a)Vision& Mission of the Department (CSE)
Vision Enhance learning that promotes techno graduates aiming
employability and entrepreneurship with human values to face the
challenges in the global technological society.
Mission MISSION 1: Empowering students for professional career and higher
studies by providing hands on experience and value education to
become successful technocrats in the society.

MISSION 2: Nurturing students with interpersonal and

entrepreneurial skills, so that they gain ability to work as a team.

MISSION 3: Imparting quality education, employability skills and

techno ethical values among the students for the benefit of the society.

b) Program 1. The students of the program will have strong foundation in the
Educational fundamental principles and gain advanced knowledge in the Basic
Objectives Sciences, Mathematics and other application of Advanced Computer
(PEOs) Engineering.
2.The students of the program will be prepared for their successful
careers in the software industry / seek higher studies and continue to
develop.
3.The students of the program will prepare to engage in professional
development through self-study, graduate and professional studies in
engineering & business.
4.Graduates shall have good communication skills, leadership skills,
professional, ethical and social responsibilities.
c) Program PO 1.Engineering knowledge: Apply the knowledge of mathematics,
Outcomes science, engineering fundamentals and an engineering specialization
& Program
 Specific to the solution of complex engineering problems.
Outcomes PO 2. Problem analysis: Identify, formulate, review research
(POs)& literature, and analyze complex engineering problems reaching
(PSOs)
substantiated conclusions using first principles of mathematics,
natural sciences, and engineering sciences.
PO 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.
PO 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.
PO 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.
PO 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.
PO 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.
PO 8.Ethics:Apply ethical principles and commit to professional ethics
and responsibilities and norms of the engineering practice.
PO 9. Individual and team work:Function effectively as an
individual, and as a member or leader in diverse teams, and in
multidisciplinary settings.
PO 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.
PO 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.
PO 12. Life-long learning:Recognize the need for, and have the
preparation and ability to engage in independent and life-long learning
in the broadest context of technological change.
 PSO 1: Acquire knowledge will be used to design and modify
principles in the development of software and hardware systems to
get a better quality product.
PSO 2: An ability to identify the state of professional development in
preparing for competitive examinations that offers successful career
and career building.
d)Pre-  Basics of Mathematics
Requisites
e) Course CO1:The student will be able toMake use of divide and conquer methods
Outcomes for developing algorithms.
(COs) CO2:Apply the concept of backtracking to solve the optimization
problems.
CO3:.Solve the optimization problems using dynamic programming
methodology.
CO4:.Solve the optimization problem by using Greedy method.reusable
code and learn dynamic memory allocation
CO5:Solve the optimization problem by using branch and bound method
and NP-Hard and NP- Completefor the given example problems.

f) Detailed UNIT - I
Syllabus Introduction: Algorithm, pseudo code for expressing algorithms,
Performance Analysis-Space complexity,Time complexity, Asymptotic
Notations- Big oh notation, Omega notation, Theta notation and Little
ohnotation.
Divide and conquer: General method, applications-Binary search, Quick
sort, Merge sort, Strassen’s matrixmultiplication.
UNIT - II
Disjoint Sets: Disjoint set operations, union and find algorithms, Graph
Traversals-Breadth first search anddepth first search.
Backtracking: General method, applications, n-queen’s problem, sum of
subsets problem, graph coloring.
UNIT - III
Dynamic Programming: General method, applications- Optimal binary
search trees, 0/1 knapsack problem, all
pairs shortest path problem, Traveling sales person problem, Reliability
design, Matrix chain multiplication.
UNIT - IV
Greedy method: General method, applications-Job sequencing with
deadlines, knapsack problem, Minimum
cost spanning trees, Single source shortest path problem.
UNIT - V
Branch and Bound: General method, applications - Travelling sales person
problem, 0/1 knapsack problem -
LC Branch and Bound solution, FIFO Branch and Bound solution.
NP-Hard and NP-Complete problems: Basic concepts, non-deterministic
algorithms, NP - Hard and NP-Complete classes, Cook’s theory.

Topics
Covered
Beyond
Syllabus
Text Books 1. Fundamentals of Computer Algorithms, Ellis Horowitz, SatrajSahni and
Raja sekharan, University Press.

Reference 1. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson
Books education.
2. Introduction to Algorithms, second edition, T. H. Cormen, C.E.
Leiserson, R. L. Rivest, and Stein, PHI Pvt.Ltd. / Pearson Education.
3. Algorithm Design: Foundations, Analysis and Internet Examples, M.T.
Goodrich and R. Tamassia, JohnWiley and sons.

Course Plan

S. No. Topic(s) No. of Lecture

Hours
UNIT-I- Introduction

1 Introduction: Algorithm Definition 1

2 Algorithm Specification 1
3 Performance Analysis 1
4 Time Complexity 1
5 Space Complexity 1
6 Randomized Algorithms 1

7 Asymptotic Notations 2

8 Divide and conquer 1

9 General Method 1

10 Applications- Binary Search 1

11 Merge Sort 1
12 Quick Sort 1
13 Strassen’s Matrix Multiplication 1

Total 14
UNIT-II- Backtracking
14 Disjoint sets Operations 2

15 Union and find algorithms 2

16 Graph Traversals- Breadth First Search 2

17 Depth First Search 1

18 Back Tracking 1

19 General Method 1

20 Applications 1

21 n-queen’s Problem 2
22 Sum of Subsets Problem 1
23 Graph Coloring. 2
Total 15
UNIT-III- Dynamic Programming
24 Dynamic Programming: General Method 1

25 Applications: Examples 1

26 Optimal Binary Search Trees 2

27 0/1 Knapsack problem 2
28 All Pairs Shortest Path Problem 2
29 Travelling Sales Person Problem 2
30 Reliability Design 2

31 Matrix Chain Multiplication 2

Total 14
UNIT-IV-Greedy Method
32 Greedy Method 1
33 Greedy Method: General Method 1
34 Applications: Examples 2
35 Job Sequencing with Deadlines 2
36 Knapsack Problem 2
37 Minimum Cost Spanning Trees 2
38 Allocating memory for arrays of different data types 1
Total 11
UNIT-V- Branch and bound
 39 Branch and bound: General Method 1

40 Applications 1

41 Travelling Sales Person Problem 1

42 0/1 Knapsack Problem 2
43 LC Branch and Bound Solution 2

44 FIFO Branch and Bound Solution 2

45 NP- Hard and BP-Complete Problems 1

46 Basic Concepts 1
47 Non-deterministic Algorithms 2
48 NP-Hard and NP-Complete Classes 2
49 Cook’s Theory 1
Total 16
GrandTotal 70

Evaluation Scheme
Theory
Evaluation Criteria Marks
Assignment I 05
Midterm-1 Objective paper 10
Descriptive Paper 10
Total 25
Assignment II 05
Midterm-2
Objective paper 10
Descriptive Paper 10
Total 25
Average of Midterm-1 and Midterm-2 25
End-Examination 75
Total 100
 Mapping of CO-PO&PSO
Course Objectives:

1. Introduces the notations for analysis of the performance of algorithms.

2. Introduces the data structure disjoint sets.
3. Describes major algorithmic techniques (divide-and-conquer, backtracking, dynamic
programming,greedy, branch and bound methods) and mention problems for which each
technique is appropriate.
4. Describes how to evaluate and compare different algorithms using worst-, average-, and
best-caseanalysis.
5. Explains the difference between tractable and intractable problems, and introduces the
problems thatare P, NP and NP complete.

Course Outcomes:

CO1:The student will be able toMake use of divide and conquer methods for developing
algorithms.

CO2:Apply the concept of backtracking to solve the optimization problems.

CO3:.Solve the optimization problems using dynamic programming methodology.

CO4:.Solve the optimization problem by using Greedy method.reusable code and learn
dynamic memory allocation

CO5:Solve the optimization problem by using branch and bound method and NP-Hard and
NP- Completefor the given example problems.

Program
Program Outcomes Specific
Course Outcomes
Outcomes
PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 3 3 3 2 1 1 3 3
CO2 3 3 3 3 2 1 1 3 3
CO3 3 3 3 3 2 1 1 3 3
CO4 3 3 3 3 2 1 1 3 3
CO5 3 3 3 3 2 1 1 3 3
Average 2.8 3 3 3 2 1 1 3 3

*To be rated with 1- slightly, 2 – moderately, 3- substantial

 Contribution of course to program outcomes& Program Specific outcomes
Type Course Code, PO1 PO PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO1 PO11 PO1 PSO1 PSO2
Title 2 0 2

Theor CS603PC: 2.8 3 3 3 2 1 1 3 3

y Design and
Analysis of
Algorithms
 Delivery Methodology
Course Delivery Methods/Modes:

1. Class room lectures :block board

2. Presentations :Yes
3. Laboratory sessions :Yes
4. Demos : Yes
5. Assignments :Yes
6. Case studies :Yes
7. Seminars :Yes
8. Projects : No
9. E-Learning Resources:Yes

Mapping between Course Delivery Methodology and

Program Outcomes
Course Delivery Methods/CO’S 1 2 3 4 5
Class room lecture 3 3 3 3 3
Presentations 1 1 1 1 1
Laboratory sessions 3 3 3 3 3
Demo or simulations - - - - -
Assignments 3 2 2 2 2
Case studies - - - - -
Projects - - - - -
Seminars - - - - -
E-Learning resources 1 1 1 1 1
Weight age 40% 37% 37% 37% 37%
*To be rated with 1- slightly, 2 – moderately, 3- substantial
 Assessment Methodology
Outcome Assessment Tool Activity aligned to the Outcome
CO1,CO2, Test Conducted mid exams and Unit tests
CO3,CO4,CO5
CO1,CO2, Assignment Given problems questions & to solve and
CO3,CO4,CO5 told to give presentations
CO1,CO2, Rubric Evaluated mid exam question paper.
CO3,CO4,CO5
CO1,CO2, E-Learning Followed youtube or NPTEL videos
CO3,CO4,CO5 Resources
CO1,CO2, End Semester Test We delivered the contents according to the
CO3,CO4,CO5 syllabus and given important questions
according to the unit wise
 Teaching diary for the course
At the end of the course, the students are able to achieve the following course learning outcomes

UNITS Course Topics to be Covered Text Book Method of Covered

Learning / Teaching - Date
Outcomes Reference PPT /
Book Blackboard
1 CO-1 Introduction: Algorithm TB Block board
Definition
1 CO-1 Algorithm Specification TB Block board
1 CO-1 Performance Analysis TB Block board
1 CO1 Time Complexity TB Block board
1 CO-1 Space Complexity TB Block board
1 CO-1 Randomized Algorithms TB Block board
1 CO-1 Asymptotic Notations TB Block board
1 CO-1 Divide and conquer TB & RB Block board
1 CO-1 General Method TB Block board
1 CO-1 Applications- Binary TB Block board
Search
1 CO-1 Merge Sort TB Block board
1 CO-1 Quick Sort TB Block board
1 CO-1 Strassen’sMatrix TB Block board
Multiplication
2 CO-2 Disjoint sets Operations TB Block board
2 CO-2 Union and find algorithms TB Block board
2 CO-2 Graph Traversals- Breadth TB Block board
First Search
2 CO-2 Depth First Search TB Block board
2 CO-2 Back Tracking TB Block board
2 CO-2 General Method TB & RB Block board
2 CO-2 Applications TB Block board
2 CO-2 n-queen’s Problem TB Block board
2 CO-2 Sum of Subsets Problem TB Block board
2 CO-2 Graph Coloring. TB Block board
3 CO-3 Dynamic Programming: TB Block board
General Method
3 CO-3 Applications: Examples TB Block board
3 CO-3 Optimal Binary Search TB Block board
Trees
3 CO-3 0/1 Knapsack problem TB Block board
4 CO-4 All Pairs Shortest Path TB Block board
Problem
4 CO-4 Travelling Sales Person TB Block board
Problem
4 CO-4 Reliability Design TB Block board
4 CO-4 Matrix Chain TB Block board
Multiplication
4 CO-4 Greedy Method: General TB Block board
Method
4 CO-4 Applications: Examples TB Block board
4 CO-4 Job Sequencing with TB Block board
Deadlines
4 CO-4 Knapsack Problem TB Block board

4 CO-4 Minimum Cost Spanning TB & RB Block board

Trees
4 CO-4 Single Source Shortest Path TB Block board
Problem

5 CO-5 Branch and bound: General TB Block board

Method
5 CO-5 Applications TB Block board
5 CO-5 Travelling Sales Person TB Block board
Problem
5 CO-5 0/1 Knapsack Problem TB Block board

5 CO-5 LC Branch and Bound TB Block board

Solution
5 CO-5 FIFO Branch and Bound TB Block board
Solution
5 CO-5 NP- Hard and BP-Complete TB Block board
Problems
5 CO-5 Basic Concepts TB Block board
5 CO-5 Non-deterministic TB Block board
Algorithms
5 CO-5 NP-Hard and NP-Complete TB Block board
Classes
5 CO-5 Cook’s Theory TB Block board
 Question Bank prepared by faculty (unit wise)

UNIT – I
SECTION – A

(Short Answer Questions for 1 marks)

S.N Question BL CO
O
1. Define an algorithm and provide an example of a real-life 4 CO1
application.
2. What is the purpose of pseudocode, and how does it help in 2 CO1
expressing algorithms?
3. Explain the concept of space complexity and its importance in 4 CO1
algorithm analysis.
4. Differentiate between Big O notation, Omega notation, and Theta 2 CO1
notation in asymptotic analysis.
5. How does the divide and conquer method work in solving 1 CO1
problems? Provide a brief explanation.
6. Name an application where the binary search algorithm is used, 1 CO1
and explain its efficiency compared to linear search.
7. What is the main advantage of using Quick Sort over other 1 CO1
sorting algorithms?
8. Describe the basic steps involved in Merge Sort and why it is 1 CO1
considered a stable sorting algorithm.
9. How does Strassen's Matrix Multiplication algorithm improve the 1 CO1
efficiency of matrix multiplication?
10. In terms of time complexity, what is the relationship between 2 CO1
Little oh notation and Big O notation?

SECTION – B
(Essay Questions for 10 Marks)
S.NO Question BL CO
1. Compare and contrast the merge sort and quick sort algorithms 2 1

2. Explain why binary search is more efficient than linear search 2 1

for large sorted datasets
3. Recall the steps involved in the divide and conquer paradigm 1 1
and discuss its advantages in problem-solving.
4. List the four asymptotic notations (Big O, Omega, Theta, Little 1 1
oh), and define each notation in detail.
5. Implement the merge sort algorithm in a programming language 3 1
of your choice and demonstrate its sorting functionality with
sample input.
 6. Develop a recursive function to calculate the factorial of a 3 1
positive integer and analyze its time and space complexity.
7. Apply Strassen's Matrix Multiplication method to multiply two 3 1
2x2 matrices, providing step-by-step calculations and analyzing
its efficiency compared to the traditional method.
8. Evaluate the performance of binary search and linear search 4 1
algorithms in terms of time complexity for large datasets.
9. Assess the efficiency of merge sort when sorting an array with 4 1
both random and partially sorted elements, and discuss the
impact of input data on the algorithm's performance.
10. Compare the performance of Strassen's Matrix Multiplication 4 1
and the traditional matrix multiplication for large matrices and
identify scenarios where one method is superior to the other.

UNIT - II
SECTION – A
(Short Answer Questions for 1 marks)

S.N Question BL CO
O
1. 2 2
What are disjoint set operations?
2. 1 2
How is the union operation performed?
3. 1 2
Define Breadth First Search (BFS).
4. 1 2
What is the time complexity of BFS?
5. 3 2
Describe the general method of backtracking.
6. 1 2
Give an example of an application of backtracking.
7. 2 2
Explain the sum of subsets problem.
8. 1 2
What is the graph coloring problem?
9. 2 2
Discuss the concept of chromatic number.
10. 2 2
Explain the greedy algorithm for graph coloring.

SECTION – B
(Essay Questions for 10 Marks)
S.NO Question BL CO
11. Recall the union and find operations in disjoint sets and their 1 2
time complexities.

12. List the steps involved in Breadth First Search (BFS) and Depth 1 2
First Search (DFS) algorithms.

13. Define the graph coloring problem and the chromatic number of 1 2
a graph.

14. Compare the efficiency of union-by-rank and path compression 2 2

heuristics in disjoint set data structures.

15. Explain how BFS and DFS algorithms traverse a graph 2 2

differently, with a focus on their applications.

16. Discuss the concept of backtracking and its application in 2 2

solvingproblems with a large solution space.

17. Design and implement the union and find algorithms for disjoint 3 2
sets using path compression and union

18. Develop a BFS based algorithm to find the shortest path in an 3 2

unweighted graph, and analyze its time complexity.

19. Create a backtracking solution to solve the n 3 2

20. Analyze the time complexity of BFS and DFS for different types 4 2
of graphs, and determine their advantages and limitations.

UNIT - III
SECTION – A
(Short Answer Questions for 1 marks)

S.N Question BL CO
O
1. 1 3
What
tree? is the main goal of constructing an optimal binary search
2. 4 3
How
binarydoes dynamic
search programming help in solving the optimal
tree problem?
 3. 2 3
Define the 0/1 knapsack problem and its constraints.
4. How does dynamic programming ensure an optimal solution to 2 3
the knapsack problem?
5. What is the purpose of solving the all pairs shortest path 2 3
problem?
6. Explain the role of dynamic programming in finding shortest 2 3
paths between all pairs of vertices.
7. What is the significance of the traveling salesperson problem in 2 3
real-world applications?
8. How does dynamic programming approach the TSP to find the 3 3
optimal solution?
9. How is dynamic programming used to optimize the reliability of 2 3
a system?
10. What are the benefits of applying dynamic programming in 2 3
reliability design?

SECTION – B
(Essay Questions for 10 Marks)

S.NO Question BL CO
1. Analyze the dynamic programming approach to constructing an 4 3
optimal binary search tree, focusing on its time complexity.
2. Create a step-by-step algorithm to build an optimal binary search 6 3
tree from a given set of keys and their access probabilities.
3. Evaluate the impact of different item weights and values on the 5 3
time complexity of the 0/1 knapsack problem solved using
dynamic programming.
4. Design a dynamic programming solution to the knapsack 6 3
problem with an additional constraint and discuss its trade-offs.
5. Compare and contrast the Floyd-Warshall algorithm and the 4 3
dynamic programming approach for solving the all pairs shortest
path problem.
6. Develop a dynamic programming algorithm for finding the 6 3
shortest paths between all pairs of vertices in a directed acyclic
graph.
7. Assess the effectiveness of dynamic programming in finding the 4 3
optimal solution to the TSP for a large number of cities.
8. Apply dynamic programming to solve the TSP with a specified 4 3
distance matrix and analyze the complexity of the solution.
9. Critique the dynamic programming approach to optimize the 5 3
reliability of a complex system, discussing its assumptions and
limitations.
S.NO Question BL CO
1. Analyze the dynamic programming approach to constructing an 4 3
optimal binary search tree, focusing on its time complexity.
2. Create a step-by-step algorithm to build an optimal binary search 6 3
tree from a given set of keys and their access probabilities.
3. Evaluate the impact of different item weights and values on the 5 3
time complexity of the 0/1 knapsack problem solved using
dynamic programming.
4. Design a dynamic programming solution to the knapsack 6 3
problem with an additional constraint and discuss its trade-offs.
5. Compare and contrast the Floyd-Warshall algorithm and the 4 3
dynamic programming approach for solving the all pairs shortest
path problem.
10. Propose a modification to the reliability design dynamic 6 3
programming algorithm to accommodate varying component
failure probabilities.

UNIT - IV

SECTION – A
(Short Answer Questions for 1 marks)
S.NO Question BL CO
1. 1 4
Explain the basic principle of the greedy method.
2. What makes the greedy method a heuristic approach? 1 4

3. 1 4
Define the job sequencing problem with deadlines.
4. How does the greedy method find the optimal job sequence? 1 4

5. Describe the 0/1 knapsack problem and its constraints. 1 4

6. How does the greedy method approach the knapsack problem? 1 4

7. What is the objective of finding minimum cost spanning trees? 1 4

8. Discuss the advantages and limitations of the greedy approach. 2 4

9. Define the single source shortest path problem. 1 4

10. How does the greedy method work in finding the shortest path? 1 4

SECTION – B
(Essay Questions for 10 Marks)
S.NO Question BL CO
1. Recall the definition of the greedy method and its fundamental 1 4
principle.
 2. List the characteristics of the job sequencing problem with 1 4
deadlines.
3. Define the 0/1 knapsack problem and its constraints. 1 4

4. Explain the objectives and constraints of the job sequencing 2 4

problem with deadlines.
5. Discuss the role of the greedy method in finding an optimal 2 4
solution to the fractional knapsack problem.
6. Describe the minimum cost spanning trees problem and its 2 4
significance in graph theory.
7. Design a greedy algorithm to solve the job sequencing problem 3 4
with deadlines and demonstrate its application with sample data.
8. Develop a greedy approach to finding the Minimum Cost 3 4
Spanning Tree for a given graph and analyze its time
complexity.
9. Implement the Dijkstra's algorithm using the greedy method to 3 4
find the Single Source Shortest Path in a weighted graph.
10. Analyze the time complexity of the greedy algorithm for job 4 4
sequencing with deadlines in the best and worst-case scenarios.

SECTION – A
(Short Answer Questions for 1 marks)
Unit – 5

Q.No. Question BL CO
Easy
1 What is the main idea behind the branch and bound method? 1 CO5
2 How does the branch and bound approach handle optimization 4 CO5
problems?
3 Define the Travelling Salesperson Problem (TSP). 1 CO5
4 How does the branch and bound method solve the TSP 4 CO5
optimally?
5 Describe the 0/1 knapsack problem and its constraints. 1 CO5
Moderate
1 Explain the use of branch and bound in solving the knapsack 2 CO5
problem.
2 What does "LC" stand for in LC Branch and Bound? 1 CO5
3 How does LC Branch and Bound differ from the standard 4 CO5
method?
4 Define FIFO Branch and Bound. 1 CO5
5 Compare and contrast FIFO Branch and Bound with LC Branch L4 CO5
and Bound.
SECTION – B
 (Essay Questions for 10 Marks)
Unit – 5
Q.No. Question BL CO
Easy
1 Analyze the branch and bound approach's key features 4 CO5
and its effectiveness in solving optimization problems.
2 Compare the branch and bound method with other optimization 4 CO5
techniques, such as dynamic programming.
3 Develop a step-by-step branch and bound algorithm to find the 6 CO5
optimal solution for the TSP.
4 Evaluate the efficiency of the branch and bound approach for the 5 CO5
TSP in terms of time complexity and accuracy.
Moderate CO5
1 Design a branch and bound algorithm to solve the 0/1 knapsack 6 CO5
problem, considering different constraints.
2 Analyze the impact of varying item weights and values on the 4 CO5
performance of the branch and bound method for the knapsack
problem.
3 Explain the concept of "LC" in LC Branch and Bound 1 CO5
and how it improves the algorithm's performance.
Standard CO5
1 Develop a branch and bound solution using LC technique to 6 CO5
find the optimal solution for a given problem.
2 Assess the advantages and limitations of using LC Branch and 4 CO5
Bound in comparison to the standard method.
3 Create a step-by-step algorithm for FIFO Branch and Bound 6 CO5
and illustrate its implementation on a specific problem.

Descriptive question bank for assignment

UNIT I :Introduction
1. What is meant by time complexity? Define different time complexit notations? Define
example for one of each?
2. Explain how algorithms performance is analyzed ? Describe asymptotic notation
3. Explain the different looping statements used in pseudo code conventions
4. What is meant by recursion? Explain with example, the direct and indirect recursive
algorithms.
5. Write about the two methods to calculate time complexity with examples

UNIT II:Backtracking
 1. Develop the algorithms for the following
i). UNION
ii) FIND
iii) WEIGHTED UNION.
2. Explain general Backtracking method
3. Explain Knapsack Problem using Backtracking
4. Explain sum of Subsets problem and give the algorithm to find the same
5. Define Chromatic number & Give the state space tree for 4 – Coloring problem.

UNIT III: Dynamic Programming

1. Explain 0/1 knapsack problem
2. Explain Travelling salesman problem
3. Give the statement of Reliability design problem and explain with suitable
example
4. Describe the Dynamic 0/1 Knapsack Problem. Find an optimal solution for the
dynamic programming 0/1 knapsack instance for n=3, m=6, profits are (p1,
p2, p3 ) = (1,2,5), weights are (w1,w2,w3)=(2,3,4).
5. Explain applications of dynamic programming.

UNIT IV :Greedy Method

1. Give the control abstraction for greedy method.

2. Explain, how to find the minimum cost spanning tree by using Prim’s Algorithm.
3. Explain about spanning tree and write Kruskal’s algorithm and explain it with
following graph?
4. Define job sequencing with deadlines problem?
5. Describe greedy general method and its applications.

UNIT V :Branch and bound

1. Write short notes on

i) Classes of NP-hard
ii) Classes of NP-complete
2. Compare NP-hard and NP-completeness?
3. Distinguish between deterministic and non-deterministic algorithms
4. Explain the satisfiability problem?
5. Explain travelling sales person person problem LCBB procedure with the following
instance and draw the portion of the state space tree and find an optimal tour
NAME & SIGN OF THE SUBJECT FACULTY
 MID QUESTION PAPERS
TEEGALA KRISHNA REDDY ENGINEERING COLLEGE
(UGC-Autonomous)
B.Tech V Semester MID-I Examinations, December 2023
Name of the subject:DAA Date: 06.12.2023

Time: 01:30min. Max. Marks: 20

All questions carry equal marks

Q. Questions Marks Bloom’s CO

Levels Map
No
Q.1 What is asymptotic notations? Explain big-oh, omega, and 5 L-I 1
theta notations with examples.

Q.2 Explain n-queens problem with the example of 4x4 chess 5 L-III 2
board.

2.5

Q.3 Solve the given example using Quick Sort. 5 L-II 1

10 16 8 12 15 6 3 9 5

Q.4 What are disjoint sets and explain the operations with 5 L-II 2
examples?

END OF THE QUESTION PAPER

 TEEGALA KRISHNA REDDY ENGINEERING COLLEGE
(UGC-Autonomous)
B.Tech V Semester MID-I Examinations, December 2023
Name of the subject: DAA Date:06.12.2023
Time: 01:30min. Max. Marks: 20

All questions carry equal marks

Q. Questions Marks Bloom’s CO

Levels Map
No
Q.1 What is graph traversals? Explain BFS and DFS with 5 L-I 2
examples.

Q.2 Solve the given array using Merge sort. 5 L-III 1

12 31 25 8 32 17 40 42

Q.3 Explain Strassen’s matrix multiplication. Solve the recurrence 5 L-II 1

relation of time complexity to O(n 2.87).

Q.4 Explain sum of subsets with example using backtracking 5 L-II 2

method?

END OF THE QUESTION PAPER

Questions
Q. BT
MCQ’S (1 – 10) CO
No Level
Fill in the blanks (11 – 20 )
The name backtrack was first coined by [ ]
1.
A. D.H Lehmar
B. J.D. Ullman 3 I
C. K.Thompson
D. R.E. Bellman
If M=15, n=4, =(10,10,12,18) and =(2,4,6,9) of 0/1 knapsack problem then the
maximum profit is [ ]
2. A. 32
3 IV
B. 34
C. 36
D. 38
 In branch-and-bound method, for nodes representing infeasible solutions, C(x) = [ ]
3.
A. Infinite
B. 0 5 IV
C. 1
D. 2

__________ Functions find a live node with least cost function in LC search [ ]
A. minimum()
4.
B. Maximum() 5 I
C. Least()
D. Search()

To identify articulation points in a graph _________ is useful. [ ]

5.
A. Game tree
B. in order traversal 3 I
C. dfs
D. none
We start at a particular node in the graph, visiting all nodes exactly once and come
back to initial node with minimum cost is known as [ ]
6.

A. 0/1 knapsack problem

B. Optimal storage on tapes 4 IV
C. Minimum cost spanning tree
D. Travelling sales person problem
For infinite state space trees with no answer nodes [ ]
7.
A. LC search will terminate
B. LC search will not terminate 5 I
C. LC search can not be conducted
D. Termination of LC search depends on cost function
The FIFO search coupled with bounding functions is called as [ ]
8.
A. FIFOBB
B. Least count search 5 IV
C. Cumulative reduction function
D. Column reduction
NP complete stands for [ ]
A. Natural polynomial time complete
9.

B. Non polynomial time complete

5 I
C. N-power time complete
D. Non deterministic polynomial time complete

Only _________ can be NP complete [ ]

A. Linear problems
10.
B. Non linear problems 5 I
C. Decision problems
D. Hard problems
11.

Tractability means ____________.

4 I

12.
____________ is the set of decision problems that can be solved by a deterministic
machine in a polynomial time. 4 III

13.
____________ process in one whose behavior is non deterministic i.e, the next state of
the environment is not fully determined by the previous state of the environment. 3 I

14.

In FIFOBB square node indicates ___________.

5 IV
15.

The LC branch and bound search of a tree will begin with upper _________.
5 I
16.

An optimal solution is a feasible solution with _______.

3 I
17.
In branch and bound method the three common search strategies are
____________,__________________ and ____________. 5 IV
18.

In FIFOBB initially the queue of live nodes is __________..

5 I
19.

A problem is intractable if all algorithms to solve that problem are of atleast __________.
3 I
20.

In __________ algorithms, the result of every operation is uniquely defined.

4 I
OLD End Exam Question papers
Code No: RT32054
III B. Tech II Semester Supplementary Examinations, November/December - 2016
DESIGN AND ANALYSIS OF ALGORITHMS
(Common to CSE and IT)
Time: 3 hours Max. Marks: 70
Note: 1. Question Paper consists of two parts (Part-A and Part-B)
2. Answering the question in Part-A is compulsory
3. Answer any THREE Questions from Part-B
*****
PART –A
1 a) What are the characteristics of an algorithm? [3M]
b) Define Divide & Conquer Strategy. [3M]
c) Explain about single source shortest path problem. [4M]
d) Differentiate between greedy method and dynamic programming. [4M]
e) Define graph coloring [4M]
f) Explain about Branch and Bound method. [4M]

PART –B
2 a) Compare time complexity with space complexity? [8M]
b) Write the pseudo code for expressing algorithms.[8M]
3 a) Write and explain recursive binary search algorithm. [8M]
b) Derive the time complexity of merge sort. [8M]
4 a) Write with an example of Prim’s algorithm. [8M]
b) Write a greedy algorithm for sequencing unit time jobs with dead lines and profits. 8M]
5 a) Explain Optimal Binary Search tree. [8M]
b) Solve the following instance of 0/1 Knapsack problem using Dynamicprogramming
n = 3; (W1, W2, W3) = (3, 5, 7); (P1, P2, P3) = (3, 7, 12); M = 4.[8M]
6 a) Discuss Sum of subset problem. [8M]
b) Discuss about n-queen problem.[8M]
 7 a) Explain FIFO Branch and Bound solution. [8M]
b) Explain 0/1 Knapsack problem with respect to branch and bound method. [8M]
*****

Analysis of student performance in the coursePerformance Index (Theory)

III B Tech I SEMESTER STUDENTS LIST FOR ACY 2020-21

EXTERNAL GRADE
MARKS
S.No H.T No Name of the Student MID1 MID2 AVG
16R91A0548 R SHESHADRI 14 -1 Ab
1 14 14
16R91A0570 A SURYA 14 15 F
2 14 14
16R91A0597 M ARUN 17 14 F
3 19 15
176H1A0505 G.SWEETY 16 10 F
4 17 14
17R91A0512 G SAIVIKAS 15 8 F
5 16 14
17R91A0517 KANDI ROHIT REDDY 14 35 B
6 14 14
KOTLA SHASHANK
17R91A0521
CHANDRA 20 14 17 36 B
7
17R91A0528 MITTA RAKESH REDDY 14 39 B
8 14 14
17R91A0531 M MANOJ 14 26 C
9 14 14
17R91A0551 AJJAM JAGADISH 14 26 C
10 14 14
17R91A0572 M RAJASHEKHAR 14 30 C
11 14 14
17R91A05A8 D AKASH DEEP 17 26 C
12 15 18
17R91A05B1 D ROHITH 14 33 C
13 14 14
17R91A05C5 M GOWTHAM GANESH 16 11 F
14 17 14
17R91A05E0 S MELWIN SIMON 18 11 F
15 21 14
KAPA HITESH KUMAR
17R91A05G9
REDDY 17 14 16 32 C
16
17UR1A0504 B.SAI VASIHNAVI 18 -1 Ab
17 20 15
 INAVOLA REISHEKESH
18C21A0514 REDDY 19 17 18 26 C
18
18C21A0531 MOGILIPALEM SHIVA 16 26 C
19 18 14
PULIGILLA RAM MOHAN
18C21A0537 MEHER PRADEEP 17 20 19 26 C
20
18C21A0543 VADE SUSHMITHA 22 26 C
21 21 22
18C21A0545 VELAKURTHY PRADEEP 14 46 B+
22 5 22
18C21A0551 DHANRAJ J S 17 27 C
23 17 17
18C21A0557 MANASA DESHPANDE 21 0 F
24 22 19
18R91A0501 AGURLA RAKESH 19 20 26 C
25 21
18R91A0502 AMGOTH SWARNAJEETH 17 16 35 B
26 14
18R91A0504 BAJINENI NAVEEN 14 17 26 C
27 20
18R91A0505 BODA PAVAN 22 22 26 C
28 22
18R91A0506 BOLLU SRISAILAM 21 21 16 F
29 20
18R91A0507 BONTHALA MAHESH 19 20 16 F
30 21
18R91A0508 CHINTHA SRIJA 19 21 26 C
31 22
18R91A0509 D RAJATH 23 23 1 F
32 22
18R91A0510 DHARMAPURI VAISHNAVI 23 24 26 C
33 24
18R91A0512 G.SUSHMITHA 22 20 26 C
34 18
18R91A0513 GADDAM MANISHA 22 23 26 C
35 23
GANGAPURAM DINESH
17
18R91A0514 GOUD 14 16 27 C
36
18R91A0515 GURRAM RAKESH 19 19 26 C
37 18
18R91A0516 GUTTULA SAI SUHAS 14 15 26 C
38 16
18R91A0517 JELLA PRASANNA 21 21 28 B
39 21
18R91A0519 K SHIVA SAI REDDY 20 18 28 C
40 16
18R91A0520 K V VINAY RAJ 20 19 14 F
41 17
18R91A0521 KANDE SINDHU 21 22 26 C
42 23
43 18R91A0522 KANDULA RAJU 20 20 20 11 F
 18R91A0524 KOTTE SUDHEER 19 20 1 F
44 21
18R91A0526 M MANISH 22 19 12 F
45 15
18R91A0527 MADAMANCHI HARIKA 23 24 26 C
46 24
18R91A0528 MAGGIDI REVANTH REDDY 19 20 26 C
47 21
18R91A0529 MILIN MANKER 21 22 40 B
48 22
18R91A0530 MOHAMMED RESHMA 19 19 27 C
49 19
MOHAMMED SOHAIL
22
18R91A0531 AHMED 14 18 27 C
50
18R91A0532 MOHAMMED TALHA UMAIR 22 18 26 C
51 14
18R91A0533 MURARISHETTY SUPRIYA 22 21 28 C
52 20
18R91A0534 NADIGATLA RAKESH 19 19 0 F
53 19
NALAJALA VENKAT
18
18R91A0535 RAMANA 19 19 32 C
54
NARAHARI MANIDEEP
19
18R91A0536 REDDY 14 17 26 C
55
18R91A0537 NARALACHETTY NAVITHA 23 23 26 C
56 23
18R91A0538 NARRA SANJAY 19 17 14 F
57 14
18R91A0539 NIKIL SAUD 21 21 42 B+
58 20
18R91A0540 NOMULA DEVENDHAR 14 17 28 C
59 19
18R91A0541 NUTAKKI GOPALA KRISHNA 16 15 26 C
60 14
PASPUNOOR NAVEEN
20
18R91A0542 KUMAR 14 17 26 C
61
PRANITHA REDDY
20
18R91A0543 CHIMMULA 22 21 9 F
62
18R91A0544 R PAVAN KUMAR 19 22 12 F
63 24
18R91A0545 RAGULA CHAKRADHAR 17 19 13 F
64 21
18R91A0546 RATHOD VENKATESH 14 14 13 F
65 14
18R91A0548 SIDDALA DHAN RAJ 20 14 17 41 B+
66
 18R91A0549 T YASHWANTH RAJ 20 17 19 30 B
67
18R91A0550 THATIKONDA RAJESH 15 14 15 15 F
68
TIRUMALAPUDI VAMSHI 14
18
18R91A0551 KRISHNA 16 5 F
69
18R91A0552 VANAM BHARGAVI 20 22 21 14 F
70
18R91A0553 VANGALA VAISHNAVI 20 21 21 26 C
71
VUMMADI RUTHVIKA 23
20
18R91A0554 REDDY 22 9 F
72
18R91A0555 Y SUMANA 15 17 16 29 C
73
18R91A0556 YANNAM KALYAN 19 15 17 8 F
74
18R91A0557 YERUVA JOSEPH REDDY 19 20 20 26 C
75
19R95A0501 BHUKYA PRAVEEN 18 18 18 26 C
76
19R95A0502 EEROLLA UDAY KUMAR 14 14 14 45 B+
77
19R95A0503 ITHANABOINA SAI TEJA 14 14 14 32 B
78
19R95A0504 KANDUKURI SHIVASAI 19 21 20 27 C
79
19R95A0505 P RAHUL 17 14 16 39 B
80
19R95A0506 PENTA PAVAN 19 14 17 27 C
81
19R95A0507 THAMMISHETTI VARUN 17 20 19 37 B
82
18R91A0558 A HARSHA VARDHAN 19 22 21 36 B
83
18R91A0560 ARUKALA SOWMYA 23 24 24 35 B
84
18R91A0562 BAKKASHETTI SRINIVAS 19 21 20 35 B
85
18R91A0563 BANDA PRAVEEN 17 20 19 34 B
86
18R91A0566 BATTULA VISHANTH REDDY 17 20 19 28 B
87
18R91A0567 BHAVANA PURI 22 24 23 13 F
88
18R91A0569 BIRKURWAR THARUN TEJA 20 19 20 38 B
89
18R91A0571 BOLLOJU ANUSHA 22 24 23 14 F
90
18R91A0572 BUNETI PRAVEEN KUMAR 20 21 21 41 B
91
 CHALLA DATHA VENKATA
19
18R91A0573 NAGA SAI KIRAN 21 20 42 B+
92
18R91A0574 CHINTA NIKHIL VARMA 20 21 21 49 A
93
18R91A0577 EEKE ANKITHA 20 24 22 28 C
94
18R91A0578 ERRABELLY ARCHANA 22 24 23 46 B+
95
18R91A0579 GADAM SOWUMYA 22 23 23 32 B
96
18R91A0580 GADDAMANUGU SAHITHI 23 24 24 8 F
97
18R91A0581 GAJJELA ABHISHEK REDDY 18 14 16 53 A
98
18R91A0582 GANDAM PRAVEEN 20 18 19 55 A
99
18R91A0583 GAURAGALA PRASHANTHI 18 24 21 45 B+
100
18R91A0584 GAVVA PRASHANTH 14 14 14 34 B
101
18R91A0585 GOPISHETTY SATHWIKA 22 23 23 41 B+
102
18R91A0586 GORANTHALA PALLAVI 21 21 21 40 B+
103
18R91A0589 KATTA SAI KIRAN REDDY 20 17 19 55 A+
104
KESAVA ROHIT
18
18R91A0590 GIRIVARDHAN REDDY 14 16 -1 Ab
105
18R91A0591 KORRA JEEVAN 16 20 27 C
106 18
18R91A0592 KOSHIREDDY INDU 21 21 33 B
107 21
18R91A0593 MAHANKALI SRI LALITHA 22 24 55 A+
108 23
18R91A0595 MD NAWAZ 19 14 38 B+
109 16
MUTHYAPOTHULA BHAVYA
22
18R91A0596 SRI 19 48 A
110 21
18R91A0597 N.SOUMITHA 23 24 50 A
111 24
18R91A0598 PULLABOINA SNEHA 21 23 36 B
112 22
18R91A05A0 RAMIDI SUMANTH REDDY 14 19 46 B+
113 16
18R91A05A1 RANABOTHU SIRI 19 23 46 B+
114 21
18R91A05A2 RANABOTHU SREYA 22 24 46 B+
115 23
18R91A05A3 RESU SAI CHAND GOUD 17 14 43 B+
116 16
117 18R91A05A5 SAMA ABHIGNYA REDDY 19 14 16 43 B+
 SATHYAM LAXMI VENKATA 16
19
18R91A05A6 PRASAD 51 A
118 18
18R91A05A7 SURVI HRITHIK GOUD 15 19 31 B
119 17
SYED SIDDIQUE AHMED 18
16
18R91A05A8 RAZVI 41 B
120 17
THUMMALA KEERTHESH 16
15
18R91A05A9 REDDY 26 C
121 16
18R91A05B0 UPPULETI RAKESH 17 18 -1 Ab
122 18
18R91A05B1 VAMJA POOJA 18 24 9 F
123 21
18R91A05B2 VUNDI VEDAVYAS 22 20 6 F
124 21
YELGANAMONI VAMSHI 23
20
18R91A05B4 KRISHNA 47 A
125 22
19R95A0508 ASAM DINESH 14 14 32 B
126 14
19R95A0509 B RAJASHEKAR 14 14 26 C
127 14
19R95A0510 K MOHAN 19 23 26 C
128 21
19R95A0511 KOTHALA NAVEEN KUMAR 18 26 C
129 16 19
KUMMARI PRAVEEN 14
19R95A0512 KUMAR 5 F
130 14 14
19R95A0514 SWATHI THANGELLA 20 20 15 F
131 20
17R91A0592 S PAVAN KALYAN 15 15 26 C
132 15
17R91A05G7 JADA VIKRAM 14 14 26 C
133 14
18R91A05B5 AILENI SATHVIK REDDY 22 0 F
134 21 23
ALLURI BANGLA BHARATH 16
18R91A05B6 REDDY 26 C
135 14 19
18R91A05B7 ANUMULA LAVANYA 21 29 C
136 21 21
18R91A05B8 ANUMULA PRANAY KUMAR 22 5 F
137 21 23
18R91A05B9 AYUSH JOSHIYA 22 26 C
138 21 22
18R91A05C0 BATTHULA PAVITHRA 12 8 F
139 0 23
 18R91A05C3 C RISHIKA 21 23 22 26 C
140
18R91A05C4 CHERIPALLY PRANATHI 21 22 22 8 F
141
18R91A05C5 CHERUPALLI SRI LAKSHMI 21 22 22 26 C
142
18R91A05C6 DODLA NAVADEEP REDDY 22 22 22 15 F
143
18R91A05C7 GANGA SHIRISHA 21 14 18 17 F
144
18R91A05C8 GUNDA BHARGAVI 23 24 24 26 C
145
18R91A05C9 GUNDU SOUMYA 21 22 22 12 F
146
18R91A05D0 ISTA SATYA JANAKI 21 23 22 8 F
147
18R91A05D1 JUJJURI SHANMUKH GOUD 21 21 21 17 F
148
18R91A05D3 KANUKURTHI DEEPIKA 24 25 25 26 C
149
KETANPALLY GOWTHAM 20
21
18R91A05D6 REDDY 21 -1 Ab
150
18R91A05D7 KONAMGERI KARTHIK 22 14 18 8 F
151
18R91A05D8 LOKESH KONDA 17 22 20 14 F
152
18R91A05D9 MADHUSMITA PATRA 23 22 23 -1 Ab
153
18R91A05E0 MALIGIREDDY RAMYA SREE 23 22 23 15 F
154
MOHAMMED SHARIQ 23
21
18R91A05E2 SAADUDDIN AHMED 22 14 F
155
18R91A05E3 MUSTI MANISHA 21 23 22 10 F
156
18R91A05E4 NADIKUDE HARSHINI GOUD 21 20 21 8 F
157
18R91A05E5 NARENDER REDDY VALLAM 21 21 21 35 B
158
18R91A05E6 NENAVATH PARAMESH 21 22 22 36 B
159
18R91A05E7 P MEENAKSHI 23 24 24 39 B
160
18R91A05E8 P MINAKSHI 22 22 22 26 C
161
PARIGI JAGAN MOHAN 22
22
18R91A05F0 REDDY 22 26 C
162
18R91A05F1 PASAM BHARGAVA SAI 21 17 19 30 C
163
18R91A05F2 PASULA SAI KALPANA 14 23 19 26 C
164
165 18R91A05F3 PASULA VISHAL REDDY 23 16 20 33 C
 18R91A05F4 PEDDI VENKATARAMANA 13 24 19 11 F
166
18R91A05F5 PINDI PALLAVI 21 25 23 11 F
167
18R91A05F6 R SHIVANANDINI 23 20 22 32 C
168
18R91A05F7 RAMYA PODICHETI 22 17 20 -1 Ab
169
18R91A05F8 SAMREEN SULTANA 21 21 21 26 C
170
18R91A05F9 SANGYAM NANDANA 23 25 24 26 C
171
18R91A05G1 SUDAGANI SUJITH KUMAR 23 25 24 26 C
172
18R91A05G3 SURA SRIKANTH 22 24 23 26 C
173
18R91A05G4 THOTAPALLY SANTHOSH 21 24 23 46 B+
174
18R91A05G5 UPPU RAJASHEKAR 22 25 24 27 C
175
18R91A05G6 USHAKOLA SAITEJA 22 23 23 0 F
176
18R91A05G7 V SHIV TEJ REDDY 21 25 23 26 C
177
18R91A05G8 VAISHAVA SUNDARI 24 20 22 35 B
178
VANGOORI PRADEEP 16
21
18R91A05G9 KUMAR 19 26 C
179
18R91A05H0 VEGYARAPU PRANAVI 21 25 23 26 C
180
18R91A05H2 ZEESHAN TABASSUM 22 25 24 16 F
181
19R95A0515 B GAYATHRI 18 20 16 F
182 22
19R95A0516 KANUGULA ROHITH 21 22 26 C
183 22
19R95A0517 MAAKAM ROSHINI 21 21 1 F
184 21
19R95A0518 PADERA RAHULL 21 21 26 C
185 20
19R95A0519 RAYINENI RANJITHKUMAR 20 21 26 C
186 21
VALLABHAPURAPU NAGASAI 18
19R95A0521 JAIRAM 20 26 C
187 22
18R91A05H3 AMBATI SRINIVAS GOUD 21 22 27 C
188 22
18R91A05H5 ANDOJU NAVEEN KUMAR 23 23 26 C
189 22
18R91A05H7 BEKKAM SOUSIL KUMAR 25 25 26 C
190 24
 18R91A05H8 BHAVANTHI SAI KUMAR 22 24 23 28 B
191
18R91A05J1 BOPPA ABHINAV 23 25 24 28 C
192
18R91A05J2 CHATURI SHAH KUMAR 19 20 14 F
193 21
18R91A05J3 CHAVA SATISH KUMAR 20 17 26 C
194 14
18R91A05J6 G AKSHITHA 23 21 11 F
195 18
18R91A05J7 G SREENATH 22 23 1 F
196 23
18R91A05J8 GADAM SRIKANTH 20 19 12 F
197 18
18R91A05J9 GANTAJI NEERAJ 22 20 26 C
198 17
18R91A05K0 GARIMILLA BHARATH 22 20 26 C
199 17
18R91A05K1 GHALOT ROHIT KUMAR 18 18 40 B
200 17
18R91A05K2 GOLLAPALLY JITHENDHER 21 21 27 C
201 20
18R91A05K3 GOLLAPALLY PALLAVI 23 24 27 C
202 25
18R91A05K4 GUDURU GOWTHAMI 21 20 26 C
203 19
18R91A05K5 GURRAM MANISHA 21 20 28 C
204 19
18R91A05K6 K DEEPIKA 19 21 0 F
205 23
18R91A05K7 KARROLA SATHWIKA 22 24 32 C
206 25
18R91A05K8 KELU GIPSON 22 20 26 C
207 17
KOMMULA VINODHA
18R91A05L0 22
REDDY 24 23 26 C
208
18R91A05L1 KUSA PREMCHAND 16 19 14 F
209 22
MADUGULA PRANAY
18R91A05L2 18
KUMAR 19 19 42 B+
210
18R91A05L3 MENGANI KIRAN 17 18 28 C
211 18
MOHAN KRISHNA GOUD
18R91A05L4 21
BODA 17 19 26 C
212
18R91A05L5 MUTHYALA RACHANA 21 20 26 C
213 18
MYADARABOINA DHEERAJ
18R91A05L6 9
RAO 14 12 9 F
214
 18R91A05L7 NAAZREEN SULTHANA 20 22 12 F
215 23
18R91A05L8 NARAPARAJU JAHNAVI 22 22 13 F
216 22
18R91A05M0 NENAVATHU GOPAL 21 21 13 F
217 21
18R91A05M3 PALLAPU VENUGOPAL 20 19 41 B+
218 17
18R91A05M4 PASUPULETI ABHINAY 23 24 30 B
219 25
18R91A05M5 PEDAVEETI AKHILA 22 22 15 F
220 21
18R91A05M6 POTTIPOCHALA SRIVIDYA 19 21 5 F
221 23
18R91A05M7 R ASHISH KUMAR JAISWAM 18 21 14 F
222 23
18R91A05M8 RAMYA REDDY NARRA 20 21 26 C
223 22
18R91A05N0 SHASANALA SAI ANUPAMA 19 20 9 F
224 21
18R91A05N1 SIRIKONDA NAVYA LAXMI 23 24 29 C
225 24
18R91A05N2 SOM ABHILASH 16 17 8 F
226 17
18R91A05N3 SULAM TULASI 21 22 26 C
227 22
18R91A05N4 SUNKARI AVINASH 20 20 26 C
228 20
18R91A05N5 TATIPARTI ADRIANWINCY 18 17 45 B+
229 16
18R91A05N6 THANUKU SHIVANI 20 21 32 B
230 21
18R91A05N7 VADIYALA BHAVANA REDDY 20 21 27 C
231 22
18R91A05N8 VOLETI KOUSHIK 18 16 39 B
232 14
WADEPALLY VAISHNAVI
18R91A05N9 21
TARA 24 23 27 C
233
18R91A05P0 CHINTALA KARTHIKEYAN 17 20 37 B
234 23
18R91A05P3 DUMBALA ADITHYA REDDY 19 19 36 B
235 19
19R95A0523 ELA SAI PRUDVI 22 35 B
236 21 22
19R95A0524 JELLA RAGHAVENDAR 14 35 B
237 12 16
19R95A0525 SYED SAAD 18 34 B
238 19 17
19R95A0526 THATIKONDA MAHESH 20 28 B
239 21 19
19R95A0527 VIJJAGIRI PRIYANKA 18 13 F
240 20 16
Analysis of PI (for the past three batches)

Summary statistics
NO.STUDENTS:
APPEARED:NO.STUDENTS:
PASS:NO.STUDENTSFAILED:

Subject For Batch: 2020-21

% of A Grades % of B Grades % of C Grades
CPE

Graphical statistics (Pie-chart for CAY and bar chart for the past three years)
 REMEDIAL CLASSES DETAILS
Name of the Subject: DESIGN AND ANALYSIS OF ALGORITHMS
Year and Semester: 3rd Year 2ND Semester
Name of the Faculty: K DEVADAS Date:

S.No Roll No Student Name Remedial measures taken by

teacher
1 Conducted remedial classes, identified
RATHOD their weakness in the subject according to
18R91A0546
VENKATESH that given important questions and
problems and made them to practice
2 Conducted remedial classes, identified
GANGAPURAM their weakness in the subject according to
18R91A0514
DINESH GOUD that given important questions and
problems and made them to practice
3 Conducted remedial classes, identified
M GOWTHAM their weakness in the subject according to
17R91A05C5
GANESH that given important questions and
problems and made them to practice
4 Conducted remedial classes, identified
NENAVATH their weakness in the subject according to
18R91A05E6
PARAMESH that given important questions and
problems and made them to practice
5 Conducted remedial classes, identified
NUTAKKI GOPALA their weakness in the subject according to
18R91A0541
KRISHNA that given important questions and
problems and made them to practice
6 Conducted remedial classes, identified
their weakness in the subject according to
19R95A0509 B RAJASHEKAR
that given important questions and
problems and made them to practice
7 Conducted remedial classes, identified
their weakness in the subject according to
19R95A0525 SYED SAAD
that given important questions and
problems and made them to practice

Signature of the Faculty Signature of the HOD

Course End Survey/Analysis of student Feedback
 Analysis of student feedback

Specify the feedback collection process:

Percentage of students participating:

Specify the feedback analysis process:

Basis of reward/corrective measures, if any:

Attainment of COs (using course end survey) (bar chart (CO scores vseach CO)

Corrective actions taken in the last three years:

Teacher self-assessment (at the completion of course)

All five units are completed and 80% of students understood the subject with the help
of lab practical’s students and the various examples given in the classroom.

Recommendation/Suggestions for improvement by faculty

 CERTIFICATE
I, the undersigned, have completed the course allotted to me as shown below.

S. Semester Subject with code Total Remarks

No units
Design and Analysis of
1 I Algorithms 5
(CS603PC)

Date: Signature of faculty

Submitted to HOD
Certificate by HOD

I, the undersigned, certify that K. DEVADAS has completed the course work
allotted to him/her satisfactorily/not satisfactorily.

Date: Signature of HOD