MALLIG PLAINS COLLEGES

Casili, Mallig, Isabela

COLLEGE OF INFORMATION TECHNOLOGY EDUCATION

SYLLABUS
School Year 2013-2014

Course No.: Comp 7 No. of Units: 3 Time: Days:

Course & Year: BSCS 2 Building & Room No.: Consultation Hours:
Descriptive Title: Design and Analysis of Algorithm
Course Objectives:
 Design effective, efficient, elegant, and readable algorithms for various classes of computing problems
 Determine space and time complexity of algorithms
 Use various algorithm design techniques (divide and conquer, backtracking, greedy, etc)

Objectives & Learning Strategies and Expected Outcomes

Topics & Time Allotment
Classification Levels Assessment Activities and/or Results
Orientation Internalize the meaning and Discussion Sincerity
MPC – Philosophy, Mission, Vision the message of the MPC Group Loyalty
& Objectives and ICS Dept PVMO Buzzing Obedience
ICS Dept - Mission, Vision &
Objectives
(1hr)
Mathematical Tools in Analysis - Identify and differentiate Lecture Clear knowledge and
the three proof techniques. Recitation application of different
 Proof Techniques - Differentiate between the Group Activity Mathematical tools in
theorem & proof Library Work analysis
 Recurrence Relation - Know the summation Assignment
formula & properties Seatwork/Laboratory
 Generating Functions Knowledge (C1), Quiz/Hands-on
Comprehension (C2),
(16hrs) Application (C3), Analysis
 (C4), Organization (A4)
PRELIM EXAMINATION
Basic Algorithmic Analysis - Understand the Lecture Clear knowledge and
techniques in algorithms Recitation application of different basic
 Best, average, worst - Know the symbols in Group Activity algorithmic analysis
case behaviors complexity classes Library Work
- Solve the problems in Assignment
 Time and Memory Worst- Best- & Average- Seatwork/Laboratory
Complexity case analysis Quiz/Hands-on
Knowledge (C1),
(16hrs) Comprehension (C2),
Application (C3), Analysis
(C4), Organization (A4)
MIDTERM EXAMINATION
Algorithmic Strategies - Know the methods used Lecture Clear knowledge and
in designing algorithms Recitation application of different basic
 Brute Force - Know the dynamic Group Activity algorithmic analysis and,
algorithms programming using Library Work sorting and searching
 Greedy algorithms mathematical formula to be Assignment
 Divide-and-Conquer translated directly to Seatwork/Laboratory
strategies algorithms. Quiz/Hands-on
 Backtracking - Understand what is
 Branch-and-bound backtracking
 Heuristics Knowledge (C1),
Comprehension (C2),
Sorting and Searching Application (C3), Analysis
(16hrs) (C4), Organization (A4)
FINAL EXAMINATION

Course Requirements:
1. Major Examinations
2. Attendance
3. Quizzes
4. Projects
5. Laboratory Activities
 6. Participation in the class discussion

Grading System:
ClassStanding = 90%(Quiz+Recitation+Assignment+LaboratoryActivities+Project) + 10%(Attendance)
PrelimGrade = 2/3ClassStanding + 1/3PrelimExam
MidTermGrade = 2/3 PrelimGrade + 1/3MidTermTentativeGrade
FinalGrade = 2/3 PrelimGrade + 1/3FinalTentativeGrade

References:

Books
1. Drozdek, Adam, Java: Data Structure and Algorithms, 2008
2. Drozdek, Adam, Data Structure and Algorithm in C++, 2007
3. Goodrich, Michael, Data Structure and Algorithm in Java, 2004
4. Weiss, Mark Allen, Data Structure and Algorithm Analysis in C++, 2003

Websites
1. http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html
2. http://www.aw-bc.com/info/levitin/
3. http://ics.uplb.edu.ph/courses/ugrad/cmsc/142
4. http:// www.cse.iitd.ernet.in/~ssen/csl356/.../root.pdf

Online Journals
1. http://www.journals.elsevier.com/journal-of-discrete-algorithms/
2. http://www.springer.com/computer/theoretical+computer+science/book/978-0-387-97687-7
3. http://www.personal.kent.edu/~rmuhamma/Algorithms/algorithm.html

Prepared by: Noted by:

JERIKO G. PELIMIANO DRYMLAD A. REBAJA GEORGE A. BORROMEO, MIT

Instructor Instructor Dean