COMMISSION ON HIGHER EDUCATION

SAMPLE SYLLABUS TEMPLATE

COURSE NUMBER: CS202
TITLE: Design and Analysis of Algorithms
DEPARTMENT / PROGRAM: BSCS
SCHOOL:
SEMESTER AND SCHOOL YEAR:
INSTRUCTOR:
COURSE DESCRIPTION
A study on the design and analysis of algorithms, which introduces
students to the techniques in basic algorithmic analysis, algorithmic
strategies, sorting and searching, graph algorithms, and geometric
algorithms.
COURSE OBJECTIVES (DESIRABLE OBJECTIVES)
At the end of this course, the student should be able to:
1. Design effective, efficient, elegant, and readable algorithms for
various classes of computing problems
2. Determine space and time complexity of algorithms
3. Use various algorithm design techniques (divide and conquer,
backtracking, greedy, etc)
COURSE OUTLINE AND TIMEFRAME
TOPICS AND READINGS
1. Mathematical Tools in Analysis
Proof Techniques
Recurrence Relation
Generating Functions

DATE

2. Basic Algorithmic Analysis

Best, average, worst case behaviors
Time and Memory Complexity

CS202

Page 1

3. Algorithmic Strategies

Brute Force algorithms

Greedy algorithms

Divide-and-Conquer strategies

Backtracking

Branch-and-bound

Heuristics
4.
5.
6.
7.

Sorting and Searching

Graph Algorithms
Geometric Algorithms
NP-Completeness
REQUIRED READINGS

SUGGESTED READINGS

COURSE REQUIREMENTS

CONSULTATION HOURS

CS202

Page 2