Program BCS (Hons) – VI
Course Name Analysis of Algorithm
Course Code CS-604
Prerequisite Data Structure and Algorithm
Department Computer Science
Credit Hours 03
Total Weeks 16
Total Hours 48
Course Description:
Analysis of Algorithm is the core subject of computer science. This course deal with the most
important aspect of how to create our own algorithms in order to develop efficient and
interactive software’s. Students will make every algorithm accessible and interesting. This course
also provides careful explanations of the mathematics needed to understand the analysis of the
algorithms
Week 1 Introduction, Properties of Algorithms, Features of Algorithms
Week 2 Factors Influencing the Performance of Algorithms (Not In Control of the
Programmer),Classification of Algorithms, Computational Complexity.
Week 3 Analysis of Algorithms, Analysis of Insertion Sort Algorithm, bubble sort etc.
Week 4 Asymptotic Notations, Theta Notation, Big Oh, Big Omega, Little Oh, Little
Week 5 Omega Notations, Usefulness and Limitations of the Asymptotic Notation.
Week 6 Basic Recurrences, Recurrence Solutions, Recurrence Solutions Methods.
Week 7 Master Method and Recursion Tree Method. Relative examples and Exercises
Week 8 Factors Influencing the Execution Time of an Algorithm, Time factor, Input Size,
and algorithm Speed factor.
MID TERM EXAMINATION
Week 9 Some Examples To Calculate The Time T(N) Of Algorithms.
Week 10 Implementation of Algorithms, Rules For Implementation, Using C++, Using Java.
Week 11 Understanding Algorithm Logic, Writing Variables and Code, Testing and Running
via Compiler program. Empirical Analysis.
Week 12 Dynamic Programming, Greedy Algorithms, Divide and Conquer Approached.
Week 13 Introduction to Generation Functions, System Approach, Algorithms and Systems
Week 14 Presentation
Week 15 Quiz
Week 16 Revision-2
Methodology:
The teaching methodology is based on the use of PowerPoint slides, practical case handouts and white
board lecture.
Grading and Evaluation:
The subject will be considered failed if the student gets below 55 mark in it. While semester will be
considered failed if a student gets less than 60% marks overall.
GRADING TABLE
90 and above A
80-89 B
70-79 C
55-69 D
Less than 55 F
EVALUATION
Evaluation of the student is done by exams conduction, assignment and quizzes. Their weigh age is given
as below.
Total Marks 100
Quiz 5%
Attendance 5%
Assignment 5%
Presentation 5%
Mid term 20%
Final Examination 60%
Recommended Books:
1. Thomas H. Carmen, Charles E. Leadsperson, Ronald L. Rivets, Clifford Stein, Introduction
To Algorithms, 2nd Edition, The MIT Press, 2001.
2. Robert Sedgwick, Philippe Flageolet, an Introduction to the Analysis of Algorithms, 1st
Edition, Addison Wesley Publishing Company, 1995.
