COURSE FILE ODD SEMESTER

SUBJECT: Design and Analysis of Algorithms

SUBJECT CODE: CAS303

B.C.A – 5th SEM

SESSION: 2023 – 2024

FACULTY NAME(S): Shobhita Singh

AMITY UNIVERSITY PUNJAB

MOHALI

Signature of Subject Teacher(s) Signature of HOD

Signature of HOS Signature of Dean

Amity School of Engineering and Technology

Table of contents/checklist

S. No. Contents Page No.

1 Cover Page 1
2 Vision and Mission of the University and School / Institute 2
3 Vision and Mission of the Department (if applicable) 3
4 Program statements i.e., PEOs, POs, and PSOs. 4
5 Course description including Syllabus, List of Standard textbooks, reference books, other
5
study material
6 COs, CO-PO Mapping, CO-PSO Mapping
7 List of Experiments / Value-added programs / Project based learning list
8 Evaluation sheet with LTPC
9 Assessment Tools / criteria (direct and indirect both)
10 Lecture / Course Plan
11 Class, Lab & Faculty Timetable
12 Lecture / Unit wise Class Notes with indexing
13 Question Bank
14 Innovative teaching-learning methods used, and Details of online resource utilized
15 PPT of Few Topics of Syllabus (01 topic per unit or 5 topics)
16 Internal exam Question Papers (OBE aligned)
17 CO-wise Assignments / Quizzes
18 Record of Evaluated Answer Sheets (all tests), Assignments etc. – 5 samples
19 Lab Manual
20 Guidelines regarding lab work
21 Criteria for identification of slow / fast learners
22 Students’ List, List of Slow Learners, List of Fast Learners
23 Actions taken to improve performance of slow learners; impact of actions taken
24 Actions taken to motivate fast learners; impact of actions taken
25 Planning of Extra Classes to cover Syllabus, if conducted any
26 CO attainment, that includes:
a) Internal Marks: Class test / exam / Assignments / Quizzes
b) Internal Marks: Continuous Lab Evaluation, Lab file, Quizzes, Viva
c) End Sem Exam Marks
d) Course Exit Survey- Indirect Attainment
27 Attendance Register duly signed by faculty (completed in all respect)
28 University End Sem Exam Question paper
29 1-2 Samples each:
a) Lab File, Jobs, Drawing Sheets (submitted by students)
b) Evaluated Quizzes / Assignments
c) Course Exit Survey (duly filled by students)
1. Vision, Mission of University

Vision
Building the nation and the society through providing total, integrated and trans-cultural quality education and
to be the global front runner in value education and nurturing talent in which Modernity Blends with
Tradition.

Mission

To provide education at all levels in all disciplines of modern times and in the futuristic and emerging frontier
areas of knowledge, learning and research and to develop the overall personality of students by making them
not only excellent professionals but also good individuals, with understanding and regard for human values,
pride in their heritage and culture, a sense of right and wrong and yearning for perfection and imbibe attributes
of courage of conviction and action.
2. Vision, Mission of Amity School of Engineering and Technology Department

Vision
To nurture talent and create globally acceptable, cognitively thinking industry ready technocrats with ethics
and compassion towards socio-economic growth of the society.

Mission

 To execute industry-oriented curriculum with an experiential learning pedagogy inculcating social and
ethical values.

 Undergraduate and Post Graduate programs that integrate foreign languages, communication skills,
team building, interdisciplinary approach and tailored curriculum.

 Inculcate research oriented approach amongst students through mentorship and provide world class
facilities
3. Program statements i.e., PEOs, PO(s), PSOs
Programme Outcomes (POs)
At the end of the program, students will be able to

PO 01 Engineering Knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex engineering
problems.
PO 02 Problem Analysis: Identify, formulate, review research literature, and analyses complex
engineering problems reaching substantiated conclusions using first principles of mathematics,
natural sciences, and engineering sciences
PO 03 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 04 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 05 Modern Tool Usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modelling to complex engineering activities
with an understanding of the limitations.
PO 06 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 07 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 08 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.
PO 09 Individual and Teamwork: 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.

Programme Educational Objectives (PEOs)

After the completion of program, the student will be able to
PEO1 Apply the fundamental knowledge and skills of computer science and engineering to solve real
world problems efficiently.
PEO2 Contribute as entrepreneur or technology expert by using the techniques and engineering tools to
solve complex problems.
PEO3 Pursue research and higher education, advancing the knowledge base of computer science and
engineering.
PEO4 Articulate and design computational solutions to societal problems.

Program Specific Outcomes (PSOs)

After the completion of program, the student will be able to

PSO 1 Apply the software development life cycle process in building web, mobile and cross-platform
based applications using analytical skills, creativity, communication, problem solving skills and
programming languages.
PSO 2 Demonstrate proficiency in using advanced tools and techniques to implement information and
cyber security solutions.
4. Course Description
Course Title: Design and Analysis of Algorithms

L T P/S SW/FW TOTAL

CREDIT
UNITS
Course Contents/syllabus: 4 0 2 0 5
Tea
chin
g
Hou
rs
Unit I: Introduction 15
H
Characteristics of algorithm. Analysis of
algorithm: Asymptotic analysis of
complexity bounds – best, average and
worst-case behavior; Performance
measurements of Algorithm, Time and
space trade-offs, Analysis of recursive
algorithms through recurrence relations:
Substitution method, Recursion tree
method and Masters’ theorem.
Unit II: Algorithmic Strategies 15
H
Brute-Force, Greedy, Dynamic
Programming, Branch- and-Bound and
Backtracking methodologies for the
design of algorithms; Illustrations of
these techniques for Problem-Solving:
Knap Sack, TSP.
Unit III: Graphs & Trees 15
H
Traversal algorithms: Depth First Search
(DFS) and Breadth First Search (BFS);
Shortest path algorithms, Transitive
closure, Minimum Spanning Tree,
Topological sorting, Network Flow
Algorithm.
Unit IV: Tractable and In-Tractable 15
problems H
Computability of Algorithms,
Computability classes – P, NP, NP-
complete and NP-hard. Cook’s theorem,
Standard NP-complete problems and
Reduction techniques. .

List of Experiments (Total: 30 Hours)

 1. Code and analyze solutions to following problem with given strategies:
i. Knap Sack using greedy approach
ii. Knap Sack using dynamic approach
2. Code and analyze to find an optimal solution to matrix chain multiplication using dynamic
programming.
3. Code and analyze to find an optimal solution to TSP using dynamic programming.
4. Implementing an application of DFS such as:
i. to find the topological sort of a directed acyclic graph
ii. to find a path from source to goal in a maze.
5. Implement an application of BFS such as:
i. to find connected components of an undirected graph
6. Code and analyze to find shortest paths in a graph with positive edge weights using Dijkstra’s
algorithm.
7. Code and analyze to find the minimum spanning tree in a weighted, undirected graph using
Prims’ algorithm
8. Code and analyze to find the minimum spanning tree in a weighted, undirected graph using
Kruskals’ algorithm.
9. Coding any real world problem or TSP algorithm using any heuristic technique.
10.

Course Learning Outcomes: After studying this course students will be able to:

1. For a given algorithms analyze worst-case running times of algorithms based on asymptotic
analysis and justify the correctness of algorithms.
2. Explain when an algorithmic design situation calls for which design paradigm (greedy/
divide and conquer/backtrack etc.).
3. Explain model for a given engineering problem, using tree or graph, and write the
corresponding algorithm to solve the problems.
4. Demonstrate the ways to analyze approximation/randomized algorithms (expected running
time, probability of error); &
5. Examine the necessity for NP class-based problems and explain the use of heuristic
techniques.

Text / Reference Books:

AUTHOR TITLE Publisher Year of ISBN

publication
Thomas H Cormen, Introduction to Algorithms PHI 2010 978-
Charles E 8120340077
Lieserson, Ronald
L Rivest and
Clifford Stein

Adam Drozdek Data Structures and Cengage 2013 978-

Algorithms in C++ 8131521267

E. Horowitz, Sartaj Fundamentals of Computer Galgotia 1999 978-

Saini Algorithms Publications 817515257
 Jon Kleinberg and Algorithm Design Pearson 2013 978-
Éva Tardos 9332518643

Udi Manber Algorithms -- A Creative Pearson 1989 978-

Approach 0201120370

CO PO Mapping
Mapping of syllabus with Course Outcomes:

Sr. No Syllabus (unit) CO Mapping

1 Unit 1: Characteristics of algorithm. Analysis of algorithm: 1,2,3, 4
Asymptotic analysis of complexity bounds – best, average and
worst-case behavior; Performance measurements of
Algorithm, Time and space trade-offs, Analysis of recursive
algorithms through recurrence relations: Substitution method,
Recursion tree method and Masters’ theorem.
2 Unit 2: Algorithmic Strategies 2,3
3 Unit 3: Graphs and Trees 3
4 Unit 4: Traceable and In-Traceable Problems 4

Mapping of syllabus with Program Outcomes:

CAS303T PO PO PO PO PO PO 6 PO 7 PO 8 PO 9 PO10 PO11 PO12

CAS303P 1 2 3 4 5
Unit 1 3 2 3 3 -- -- -- -- -- -- --
Unit 2 3 2 2 2 -- -- -- -- 2 -- --
Unit 3 3 3 3 -- -- -- -- -- 2 -- --
Unit 4 3 3 3 -- -- -- -- -- 2 -- --
5. COS, CO-PO Mapping, CO-PSO Mapping (Sample)
PO PO1 PO1 PO1
PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
1 0 1 2
CO-
3 1 2 1 1 1 3 3
1
CO-
3 2 2 1 1 1 2 2
Design and 2
Analysis of CO-
3 2 1 2 1 2 1 2 2 1 3 3
Algorithms I 3
(CAS303) CO-
3 1 2 1 2 3 3
4
CO-
3 2 1 2 2 1 1 3 3
5
CO-
3 1 2 2 1 3 3
6
Average out 2.8
1.69
comes= 3.0 2.0 1.0 2.0 1.0 1.8 1.0 1.5 1.5 1.0 2.8
6
(Max3)
6. List of experiments/Value added programs/Project based learning list
List of Lab Experiments:

File is uploaded for the reference

7. Evaluation sheet
Evaluation Scheme:

Theory Examination

CONTINUOUS EVALUATION FORMAT FINAL EXAM

TYPE OF Surprise Term Seminar/ Mid End End

ASSESSMENT Tests MCQ paper semester semester Semester
based Best of presentatio Test Exam Exam
4 (minimum n/
6 tests) (Subjective) (MCQ)
Assignmen
t

WEIGHTAGE 16 4 5 25 25 25

(%)

Minimum # of Surprise test for up to 1 credit = 3

Minimum # of Surprise test for more than 1 credits = 6

Attendance marks (if any)

% Attendance Marks out of 4

80-84 1
85-89 2
90-94 3
95-100 4

Practical examination

Continuous Assessment/Internal
End Term Examination
Assessment

Lab Record
including
Minor Major
Components Attendance, Viva-
Experiment/ Experiment Viva Total
(Drop down) Ethics, voce
Spotting (Practical)
Precautions,
Interactions

Weight age
20 15 15 35 15 100
(%)

Attendance marks (if any)

% Attendance Marks out of 4

80-84 0.5

85-89 1

90-94 1.5

95-100 2
8. Assessment tools/criteria (direct and indirect)
S. No Assessment tools/criteria (direct and indirect) Average Marks
1 Mid-Term Exam 25
2 Continuous Assessment (Quiz, assignments, Term Paper) 25
3 Student Teacher interaction 00
4 End semester exam (Offline written exam) 25
5 Online MCQ AUP Exam 25
9. Lecture/Course Plan (Sample)
Session plan is uploaded on the amizone portal
10. Class, Lab & Faculty Time table
Class time table

B
.

T
e3
cr
hd

( S
Ce
Sm
Ee
) s
t
2e
2r
B D 91 11 1 1 11
. A 0 3 4
T Y : : :
e 1 1 1
c 5 5 5
h - - -
1 1 1
C 1 4 5
S : : :
E 1 1 1
0 0 0
(
B
)

D
B u
d
it
S

L
a
R o
u
c

E
b r
s
( e
G s

A
M
3 /
o
) M
n D
/ O
d P DO T

K
I O
a
T C
y
/
L C
a la
b s
s
(
a
G
c
4
ti
)
vi
t
y

T I O DC A A
u T u u
e d d
s L it it
d a c c
a b o o
 u u
r r
s s
( e e
G s s
3 / /
) M M
/ O O
D O O
S C C
y / /
L C C
a la la
b s s
s s
( a a
G c c
4 ti ti
) vi vi
t t
y y

W O PC DP D
e S O y S
d A t L
n h a
e o b
s n (
d P G
a r 3
y o )/
g. P
y
t
h
o
 n
L
a
b
(
G
4
)

O
R
S
e
L s
a e
b a
r
( c
T
G h
h Li
3 L
u b
) e
r r
/ c
s P DP a
D t
d r
S u
a y
r
y L e
a /
b S
p
(
o
G
rt
4
s
)

F P PC DA P
r y O u y
i t A d t
d h it h
 c
o
u
o
r
n
s
L
e
a
s
b
/
o (
M
n G
O
3
O
a P )/
C
y r O
/
o S
C
g L
la
. a
s
b
s
(
a
G
c
4
ti
)
vi
t
y
11.Lecture/Unitwise class notes with indexing (1 unit)
12. Question bank (AUP Exam)

500 questions uploaded on exam portal

13. Innovative teaching learning methods used/Online resources utilized

Innovative Teaching strategy used by Faculty:

As the mode of teaching – learning process is online, following strategies were followed:

1. Proper notes were prepared unitwise with appropriate examples

2. Practice assignments were given time to time
3. Interesting discussions were done
4. Doubt classes were taken
5. PPT of few Topics of syllabus (01 Topic per unit or 5 Topics) (Include 5 slides)

Notes has been provided for the reference

6. Internal exam question papers (OBE aligned) (Mid term)

Section A (4x4=16)
1. What do you mean by greedy method in DAA? You have a knapsack with a maximum weight
capacity of 15 units. You are given the following items with their weights (W_i) and values (V_i):

Items Weight(W_i) Value (V_i)

1 2 10

2 3 5

3 5 15

4 7 7

5 1 6

Find the combination of items to maximize the total value in the knapsack without exceeding its
weight capacity.
2. Solve the equation to determine complexity using Master’s theorem:
T (n) = 6T (n/3) + n2 log n
Explain closure properties on Asymptotic notation.
3. Explain spanning tree. Consider a complete undirected graph with vertex set {0, 1, 2, 3, 4}. Entry Wij
in the matrix W below is the weight of the edge {i, j}. What is the minimum possible weight of a
spanning tree T in this graph such that vertex 0 is a leaf node in the tree T?
NOTE: You can use any method to find MST.

4. A file contains the following characters with the frequencies as shown. If Huffman Coding is used for
data compression, determine-

1. Huffman Code for each character

2. Average code length
Character Frequencies

A 10

E 15

I 12

O 3

U 4
S 13

T 1

Section B
1. Explain Dijkstra’s algorithm in detail. Why it is used? Solve the following question using Dijkstra’s
algorithm: Using Dijkstra’s Algorithm, find the shortest distance from source vertex ‘S’ to remaining
vertices in the following graph-

(9)
7. CO wise Assignments/ Quizzes – (Include Quizzes and Assignment Questions)
Test:

1. Which of the following notations represents the upper bound of an algorithm's running time?

A) Big O notation
B) Theta notation
C) Omega notation
D) Little o notation

2. If an algorithm's time complexity is Θ(n^2), what does this mean?

A) The algorithm has a linear time complexity.

B) The algorithm has a quadratic time complexity.
C) The algorithm's time complexity is unknown.
D) The algorithm's time complexity is logarithmic.

3. If an algorithm has a worst-case time complexity of O(n^2) and a best-case time complexity of O(n log n),
which notation provides a tighter bound for the algorithm's time complexity?

A) Big O notation
B) Theta notation
C) Omega notation
D) Little o notation

4. Which of the following best describes the key principle of greedy algorithms?

A) Making decisions based on local optimization without considering their global effects.
B) Exploring all possible solutions exhaustively to find the best one.
C) Solving problems using a recursive divide-and-conquer approach.
D) Analyzing problems using dynamic programming techniques.

5. Which of the following problems can be efficiently solved using Huffman coding, a greedy algorithm?

A) Sorting a list of integers.

B) Finding the shortest path in a graph.
C) Encoding characters to minimize the total number of bits.
D) Constructing a minimum spanning tree.

6. In the fractional knapsack problem, the greedy strategy is to select items based on their:

A) Value-to-weight ratio.
B) Total value.
C) Total weight.
D) Total profit.

7. Which of the following statements is true about the greedy approach in the fractional knapsack problem?

A) The greedy approach always guarantees an optimal solution.

B) The greedy approach might not lead to the optimal solution.
C) The greedy approach works only when the knapsack has unlimited capacity.
D) The greedy approach works only when all items have equal values.

8. Which of the following statements about a spanning tree of a graph is true?

A) A spanning tree has fewer edges than the original graph.
B) A spanning tree may contain cycles.
C) A spanning tree connects only some of the vertices of the original graph.
D) A spanning tree can be disconnected.

Test:

1. What is the primary goal of a Minimum Spanning Tree (MST) algorithm in a weighted graph?

A) To find the shortest path between two vertices.

B) To connect all vertices with the minimum total edge weight.
C) To find the maximum weight path between two vertices.
D) To create a cycle in the graph.

2. Which of the following greedy algorithms is commonly used to find a Minimum Spanning Tree
(MST)?

A) Quick Sort
B) Dijkstra's Algorithm
C) Kruskal's Algorithm
D) Breadth-First Search (BFS)

3. What data structure is commonly used in Prim's algorithm to efficiently select the next edge to
include in the MST?

A) Priority Queue (Min-Heap)

B) Stack
C) Linked List
D) Queue

4. In a connected graph with N vertices, how many edges does a Minimum Spanning Tree (MST)
typically have?

A) N
B) N - 1
C) N^2
D) 2N

5. Dijkstra's algorithm is most commonly used for graphs with:

A) Negative edge weights.

B) Non-weighted edges.
C) Non-negative edge weights.
D) Directed edges.

6. What does the "tentative distance" represent in Dijkstra's algorithm?

A) The distance between the source vertex and the current vertex.
B) The distance between the source vertex and the target vertex.
C) The sum of edge weights along the current path.
D) The maximum edge weight in the graph.

7. Dijkstra's algorithm may produce incorrect results when:

A) The graph contains negative edge weights.

B) The graph contains cycles.
C) The graph is not connected.
D) The graph has more than one source vertex.

8. The Master Theorem provides a method for analyzing the time complexity of algorithms that can
be expressed in the form of a recurrence relation of the following type:

A) T(n) = T(n-1) + T(n-2)

B) T(n) = a * T(n/b) + f(n)
C) T(n) = n^2
D) T(n) = log(n)

Test:

1. In the context of transitive closure, what does the entryT[i][j] represent in the Floyd-Warshall
dynamic programming table?
a. The weight of the edge between vertices i and j.
b. The reachability between vertices i and j.
c. The number of edges in the shortest path from i to j.
d. The maximum flow from i to j.
2. In BFS, which data structure is typically used to keep track of the vertices to be visited?
a. Stack.
b. Queue
c. Priority queue
d. Hash table
3. What does the entry D[i][j] represent in the Floyd-Warshall dynamic programming table?
a. The weight of the edge between vertices i and j
b. The shortest path distance from vertex i to vertex j
c. The number of edges in the shortest path from i to j
d. The maximum flow from i to j
4. Which algorithm is commonly used to solve the All-Pairs Shortest Path problem for dense graphs?
a. Dijkstra's algorithm
b. Bellman-Ford algorithm
c. Floyd-Warshall algorithm
d. Prim's algorithm
5. In Bellman-Ford algorithm, how many iterations are required to find the shortest paths in a graph
with V vertices?
a. V - 1
b. V
c. V + 1
d. log(V)
6. In DFS, when do you backtrack?
a. When a cycle is detected.
b. When the destination vertex is encountered.
c. When the stack becomes empty.
d. When all vertices have been explored.
7. What is the role of the visited array in DFS?
a. To store the values of visited vertices.
b. To mark vertices that have been added to the stack.
c. To store the shortest path between vertices.
d. To store the adjacency matrix.
8. In BFS, when do you stop the traversal process?
a. When all vertices have been added to the queue.
b. When the destination vertex is encountered.
c. When the queue becomes empty.
d. When a cycle is detected.
8. Record of Evaluated answer sheet (Mark Rubrics) – Mid Term, CAS, Total
File is uploaded for the reference
9. Lab manual (with Solutions)
File has been uploaded for the reference
10. Guidelines regarding labwork
General Guidelines For The Students

 A Student is expected to maintain the decorum of the laboratory by maintaining proper discipline.
 Student is expected to be punctual in lab, should keenly perform the experiment allotted to him without
moving from one lab to another and even experimental set up should not be left until it unavoidable.
 Mobile phones are not allowed in the labs and should be kept in the bags in silent or switch-off mode.
 Keep the work area clear of all materials except those needed for your work. Extra books, purses, bags
etc. should be kept in the racks placed in the laboratories.
 Clean up your work area before leaving.
 Eating and drinking is not allowed in the lab.
11.Criteria for Evaluation of slow/fast learners
 MST marks
 Quizzes
 Vivas
 Faculty Student interaction
12.Students list/List of slow learners/ list of fast learners – 5 students getting
higher marks or less than 50%
List of students

List of slow learners

Sr. No Roll No Name of Student

1. A25304821002 Bhumika

2. A25304821008 Raman

List of fast learners

Sr. No Roll No Name of Student

1. A25304821004 Jashan

2. A25304821006 Kuber
13.Actions taken to improve performance of slow learners; ; impact of actions
taken

S. Name of Slow Action Taken to Improve Performance of Slow Learner Remarks/Impact

No. Learner Student Students of action

Assessment I: Detailed discussion Assessment II: Viva

about the subject Voce

Bhumika Conducted detailed discussion Improved

sessions about the subject to understanding and
Raman
clarify concepts and address engagement during
doubts. viva voce. Student
was more confident
in answering
questions.

Bhumika Organized one-on-one tutoring Enhanced grasp of

sessions to focus on specific areas key topics and
Raman
of difficulty. concepts, leading to
higher scores in
viva voce.
 14.Actions taken to motivate fast learners; impact of actions taken

S. Name of Fast Action Taken for Fast Learner Students Remarks//Impact of

No. Learner Student action

Assessment I: Discussion about the Assessment II: Viva

various concepts and subject topics Voce

Jashan Facilitated independent study Increased autonomy

opportunities tailored to the student's and initiative, resulting
Kuber
interests. in highly self-motivated
and well-prepared viva
voce responses.

Jashan Introduced real-world Developed practical

applications of subject concepts understanding and
Kuber
through internships or practical application skills,
assignments. leading to practical
and relevant viva
voce answers.
15.Planning of extra classes to cover syllabus, if conducted any.
The Syllabus was covered on time; no extra classes were planned and conducted. However, various
revision classes were conducted to clear doubts of students.

3-5 Extra classes were provided to students getting attendance less than 75% so that he/she would cover
the syllabus and not debarred from final examinations.