CAVITE STATE UNIVERSITY

(CvSU)
Cavite, Philippines

CvSU Vision
The premier University in
historic Cavite recognized for
excellence in the development of
globally competitive and morally
upright individuals.

COURSE SYLLABUS
First Semester, School Year 2009-2010

CvSU Mission
Cavite State University shall provide
excellent,
equitable
and
relevant
educational opportunities in the arts,
sciences and technology through quality
instruction and responsive research and
development activities.
It shall produce professional, skilled
and morally upright individuals for global
competitiveness.

____________________________________________________________________________
Professor / Instructor
Office Location

E-mail Address

Office Phone Number

Consultation Hours
____________________________________________________________________________
Course Code

COSC50

Course Title

DESIGN AND ANALYSIS OF ALGORITHM

Course Description :

A study of the design and analysis of algorithms, which introduces

students to techniques in basic algorithmic strategies, sorting and
searching, graph algorithms and geometric algorithms

Credit Unit

3 Units

Lecture

3 hours per week

Laboratory

None

Prerequisite

DCIT22

Course Objectives

After completing this course, the student must be able to:

1.
accept the mission, goals and objective of the
university, college and department;
2.
explain the importance of mathematical tools in
analysis
3.
relate the importance of algorithm in
computing
4.
practice the techniques in designing
algorithms
5.
utilize the use of different sorting algorithms
6.
identify the proper algorithm that works for
graphical problems
7.
identify the proper algorithm that works for
geometrical problems
8.
practice the techniques in analyzing algorithm
complexities

Credit Hours

Core Values

Students are expected to live by and stand for the following University tenets:
TRUTH is demonstrated by the students objectivity and honesty during examinations, class
activities and in the development of projects.
EXCELLENCE is exhibited by the students self-confidence, punctuality, diligence and
commitment in the assigned tasks, class performance and other course requirements.
SERVICE is manifested by the students respect, rapport, fairness and cooperation in dealing
with their peers and members of the community.
In addition, they should exhibit love and respect for nature and support for the
cause of humanity.

Course Content

Course Calendar
(No. of Hours)

I.

Introduction
A.
B.

Mission, Vision, Goals and Objectives

The importance of the subject, guidelines and policies

II. Mathematical Tools in Analysis

A.
B.
1.
2.
3.
4.
5.

Proof Techniques
Recurrence Relation
Technical Detail
Substitution Method
Recursion-tree Method
Master Method
Generating Functions

III. Basic Algorithmic Analysis

A.
B.

1.5

Best, Average, Worst case behaviors

Time and Memory Complexity

FIRST LONG EXAMINATION

1.5

IV. Algorithmic Strategies

8.5

A.
B.
C.
D.
E.
F.

Brute Force Algorithms

Greedy Algorithms
Divide-and-Conquer Strategies
Backtracking
Branch-and-Bound
Heuristics

MIDTERM EXAMINATION

1.5

V. Sorting and Searching

A. Heap Sort
B. Merge Sort
C. Quick Sort
D. Sorting in Linear Time

SECOND LONG EXAMINATION

1.5

VI. Graph Algorithms

A.
B.
C.
D.
E.

Elementary Graph Algorithms

Minimum Spanning Trees
Single-Source Shortest Paths
All-Pairs Shortest Paths
Maximum Flow

VII. Geometric Algorithms

VIII. NP-Completeness

FINAL EXAMINATION

1.5

TOTAL

54

Teaching Methods / Learning Activities:

Lecture (suggested for all chapters)

Problem-solving (suggested for all chapters)
Reporting (suggested for chapters IV, V, and VI)
Group dynamics (suggested for all chapters)
Simulations (suggested for chapters II and III)
Interactive learning (suggested for all chapters)
Case study (suggested for chapters VII and VIII)
Brainstorming (suggested for all chapters)
Projects (suggested for chapters VII and VIII)
Team teaching (suggested for all chapters)

Instructional Materials

Textbooks/References

video clips, pictures, supplies, LCD projector,

laptop/desktop computer, internet connection
1. Cormen, T. H., Leiserson, C. E., Rivest, R. L.,
Stein, C. (2001). Introduction to algorithms. 2nd
ed. The MIT Press.
2. Dasgupta, S., Papadimitriou, C. H., Vazirani, U. V.
(2006). Algorithms.

Supplementary Readings

Online Research, Related Computer Books and

Magazines

Course Requirements

Research for real-world problems that can utilize Dynamic,

Greedy, Divide and Conquer Algorithms, and Graph
Algorithms and design an algorithm for the problems with
their analysis. It also includes the following:
Group/Individual Reports
Group/Individual Projects
1. Compilation of Problems
2. Puzzle
Written and Oral Examination

Evaluation of Student Performance / Grading:

Examinations
Quizzes
Attendance
Assignments
TOTAL
100%

60%
30%
5%
5%

Grading Scale:
The grading scale is as follows:
96.64 100.00
93.31 96.63
89.98 93.30
86.65 89.97
83.32 86.64
79.99 83.31
76.66 79.98
73.33 76.65
70.00 73.32
66.67 69.99
Below 66.66

1.00
1.25
1.50
1.75
2.00
2.25
2.50
2.75
3.00
4.00
5.00

Passing Grade
Conditional
Failed

Course Policies:
A. Attendance
Students are not allowed to have 20% or more absences of the total
class hours, otherwise, they will be graded as follows:
Dropped (if majority of the excessive absences are excused)
Failed (if majority of the excessive absences are unexcused)
B. Classroom decorum
Students are required to:
1. wear their identification cards and observe proper dress code at all times;
2. turn off or put in silent mode their cellular phones during class hours;
3. maintain cleanliness and orderliness of the room at all times; and
4. come to class on time.

C. Examination/ Evaluation
1.
2.
3.

Quizzes may be announced or unannounced.

Long examinations are always announced.
Cheating is strictly prohibited. A student who is caught cheating will be
given a score of 0 for the first offense. For the second offense, he/she will
automatically fail the subject.
4.
Examination permits are required during midterm and final examinations.
5.
Students who missed exams, laboratory exercises, or quizzes may only be
excused for any of the following reasons:
a. participation in a University/College-approved field trip or activity (must be
cleared one week in advance);
b. personal illness (must present medical certificate); and
c. death or serious illness in the immediate family (must present death or
medical certificate).

Prepared by:

Recommended by:

Approved by:

__________________
Professor/Instructor

___________________
Department Chair

___________________
Dean