DHA SUFFA UNIVERSITY

COMPUTER SCIENCE DEPARTMENT

Course Information Sheet

Semester Spring 2023 Instructor Ms. Raazia Sosan

Program BS(CS) Course Code – Course Name CS 2103- Design and Analysis of
Algorithms

Phone (Ext) 163 E-mail: [email protected]

Course Description:

This course is designed for students with some prior knowledge of data structures and algorithms, and aims
to teach them advanced techniques for designing and analyzing algorithms that are efficient in terms of both
time and space complexity. The course emphasizes practical applications of these techniques, with the goal
of enabling students to solve complex problems efficiently in various domains.

Course Objectives:

After taking this course students will be able to:

1. Assess the asymptotic efficiency of algorithms.

2. Formulate thorough proofs of correctness for algorithms.
3. Display familiarity with significant data structures and algorithms.
4. Implement crucial algorithmic design paradigms and methods of analysis.

Learning Outcomes:

CLO. No. Course Learning Outcomes (CLOs) Bloom’s Taxonomy

DESCRIBE the major modern algorithms and

CLO_1 selected techniques that are essential to today’s 1(Cognitive)
computers.

EXPLAIN the suitability of a specific algorithm design

CLO_2 3(Affective)
technique for a given problem

DESIGN algorithms to solve problems, and

CLO_3 7(Psychomotor)
mathematically evaluate the quality of the solutions;

Page 1 of 4
 DHA SUFFA UNIVERSITY
COMPUTER SCIENCE DEPARTMENT

Course Information Sheet

Semester Spring 2023 Instructor Ms. Raazia Sosan

Program BS(CS) Course Code – Course Name CS 2103- Design and Analysis of
Algorithms

Phone (Ext) 163 E-mail: [email protected]

Book
Week Date Topic Assessment
Chapter

• The Role of Algorithms in Computing

1 6-3-2023 o Algorithms 1
o Algorithms as a technology
• Getting Started
o Insertion sort
2 13-3-2023 o Analyzing algorithms 2
o Designing algorithms

 Growth of Functions
3 20-3-2023 o Asymptotic notation 3 Quiz#1
o Standard notations and common
functions
• Divide-and-Conquer
o The maximum-subarray problem
4 27-3-2023 o Strassen’s algorithm for matrix 4 Assignment#1
multiplication
o The substitution method for
solving recurrences
 Heapsort
5 3-4-2023 o Heaps 6
o Maintaining the heap property
o Building a heap
 Heapsort
6 10-4-2023 o The heapsort algorithm 6 Quiz#2
o Priority queues
 Quicksort
7 17-4-2023 o Description of quicksort 7
o Performance of quicksort
o A randomized version of quicksort

Page 2 of 4
 DHA SUFFA UNIVERSITY
COMPUTER SCIENCE DEPARTMENT

Course Information Sheet

Semester Spring 2023 Instructor Ms. Raazia Sosan

Program BS(CS) Course Code – Course Name CS 2103- Design and Analysis of
Algorithms

Phone (Ext) 163 E-mail: [email protected]

o Analysis of quicksort
8 24-4-2023  Mid Term
 Binary Search Trees
9 1-5-2023 o What is a binary search tree 12 Assignment # 2
o Querying a binary search tree
o Insertion and deletion
10 8-5-2023  Dynamic Programming 15
o Matrix-chain multiplication
11 15-5-2023  Dynamic Programming 15 Quiz # 3
o Longest Common Sequence
 Greedy Algorithms
12 22-5-2023 o An activity-selection problem 16
o Elements of the greedy strategy
o Huffman codes
 Elementary Graph Algorithms
13 29-5-2023 o Representations of graphs 22 Assignment # 3
o Breadth-first search
o Depth-first search
 Data Structures for Disjoint Sets
o Disjoint-set operations
o Linked-list representation of
14 5-6-2023 disjoint sets 21,23
o Minimum Spanning Trees
o Growing a minimum spanning tree
o The algorithms of Kruskal and Prim
 Single-Source Shortest Paths
o The Bellman-Ford algorithm
15 12-6-2023 o Single-source shortest paths in 24
directed acyclic graphs
o Dijkstra’s algorithm
16 19-6-2023  Final Exam

Page 3 of 4
 DHA SUFFA UNIVERSITY
COMPUTER SCIENCE DEPARTMENT

Course Information Sheet

Semester Spring 2023 Instructor Ms. Raazia Sosan

Program BS(CS) Course Code – Course Name CS 2103- Design and Analysis of
Algorithms

Phone (Ext) 163 E-mail: [email protected]

Marks Distribution
Assignments 10
Quizzes 10
Midterm Examination 30
Final Examination 40
Total 100

Text Books:
 Introduction to Algorithms”, by Cormen, Leiserson, Rivest, and Stein, Fourth Edition, 2022
Reference Books:
 How to Solve It”, by George Polya, Princeton University Press, Second Edition, 2015

Page 4 of 4