1 of 1
Banasthali Vidyapith
Department of Computer Science
Course Handout: B.Tech. (CSE/ IT/ CS-AI) IV Semester/ MCA II Semester/ M.Sc. (CS) II Semester
December 2024 – April/ May 2025
Date: 26-December-2024
Course Code: CS 213L Course Name: Design and Analysis of Algorithms Lab
Credit Points: 2 Max. Marks: 100 (CA: 40 + ESA: 60)
Course Instructors:
Prof. Kusum Gupta, Professor (Computer Science) MCA II Sem. & M.Sc. (CS) II Sem.
Prof. Sanjay Kumar Sharma, Professor (Computer Science) B.Tech. (IT) IV Sem.
Mr. Vivek Purohit, Associate Professor (Computer Science) B.Tech. (CSE) IV Sem. Section A
Dr. Richa Jain, Assistant Professor (Computer Science) B.Tech. (CS-AI) IV Sem.
Mr. Ankur Sharma, Assistant Professor (Computer Science) B.Tech. (CSE) IV Sem. Section B & C
Learning Outcomes:
On successful completion of the course students will be able to:
Analyse the performance of various algorithms in terms of time and space.
Solve recurrence relations and compute complexity of various iterative and recursive algorithms.
Understand and use B-Tree and hashing techniques.
Understand algorithm design techniques like divide-and-conquer, greedy, dynamic programming, backtracking and
branch-and-bound and apply them for solving real world problems.
Suggested Books:
R1. Horowitz, E., Sahni, S., & Rajsekran S. (2003). Fundamentals of Computer Algorithms. Orient Black Swan.
R2. Aho, A.V., Hopcroft J.E., & Ullman J.D. (2016). The Design and Analysis of Computer Algorithms. Addison
Wesley.
R3. Cormen, T.H., Leiserson, C.E., Rivest, R.L., & Stein, C. (2009). Introduction to Algorithms. MIT Press.
R4. Berlioux, P., & Bizard, P. Algorithms - The Construction, Proof and Analysis of Programs. Wiley.
R5. Mehlhorn, K. (2013). Data Structures and Algorithms. Vol. 1 & Vol. 2. Springer Science & Business Media.
Suggested E-Learning Material:
E1. Design and Analysis of Algorithms: https://nptel.ac. in/courses/106101060/
E2. Algorithms Specialization: https://www.coursera.org/specializations/algorithms
Assessment:
Component Marks Submission/ Examination Date(s) Allotment/ Syllabus
Continuous Assessment@ 40 --- Course related topics
End-Semester Examination 60 19 April - 05 May, 2025* Lab No. 01 to 25 (Entire Syllabus)
* Subject to change, if required.
@ Continuous assessment will be based on practical test(s)/ viva-voce/ minor project(s)/ any other component(s) as decided by the
instructor(s) on regular basis.
Laboratory-Wise Schedule: (02 hours/ laboratory)
Laboratory Topics to be Covered
Number
01 – 02 Linear Search, Bubble Sort, Selection Sort, Insertion Sort
03 – 04 Heap: Creating a Heap, Insertion into a Heap, Deletion from a Heap
05 – 06 Graph: Graph Representations (Adjacency Matrix, Adjacency Lists), Breadth First Search and Traversal,
Depth First Search and Traversal
07 – 08 Disjoint Sets: Union, Find, Union with Weighting Rule, Find with Collapsing Rule
09 – 12 Divide-and-Conquer: Binary Search, Finding the Maximum and Minimum, Merge Sort, Quick Sort
13 – 19 Greedy Method: Knapsack Problem, Job Sequencing with Deadlines, Minimum-Cost Spanning Tree
(Prim’s Algorithm, Kruskal’s Algorithm), Optimal Merge Patterns, Single-Source Shortest Paths
(Dijkstra’s Algorithm)
20 – 25 Backtracking: N-Queens Problem, Sum of Subsets, Graph Coloring, Hamiltonian Cycles, 0/1 Knapsack
Problem
Mr. Ankur Sharma Dr. Richa Jain Mr. Vivek Purohit Prof. Sanjay Kumar Sharma Prof. Kusum Gupta
