Sixteen Week Plan

Faculty of Computing & Information Technology

Department of Computer Science
Hafiz Hayat Campus, University of Gujrat

Title Analysis of Algorithm

Code CS-365
Credit hours 3.0
Prerequisite --
Category --

This is an theory course directed at non-theory students with the standard undergrad background. The goal is to survey the key
Course Description theory topics that every computer science graduate student should know. In about two weeks for each selected topic, we will
gain insights into the basics and study one two example in depth.
The goal of this course is to develop the appropriate background, foundation, and experience for advanced study in Computer
Science. Students will develop the necessary skills from both a theoretical perspective as well as applying their knowledge on
various problem sets. Particularly, this course will help them in
Developing mathematical skills for algorithm design, analysis, evaluation and computational cost,
Aims & Objectives Developing the skills to design and implement efficient programming solutions to various problems,
Developing data structure techniques for various aspects of programming.
At the end of the course, the students should be able to comprehend design & analysis of algorithms and be able to develop
efficient optimized algorithms for complex real world problems.
Learning Outcomes --

Text Books Introduction to Algorithms, (2nd ed. 2007 MIT Press) by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and
Clifford Stein.
Data Structures and Algorithm Analysis in C++, Mark Allen Weiss.
Reference & Material
Data Structures using C++, Tenanbaum
Quizzes 05 %
Assignments 10 %
Grading Breakup and
Mid Term Exam 25 %
Policy
End Semester Exam 50 %
Project 10%
Wee Lecture Source Recommendatio
TOPICS ns for
# (Book,
 Learning
Chapter No)
Activities
Introduction - Algorithm Design, Data Structures, Efficiency, Analysis of Algorithms, Mathematical
01 01, 02
Review
02 03, 04 Mathematical Analysis of Algorithms, types of functions, Order of Growth and Asymptotic Notations
03 05,06 Selection Sort algorithm, example and Analysis, Insertion Sort algorithm, example and Analysis
Divide and Conquer Algorithms ,Merge Sort algorithm, example and Analysis, Quick Sort algorithm, Quiz-01
04 07,08
example and Analysis
Bucket Sort algorithm, example and Analysis, Radix Sort algorithm, example and Analysis, Counting
05 09,10
Sort algorithm, example and Analysis
Heap Sort basics, Algorithms, properties and examples, Heap operations and Heap sort Algorithm
06 11,12
analysis ,Heap insertion and deletion algorithms and analysis
Red Black Tree and Binary Search Tree Basics, Properties and examples, Tree Searching Algorithms Assignment-
07 13,14
and Analysis ,Analysis of Insertion and Deletion algorithms in BST 01
Hashing Basics, Examples and Hash functions , Analysis of Collision Resolution Techniques in
08 15,16
Hashing
Mid Term Exam
09 17,18 Dynamic Programming – 0-1 Knap Sack , Fractional Knap Sack, Longest Common Subsequence
10 19,20 Dynamic Programming – Shortest Path Finding, Matrix Chain Multiplication
11 21,22 Dynamic Programming – Assembly line chain problem, Quiz-02
12 23,24 Greedy Algorithms – Prim’s Algorithm and Kruskal Algorithm,
13 25,26 Greedy Algorithms - Dijkstra's Algorithm, Huffman Coding
Assignment-
14 27,28 NP-Completeness - Polynomial time verification, Reducibility , NP-Completeness Proofs
02
15 29,30 Randomized Algorithms--Particle Swarm Optimization
16 31,32 Randomized Algorithms--Genetic Algorithms
Final Exam