Design and Analysis of Algorithms

COURSE FILE
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Programme UG

Branch CSE

Name of the Subject Design and Analysis of Algorithms

Year & Semester III B.Tech I - Sem

Section A,B&C

R.Venkateshwarlu

Prepared by Associate Professor

CSE

Verified by :
Approved by:

HOD-CSE
 Course File –Contents

S. No. Title
1 Syllabus Prescribed by University
2 Programme Educational Objectives (PEOs)
3 Programme Outcomes (POs)

Course Outcomes (must be measurable and use action verbs as

4
per blooms taxonomy) & Mapping with POs & PSOs

Lesson Plan/Lecture Schedule with methodology being used /

5
adopted( At least 5 Pedagogies should be used)

University question papers of present and previous two years

6
(regular & Supplementary)

Unit Wise Assignment Questions(Indicate level of Blooms

7
Taxonomy)(2 copies of Assignments)
8 Mid Question Papers with Scheme of Evaluation
9 Marks List
Class Test Question Papers with award list (2 copies of Class
10
Test books)
11 Results Analysis Information
CO attainments (along with target level & indication of
12
reached level of attainment)
13 Topics Beyond Syllabus
14 Lecture Notes/Handouts and additional material.
15 Power point Presentations
B.Tech. III Year Syllabus JNTU HYDERABAD

DESIGN AND ANALYSIS OF ALGORITHMS

B.Tech. III Year I Sem. L T P C

3 1 0 4
Course Objectives
 Introduces the notations for analysis of the performance of algorithms.
 Introduces the data structure disjoint sets.
 Describes major algorithmic techniques (divide-and-conquer, backtracking, dynamic programming, greedy,
branch and bound methods) and mention problems for which each technique is appropriate;
 Describes how to evaluate and compare different algorithms using worst-, average-, and best case analysis.
 Explains the difference between tractable and intractable problems, and introduces the problems that are P,
NP and NP complete.
Course Outcomes
 Ability to analyze the performance of algorithms
 Ability to choose appropriate data structures and algorithm design methods for a specified application
 Ability to understand how the choice of data structures and the algorithm design methods impact the
performance of programs

UNIT I:
Introduction: Algorithm, Performance Analysis-Space complexity, Time complexity, Asymptotic Notations-
Big oh notation, Omega notation, Theta notation and Little oh notation.
Divide and conquer: General method, applications-Binary search, Quick sort, Merge sort, Strassen’s matrix
multiplication.

UNIT II:
Disjoint Sets: Disjoint set operations, union and find algorithms
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.

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 theorem.
TEXT BOOKS:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, SatrajSahni and Rajasekharan, University Press.

REFERENCES:

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

Programme Educational Objectives (PEOs)

PEO1- To provide the learners with fundamental knowledge of applied mathematics, applied sciences
and basic engineering subjects to analyze and solve the problems in Computer Science and
Engineering and its allied fields.

PEO2 - To provide learners with a concrete knowledge in the Core areas like Programming languages,
Computer Organization & Architecture, Operating Systems, Networking, Database Management
Systems, Information & Network Security, Data Mining, etc. and with cutting edge technologies.

PEO3 –To nurture the learners with breadth subjects knowledge and competence in the areas of ES,
VLSI, cloud computing , BigData, Android, Multimedia, IM, Management Science, ENS etc. by
understanding the value of efficient design and development of solutions with multidisciplinary
approach catering to the real-time requirements

PEO4 –To inculcate the learners with advanced subjects knowledge, professional practice,
entrepreneurial skills, teamwork, leadership, project management, personal and professional growth
with ethics and character in developing effective communication, interpersonal and multidisciplinary
skills.

PEO5 –To prepare the learners for higher education, employability, innovative CSE program specific
areas of global technological appliances, research, and service attitude by providing advanced methods
of teaching and learning with effective communication & lifelong learning skills and by executing
MOUs with renowned industries and premier institutes.
 .DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

PROGRAM OUTCOMES

PO1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex engineering problems.

PO2. Problem analysis: Identify, formulate, research literature, and analyze complex engineering
problems reaching substantiated conclusions using first principles of mathematics, natural sciences,
and engineering sciences.

PO3. 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.

PO4. 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.

PO5. 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.

PO6. 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.

PO7. 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.

PO8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.

PO9. Individual and team work: Function effectively as an individual, and as a member or leader in
diverse teams, and in multidisciplinary settings.

PO10. 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.
PO11. 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.

PO12. 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.

PSOs - CSE

PSO1: Graduates will demonstrate the knowledge in allied areas of Computer Science & Engineering.

PSO2: The learners will be able to gain desired knowledge for the Competitive Environment.

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Course Objectives:
For Design and Analysis of Algorithms, the course will enable the students to:
 Introduces the notations for analysis of the performance of algorithms.
 Introduces the data structure disjoint sets.
 Describes major algorithmic techniques (divide-and-conquer, backtracking, dynamic
programming, greedy, branch and bound methods) and mention problems for which each technique
is appropriate;
 Describes how to evaluate and compare different algorithms using worst-, average-, and best case
analysis.
 Explains the difference between tractable and intractable problems, and introduces the problems
that are P, NP and NP complete.

Course Outcomes:
Upon completion of this course, the student will be able to:

CO1:Analyze algorithms and estimate their best-case, worst-case and average-case behavior in terms
of time and space complexity.
CO2:Design appropriate algorithm for solving problems using Divide and Conquer, Backtracking.

CO3:Identify the suitable data structures and algorithm designmethods impact the performance of an
algorithm using dynamic programming.
CO4:Apply algorithm design principles to derive solutions for real life problems using greedy method.
CO5:Design deterministic and non-deterministic algorithms for tractable and intractable problems and
classify them as P Class, NP Class, NP-Hard, NP-complete problems
.

Mapping of Course Outcomes with Program Outcomes:

Name of the Subject: Design and Analysis of Algorithms
Regulation: R-18

Subj P P P P
Ye Se Subject ect CO P P P P P P P P P P O O S S
ar m Name Cod PO O O O O O O O O O O 1 1 O O
e 1 2 3 4 5 6 7 8 9 10 1 2 1 2
CO1 2 3 2 2 1 - - - - 2 2 2 2 3

CO2
Design 2 3 1 2 1 - - - - 2 2 2 2 3
and
Analysis CO3
III II ---- 2 2 2 2 1 - - - - 2 2 2 2 3
of
Algorith CO4
ms 2 3 2 2 2 - - - - 2 2 2 2 2

CO5
2 3 2 2 2 - - - - 2 2 2 2 2
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
LESSON PLAN

SUBJECT: DESIGN AND ANALYSIS OF ALGORITHMS YEAR / SEMESTER: III-I

NAME OF THE FACULTY: R.Venkateshwarlu YEAR:2022-23
Unit Method of No. of
Sl.No. Syllabus Content Sub Topics Covered
No. teaching Hours
Introduction to CHALK AND
1 1 What is an Algorithm 1
Algorithm TALK
Psuedocode Conventions CHALK AND
2 1 Algorithm Specification 1
Recursive Algorithms TALK
CHALK AND
3 1 Performance Analysis Space Complexity 1
TALK
CHALK AND
4 1 Performance Analysis Time Complexity 1
TALK
CHALK AND
5 1 Performance Analysis Amortized Complexity 1
TALK
Asymptotic Notations - CHALK AND
6 1 Performance Analysis 1
(Big oh, and Omega) TALK
Asymptotic Notations - CHALK AND
7 1 Performance Analysis 1
(Theta, and Little oh) TALK
CHALK AND
8 1 Performance Analysis Probabilistic analysis 1
TALK
SEMINAR BY
9 1 Divide & Conquer General Method 1
STUDENTS
CHALK AND
10 1 Binary Search Binary Search 1
TALK

11 1 Merge Sort Merge Sort ROLE PLAY 1

CHALK AND
12 1 Quick Sort Quick Sort 1
TALK
Strassen's Matrix Strassen's Matrix CHALK AND
13 1 1
Multiplication Multiplication TALK

14 1 Assignment-1 & Test-1

CHALK AND
15 2 Disjoint set operations Disjoint set operations 1
TALK
CHALK AND
16 2 union algorithms union algorithms 1
TALK
 CHALK AND
17 2 find algorithms find algorithms 1
TALK
CHALK AND
18 2 Collapsing rule Collapsing rule 1
TALK
Weighted union CHALK AND
19 2 Weighted union algorithm 1
algorithm TALK
CHALK AND
20 2 Examples Examples 1
TALK
CHALK AND
21 2 Backtracking General Method 1
TALK
CHALK AND
22 2 The n-queen problem The n-queen problem 1
TALK
CHALK AND
23 2 Examples Examples 1
TALK
CHALK AND
24 2 The 8-queen problem The 8-queen problem 1
TALK
State space tree for GROUP
25 2 State space tree 1
queens problem DISCUSSION
CHALK AND
26 2 sum of subsets sum of subsets 1
TALK
CHALK AND
27 2 Examples Examples 1
TALK
CHALK AND
28 2 graph coloring graph coloring 1
TALK
CHALK AND
29 2 Hamiltonian cycles Hamiltonian cycles 1
TALK
CHALK AND
30 2 Assignment-2 & Test-2
TALK
CHALK AND
31 3 Dynamic Programming General Method 1
TALK
Chained matrix Chained matrix CHALK AND
32 3 1
multiplication multiplication TALK
All pairs shortest path All pairs shortest path CHALK AND
33 3 1
problem problem TALK

Single source shortest Single source shortest CHALK AND

34 3 1
path problem path problem TALK

Optimal binary Optimal binary CHALK AND

35 3 1
search trees search trees TALK
Optimal binary Optimal binary CHALK AND
36 3 1
search trees search trees TALK

37 3 0/1 knapsack problem 0/1 knapsack problem PPT 1

 Travelling sales person Travelling sales person CHALK AND
38 3 1
problem problem TALK
CHALK AND
39 3 Reliability design Reliability design 1
TALK
CHALK AND
40 3 Assignment-3 & Test-3
TALK
CHALK AND
41 4 Greedy method General Method 1
TALK
CHALK AND
42 4 Greedy method General Method 1
TALK
CHALK AND
43 4 0/1 knapsack problem 0/1 knapsack problem 1
TALK
CHALK AND
44 4 0/1 knapsack problem 0/1 knapsack problem 1
TALK
Job sequencing with Job sequencing with CHALK AND
45 4 1
deadlines deadlines TALK
Job sequencing with Job sequencing with CHALK AND
46 4 1
deadlines deadlines TALK
Minimum cost SEMINAR BY
47 4 Prim's Algorithm 1
spanning trees STUDENTS
Minimum cost
48 4 Kruskal's Algorithm SEMINAR 1
spanning trees
Single source shortest Single source shortest CHALK AND
49 4 1
path problem. path problem. TALK
Single source shortest Single source shortest CHALK AND
50 4 1
path problem. path problem. TALK
CHALK AND
51 4 Assignment-4 & Test-4
TALK
CHALK AND
52 5 Branch and Bound General Method 1
TALK
Travelling sales person Travelling sales person
53 5 PPT 1
problem problem
LC Branch and Bound CHALK AND
54 5 0/1 knapsack problem 1
solution TALK
FIFO Branch and Bound CHALK AND
55 5 0/1 knapsack problem 1
solution TALK
NP-Hard and NP- CHALK AND
56 5 Basic concepts 1
Complete problems TALK
NP-Hard and NP- CHALK AND
57 5 Basic concepts 1
Complete problems TALK
non deterministic non deterministic CHALK AND
58 5 1
algorithms algorithms TALK
 non deterministic non deterministic CHALK AND
59 5 1
algorithms algorithms TALK

NP - Hard and NP- NP - Hard and NP- SEMINAR BY

60 5 1
Complete classes Complete classes STUDENTS

NP - Hard and NP- NP - Hard and NP-

61 5 PPT 1
Complete classes Complete classes
CHALK AND
62 5 Cook’s theorem Cook’s theorem 1
TALK
CHALK AND
63 5 Assignment-5 & Test-5 1
TALK
CHALK AND
64 REVISION UNIT-I 1
TALK
CHALK AND
65 REVISION UNIT-II 1
TALK
CHALK AND
66 REVISION UNIT-III 1
TALK
CHALK AND
67 REVISION UNIT-IV 1
TALK
CHALK AND
68 REVISION UNIT-V 1
TALK

FACULTY INCHARGE HOD-CSE

 University question papers of present and
Previous two years (regular & Supplementary)
Unit Wise Assignment Questions
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

DESIGN AND ANALYSIS OF ALGORITHMS

Assignment Questions

Q. Bloom’s CO
No Questions Taxonom s
. y Levels
Define algorithm. Explain performance analysis of algorithm with an CO
Knowledg
1 1
example. e
Explain binary search algorithm with an example. Knowledg CO
2
e 1
Write the algorithms for the following CO
3 Create 2
i). UNIONii) FINDiii) WEIGHTED UNION.
Explain Graph Colouring with an example. Knowledg CO
4
e 2
Draw the optimal binary search tree for Let n = 4, and (a1, a2, a3, a4) = CO
5 (do, if, read, while) Let P (1: 4) = (3, 3, 1, 1) and Q (0: 4) = (2, 3, 1, 1, Create 2
1)
Describe a travelling salesperson problem. Find a minimum cost tour for CO
the following graph using dynamic programming. Cost of the edges are 3
given by matrix shown in figure

Knowledg
6
e

Explain the 0/1 knapsack problem using Greedy Method. Knowledg CO

7 4
e
Explain about single source shortest path problem. Knowledg CO
8
e 4
Explain briefly about NP - Hard and NP-Complete classes. Knowledg CO
9
e 5
Understan CO
10 Discuss in detail about Cook’s theorem 6
d
Faculty Incharge HOD

III B. Tech I Sem (CSM)

DESIGN ANALYSIS OF ALGORITHMS
I MID EXAMINATIONS – NOV 2023
Time: 1 Hour Max. Marks: 10
Note: Answer any TWO Questions
All Questions carry Equal Marks

Q.
Question Description
No.
a) Explain about Asymptotic Notations. (CO1-Level2)
1 b) Describe the working principle of divide and conquer method. (CO2-Level2)

2 Explain Strassen’s Matrix Multiplication. (CO2-Level 2)

a) ExplainGraph coloring with diagram.(CO2-Level 2)

3
b) Explain Union and Find Algorithms with an example. (CO2-Level 2)

Draw all possible binary search trees for the identifier set (a1,a2,a3,a4)=(do, if, while) and find
4
cost for each binary search tree. (CO3 – Level6)
 III B. Tech I Sem (CSM)
DESIGN ANALYSIS OF ALGORITHMS
I MID EXAMINATIONS – NOV 2023
Objective Exam
Name: _______________________________ Hall Ticket No.
______________________

Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks:10.
I Choose the correct alternative:

1. An Algorithm must be always []

A) Terminate B) Executable C) Well-ordered D) ALL

2. Which of the following are disjoint set operations []

A) Make-set B) Union C) Find-set D) ALL

3. If ‘d’ is the degree of a graph, then the possible number of color for coloring the graph are
[ ]
2
A) d-1 B) d+1 C) 2d D) d

4. Strassen showed that 2*2 matrix multiplication can be accomplished in [ ]

A) 8 multiplications and 4 additions
B) 7 multiplications and 18 additions or subtractions.
C) 7 multiplications and 7 additions
D) 8 additions and 4 multiplications

5. _____________ is a sorting algorithm that uses the divide and conquer strategy. [ ]
A) Heap B) Bubble C) Quick D) Insertion

6. Breadth first search is a searching strategy in the implementation of ___________design strategy.

[ ]
A)Back Tracking B) Branch and Bound C)A & B D) None

7. What is the time and space complexity of merge sort? [ ]

A)O(n log n) and O(n2) B) O(n2) and O(n2)
C)O(n log n) and O(log n) D) O(n log n) and O(n)

8. The live node whose children are currently being generated is called ______ [ ]
A) A-node B) D-node C) E-node D)I-node

9. A ___ is a compact, informal, and environment-independent description of a computer [ ]

programming algorithm.
A) Stack B) Queue C) Psuedocode D) Non-linear data structure

10. Which of the following data structure used in Depth first search algorithm? [ ]
A) Stack B) Queue C) Linked list D)None
II Fill in the Blanks

11. The function………………………………… iff there exist positive constants c and n0 such
that f(n)≤c*g(n) for all n,n≥n0.

12. A problem with N inputs will have some constraints any subsets that satisfy these constraints
are called a______________

13. In a state space tree , each node represents a ______________

14. The time complexity for general matrix multiplication is __________________

15. _________ data structure used in Breadth first search algorithm.

16. Dynamic Programming is applied to _______________

17. Two queens are lie on the same diagonal if and only if __________

18. The time complexity of binary search_________

19. The result of Posterior Analysis is ____________________

20. Graph coloring problem is also known as _______ problem.

 III B. Tech I Sem (CSM)
DESIGN ANALYSIS OF ALGORITHMS
I MID EXAMINATIONS – NOV 2023

SCHEME OF EVALUATION
MID-I

Sno Description Marks

1a) Define and explain asymptotic notation 2

Example 0.5
1b) Define divide and conquer, algorithm 2

Example 0.5
2 Definition, algorithm for Strassen’s matrix 3
multiplication
Example 2
3a) Definition and algorithm for Graph Coloring 2

Example 0.5
3b) Union and Find Algorithms 2
Example 0.5
4 Draw all possible binary search trees for the 5
identifier set (a1,a2,a3,a4)=(do, if, while) and
find cost for each binary search tree
 III B. Tech. (COMPUTER SCIENCE ENGINEERING)
II Semester 2021 - 2022
DESIGN ANALYSIS OF ALGORITHMS
II MID EXAMINATIONS – JULY 2022
Level in Bloom's
Course Outcomes: After completion of the course, the student will be
COs Taxonomy
able to
Analyze algorithms and estimate their best-case, worst-case and
CO 1: average-case behavior in terms of time and space complexity. K4: Analyze

Design appropriate algorithm for solving problems using Divide and

CO 2: Conquer, Backtracking. K6: Create

Apply algorithm design principles to derive solutions for real life

CO 3: problems using greedy method. K3: Apply

Identify the suitable data structures and algorithm designmethods

CO 4: impact the performance of an algorithm using dynamic programming. K2:Understanding

Design deterministic and non-deterministic algorithms for tractable

and intractable problems and classify them as P Class, NP Class, NP-
CO 5: Hard, NP-complete problems K6: Create

Time: 1 Hour Max. Marks: 10

Note: Answer any TWO Questions
SET-II
All Questions carry Equal Marks

Q.
Question Description
No.
Explain All pairs shortest path problem.(CO3-Level2)
1

2 Discuss briefly about the minimum cost spanning tree.(CO4-Level 2)

Consider the following instances of knapsack problem n=3, m=20, profits (p1, p2, p3)=(25, 24,
3 15) and weights (w1, w2, w3)=(18,15,10. Obtain the optimal solution using greedy method.
(CO4-Level 6)
 Draw the portion of the state space tree generated by LCBB for the knapsack instances: n=5, (P1,
4
P2,… , P5) = (12,10,5,9,3), (w1, w2, ...,w5)=(3, 5, 2, 5, 3) and M =12. (CO5-Level 6)

III B. Tech I Sem (CSM)

DESIGN ANALYSIS OF ALGORITHMS
II MID EXAMINATIONS – NOV 2023

SCHEME OF EVALUATION
MID-II

Sno Description Marks

Reliability design 2.5
1
Example 2.5
Minimum cost spanning tree- Kruskal’s and 2.5
Prim’s algorithm
2 Solve n=4, (p1,p2,p3,p4)=(100,10,15,27) ,
(d1,d2,d3,d4)=(2,1,2,1) find the optimal 2.5
solution from the feasible solutions
Draw the portion of state space tree generated
by LCBB for the following knapsack instances:
3 5
n=4,(p1,p2,p3,p4) = (10,10,12,18)
(w1,w2,w3,w4) = (2,4,6,9) and m=15
4 Cook’s theorem. 2.5
Differentiate between NP-complete and NP-
2.5
Hard.
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Design and Analysis of Algorithms

III B.Tech I Sem CSE-A MID Marks List

First Mid Second Mid

Tota Total
Sl. Assig Ob Total Avg.
Name of the l Assig of
No H.T.No. Obj Sub nme j Sub Mark of
Student Mar nment I & II
. (10) (10) nt (10 (10) s Two
ks (5) MID
(5) ) (25) (25)
(25)
(1) (2) (3) (5) (6) (7) (8) (9) (10) (11) (12) (8+12)
CHENNADI
1 16271A0501 AISHWARYA 5 7 5 17 6.5 9 5 21 38 19
RAO
RAYAR AJUR
2 16271A0502 4.5 2.5 5 12 5.5 3 5 14 26 13
DEVA
PORANDLA
3 16271A0503 5.5 3.5 5 14 7 5.5 5 18 32 16
AKHIL
DARAVENA
4 16271A0504 5.5 8 5 19 7 7 5 19 38 19
AKHILA
TIRUKOVELA
5 16271A0505 AKSHITH AB AB 0 0 AB AB 5 5 5 3
KOUNDINYA
YELAGANDULA
6 16271A0506 7.5 10 5 23 7 9.5 5 22 45 23
APARNA
MOHAMMAD
7 16271A0507 7 4 5 16 AB AB 5 5 21 11
ASIF
MAHMAD
8 16271A0508 9 10 5 24 8.5 10 5 24 48 24
ASMA
BANDA
9 16271A0509 CHANDRALEKH 6.5 6.5 5 18 9 7 5 21 39 20
A
ENJAPURI
10 16271A0510 7.5 4.5 5 17 6 7 5 18 35 18
DEEPA
POLADI
11 16271A0511 7.5 7 5 20 6.5 8.5 5 20 40 20
HIRANMAI
THANUKU
12 16271A0512 7 8.5 5 21 7 10 5 22 43 22
KEERTHANA
KONDABHATHI
13 16271A0513 7 9 5 21 7.5 10 5 23 44 22
NI KEERTHI
 GUNDETI
14 16271A0514 5 3 5 13 DETAINED
KOUSHIK
RAJALINGARI
15 16271A0515 6 3.5 5 15 6.5 8.5 5 20 35 18
LAHARI REDDY
ANNARAPU
16 16271A0516 6 9.5 5 21 6 9 5 20 41 21
LAVANYA
RAGALLA
17 16271A0517 AB AB 0 0 DETAINED
MANISHA
MADISHETTY
18 16271A0518 MOHANAVAMS 6 6 5 17 6 8 5 19 36 18
HI KRISHNA
BOORLA
19 16271A0519 6 3.5 5 15 7.5 9.5 5 22 37 19
MOUNIKA
SIRIKONDA
20 16271A0520 6 4.5 5 16 7.5 10 5 23 39 20
NAVEENA
SANDHI
21 16271A0521 6 8.5 5 20 7.5 9.5 5 22 42 21
NAVITHA
THOTA
22 16271A0522 6 8.5 5 20 7 7.5 5 20 40 20
NIKHITHA
NARSINGOJU
23 16271A0523 7 2 5 14 5 7 5 17 31 16
PRAHARSHA
GARSHAKURTH
24 16271A0524 5.5 4.5 5 15 5.5 7.5 5 18 33 17
I PRASHANTH
REDDIMALLA
25 16271A0525 5 3.5 5 14 6 7 5 18 32 16
PRATHIBHA
APURI
26 16271A0526 6 7 5 18 6.5 10 5 22 40 20
PRAVALIKA
CHIDURALA
27 16271A0527 5.5 7 5 18 7.5 8.5 5 21 39 20
PRAVALIKA
DASARI
28 16271A0528 5.5 5 5 16 5 5.5 5 16 32 16
PRIYANKA
NEELAGIRI
29 16271A0529 6 6.5 5 18 7.5 8.5 5 21 39 20
PUJITH
KATKURI
30 16271A0530 7 6 5 18 7 2.5 5 15 33 17
RAMYA
CHILUKAMARI
31 16271A0531 8 9.5 5 23 7.5 10 5 23 46 23
RAMYASRI
NEELA
32 16271A0532 7 3.5 5 16 7 9 5 21 37 19
ROSHINI
SOMA
33 16271A0533 5.5 6.5 5 17 7 9 5 21 38 19
SAHITHI
NAMPALLY
34 16271A0534 AB AB 0 0 DETAINED
SAI RAM
BABARS SAI
35 16271A0535 5 9 5 19 7.5 9.5 5 22 41 21
SPOORTHY
MUPPIDI SAI
36 16271A0536 5 8.5 5 19 6 10 5 21 40 20
SREEJA
KADARLA
37 16271A0537 6 3 5 14 6 4 5 15 29 15
SAIKRUSHNA
BANDI
38 16271A0538 6 4 5 15 6.5 5 5 17 32 16
SANJANA
ANNEDI
39 16271A0539 SAMATHA 6 2.5 5 14 6 6 5 17 31 16
REDDY
VILASAGARAM
40 16271A0540 7 9.5 5 22 7.5 10 5 23 45 23
SANDEEP
SYEDA SARA
41 16271A0541 5.5 8.5 5 19 6 7.5 5 19 38 19
FATHIMA
GARREPELLI
42 16271A0542 7 4.5 5 17 7 8.5 5 21 38 19
SHALINI
 REVOORI
43 16271A0543 4.5 7.5 5 17 7 8.5 5 21 38 19
SHARVANI
MERUGU
44 16271A0544 6 5 5 16 6.5 9.5 5 21 37 19
SHIRISHA
JANGILI
45 16271A0545 5.5 3 5 14 5 4 5 14 28 14
SHIVA GANESH
KUDUKALA
46 16271A0547 6.5 6.5 5 18 7 9.5 5 22 40 20
SHYLAJA
ERRAVELLY
47 16271A0548 6.5 9 5 21 7 9.5 5 22 43 22
SOUMYA
GEEDI
48 16271A0549 7 6.5 5 19 6.5 7 5 19 38 19
SOUMYA SRI
VODNALA
49 16271A0550 6.5 8 5 20 4.5 9.5 5 19 39 20
SREEJA
MURIKI
50 16271A0551 7.5 4 5 17 7 5 5 17 34 17
SREEKAR
MERUGU
51 16271A0552 7.5 5.5 5 18 7 5 5 17 35 18
SRINIVAS
DAWA
52 16271A0553 8 8 5 21 7 9 5 21 42 21
SUPRAJA
POTHUGANTI
53 16271A0554 7 4 5 16 6 5.5 5 17 33 17
SUPRIYA
TATIKONDA
54 16271A0555 8 7.5 5 21 6 9 5 20 41 21
SUPRIYA
KALLEM
55 16271A0557 7.5 6 5 19 6.5 10 5 22 41 21
SWATHI
MOTALA
56 16271A0558 8.5 8 5 22 7.5 10 5 23 45 23
VYSHNAVI
57 16271A0559 SALEHA WASI 7.5 9.5 5 22 7.5 8.5 5 21 43 22
MASEEHA
58 16271A0560 8.5 8 5 22 7 9.5 5 22 44 22
WASI
BADDAM
59 16271A0564 7.5 5 5 18 5.5 5 5 16 34 17
AMIT REDDY
GANJI
60 16271A0590 PRANAY 5 6 5 16 6 9 5 20 36 18
KUMAR
KASTURI
61 16271A05A3 6.5 5 5 17 6 5.5 5 17 34 17
SHALINI
VANGALA
62 16271A05G5 8 8.5 5 22 7 7.5 5 20 42 21
SRUTHI

FACULTY-INCHARGE HOD
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Design and Analysis of Algorithms

III B.Tech I Sem CSE-B MID Marks List

First Mid Second Mid

Tot
Ass Tot Ass Total
Sl. Su al
Name of the ign al ign of Avg.
No H.T.No. Obj Sub Obj b Ma
Student me Mar me I & II of
. (10) (10) (10) (10 rks
nt ks nt MID Two
) (25
(5) (25) (5) (25)
)
(10 (11 (12 (8+12
(1) (2) (3) (5) (6) (7) (8) (9)
) ) ) )
POGULA
1 16271A0561 6.5 1 5 13 5.5 5 13 26 13
VAIBHAV 2.5
G ACHUTHA
2 16271A0562 8.5 7 5 21 7.5 5 22 43 22
RANI 9
SAGI
3 16271A0563 8 4.5 5 18 7 5 20 38 19
AKSHAYA 8
SHAYISTA
4 16271A0565 7.5 5 5 18 5.5 5 16 34 17
ANJUM 5
MURAHARI
5 16271A0566 6.5 2 5 14 5 5 12 26 13
ARAVIND 2
OLADRI
6 16271A0567 8 7.5 5 21 7.5 5 21 42 21
ARCHANA 8
GANJI
7 16271A0568 9 8.5 5 23 8.5 5 24 47 24
DEEPTHI 10
GUDURI
8 16271A0569 8 9 5 22 6.5 5 21 43 22
DHARANI 9.5
CHANDA
9 16271A0570 7 6 5 18 5.5 5 17 35 18
DIVYATEJA 6
10 16271A0571 ARRA GANESH 5 5 5 15 6 3 5 14 29 15
SUDAGONI
11 16271A0572 5.5 10 5 21 7 5 22 43 22
HARIKA 10
KANJARLA
12 16271A0573 7.5 9 5 22 5.5 5 20 42 21
HIRANMAI 9.5
GADICHERLA
13 16271A0574 7 10 5 22 7.5 5 18 40 20
KARTHEESHA 5.5
14 16271A0575 JANGAPALLI 9 10 5 24 8 10 5 23 47 24
 KAVYA
GANNU
15 16271A0576 LAXMIPRASAN 6.5 10 5 22 7.5 5 23 45 23
NA 10
BADE
16 16271A0578 7.5 7.5 5 20 6 5 20 40 20
MAHESHWARI 9
KOLA
17 16271A0579 6.5 7.5 5 19 8.5 5 23 42 21
MANASA 9
RENUKUNTA
18 16271A0580 6.5 7.5 5 19 7 5 22 41 21
MANEESHA 9.5
19 16271A0583 RAMSHA MOIZ 3 4.5 5 13 4.5 4 5 14 27 14
MOHAMMED
20 16271A0584 4.5 4.5 5 14 3 5 12 26 13
NAVEED IMRAN 3.5
21 16271A0585 ADLA NAVYA 6 7 5 18 5.5 4 5 15 33 17
SINGARAVENI
22 16271A0586 5.5 6.5 5 17 6 5 17 34 17
PARASHURAM 6
GONE
23 16271A0588 6 7.5 5 19 6.5 5 20 39 20
PAVITHRA 8.5
MUTHYALA
24 16271A0589 7.5 8.5 5 21 7 5 22 43 22
POOJA 10
MOTHE
25 16271A0591 7.5 8.5 5 21 8 5 23 44 22
PRASHANTHI 10
MANPURI
26 16271A0592 7 8.5 5 21 6 5 21 42 21
RACHANA 10
THADEM
27 16271A0595 7 9 5 21 6 5 20 41 21
RAKESH 9
HAMBI
28 16271A0596 5.5 1 5 12 5 5 14 26 13
ROHAN 4
NEDUNOORI
29 16271A0597 5.5 7 5 18 6.5 5 19 37 19
SAI AMULYA 7.5
KOKKONDA
30 16271A0599 7.5 10 5 23 8.5 5 24 47 24
SAIDEEPTHI 10
31 16271A05A1 UMME SALMA 6 5.5 5 17 5.5 5 5 16 33 17
BONGONI
32 16271A05A2 SANKEERTHAN 7 6.5 5 19 7 5 21 40 20
A 9
GAMPA
33 16271A05A4 9 10 5 24 7 5 22 46 23
SHIRISHA 10
TASMIYA
34 16271A05A5 5.5 4 5 15 6 5 17 32 16
SIDDIQHA 6
ARRAVENA
35 16271A05A6 8 10 5 23 6.5 5 22 45 23
SONY 10
DAMARAPELLY
36 16271A05A7 7 10 5 22 7.5 5 23 45 23
SOUMYA 10
GURRAM
37 16271A05A8 6.5 9 5 21 5.5 5 19 40 20
SOWMYA RAJ 8
BATTU
38 16271A05A9 7.5 8 5 21 5.5 5 21 42 21
SPANDANA 10
GASIKANTI
39 16271A05B0 6 6.5 5 18 7.5 5 21 39 20
SRILEKHA 8.5
RASAMALLA
40 16271A05B1 8 10 5 23 7 5 22 45 23
SUCHARITHA 10
VEERAMANENI
41 16271A05B2 6 0 5 11 6.5 5 14 25 13
SUKANYA 2
 MENDE
42 16271A05B3 7 8.5 5 21 7 5 21 42 21
SUPRITHA 9
KOREPU
43 16271A05B4 6 5 5 16 4 5 17 33 17
SUSMITHA 8
PITTALA
44 16271A05B5 6 7 5 18 6 5 20 38 19
SWATHI 8.5
SAIF ULLAH
45 16271A05B6 5.5 4 5 15 5 5 13 28 14
KHAN 3
PARIKIPANDLA
46 16271A05B7 7 6.5 5 19 6 5 20 39 20
VAISHNAVI 8.5
GADE VAMSHI
47 16271A05B8 5 3.5 5 14 6 5 16 30 15
KRISHNA 5
BADDAM
48 16271A05B9 VENNELA 5.5 6.5 5 17 5 5 17 34 17
REDDY 6.5
SRIPERUMBUDU
49 16271A05C0 6 5.5 5 17 6.5 5 19 36 18
R VYSHNAVI 7
KANDULA
50 17275A0501 6.5 8.5 5 20 5.5 5 16 36 18
NAVANEETHA 5
JERIPOTHULA
51 17275A0502 6.5 4 5 16 5.5 5 18 34 17
SREEJA 7
TAMMANAVENI
52 17275A0503 6 6.5 5 18 5.5 5 19 37 19
RAHUL YADAV 8.5

FACULTY-INCHARGE HOD
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Design and Analysis of Algorithms

III B.Tech I Sem CSE-C MID Marks List

First Mid Second Mid Tota
Ass Tot Tot l of
Sl.N Name of the Assig Avg.
H.T.No. ign al al I&
o. Student Obj Sub Obj Sub nme of
me Mar Ma II
(10) (10) (10) (10) nt Two
nt ks rks MID
(5) (25)
(5) (25) (25)
(8+1
(1) (2) (3) (5) (6) (7) (8) (9) (10) (11) (12)
2)
JAGIRI RAJA
1 16271A0594 6 5.5 5 17 6 5 5 16 33 17
PHANEENDRA
KUNSOTH
2 16271A05C1 AKSHAY AB AB 0 0 DETAINED
NAYAK
YALLA
3 16271A05C3 5.5 6.5 5 17 DETAINED
ARCHANA
GANGIPELLY
4 16271A05C5 BHANU 5.5 6 5 17 6 2.5 5 14 31 16
PRASAD
PADIGELA
5 16271A05C6 CHARISHMA AB AB 5 5 6 8 5 19 24 12
REDDY
VAIDA
6 16271A05C7 6 1.5 5 13 4 6.5 5 16 29 15
DEEPAK
GUNDU
7 16271A05C8 6.5 9.5 5 21 5 9.5 5 20 41 21
DEVIKA
MADGULA
8 16271A05C9 AB AB 0 0 DETAINED
DIVYA
MADUPU
9 16271A05D0 5.5 9 5 20 4.5 6.5 5 16 36 18
GAYATHRI
VASAM
10 16271A05D1 6 6 5 17 6 6 5 17 34 17
GOUTHAMI
PASIKANTI
11 16271A05D2 6 1.5 5 13 DETAINED
HARISH
12 16271A05D3 GORRE 5 5 5 15 5.5 5.5 5 16 31 16
 KALYANI
SHANKAR
AMANAGANTI
13 16271A05D4 7 2.5 5 15 6.5 4.5 5 16 31 16
KARTHIK
CHELAKALA
14 16271A05D5 7 10 5 22 7.5 10 5 23 45 23
KAVERI
QANSA
15 16271A05D7 6 4 5 15 4 8 5 17 32 16
KOUSER
ELKAPALLI
16 16271A05D8 6 2 5 13 5.5 4.5 5 15 28 14
LAVANYA
MUDIGANTI
17 16271A05D9 6 1 5 12 7.5 2.5 5 15 27 14
MAHENDHAR
JAVVAJI
18 16271A05E0 7 9.5 5 22 6.5 9.5 5 21 43 22
MANISHA
CHINTAKINDI
19 16271A05E1 6 7.5 5 19 7 9.5 5 22 41 21
NIKHITHA
DONAKANTI
20 16271A05E2 AB AB 5 5 DETAINED
PRAJITH
KARRA
21 16271A05E3 PRATHITHA 6 3 5 14 5.5 7.5 5 18 32 16
REDDY
ELAGANDULA
22 16271A05E4 6 7.5 5 19 5 9.5 5 20 39 20
RAJASHEKAR
23 16271A05E5 GONDA RAJU 5 3 5 13 5 7 5 17 30 15
KANUKUTLA
24 16271A05E6 6 7.5 5 19 7 7.5 5 20 39 20
RAMANA
PARLAPELLI
25 16271A05E7 5 5 5 15 DETAINED
RAMYA
AJMEERA
26 16271A05E8 5 9 5 19 5.5 10 5 21 40 20
RASAGNA
AKARAPU
27 16271A05E9 AB AB 0 0 DETAINED
REETHU
MOLUGU
28 16271A05F0 ROHINI 6 2.5 5 14 6 3 5 14 28 14
RAMESH
NOMULA SAI
29 16271A05F1 6 5.5 5 17 6.5 7.5 5 19 36 18
SINDHU
PANYALA SAI
30 16271A05F2 AB AB 5 5 7 7.5 5 20 25 13
VIKAS REDDY
GUNTUKA
31 16271A05F3 SAIGOPALA 6 6.5 5 18 7 9.5 5 22 40 20
KRISHNA
VISHWANATH
32 16271A05F4 AM 7 9 5 21 8 9.5 5 23 44 22
SANTHOSHINI
BODDU
33 16271A05F5 SHASHIPREET 7 2.5 5 15 8 5 5 18 33 17
HAM
PARAKALA
34 16271A05F6 6 8.5 5 20 6.5 10 5 22 42 21
SHIRISHA
ENUGULA
35 16271A05F7 SHIVA 6 2.5 5 14 4.5 5 5 15 29 15
KRISHNA
36 16271A05F8 MARTHA 6 3 5 14 5 9.5 5 20 34 17
 SHIVALIKA
RAVIKANTI
37 16271A05F9 7 10 5 22 7 9 5 21 43 22
SINDHUJA
ERUGURALA
38 16271A05G0 6 2 5 13 5.5 2 5 13 26 13
SNEHA
BOLUMALLA
39 16271A05G1 6 7 5 18 6.5 9 5 21 39 20
SOUMYA
DABBETA SRI
40 16271A05G2 6 1.5 5 13 5 3 5 13 26 13
BHAVANA
PALOJU
41 16271A05G3 AB AB 0 0 DETAINED
SRINIVAS
HANUMANDL
42 16271A05G4 A SRIVANI 6 3.5 5 15 7 7.5 5 20 35 18
REDDY
KODUMUNJA
43 16271A05G6 5.5 2.5 5 13 5.5 5 5 16 29 15
SUSHMITHA
VUMMENTHAL
44 16271A05G7 A 5.5 3 5 14 6.5 9.5 5 21 35 18
SUSHMITHA
METTU
45 16271A05G9 5.5 7.5 5 18 5.5 9 5 20 38 19
TEJASWI
GUNTUKA
46 16271A05H0 5 5 5 15 6.5 7 5 19 34 17
ABHILASH
SATHPADI
47 16271A05H1 7 6.5 5 19 6.5 7.5 5 19 38 19
VIDYASRI
ADEPU
48 16271A05H2 AB AB 0 0 AB AB 0 0 0 0
VIKRAM
SARAFF
49 16271A05H3 7.5 10 5 23 7 10 5 22 45 23
SAHANA
MUKKERA
50 17275A0504 VENKATA AB AB 0 0 DETAINED
RAMANA
KADALI
51 17275A0505 7 7 5 19 7.5 8 5 21 40 20
TULASI
MEDAM
52 17275A0506 7.5 7 5 20 6 7.5 5 19 39 20
MEGHANA
RAMPELLI
53 17275A0507 PAVAN 4.5 2 5 12 AB AB 5 5 17 9
KALYAN

FACULTY-INCHARGE HOD
Results Analysis Information
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Results Analysis Information

III B. Tech II Sem CSE

Design and Analysis of Algorithms

Marks(100
S.No. H.T.No. Name of Student
)
1 16271A05E9 AKARAPU REETHU 21

2 17271A0576 MD SULTHAN 20

3 17271A0586 D. RAJIV KRISHNA 14

4 17271A05C4 A. APOORVA 44

5 17271A05F0 B. RISHITHA 23

6 18271A0501 GADE ABHILASH 57

7 18271A0502 NAKIRAKOMMULA ADHVAITHA 45

8 18271A0503 VUSKAMALLA AKHIL 28

9 18271A0504 NAREDDY AKHILA 55

10 18271A0505 KATTA AKHILA 54

11 18271A0506 PERALA AKSHAYA 64

12 18271A0507 KAMMAMPELLY ANUSHA 48

13 18271A0509 MANALA APOORVA 59

14 18271A0510 VADLAKONDA BHAVANI 52

15 18271A0511 ANUMULA DIVYA 47

16 18271A0512 EKTA LAHOTI 50

17 18271A0513 KOKKU HEMA 54

18 18271A0514 KOYA KALYANI 69

19 18271A0516 GOLLAPELLI MANIDEEP 48

20 18271A0517 GANDRA MANIMALA 57

21 18271A0518 MEGHANA GALIPELLI 49

22 18271A0519 ADEPU NAVYA 68

23 18271A0520 KANDULA NAVYA SRI 47

24 18271A0521 MUTHYALA NISHITHAREDDY 52

25 18271A0522 BOLLABATHINI NIVEDITHA 50

26 18271A0523 PUDURI PAVAN KALYAN REDDY 43

27 18271A0524 BOINIPALLI PHANINDRA 41

28 18271A0525 BURLA RAKESH 55

29 18271A0526 GOLLAPELLI RAKESH 53

30 18271A0527 VUPPULA RAMYA 52

DHARSHANALA RAMYA
31 18271A0528 RAGHINI
62

32 18271A0529 T.RISHITHA 60

33 18271A0530 AKULA RITHESH 45

34 18271A0531 NARLA ROSHINI 23

35 18271A0532 MUTA ROSHINI 31

36 18271A0533 SABAHATH SAMREEN 57

37 18271A0534 CHITIKENENI SAHITHI 29

38 18271A0535 CHIDRUPA SAI SINDHUR 55

39 18271A0536 VONTELA SANJANA 61

40 18271A0537 MUTHYAPU SANJAY KUMAR 61

41 18271A0538 SHAFANA SHAHREEN 54

42 18271A0539 PALAKURTHI SHALINI 49

43 18271A0540 KAPILAVAI SHIRISHA 61

44 18271A0541 VENGALA SHIVANI 58

45 18271A0542 DUSARI SHRAVANI 54

46 18271A0543 ARE SIDDHARTHA REDDY 45

47 18271A0544 PURMANI SINDHUJA 48

48 18271A0545 SOHAIL KHAN 41

49 18271A0546 SANKITI SOUMYA 57

50 18271A0547 DOMAKONDA SOWMYA 69

51 18271A0548 PALLEPATI SRAVANI 31

52 18271A0549 AARAPELLI SREE BHAVANI 51

53 18271A0551 EGURLA SRIRAM 48

54 18271A0552 DANNAPUNENI SRIYA 67

55 18271A0553 GOLLA SUPRIYA 37

56 18271A0554 LOKA SWATHI 47

57 18271A0555 DAVU TEJASWINI 48

58 18271A0556 VOOTURI VAISHNAVI 75

59 18271A0557 RAVULA VARSHA 48

60 18271A0558 KUNA VIDHISHA 48

61 18271A0559 MUSUKU VINEETHA REDDY 47

62 18271A0560 BODLA VYSHALI 55

63 18271A0561 AFEEFA ROOHI 45

64 18271A0562 SHEELAM AKHIL 45

65 18271A0563 VELISHALA AKHILA 47

66 18271A0564 GATTU AKHILA 51

67 18271A0565 TIPIREDDY AKHILA 62

68 18271A0566 MADISHETTY ANILA 49

69 18271A0567 SAGI ANUDIVYA 47

70 18271A0568 BONDLA ANUSHA 47

71 18271A0569 MANDAPELLI ASHISH KUMAR 47

72 18271A0570 MAISA BHAVANA 53

73 18271A0571 MANCHALA BHUVANA 37

74 18271A0572 MEDICHELMI HARI KRISHNA 34

75 18271A0574 VEYYEGANDLA INDUMATHI 46

76 18271A0575 KAVATI JHANSI 36

77 18271A0576 GATLA KALYAN 38

78 18271A0577 MADADI LAXMI 68

79 18271A0578 MAKULURI MAHATHI 48

80 18271A0579 BINGI MANASWINI 59

81 18271A0580 RACHAMALLA MEGHANA 49

82 18271A0581 KANNOJU MONIKA 48

83 18271A0582 NARAHARI NAVANEETHA 60

84 18271A0583 NEELAM NAVYA SRI 54

85 18271A0584 PENDRU PRANATHI REDDY 48

86 18271A0585 MOLGURI PRANAVI 62

87 18271A0586 CHIKOTI RASHMITHA 48

88 18271A0587 NALUMACHU SAHITHI 38

89 18271A0589 P SAI JYOTHIKA 54

90 18271A0590 JUTTU SAI SRUTHI 38

91 18271A0591 PENCHALA SAITEJA 30

92 18271A0593 SARA TABASSUM 58

93 18271A0594 KESHETTI SHASHIKALA 73

94 18271A0595 NARAHARI SHINY 56

95 18271A0596 ADLURI SHIVANI 45

96 18271A0597 MIRYALA SINDHU 54

97 18271A0598 SOURAV MANDHANI 51

98 18271A0599 CHEETI SRAVAN RAO 46

99 18271A05A0 MYAKALA SRAVYA 66

100 18271A05A1 PEECHARA SREEJA 57

101 18271A05A2 MARKONDA SRIDHAR 47

102 18271A05A3 MEKALA SRIJANI 55

103 18271A05A4 RUDRA SRINITHYA 58

104 18271A05A5 BANDA SRISAHITHI 60

105 18271A05A6 CHITUMALLA SRISONIKA 63

106 18271A05A7 GUNDLAPELLI SUCHARITHA 55

107 18271A05A8 VANGARI SUPRATHIKA 56

108 18271A05A9 MADA SUSHMA 48

109 18271A05B0 ALUMALLA SUSHMITHA 53

110 18271A05B1 NAGUNURI UDAYKIRAN 47

111 18271A05B2 NAMSANI USHARANI 53

112 18271A05B3 MANCHALA VAIBHAVI 50

113 18271A05B4 KATTA VANDANA 53

114 18271A05B5 KOTA VASAVI 48

115 18271A05B6 NARMETA VIHARI 58

116 18271A05B7 MADA VINITHA 53

117 18271A05B8 PENDOTA VYSHNAVY 46

118 18271A05B9 NYALAKONDA YAMINI DESAI 49

119 18271A05C0 KURA YASHASWINI 55

120 18271A05C1 MYANA ABHISHEK 50

121 18271A05C2 BYRI ADITHYA 47

122 18271A05C4 KOTHVAL AKHIL SRI VASTAV 48

123 18271A05C5 BASWARAJ ARAVIND SAI 30

124 18271A05C6 VEGGALAM BHAVANA 53

125 18271A05C7 GUDISE ESHWAR 64
KASTURI GANESH
126 18271A05C8 MANIKANTA RAJ
36

127 18271A05C9 INDURI HARCHITHA 47

128 18271A05D0 SADUBATHULA HARSHITHA 47

129 18271A05D1 VEMUNURI HEMANTH 49

130 18271A05D2 THIRUNAGARI HIMABINDU 57

131 18271A05D3 MAVURAPU JAYAKRISHNA 39

KATRAPALLY KEERTHI
132 18271A05D4 KASHAYAP
24

133 18271A05D5 BHOOMPALLY LAHARI 48

134 18271A05D6 PENDELA LOKESHWER BABU 29

135 18271A05D8 GUNTI MANASA 62

136 18271A05D9 RANGU MANICHANDANA 64

137 18271A05E1 THELLA MANOJ 44

138 18271A05E2 KOTHA NAVYA 48

139 18271A05E3 KANKATI NIKSHITHA 63

140 18271A05E4 MAKKAPELLI NITHIN 55

141 18271A05E5 KONDAM PRIYANKA 49

142 18271A05E6 RACHAKONDA RAJPAVAN 34

143 18271A05E7 KATLA RAMYA SREE 53

144 18271A05E8 NAGULA RITHIK 27

145 18271A05E9 MYAKALA RUCHITHA 73

146 18271A05F0 ARROJU SAHAJA 52

147 18271A05F1 KOMATIPALLY SAI KIRAN 29

148 18271A05F2 VODNALA SAI RAMANA 62

149 18271A05F3 THAKUR SAI ROHITH SINGH 53

150 18271A05F4 CHITLA SAIPRIYA 65

151 18271A05F5 KEESARA SANGEETHA 54

152 18271A05F6 APARAJU SHIVASAI RAO 48
RACHAMALLA SHRAVAN
153 18271A05F7 KUMAR
26

154 18271A05F8 KONDU SIDHYA 42

155 18271A05F9 KOMATIPALLI SOWMYA 47

156 18271A05G0 ANDEM SREECHARAN REDDY 27

157 18271A05G1 KESHAVENI SRIJA 57

158 18271A05G2 URADI SRIKANTH 56

159 18271A05G3 ETTADI SRUJANA 48

160 18271A05G4 GANGISETTI SUPRIYA 52

161 18271A05G5 SANGEM SURABHI SANTHOSHI 53

162 18271A05G6 SUPRIYA DOOSA 48

163 18271A05G7 SANDHA SURENDHAR 47

164 18271A05G8 MUTHYAM SUSHMITHA 51

165 18271A05G9 PEDDI SWAPNA 52

166 18271A05H0 MADARABOINA SWETHA 53

167 18271A05H2 AKULA VAISHNAVI 35

168 18271A05H3 GOLLAPALLY VAMSHI 48

169 18271A05H4 SOMOJI VIDYALAXMI 48

170 18271A05H5 JANAGAM VINAY KUMAR 56

SRIPATHI VISHWA
171 18271A05H6 HARSHITH SAI
50

172 18271A05H7 HARKALA VYSHNAVI 48

CHIRANJI LAKSHMI
173 18271A05H8 SAHITHI
54

174 18271A05H9 CHITTABOINA VYSHNAVI 60

175 18271A05I0 PUNEETHSAI KONJERLA 51

176 187Z1A0508 ARIKILLA ANJALI 54

177 19275A0501 ANUGULA SATHWIKA 48

178 19275A0502 PALLE RAMYA 69

 179 19275A0503 ALUVALA BHAVANI 48

180 19275A0504 GOTTE NAGA LAXMI 47

181 19275A0505 VARANASI NIKHIL TEJA 46

182 19275A0506 KASTURI HARSHA RAJ 45

183 19275A0507 KUMBALA SAMYUKTHA 44

184 19275A0508 KAMERA SOUNYA 36

185 19275A0509 LINGAMPELLI VASANTHA 38

186 19275A0510 ROOP SAGAR 40

187 19275A0511 BIYYALA VIDYA 45

188 19275A0512 KANDULA SONY 48

189 19275A0513 SOLLETI SADHIKA 30

190 19275A0514 MOHAMMAD JUNAID 34

191 19275A0515 RAMAGIRI RAKESH 32

192 19275A0516 NALLA SHALINI 61

193 19275A0517 MANDAPU YASHWANTH 33

FACULTY-INCHARGE HOD

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

RESULT ANALYSIS

Subject : DESIGN AND ANALYSIS OF ALGORITHMS

Class : IIIYEAR

Semester : II SEMESTER

Exam details & date : External Exam

Faculty :G. SRILATHA

Number of students : 193

No. of students attended : 191

No. of students absent : 02

No. of students passed : 159

No. of students failed : 32

Percentage of failures (%) : 16.58%

RESULT DATA:

Marks % 0-25 26-50 51-75 76-90 91-100

No. of Students 06 101 86 00 00

FACULTY- INCHARGE HOD

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

DESIGN AND ANALYSIS OF ALGORITHMS

 TOPICS BEYOND SYLLABUS

MULTISTAGE GRAPH
A multistage graph G = (V, E) is a directed graph where vertices are partitioned into k (where k > 1)
number of disjoint subsets S = {s1,s2,…,sk} such that edge (u, v) is in E, then u Є si and v Є s1 + 1 for
some subsets in the partition and |s1| = |sk| = 1.
The vertex s Є s1 is called the source and the vertex t Є sk is called sink.
G is usually assumed to be a weighted graph. In this graph, cost of an edge (i, j) is represented by c(i,
j). Hence, the cost of path from source s to sink t is the sum of costs of each edges in this path.
The multistage graph problem is finding the path with minimum cost from source s to sink t.
Example
Consider the following example to understand the concept of multistage graph.

According to the formula, we have to calculate the cost (i, j) using the following steps
Step-1: Cost (K-2, j)

In this step, three nodes (node 4, 5. 6) are selected as j. Hence, we have three options to choose the
minimum cost at this step.
Cost(3, 4) = min {c(4, 7) + Cost(7, 9),c(4, 8) + Cost(8, 9)} = 7
Cost(3, 5) = min {c(5, 7) + Cost(7, 9),c(5, 8) + Cost(8, 9)} = 5
Cost(3, 6) = min {c(6, 7) + Cost(7, 9),c(6, 8) + Cost(8, 9)} = 5
Step-2: Cost (K-3, j)

Two nodes are selected as j because at stage k - 3 = 2 there are two nodes, 2 and 3. So, the value i = 2
and j = 2 and 3.
Cost(2, 2) = min {c(2, 4) + Cost(4, 8) + Cost(8, 9),c(2, 6) +
Cost(6, 8) + Cost(8, 9)} = 8
Cost(2, 3) = {c(3, 4) + Cost(4, 8) + Cost(8, 9), c(3, 5) + Cost(5, 8)+ Cost(8, 9), c(3, 6) + Cost(6, 8)
+ Cost(8, 9)} = 10
Step-3: Cost (K-4, j)

Cost (1, 1) = {c(1, 2) + Cost(2, 6) + Cost(6, 8) + Cost(8, 9), c(1, 3) + Cost(3, 5) + Cost(5, 8) +
Cost(8, 9))} = 12
c(1, 3) + Cost(3, 6) + Cost(6, 8 + Cost(8, 9))} = 13
Hence, the path having the minimum cost is 1→ 3→ 5→ 8→ 9.

FACULTY-INCHARGE HOD

Information Related to the main websites

1. https://en.wikipedia.org/wiki/Divide-and-conquer_algorithm
2. https://www.cs.cmu.edu/~avrim/451f09/lectures/lect1001.pdf
 3. https://www.hackerearth.com/practice/algorithms/greedy/basics-of-greedy-algorithms/tutorial/
4. https://www.geeksforgeeks.org/backtracking-algorithms/
5. http://www.cs.umsl.edu/~sanjiv/classes/cs5130/lectures/bb.pdf

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

CLASS TEST-I-OCT-2022

III B. TECH I-SEM (AI&ML)

Subject Code –CS603PC Subject Title-Design and Analysis of Algorithms

 Cos After the completion of this course, the student will be able to
CO1 Analyze algorithms and estimate their best-case, worst-case and average-case
behaviour in terms of time and space complexity.
CO2 Design appropriate algorithm for solving problems using Divide and Conquer,
Backtracking.
CO3 Identify the suitable data structures and algorithm design methods impact the
performance of an algorithm using dynamic programming.
CO4 Apply algorithm design principles to derive solutions for real life problems using
greedy method.
CO5 Design deterministic and non-deterministic algorithms for tractable and intractable
problems and classify them as P Class, NP Class, NP-Hard, NP-complete problems

TIME: 50 minutes Answer any Two Questions Max.Marks:10(2*5=10 Marks)

1. Explain Asymptotic notations. (5M) (K2 & CO1)

2. Explain quick sort algorithm. (5M) (K2 & CO2)
3. Explain merge sort algorithm. (5M) (K2 & CO2)

Knowledge Level( Blooms Taxonomy )

K1 Remembering K2 Understanding K3 Applying(Applicatio
(Knowledge) (Comprehension) n of knowledge)
K4 Analyzing(Analysis) K5 Evaluating(Evaluation) K6 Creating (synthesis)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

CLASS TEST-II-NOV-2022

III B. TECH I-SEM (AI&ML)

Subject Code –CS603PC Subject Title-Design and Analysis of Algorithms

 Cos After the completion of this course, the student will be able to
CO1 Analyze algorithms and estimate their best-case, worst-case and average-case
behaviour in terms of time and space complexity.
CO2 Design appropriate algorithm for solving problems using Divide and Conquer,
Backtracking.
CO3 Identify the suitable data structures and algorithm design methods impact the
performance of an algorithm using dynamic programming.
CO4 Apply algorithm design principles to derive solutions for real life problems using
greedy method.
CO5 Design deterministic and non-deterministic algorithms for tractable and intractable
problems and classify them as P Class, NP Class, NP-Hard, NP-complete problems

TIME: 50 minutes Answer any Two Questions Max.Marks:10

(2*5=10 Marks)

1. Write an algorithm for collapsing find and give an example. (5M) (K2 & CO2)
2. Write an algorithm for N-Queens problem. (5M) (K2 & CO2)
3.Explain sum of subsets with an example.(5M) (K2 & CO2)

Knowledge Level( Blooms Taxonomy )

K1 Remembering K2 Understanding K3 Applying(Applicatio
(Knowledge) (Comprehension) n of knowledge)
K4 Analyzing(Analysis) K5 Evaluating(Evaluation) K6 Creating (synthesis)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

III B. Tech I Sem (CSM)
DESIGN ANALYSIS OF ALGORITHMS
CLASSTEST – I MARKS
Sl.No. H.T.No. Name of the Student Max. Marks[10]
1 20271A6601 MOHAMMAD AFTHAB 4
2 20271A6602 PONNAM AKSHAYA 4
3 20271A6603 BODDULA AMBIKA 4
4 20271A6604 MYDAM ANUHYA 2.5
5 20271A6605 MOTURI ASHRITHA 4.5
6 20271A6606 KANNEBOINA BHANUJA 6
7 20271A6607 SYED FARDEEN AHMED FAROOQI AB
8 20271A6608 CHOWDARAPU GAYATHRI 7
9 20271A6609 RONDLA MOHAN REDDY 6
10 20271A6610 DURSHETTI NIKITHA 5
11 20271A6611 M NITHIN CHANDRA 6
12 20271A6612 KASTURI ROHIT 4
13 20271A6613 UPPULA ROHITHA 3.5
14 20271A6614 SIRIGINENI RUCHITHA 5
15 20271A6615 MEDA SAIPRANEETH 5
16 20271A6616 ADIGOPPULA SATHWIKA 5
17 20271A6617 SRIGADHI SAVYA AB
18 20271A6618 SHAFIYA SAMREEN 5.5
19 20271A6619 YENNAM SHIRISHA 4
20 20271A6620 THANGALLAPALLI SHIVANI AB
21 20271A6621 POTHIREDDY SIDDARTH AB
22 20271A6622 MILKURI SREEMUKHI 5
23 20271A6623 KANKANALA SRI CHANDANA 5
24 20271A6624 MENDE SRINATH AB
25 20271A6625 KOTTE SRINITHA 2
26 20271A6626 ADLA VAISHNAVI 2.5
27 20271A6627 NAKKA VAMSHI 1
28 20271A6628 KANDI VIKAS AB
29 20271A6629 KOPPURAPU VISHAL REDDY AB
30 20271A6630 KANUKUNTLA YUGHANTH 1
 31 21275A6601 VENNAM CHARAN REDDY AB
32 21275A6602 BHUKYA VIJAY 2.5
33 21275A6603 JAKKULA REKHA 10
34 21275A6604 KOMIRE SHIVANI AB
35 21275A6605 KUNARAPU RAJU 7
36 21275A6606 ATLA PRAVEEN 6
37 21275A6607 ALLADI JOSEPH 2.5
38 21275A6608 ANKAM SAIKRISHNA 3
39 21275A6609 PONNAM SIRI CHANDANA 6
40 21275A6610 PULICHERLA SHASHIKRISHNA 2
41 21275A6611 THUMMA SAMATHA AB
42 21275A6612 KANKANALA SATHWIK REDDY 5
43 21275A6613 SIRUMALLE ANVITHA 7
44 21275A6614 MULE VYSHNAVI 7
45 21275A6615 JANKE ASHWITHA 6
46 21275A6616 CHIGURLA MANASA 5.5
47 21275A6617 THINETI PAVAN KUMAR 3
48 21275A6618 THUPAKULA VIKIAS AB

FACULTY- INCHARGE HOD

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

III B. Tech I Sem (CSM)
DESIGN ANALYSIS OF ALGORITHMS
CLASSTEST – II MARKS

Sl.No. H.T.No. Name of the Student Max. Marks[10]

1 20271A6601 MOHAMMAD AFTHAB 7
2 20271A6602 PONNAM AKSHAYA 7.5
3 20271A6603 BODDULA AMBIKA 8
4 20271A6604 MYDAM ANUHYA AB
5 20271A6605 MOTURI ASHRITHA 9
6 20271A6606 KANNEBOINA BHANUJA 8
7 20271A6607 SYED FARDEEN AHMED FAROOQI AB
8 20271A6608 CHOWDARAPU GAYATHRI 9
9 20271A6609 RONDLA MOHAN REDDY 9
10 20271A6610 DURSHETTI NIKITHA 7.5
11 20271A6611 M NITHIN CHANDRA 10
12 20271A6612 KASTURI ROHIT 8
13 20271A6613 UPPULA ROHITHA AB
14 20271A6614 SIRIGINENI RUCHITHA 10
15 20271A6615 MEDA SAIPRANEETH 6
16 20271A6616 ADIGOPPULA SATHWIKA AB
17 20271A6617 SRIGADHI SAVYA AB
18 20271A6618 SHAFIYA SAMREEN 8
19 20271A6619 YENNAM SHIRISHA 7.5
20 20271A6620 THANGALLAPALLI SHIVANI 6
21 20271A6621 POTHIREDDY SIDDARTH 6.5
22 20271A6622 MILKURI SREEMUKHI 9
23 20271A6623 KANKANALA SRI CHANDANA 10
24 20271A6624 MENDE SRINATH 7
25 20271A6625 KOTTE SRINITHA 8.5
26 20271A6626 ADLA VAISHNAVI 8
27 20271A6627 NAKKA VAMSHI 6
28 20271A6628 KANDI VIKAS AB
29 20271A6629 KOPPURAPU VISHAL REDDY AB
30 20271A6630 KANUKUNTLA YUGHANTH AB
31 21275A6601 VENNAM CHARAN REDDY AB
32 21275A6602 BHUKYA VIJAY 9
33 21275A6603 JAKKULA REKHA AB
34 21275A6604 KOMIRE SHIVANI AB
35 21275A6605 KUNARAPU RAJU 10
36 21275A6606 ATLA PRAVEEN 7.5
37 21275A6607 ALLADI JOSEPH 10
38 21275A6608 ANKAM SAIKRISHNA 9
39 21275A6609 PONNAM SIRI CHANDANA 8
40 21275A6610 PULICHERLA SHASHIKRISHNA 6.5
41 21275A6611 THUMMA SAMATHA 8.5
42 21275A6612 KANKANALA SATHWIK REDDY AB
43 21275A6613 SIRUMALLE ANVITHA 6.5
44 21275A6614 MULE VYSHNAVI 10
45 21275A6615 JANKE ASHWITHA 10
46 21275A6616 CHIGURLA MANASA 10
47 21275A6617 THINETI PAVAN KUMAR AB
48 21275A6618 THUPAKULA VIKIAS 6.5

FACULTY- INCHARGE HOD

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

III B.TECH I SEM

DESIGN AND ANALYSIS OF ALGORITHMS

CLASS TEST-III

COs Course Outcomes: After completion of the course, the student will be able to
 Analyze algorithms and estimate their best-case, worst-case and average-case
CO 1: behaviour in terms of time and space complexity.

Design appropriate algorithm for solving problems using Divide and Conquer,
CO 2: Backtracking.

Identify the suitable data structures and algorithm design methods impact the
CO 3: performance of an algorithm using dynamic programming.
Apply algorithm design principles to derive solutions for real life problems using
CO 4: greedy method.
Design deterministic and non-deterministic algorithms for tractable and intractable
CO 5: problems and classify them as P Class, NP Class, NP-Hard, NP-complete problems

Time: 1 Hour Max. Marks: 10

Note: Answer any TWO Questions
All Questions carry Equal Marks

Blooms
CO
Q.No Taxonomy
Question Description Mapp-
. (Knowledge
ed with
Level)

Discuss about all pairs shortest path problem with

1 Understand(k2) CO3
suitable example.
Describe a travelling salesperson problem. Find a
minimum cost tour for the following graph using
dynamic programming. Cost of the edges are given by
matrix shown in figure.

2 Knowledge (k1) CO3

3 Differentiate greedy and dynamic programming. Analyze(k4) CO3

 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

III B.TECH I SEM

DESIGN AND ANALYSIS OF ALGORITHMS

CLASS TEST-IV

COs Course Outcomes: After completion of the course, the student will be able to
Analyze algorithms and estimate their best-case, worst-case and average-case
CO 1: behaviour in terms of time and space complexity.
 Design appropriate algorithm for solving problems using Divide and Conquer,
CO 2: Backtracking.

Identify the suitable data structures and algorithm design methods impact the
CO 3: performance of an algorithm using dynamic programming.
Apply algorithm design principles to derive solutions for real life problems using
CO 4: greedy method.
Design deterministic and non-deterministic algorithms for tractable and intractable
CO 5: problems and classify them as P Class, NP Class, NP-Hard, NP-complete problems

Time: 1 Hour Max. Marks: 10

Note: Answer any TWO Questions
All Questions carry Equal Marks

Blooms
CO
Q.No Taxonomy
Question Description Mapp-
. (Knowledge
ed with
Level)

Describe briefly about the minimum cost spanning

1 Understand(k2) CO4
tree.
2 Explain knapsack problem with greedy method. Understand(k2) CO4
Consider the following instances of knapsack problem n=3,
m=20, profits (p1, p2, p3)=(25, 24, 15) and weights (w1, w2,
3 w3)=(18,15,10). Obtain the optimal solution using greedy Create (k6) CO4
method.

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

III B.Tech I Sem CSE
DESIGN AND ANALYSIS OF ALGORITHMS
CO Attainment