COMSATS-Lancaster Dual Degree Programme

Lancaster Block, CIIT, Defence Road, Off Raiwind Road, Lahore

COURSE HANDBOOK Fall 2016

Design and Analysis of Algorithms
1
Course Title
CSC 201
2
Course Code
3(3,0)
3
Credit Hours
Semester 5
4
Semester
Muhammad Zuhair Qadir
5
Resource Person
None
6
Supporting Team Members
3 hours per week
7
Contact Hours (Theory)
Not Applicable
8
Contact Hours (Lab)
Tue 2-3pm, Fri 11:30 1pm
9
Office Hours
10
Course Introduction
This course is designed to enable students to understand the design, complexity and efficiency
issues related to different algorithms. It is an introductory course to the design and analysis of
algorithms. It covers mainly asymptotic analysis of time complexity, Proofs of correctness,
Algorithms and advanced data structures for searching and sorting lists, graph algorithms,
numeric algorithms, and string algorithms. Some advance topics like dynamic programming and
greedy algorithms with their applications will also be introduced.

11

Learning Objectives
The student will develop knowledge of
intermediate level algorithms and data structures
techniques for the analysis of their complexity and correctness
some of the fundamental limitations on what can and cannot be computed
efficiently.
The student will be expected to learn
models for asymptotic analysis of algorithms;
techniques for searching and sorting lists including its analysis
various sorts such as insertion, selection, merge, quick, count and heap sorts;
lower/upper bounds on the complexity of sorting;
Some problem solving techniques having multiple solution i.e. Dynamic
Programming

12

Course Contents

Detailed study of the basic notions of the design of algorithms and the underlying data structures.
Several measures of complexity are introduced. Emphasis on the structure, complexity, and
efficiency of algorithms.
13

Lecture/Lab Schedule

Weeks

Week 01

Topic of Lecture
Basic Mathematic & Introduction to Algorithms:
What is an Algorithm? Its role in computing, Its
Implementation Domain, Data structure & Techniques,
Hard Problems, Algorithm as Technology, Efficiency,
Algorithms & other technologies. Algorithm Analysis:

Reading Assignment

Introduction to Algorithm analysis, Bench marks for

analysis, Bubble Sort and its analysis, Complexity
Classes, Big O Notation, Experimental proof for
Analysis of Bubble Sort.

Week 02

Week 03

Week 04

Quiz 01, Assignment 01

Analysing the Algorithms, RAM model, Analysis of
Insertion Sort, Worst & Average Case analysis, Order
of Growth. Some other case studies.
Growth of Functions: Asymptotic notations, notation, O notation, - notation, Asymptotic
notation in equations and inequalities, o notation, notation, comparison of functions, Standard notations &
common function. Association of asymptotic notation
to complexity classes
Quiz 02, Assignment 02
Designing of Algorithms: Loop Invariants and the
correctness, Incremental Approach, Divide and conquer
approach, Its use in Merge Sort, Analysis of Merge
Sort, Recurrences, Its Technicalities, Recursion.

Week 05

Recurrences, Its Technicalities, Fibonacci Series,

Mathematical modelling of recursive equations, Towers
of Hanoi problem, Revision of Course for First
Sessional

Week 06

Sessional I, Paper Checking and discussion about

the solution of the paper

Week 07

Designing of Algorithms: The Recursion Tree

Method, Its implementation and use. Different cases of
Recursion Tree Method. The Master Method, The
Master Theorem & its use

Week 08

Student Week

Week 09

Application of Analysis & Design Techniques: Sorting

and order Statistics, Structure of data, Why sorting is
used? Different Sorting Techniques, Quick sort,
Description of Quick Sort, Performance of Quick Sort,
worst, average & best cases, Analysis of quick sort,
Worst-case analysis.

Week 10

Quiz 03, Assignment 03

Application of Analysis & Design Techniques: Heaps,
Heap Sort, Maintaining Heap Property, Building a
Heap, The Heap Sort Algorithm, Priority Queues

Week 11

Application of Analysis & Design Techniques:

Sorting in Linear Time, Lower Bounds for sorting,
Decision tree model, Tracking and implementation of
Counting Sort. Tracking and implementation of
Counting
Sort,
Its
analysis,
tracking
and
implementation of Radix Sort & Bucket Sort with their

analysis. Revision of Course for Second Sessional

Week 12

Sessional II, Paper Checking and discussion about

the solution of the paper

Week 13

Hash Table & Hashing: Hashing, Direct address

table, Hash Tables, Collision, Resolution by chaining,
and Analysis of hashing with chaining, Hash functions,
The division method, and Multiplication method,
Universal Hashing, Designing a universal class of
hashing functions. Open Addressing, Linear probing,
Quadratic probing, Double Hashing, Analysis of open
address hashing.
Dynamic Programming: Assembly line scheduling,
fastest way through the factory, recursive solution,
computation of the fastest time, construction of fastest
way, Matrix chain Multiplication, optimal
parenthesization, recursive solution, optimal cost
calculation, construction of optimal solution.
Quiz 04, Assignment 04
Dynamic Programming: 0-1 Knapsack Problem,
recursive
solution,
optimal
cost
calculation,
construction of optimal solution.
Greedy Algorithms: Elements of the greedy strategy,
greedy choice property, Optimal substructure, greedy
versus dynamic programming.
Greedy Algorithms:. Activity Selection Problem,
Making Change, Huffman Codes, prefix code,
Construction of Huffman code, and Correctness of
Huffmans algorithm.
Graphs,
Shortest path calculation, Minimum Spanning Trees,
Prims Algorithm, Kruskal Algorithm, Djikstras
Algorithm
Revision of course

Week 14

Week 15

Week 16

Week 17
14
Course Assessment

The assessment of this module shall have following breakdown structure

First Sessional Test
Second Sessional Test
Quizzes/Assignments
Terminal Examination

10%
15%
25%
50%

The minimum pass marks for each course shall be 50%. Students obtaining less than 50% marks
in any course shall be deemed to have failed in that course. The correspondence between letter
grades, credit points, and percentage marks at CIIT shall be as follows:
Grades Letter Grade
A
AB+

( Excellent)

Credit Points
4.0
3.7
3.3

Percentage Marks
90and above
85-89
80-84

B
BC+
C
CD

(Good)

(Average)
(Minimum passing)

3.0
2.7
2.3
2.0
1.7

75-79
70-74
65-69
60-64
55-59

1.3

50-54

F
(Failing)
0.0
Less than 50
Note: The marks to be assigned to students shall be in whole numbers and are not same as
followed in the annual system of Lancaster University.
15
Assessment Schedule
Week 3 Quiz 01, Assignment 01
Week 06 Sessional-I
Week 10 Quiz 02, Assignment 02
Week 12 Sessional-II
Week 15 Quiz 03, Assignment 03
Week 17 Quiz 04. Assignment 04
Week18-19 Terminal Examination
16.
Format of Assignment
This course indoctrinates the following format for all its assignments:
1. Paper Size: A4
2. Left Margin: 2 Inches
3. Right Margin: 1 Inch
4. Top Margin: 0.5 Inch
5. Bottom Margin: 0.5 Inch
6. Font: Times New Roman
7. Font Size:
a. Main Heading 14
b. Sub Heading 12
c. Text 12
d. Titles 16
8. Font Color: Black
9. Line Spacing: 1.5
10. Diagrams & Charts: Need not be colored
11. Title page must be designed as guided by resource person in class
12. Number of Pages: No Limit
13. Reference Style: APA (If applicable)
i. T. H. Cormen, C. E. Leiserson, and R. L. Rivest
17.
Text Book
(2009),Introduction to Algorithms, (3rd Ed.) MIT Press,
McGraw-Hill, New York.
I.
Algorithms, Robert Sedgewick, Edition 2nd,
18.
Reference Books
II.
Compared to What? An Introduction to the Analysis
of Algorithms, by G.J.E Rawlins
III.
The Design and Analysis of Computer Algorithms,
by Alfred V. Aho
19.
Plagiarism
Plagiarism involves the unacknowledged use of someone elses work, usually in coursework, and
passing it off as if it were ones own. Many students who submit apparently plagiarised work
probably do so inadvertently without realising it because of poorly developed study skills,
including note taking, referencing and citations; this is poor academic practice rather than
malpractice. Some students, particularly those from different cultures and educational systems,
find UK academic referencing/acknowledgement systems and conventions awkward, and proofreading is not always easy for dyslexic students and some visually-impaired students. Study skills

education within programmes of study should minimise the number of students submitting poorly
referenced work. However, some students plagiarise deliberately, with the intent to deceive. This
intentional malpractice is a conscious, pre-mediated form of cheating and is regarded as a
particularly serious breach of the core values of academic integrity. The Dual Degree
Prorgamme has zero tolerance for intentional plagiarism.
Plagiarism can include the following:
1. collusion, where a piece of work prepared by a group is represented as if it were the
students own;
2. commission or use of work by the student which is not his/her own and representing it as
if it were, e.g.:
a. purchase of a paper from a commercial service, including internet sites, whether
pre-written or specially prepared for the student concerned
b. submission of a paper written by another person, either by a fellow student or a
person who is not a member of the university;
3. duplication (of ones own work) of the same or almost identical work for more than one
module;
4. the act of copying or paraphrasing a paper from a source text, whether in manuscript,
printed or electronic form, without appropriate acknowledgement (this includes quoting
directly from another source with a reference but without quotation marks);
5. submission of another students work, whether with or without that students knowledge
or consent;
6. Directly quoting from model solutions/answers made available in previous years;
7. cheating in class tests, e.g.
a. when a candidate communicates, or attempts to communicate, with a fellow candidate
or individual who is neither an invigilator or member of staff
b. copies, or attempts to copy from a fellow candidate
c. attempts to introduce or consult during the examination any unauthorised printed or
written material, or electronic calculating, information storage device, mobile phones
or other communication device
d. personates or allows himself or herself to be impersonated.
8. Fabrication of results occurs when a student claims to have carried out tests, experiments
or observations that have not taken place or presents results not supported by the evidence
with the object of obtaining an unfair advantage.
These definitions apply to work in whatever format it is presented, including written work,
online submissions, groupwork and oral presentations.

20.

Attendance Policy

Every student must attend 80% of the lectures/seminars delivered in this course and 80% of the
practical/laboratory work prescribed for the respective courses. The students falling short of
required percentage of attendance of lectures/seminars/practical/laboratory work, etc., shall not
be allowed to appear in the terminal examination of this course and shall be treated as having
failed this course.

21.

Field Trips/Case Studies/Seminars/Workshop