You are on page 1of 6

Republic of the Philippines

CAMARINES SUR POLYTECHNIC COLLEGES


Nabua, Camarines Sur
VISION

CSPC-F-COL-13

SYLLABUS
In

CSPC as the regional center of excellence in polytechnic education

MISSION

CSPC shall take the lead in providing highly technical and quality professional education
through ladderized curricula in fisheries, trades and technology, arts and sciences, generating
technology and undertaking sustainable community development goals.
1.
2.
3.
4.

Provide quality instruction, learning environment and other support services to procedure graduates
who are morally upright, service-oriented, technologically and professionally competitive and
innovative.
Initiate research and development to generate new scientific knowledge and advance technology
through appropriate utilization and conservation of natural resources for sustainable development,;
and
Establish an effective and efficient management of production and income generating projects for
self-sufficiency; and
Undertake responsive and relevant extension and community development services.

In support to this mission, the Colleges shall establish pro-active and transparent
governance system to ensure effective and productive performance of these four major
functions.
In is our noble intention to make CSPC a public higher education institution exemplar in
undergraduate and advance education grounded in technology and sciences that grow naturally
out of the philosophy, values, content and desired outcomes of a polytechnological education.
We will be guided with our strong core values of:
T
- Truthfulness
W
- Workmanship
E
- Empowerment
O
- Optimism
A
- Availability
R
- Responsibility
M - Motivation
K
- Kindness
In short, through TEAMWORK!
PHILOSOPHY & OBJECTIVES
CSPC is committed to provide fresh dimensions and directions toward social
transformation and development, guided by its philosophy, which is education for economic
development and social progress. The institutions blueprint is the development of a critical
mass of quality manpower in the area through the ladderized programs.
The College commits itself to:
A.
B.
C.

DESIGN AND ANALYSIS OF ALGORITHM

1st Semester S/Y 2014-2015

I.

COURSE CODE

II. COURSE TITLE

COURSE DESCRIPTION : The objective of this course is to study paradigms


and approaches used to analyze and design algorithms and to appreciate the impact of
algorithm design in practice. It also ensures that students understand how the worst-case
time complexity of an algorithm is defined, how asymptotic notation is used to provide a rough
classification of algorithms, how a number of algorithms for fundamental problems in
computer science and engineering work and compare with one another, and how there are
still some problems for which it is unknown whether there exist efficient algorithms, and how
to design efficient algorithms.
III. CREDIT

: 3 hrs/Week

V. PRE-REQUISITE

: IT/CS 101

VI. COURSE OBJECTIVES


students are expected to:

CSPC QUALITY POLICY


CSPC commits to provide quality education and services that satisfy its clients and
stake holders thereby producing world class professionals through continual improvements of all
its programs.

CICT GENERAL OBJECTIVE

Effectivity Date:

October 2012

: 3 units

IV. HOURS PER WEEK

The ladderized curricula in Information Technology, Electronics and Computer


Technology program is committed to prepare the students for professional career
imbued with the desired values, skill & knowledge needed in the development of

: Design and Analysis of Algorithm

III.

Contribute to the attainment of national goals;


Democratize access to educational opportunities;
Help accelerate countryside development by bringing college education within the reach of the rural
people
Promote the building of self-reliant and egalitarian society; and
Encourage and undertake researches for technology transfer and social uplift of the Bicolanos in
general and the services area in particular.

D.
E.

: CS 113

After completion of this course,

Define the different algorithm; understand its concept and how it is


used.
Classify various types of data structure and how the differ in terms
of usage and application.
Determine how certain algorithm is used in various cases.
Compare the logic behind the different algorithms used in computer
science.
Apply the different concept and principles learned by analyzing
different problem structures and algorithms.

Rev.0

Page 1 of 6

Republic of the Philippines


CAMARINES SUR POLYTECHNIC COLLEGES
Nabua, Camarines Sur

CSPC-F-COL-13

Demonstrate an understanding of the use of algorithm in Computer


Science and Information Technology.

SPECIFIC OBJECTIVES

COURSE OUTLINE

VALUES
TO BE
INTEGRAT
ED

TEACHING
METHODOLOGY/
STRATEGY
Consequence Game. Student
chosen randomly will
introduce themselves
mentioning only items given
by the teacher. Every after
student introduction one
student will answer question
related to the previous
introduction. If the latter will
not able to answer he will
face consequence by
showcasing his talent.
Assignment 1 will be given.
Students analyze the concept
explained by teacher through
PowerPoint Presentation

Course Orientation

1.5 hrs

Attentivene
ss
Responsibili
ty
Readiness
Discipline

Understand the meaning


and application of
algorithm.

Introduction to algorithm

9 hrs

Appreciatio
n
Readiness
Organizatio
n
Independen
t work

Identify different problem


types
Review the application and
importance of data
structure.

Fundamentals of
Algorithmic Problem
Solving
Important Types of Problem
Types of Data Structure
Concept of Array
Queue
List

Identify the different types

Effectivity Date:

Stack

October 2012

Model problems in Computer Science that will use an algorithm


acquired from the study.

TIME
ALLOTMEN
T

Discuss all the necessary


requirements such as
attendance, written
quizzes, long test, major
exams final projects and
compliance of standard
policies

Identify the phases of


problem analysis process

3 hrs

Appreciatio
n
Readiness
Organizatio
n
Team work

Students will create an


algorithm based on their
daily activity, focusing on the
characteristics of good
algorithm
Students explain in their own
understanding after teacher
discussion of the topic using
graphical presentation of the
Types of Data Structure.
Group Dynamics. Each group
will have 5 members. Each
member will have part on

Rev.0

MATERIALS
USED

EVALUATIVE
MEASURE

REMARK
S/
INPUT

Students
Handbook

N/A

N/A

Chalk,
blackboard,
slide
presentations,
handouts

Recitation, Quiz,
Assignments

To pass
the
recitation
,
assignme
nt, &
quizzes

Chalk,
blackboard,
slide
presentations,
handouts

Recitation, Quiz,
Assignments

To pass
the
recitation
,
assignme
nt, &
quizzes

Page 2 of 6

Republic of the Philippines


CAMARINES SUR POLYTECHNIC COLLEGES
Nabua, Camarines Sur

CSPC-F-COL-13

of data structure.

their group presentation.


Seatwork

prove the correctness and


analyze the running time of
the basic algorithms for those
classic problems in various
domains

Basic Algorithmic Analysis


Best, average, worst
case behaviors
Time and Memory
Complexity

3 hrs

Explain the mathematical


concepts used on
describing the complexity
of algorithm

Mathematical Analysis

6 hrs

Non recursive
algorithm
Recursive algorithm

Differentiate non-recursive
to recursive algorithm

Understand
the
Force algorithm
technique

Brute
design

Associate
Brute
Force
algorithm technique to
some important problem
solving

Brute Force Application


Selection Sort
Sequential Sort
Exhaustive Search
Combinatorial Problems
-

Effectivity Date:

Permutation
Combination

October 2012

6 hrs

PRELIMINARY EXAMINATION
Appreciatio Students analyze the concept
explained by teacher through
n
Readiness
PowerPoint Presentation
Group
collaboratio Students will be given
sample problems for them to
n
Attentivene work on and explain on the
board using the concept
ss
Appreciatio
n
Readiness
Group
collaboratio
n
Discipline
Organizatio
n

Appreciatio
n
Readiness
Group
collaboratio
n
Discipline
Organizatio
n

acquired on the discussion


Students analyze the concept
explained by teacher through
PowerPoint Presentation
Students will be given
sample problems for them to
work on and explain on the
board using the concept
acquired on the discussion.

Students analyze the concept


explained by teacher through
PowerPoint Presentation
Students will be given
sample problems for them to
work on and explain on the
board using the concept
acquired on the discussion.

Rev.0

Chalk,
blackboard,
slide
presentations,
handouts

Recitation, Quiz,
Assignments

To pass
the
recitation
,
assignme
nt, &
quizzes

Chalk,
blackboard,
slide
presentations,
handouts

Recitation, Quiz,
Assignments

To pass
the
recitation
,
assignme
nt, &
quizzes

Chalk,
blackboard,
slide
presentations,
handouts

Recitation, Quiz,
Assignments

To pass
the
recitation
,
assignme
nt, &
quizzes

Page 3 of 6

Republic of the Philippines


CAMARINES SUR POLYTECHNIC COLLEGES
Nabua, Camarines Sur

CSPC-F-COL-13

Pascal triangle
Euclidean algorithm

Seatwork (individual).
Chosen at randomly student
will present their work in
class.

MIDTERM EXAMINATION
Define Divide and Conquer
algorithm
design
technique and enumerate
its importance.

Divide and Conquer


Application
- Merge sort
- Quick sort
Binary search

6 hrs

Differentiate the types of


Greedy
Algorithm
techniques

Greedy Algorithm
Technique
- Prims algorithm
- Kruskals algorithm
- Dijkstras algorithm

3 hrs

Apply the different Greedy


algorithm techniques in
problem solving

VI.

Appreciatio Students analyze the concept


explained by teacher through
n
Readiness
PowerPoint Presentation
Group
Seatwork (individual).
collaboratio Chosen at randomly student
n
will present their work in
Discipline
class.
Organizatio
n
Appreciatio Students analyze the concept
explained by teacher through
n
PowerPoint Presentation
Readiness
Seatwork (individual).
Group
collaboratio Chosen at randomly student
will present their work in
n
class.
Discipline
Organizatio
n
FINAL EXAMINATION

Chalk,
blackboard,
slide
presentations,
handouts

Recitation, Quiz,
Assignments

To pass
the
recitation
,
assignme
nt, &
quizzes

Chalk,
blackboard,
slide
presentations,
handouts

Recitation, Quiz,
Assignments

To pass
the
recitation
,
assignme
nt, &
quizzes

COURSE REQUIREMENTS
a. Quizzes
b. Attendance
c. Recitation
d. Seatworks
e. Assignments
f. Examinations

Effectivity Date:

October 2012

Rev.0

Page 4 of 6

Republic of the Philippines


CAMARINES SUR POLYTECHNIC COLLEGES
Nabua, Camarines Sur

VII.

CSPC-F-COL-13

GRADING SYSTEM:
A. Class Standing
B. Quizzes
C. Major Exam
Total

30%
30%
40%
___________
100%

MTFG = PG + 2 (Tentative MGrade)


3
FG = MTFG + 2(Tentative FGrade)
3
VIII.

References

Anany Levitin, Introduction to the Design and Analysis of Algorithm, (3 rd Edition),


Pearson Education Inc, 2012.
Kleinberg, Jon &Tardos, Eva (2006) Algorithm Designm Pearson Education Inc.
Bernard Kolman& Robert C. Busby Discrete Mathematical Structures for Computer Science
2nd Edition 1987
Websites:
http://www.cse.iitd.ernet.in/~ssen/csl356/notes/root.pdf
Multimedia References:
a. JEDI Slides Design and Analysis of Algorithm Notes
b. PSITE Slides Design and Analysis of Algorithm Notes
c. CAL Slides Design and Analysis of Algorithm Notes

Classroom Management
:
Student of this course are expected to:
1. Take and pass all short/long quizzes, prelim, midterm and final examinations and subject requirements/ project.
2. Participate actively during recitation, individual or group activities, discussion, etc.
Effectivity Date:

October 2012

Rev.0

Page 5 of 6

Republic of the Philippines


CAMARINES SUR POLYTECHNIC COLLEGES
Nabua, Camarines Sur

CSPC-F-COL-13

3. Attend class punctually and regularly.


a. Student who has been absent for at least 20% of the hours of recitation, lecture, laboratory or any other scheduled in the subject for the
semester or any academic period shall automatically dropped from the class
b. If the student is the late for 15 minutes, the student will allowed attending classes but will marked absent. If he/she arrives during any
portion of the first 15 minutes he/she will be marked late. Two late will equivalents to one absent.
4. Observe honesty and independence during recitation, examinations quizzes. Any student caught to be dishonest will be dealt with accordingly
based on the College policies.
5. Act & speak decently and appropriately; pin their IDs and wear proper uniform during uniform days as prescribed by the College and proper
attire during wash days (Wednesday).
6. Make up for missed exams voluntarily. However, only those who have reasonable cause will be granted special examination. This will depend on
whether the students will be able to submit properly filled up admission slip from the DEANS office, Medical Certificate or Authorized letter from
parents/guardian.
7. Communicate to the instructor concerned, any difficulties encountered in the subject for necessary assistance.
8. Maintain the cleanliness and orderliness of the room/laboratory room.
9. Cell phones must be turned-off during class period.

PREPARED BY:
BEN L. SAMINIANO
TERESITA B. SALAZAR
Instructor 1

Effectivity Date:

October 2012

VERIFIED BY:

RECOMMENDING APPROVAL:

IAN P. BENITEZ

APPROVED BY:

CHALLIZ D. OMOROG

CICT Chairperson

Dean, CICT

Rev.0

DR.
VPAA

Page 6 of 6

You might also like