Design and Analysis of Algorithm
Design and Analysis of Algorithm
CSPC-F-COL-13
SYLLABUS
In
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.
I.
COURSE CODE
: 3 hrs/Week
V. PRE-REQUISITE
: IT/CS 101
Effectivity Date:
October 2012
: 3 units
III.
D.
E.
: CS 113
Rev.0
Page 1 of 6
CSPC-F-COL-13
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
Introduction to algorithm
9 hrs
Appreciatio
n
Readiness
Organizatio
n
Independen
t work
Fundamentals of
Algorithmic Problem
Solving
Important Types of Problem
Types of Data Structure
Concept of Array
Queue
List
Effectivity Date:
Stack
October 2012
TIME
ALLOTMEN
T
3 hrs
Appreciatio
n
Readiness
Organizatio
n
Team work
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
CSPC-F-COL-13
of data structure.
3 hrs
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
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
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
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.
6 hrs
Greedy Algorithm
Technique
- Prims algorithm
- Kruskals algorithm
- Dijkstras algorithm
3 hrs
VI.
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
VII.
CSPC-F-COL-13
GRADING SYSTEM:
A. Class Standing
B. Quizzes
C. Major Exam
Total
30%
30%
40%
___________
100%
References
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
CSPC-F-COL-13
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