ANNEXURE-I
Design and Analysis of Algorithm,
Course Code CS09232|11
Semester Fall 2025
Cr. Hrs. 3
Section (s) DAA-A, DAA-C
Instructor Contact Information
Instructor Miss Mariya Bibi
Email [Link]@[Link]
Cell No. 0335-xxxxxxx
Zoom ID 00000000000
Office Room No CS-218- 2nd Floor CS1 Building
i) Teacher will be available during the office hours for student consultation as per following schedule:
Mon: 9:30am-10:30 am
Student
Tue: 9:30am-11:30 am
Consultation
Wed: 10:00am- 12:00pm
Hours
ii) Moreover student can take online appointment with the teacher for consultation.
Class Details
Class Class
Section Class Title Days & Times Class Dates
Type Room Location
Mon :12:30am -
Design and analysis of Lecture Block LB3-06, Cs- Sep 28th , 2025 -
Section DAA-A Lecture 1:55pm
algorithm 207 Feb 08, 2025
Tue :12:30am -1:55pm
Tu[Link]m - Sep 28th , 2025 -
Design and analysis of
Section DAA-C Lecture 09:15am Cs-001, CS-207 Feb 08, 2025
algorithm
Wed: 8:00am -9:15am
i) Please use email rather than telephone voice mail for messages.
ii) Please keep emails short and focused, and use a clear subject line beginning with "CS09232|
11 Question".
Communication
iii) Instructor will generally respond within 24 hours (during the academic days).
with Instructor
iv) Always include your name, course, and UOL email address in your messages to instructor.
If you send an email from some address other than uol email address like mr@[Link];
instructor would not be able to recognize that you are a student of University.
PreRequisites (Data Structure And Algorithm)
Prerequisites: DSA, OOP , Problem solving
Corequisite CS09232|11. Design and analysis of algorithms, their representation, design, structuring, analysis, and
optimization. Implementation of algorithms as structured programs in a high-level language
Medium of Instruction
Instructor will deliver class lectures, conduct discussions and engage in all academic activities exclusively in
Medium of
English. Moreover, the students are required to use English as mode of communication for class room
Instruction
discussions, group discussions, vivas/presentations, group projects etc.
Course Material Availability on SLATE/LMS:
I will use LMS/Slate to keep in touch with my classes. In-class discussion problems, homework solutions
and supplemental materials, and scores for exams, attendance, and assignments will be posted to LMS/SAP.
You should be certain that you are able to log in to LMS/SAP, and that you check the class page on LMS
SLATE/LMS and your University email account regularly.
Course material is available on LMS: [Link]
Grades will be posted on LMS/SAP: [Link]
Required Text
Text Book 1 T.H. Cormen & others, Introduction to Algorithms (3rd Edition)
Text Book 2 Algorithms –Sanjoy Das Gupta, Christos Papadimitriou, Umesh Vazirani
Other
Lecture notes, on board lecture deliver
Material
Software/ Other Tools/Resources
You must install the Dev C++ and an editor to write programs for the class.
You can use whatever editor you prefer..
Dev C++ For the IDK, go to:
[Link]
i) VS Code: [Link]
Other ii) MS Office: [Link]
Tools/Software
s
Goals:
Sr.
Goals
No
Understanding Algorithm Fundamentals:
1
Equip students with a solid foundation in the principles and concepts of algorithms
2 Developing Problem-Solving Skills:
Enhance critical thinking and problem-solving abilities through algorithmic thinking.
Analyzing Algorithm Efficiency:
3
Teach students to evaluate the performance and efficiency of algorithms using appropriate metrics
Understanding Algorithm Design:
Develop the ability to design efficient algorithms to solve computational problems.
4
Learn different paradigms of algorithm design, such as divide-and-conquer, dynamic programming, and greedy
algorithms.
Solving Complex Problems:
Apply algorithms to a variety of complex real-world problems, such as searching, sorting, optimization, and
5 graph-related challenges.
Learn how to select the most appropriate algorithm for a given problem.
Mathematical Proof and Correctness:
6 Understand how to prove the correctness of algorithms through rigorous mathematical proofs.
Learn techniques such as induction and contradiction to validate the accuracy and efficiency of algorithms.
Optimization of Algorithms:
Gain knowledge of how to optimize algorithms and improve their performance.
7
Explore advanced techniques such as amortized analysis and randomized algorithms for performance
improvements
Course Objectives:
Sr.
Objectives
No
1 Algorithm Design Techniques: Equip students with knowledge of various algorithm design strategies such as divide-
and-conquer, dynamic programming, and greedy approaches.
2 Complexity Analysis: Understand time complexity, and apply asymptotic notation to analyze the efficiency of
algorithms.
3 Analyze Algorithm Efficiency: Teach students how to analyze the time and space complexity of algorithms and
understand Big O, Big Theta, and Big Omega notations.
4 Prove Algorithm Correctness: Develop the ability to prove the correctness of algorithms through formal methods such
as induction and contradiction
5 Understand Computational Complexity: Introduce students to the limits of computation, including NP-complete
problems, and teach them how to approach intractable problems.
6 Real-World Applications: Explore how algorithms are applied in various computing applications.
7 Optimize and Refine Algorithms: Encourage students to continuously refine and optimize algorithms for efficiency,
promoting a mindset of iterative improvement and performance tuning.
8 Master Algorithm Design Principles: Cultivate a deep understanding of algorithmic design techniques, empowering
students to create innovative solutions using strategies like backtracking, branch-and-bound, and divide-and-conquer.
COURSE REQUIREMENTS (Design and Analysis of Algorithm)
(Note: Instructor should define it in coordination with HOD/Faculty Committee)
A. Class Attendance:
You are expected to attend class and participate by asking questions, answering questions and contributing to topical
discussions. You are expected to arrive prior to the beginning of class. Class members will be randomly selected to answer
questions and/or help with the solution of exercises.
If you do miss a class, it is your responsibility to ensure that you understand the material covered and the announcements made
in the class you missed. You may not use office hours to have the professor explain the material if you missed the class when it
was discussed.
B. Class Participation:
The following factors will be considered in evaluating class participation:
(1) Attend class sessions and contribute to a positive learning environment,
(2) Ask thoughtful questions,
(3) Participate in discussion,
(4) Prepare for reading and assignments conscientiously.
A positive learning environment results when you demonstrate respect for other students and the instructor, are courteous and
attentive, assist others in learning, attend class regularly, and arrive in class on time.
C. Homework/Assignment:
Doing the homework is essential for success in this course. Throughout the semester, at least 4 Homework/Assignments (5
marks/points each) , 2 before Mid-Term and 2 after Mid-Term will be given.
Homework/Assignment assigned will be discussed in class when time permits; but you may not understand it completely unless
you have already attempted the work. Programming is a discipline that cannot be learned merely by watching; it is learned only
by doing. By attempting each homework problem prior to the class discussion, you can maximize your learning experience and
will be in a position to ask appropriate questions and identify areas where you need help. Accordingly, homework should be
done as instructed before coming to each class.
Incomplete work (or cheating on an assignment) cannot be accepted. Late homework cannot be accepted (as the solution
will be posted right after the collection of the assigned homework).
D. Quizzes
Throughout the semester, at least 4 quizzes (5 marks/points each), 2 before Mid-Term and 2 after Mid-Term will be given in
class on material covered in the previous week(s) to ensure that you are keeping current. There are no make-up quizzes. If you
are not in class on the day of a quiz, you will receive a zero.
E. Exams:
There will be two (2) exams for the semester. All exams are “closed book.” Students will not be given any extended time if
arriving late on that day.
Exams will be a combination of objective questions (e.g., multiple choices, short answer) and numerical problems. To receive
credit for numerical answers, adequate supporting computations (and also explanations if necessary) must be provided.
No makeup exam will be given and the exam will not be administered on any other day!
EVALUATION & GRADING :
The course grades will be determined by the following:
Components Marks Weight
Mid-Term 100 30%
Final-Exam 100 45 %
Quizzes (4*5 points) 20 10%
Home Work/Assignment (4*5 points) 20 10%
Attendance 10 5%
Total 100%
Your Responsibilities
Sr.
No Major Responsibilities
.
1 Arrive on time and do not leave before the end of the class period.
Refrain from causing other distractions (ringing cell phones, talking while others have the floor, etc.). Disruptive
2
students will be asked to leave the class
3 Treat everyone with respect
Be responsible for all assigned materials plus everything covered in class. If you missed classes, make arrangements
4
with another student to collect handouts and to update you on classes you missed
5 xxxx
ACADEMIC HONESTY STATEMENT
Academic dishonesty, which includes cheating, fabrication, facilitation of academic dishonesty, and plagiarism, is a serious
academic offense. A grade of "F" shall be assigned to any student who engages in academic dishonesty in this class, and formal
disciplinary action shall be taken. (Plagiarism in any assignment or cheating in the examinations will result in a grade of F in the
entire course).
THIS SYLLABUS CONSTITUTES A CONTRACT BETWEEN THE STUDENT AND THE FACULTY OF IT (FIT). THE TERMS
AND CONDITIONS CONTAINED IN THIS CONTRACT ARE DEEMED TO BE ACCEPTED BY EACH STUDENT WHO
REMAINS IN THIS COURSE AFTER THE OFFICIAL DROP DATE.
Home Work/Assignment and Quiz Details (subject to change)
Home Work (HW)/Assignment Quiz
Submission of Solution
Homework/ HW/Assignment Solution Posting of Result Result
Week Quiz Week Quiz by Posting of Quiz
Assignment Submission by HW/Assignment By Submission Submission
No (on LMS) No Student on by Teacher on
(on LMS) Student on LMS Teacher on LMS Date date
LMS LMS
Home Work 1 Quiz 1 Week 3 Within the Immediately Within
Within the Time Immediately after the
Week Within Time Line after the quiz 7days
Line Assigned by assignment
4 7days Assigned by submission dead
Teacher submission dead line
Teacher line
Home Work 2 Week Within Quiz 2 Week 7 Within
Same as Above Same as Above Same as Above Same as Above
6 7days 7days
Home Work 3 Week Within Quiz 3 Week Within
Same as Above Same as Above Same as Above Same as Above
10 7days 11 7days
Home Work 4 Week Within Quiz 4 Week Within
Same as Above Same as Above Same as Above Same as Above
13 7days 14 7days
Reading
Every Week
Assignments
Note : This is the minimum number of Home Work/Assignments and Quizzes . The Instructor should encourage to add more Home Work/Assignments and Quizzes.
Submitting Work:
1. Most assignments will be submitted electronically via Slate/LMS.
2. Please do not email submissions until and unless necessary due some justified reason.
Course Contents and Tentative Class Schedule Table-I (DAA)
Exam/Quiz/Assignment
Week Chapter
No Dates Topics Book Name Time Line
No Category for Result
Submission
5D: 17-2- T.H. Cormen &
25 && 17- Overview of Course and Introduction of others, Introduction
Ch 1 NA NA
2-25 Algorithms. What is an Algorithm? to Algorithms (3rd
Edition)
5E: 18-2- Algorithms Importance and analysis of
1 Same as Above Ch1 NA NA
25 && 17- algorithms and their comparison
2-25 Why time complexity is important Same as Above Ch1 &2 NA NA
Execution time of simple algorithm Ch1 &2 NA NA
how to calculate running time of simple
Same as Above Ch1 &2 NA NA
algorithms
2 5D: 24-2- Sorting Algorithms T.H. Cormen & Ch 2 NA NA
25 && 25- others, Introduction
2-25 to Algorithms (3rd
Week
Dates Topics Book Name Chapter
No Exam/Quiz/Assignment
No
Edition)
Insertion Sort Algorithm Same as Above Ch 2 NA NA
5E: 25-2-
25 && 25- Insertion Sort Algorithm and Its Analysis Same as Above Ch 2 NA NA
2-25
Bubble Sort Algorithm and Its Analysis Same as Above Ch 2
Selection Sort Algorithm and Its Analysi Same as Above Ch 2 NA NA
T.H. Cormen &
5D: 3-3-25 others, Introduction
&& 5-3-25 Time Complexity Analysis Ch 3 NA NA
to Algorithms (3rd
Edition)
3 5E: 4-3-25 Quiz 1 Within 7
Asymptotic analysis of algorithm Same as Above Ch 3 (Week 3/Week4) Days
&& 5-3-25
Growth Rate Same as Above Ch 3 NA NA
Big O Notions Same as Above Ch 3 NA NA
Omega and Theta Notions Same as Above Ch 3 NA NA
5D: 10-3- T.H. Cormen &
25 && 12- others, Introduction
Recursions Ch 4 NA NA
3-25 to Algorithms (3rd
Edition)
4 Home Work/
5E: 11-3- Recursion and Recurrence Relations Within 7
Same as Above Ch 4 Assignment 1
25 && 12- (Week 2/Week3)
Days
3-25 Recursive Tree Method Same as Above Ch 4
Substitution Method Same as Above Ch 4 NA NA
5D: 17-3- Master Theorem with examples Same as Above Ch 4 NA NA
25 && 19-
3-25
5 Divide and Conquer Approach
5E: 18-3- Same as Above Ch 4 NA NA
Merge Sort algorithm and its Analysis
25 && 19-
3-25
5D: 24-3- T.H. Cormen &
25 && 26- others, Introduction
Quick Sort Algorithm and Analysis Ch 7 NA NA
3-25 to Algorithms (3rd
Edition)
6 5E: 25-3- Quick Sort and Pivot Variation Same as Above Ch 7 NA NA
25 && 26- BST, Tree traversal Same as Above Ch 12
3-25 Home Work/ Within 7
In order, Pre order, Post Order: level Order Same as Above Ch 12 Days
Assignment 2
Linear Search Same as Above NA NA
Heap T.H. Cormen &
others, Introduction Quiz 2 Within 7
Ch 6 (Week 6/) Days
5D: 24-2- to Algorithms (3rd
25 && 25- Edition)
2-25 Types of Heap: Min heap , Max heap
Same as Above Ch 6 NA NA
7 5E: 25-2- Heap Sort Analysis
25 && 25- Same as Above Ch 6 NA NA
2-25
T.H. Cormen &
others, Introduction
Binary Search Tree Problem Ch 12 NA NA
to Algorithms (3rd
Edition)
8 5D: 31-3- Loop Invariants solved with examples NA NA
25 && 2-4- Graphs T.H. Cormen &
25 Graph terminologies others, Introduction
Ch 20 NA NA
to Algorithms (3rd
5E: 01-4- Edition)
25 && 2-4- Different types of graph Same as Above Ch 20 NA NA
Exam/Quiz/Assignment
Week Chapter
25 Dates Topics Book Name
Direct Acyclic Graph Algorithms
Same as Above Ch 20 NA NA
7-4-2025
Within
&& 12-4- Mid Term Exam Week Midterm
2025 5 Days
5D: 14-4- Different Algorithms Design Strategies T.H. Cormen &
25 && 16- others, Introduction Ch 14 &
NA NA
4-25 to Algorithms (3rd 15
Edition)
Greedy Activity Selection Home Work/
9 5E: 15-4- Within 7
Same as Above Ch 15 Assignment 3
Days
25 && 16- (Week10/Week11)
4-25 Greedy Algorithm Same as Above Ch 15 NA NA
Terminologies related to Graph Same as Above Ch 15 NA NA
Huffman Coding Same as Above Ch 15
5D: 21-4- Introduction to Dynamic Programing T.H. Cormen &
25 && 23- others, Introduction
Ch 14 NA NA
4-25 to Algorithms (3rd
Edition)
10 5E: 22-4- Assembly Line Scheduling problem
25 && 23- Ch
Same as Above NA NA
4-25
Assembly Line Scheduling algorithm and Analysis Quiz 3 Within 7
Same as Above (Week 11) Days
5D: 28-4- Longest Common Subsequence Problem T.H. Cormen &
25 && 30- others, Introduction
Ch 14 NA NA
4-25 to Algorithms (3rd
Edition)
11 5E: 29-4- Graphs Introduction Same as Above Ch 20 NA NA
25 && 30- Terminologies related to Graph & Trees
4-25
Same as Above Ch 20 NA NA
5D: 05-5- Depth First Search Same as Above Ch 20 NA NA
25 && 7-5- Breadth First Search Same as Above Ch 20 NA NA
25 Shortest Path T.H. Cormen & Ch 21
others, Introdu- Assignment 4 Within 7
12
5E: 6-5-25 ction to Algorithms (Week 13) Days
&& 7-5-25 (3rd Edition)
Minimum Spanning Tree (MST) Ch 21
Same as Above NA NA
5D: 12-5- Prim’s Algorithm Same as Above Ch 21 Quiz 4 Within 7
(Week 11) Days
25 && 14-
5-25 Kruskal’s Algorithm (MST) Same as Above Ch 21
0/1 Knaspack Same as Above Ch 21
13 5E: 13-5- A star Algorithm. Same as Above Ch 21
25 && 14-
5-25
5D: 19-5- Graph Shortest Path Algorithms T.H. Cormen & Ch 22
25 && 21- others, Introduction
5-25 to Algorithms (3rd
Edition)
14 5E: 20-5- Graph Path Problem Same as Above Ch 22
25 && 21- Shortest Path. Same as Above Ch 22
5-25 Djikstra’s Algorithm Same as Above Ch 22
15 5D: 26-5- Shortest Path Bellman Ford Algorithm Same as Above Ch 22 NA NA
25 && 28- Optimization problem T.H. Cormen & Ch 34 NA NA
Week
Dates Topics Book Name Chapter
No Exam/Quiz/Assignment
No
others, Introduction
to Algorithms (3rd
Edition)
Decision Problem Same as Above Ch 34 NA NA
5-25 Class P (Polynomial), NP (Non- deterministic Same as Above
polynomial)
Ch 34 NA NA
5E: 27-5- NP Complete Same as Above Ch 34
25 && 28- Ch 34
5-25
5D: 31-3- NP Hard set of problem Ch 34
25 && 2-4-
25
16 Review of Course
5E: 01-4-
Within
25 && 2-4- Final Exam Discussion Final Term
25 3 Days
13-2025
18 To Final Exam Week
18-01-2025