xxxx TECHNOLOGICAL COLLEGE FOUNDATION INC.

Astillero Bldg, Rizal St., Leg City

COLLEGE OF COMPUTER STUDIES

OBE SYLLABUS for DESIGN ANALYSIS OF ALGORITHM
1st Semester, 2015-2016
I.

Course Title

DESIGN ANALYSIS OF ALGORITHM

II.

III.

Course Description
:
This course will eye o algorithm which is a finite set of precise instructions for performing a computation or for solving a problem.
This course will analyse different algorithm to compare them mainly in terms of running time but also in terms of other factors (e.g. memory, requirements, programmers
effort, etc.) This will help the student to choose what will be best for a particular problem/job involves, among other factors, two important measures: time complexity (how
much time an algorithm will take to render the result?) and space complexity (how much storage will the algorithm need?).
Course Unit
:
3 Units

IV.

Time Allotment

54 Hours

V.

Pre-requisite

None

VI.

Course Learning Outcomes

After successful completion of the course, the student should be able to:
1. Recognize the different algorithms for solving programming problems.
2. Proficiently evaluate the benefits and drawbacks of particular algorithm in terms of memory and run time efficiency.
3. Know the different ways of organizing the data to facilitate such efficient use.
4. Design, analyse and calculate running time of an algorithm.

COURSE COVERAGE-PRELIMS
WEEK

UNIT EXPECTED
OUTCOMES (UEO)
COURSE ORIENTATION
o Explain the mission
and vision of IDC
o Relate how the
study of Computer
Science shares
achieving the vision
and mission of the
university
o Outline the content
of the course
syllabus and
requirements
o Knowledge about
Algorithm, Tracing,
and efficiency

o
3

Illustrate a problem
analysis and
production in
solving the best
algorithm using
pseudo codes and
table tracing.

COURSE CONTENT

1.COURSE ORIENTATION
1.1IDC VMV
1.2PEO, PO, CO
1.3Course Outline

2.Algorithm
2.1 What is algorithm
2.2 Importance of
algorithm
2.3 Algorithm
properties
2.4 Tracing an Algorithm
2.5 Input/output
2.6 Branching statements
(if, if else)

TEACHING-LEARNING ACTIVITIES
(TLA)
TEACHING
LEARNING
Lecture
Lecture
o Lecture with
o Facilitated
discussion
discussion

Lecture
o Deductive

Lecture
o Simulation

Laboratory
o Demonstrati
on
Lecture/Laborato
ry
o Demonstrate
o Problem
Solving

Laboratory
o Problem
Solving
Lecture/Laborato
ry
o Simulation
o Problembased
learning

ASSESSMENT TASKS (AT)

ASSESSMENT
Selected
Response
(MCQ)

TOOL
Answer Key

RESOURCES

Student
Handbook
Course Syllabus

Performance
Based

o
o

Answer Key
Rubric

o
o
o

Course Syllabus
Textbook
Online Materials

Performance
Based

o
o

Answer Key
Rubric

o
o

Course Syllabus
Textbook

2.7 Looping statements

(for, while, do.while)
2.8 Array

o
5

Knowledge in
Algorithm Mantra and
application

3. Algorithm Design
Mantra
3.1 Designers View
3.2 Algorithm
Comparison

6
WEEK

UNIT EXPECTED
OUTCOMES (UEO)

Application and
comparison for
Algorithm

Practise
appropriate
calculation of
runtime by the
use of benchmark

COURSE CONTENT

4. Algorithm Analysis
4.1 Experimental
Analysis

5. Steps in
benchmarking analysis
5.1 Algorithm
implementation
5.2 Calculation of running
time (using benchmark)

Lecture
o Reflective
teaching
Laboratory
o Problem
Solving

Lecture
o Analogy

Performance
Based

o
o

Answer Key
Rubric

Laboratory
o ProblemBased
learning
PRELIMINARY EXAMINATION
COURSE COVERAGE-MIDTERM
TEACHING-LEARNING ACTIVITIES
ASSESSMENT TASKS (AT)
(TLA)
TEACHING
LEARNING
ASSESSMENT
TOOL
Lecture/Labora Lecture/Labora o Performance
o Answer Key
o Rubric
tory
tory
Based
o Simulation
o Deductive
o Problem
o Demonstratio
Solving
o Drills
n
Lecture/Labora Lecture/Labora o Performance
o Answer Key
o Rubric
tory
tory
Based
o Simulation
o Demonstratio o Problem
n
Solving
o Deductive
o Drills
o Simulation

o
o
o

Course Syllabus
Textbook
Online Materials

RESOURCES

o
o

Course Syllabus
Textbook

o
o

Course Syllabus
Textbook

o
10

11

12

5.3 Plotting algorithm

runtime

Practise solution for

using an effective
Algorithm through
Experimental
Analysis

6. Drawback of
Experimental Analysis
6.1 Experimental tools in
behavioural research
6.2 Experimental Data for
Communication testing
6.3 Attainment Function
Approach
6.4 Design Analysis of
Computational
Experiments
6.5 Experimental Analysis
vs. Theoretical

Lecture/Labora
tory
o Inductive
o Lecture
o Problem
Solving
o Demonstratio
n
o Discovery
Teaching

Lecture/Labora
tory
o Demonstratio
n
o Deductive

Lecture/Labora
tory
o Problem
Solving
o Work
activities
o Simulation

Lecture/Labora
tory
o Problem
Solving
o Drills
o Simulation

o
o

o
o

Performance
Based
Simulation

Performance
Based
Simulation

MIDTERM EXAMINATION

o
o

o
o

Answer Key
Rubric

Answer Key
Rubric

o
o

o
o

Course Syllabus
Textbook

Course Syllabus
Textbook

COURSE COVERAGE-PREFINALS
WEEK

UNIT EXPECTED
OUTCOMES (UEO)
o

13

Practise Algorithm
Analysis through a
different method
using Theoretical
Analysis

COURSE CONTENT

7. Theoretical Analysis
7.1 Alternative for parallel
Search
7.2 Heuristic branching
factor
7.3 Distributive tree vs.
Parallel Window Search

14

15

Knowledge about
counting primitive
operation for analysing
possible Algorithm

TEACHING-LEARNING ACTIVITIES
(TLA)
TEACHING
LEARNING
Lecture/Labora Lecture/Labora
tory
tory
o Didactic
o Lecture
Lecture
o Discussion
o Inductive
Lecture
o Problem
o Problem
Solving &
solving &
Decision
Analysis
Making
Laboratory:
Laboratory:
o Discussion
o Demonstratio o Simulation
o Work
n
o Simulation
Activities
o Discovery
Teaching

8. Counting Primitive
Operation
8.1 Input/ Output operations
8.2 Iterative Statements
8.3 Conditional Statement
8.4 Worst Case/ Best Case
Scenario

Lecture
o Didactic
Lecture
o Inductive
Lecture
o Problem
Solving &
Decision
Making
Laboratory

Lecture
o Lecture
o

Discussion

Problem
solving &
Analysis
Laboratory:
o Discussion
o Simulation
o

ASSESSMENT TASKS (AT)

ASSESSMENT
Performance
Based
o Simulation
o

o
o

Performance
Based
Simulation

o
o

TOOL
Answer Key
Rubric

o
o

Answer Key
Rubric

RESOURCES

o
o

Course Syllabus
Textbook

o
o

Course Syllabus
Textbook

o
o
o

16

Recognize the role of a

good algorithm using
the Asymptotic
Analysis for a good
Design

17

Demonstration
Simulation
Discovery
Teaching

Work Activities

9. Asymptotic
Analysis(using Big-O
notation)
9.1 Functions for Growth
Rate
9.2 Big-O theorems/
Mathematical definition of
Big-O

Lecture
o Didactic
Lecture
o Inductive
Lecture
o Problem
Solving &
Decision
Making

Lecture
o Lecture

9.3 Big-O Calculation

9.4 Calculation of
Running Time

Laboratory
o Demonstration
o Simulation
o Discovery
Teaching

Laboratory:
o Discussion
o Simulation
o Work Activities

18

Discussion

Problem
solving &
Analysis

o
o

Performance
Based
Simulation

o
o

Answer Key
Rubric

o
o

Course Syllabus
Textbook

PREFINAL EXAMINATION

COURSE COVERAGE-FINALS
WEEK

UNIT EXPECTED
OUTCOMES (UEO)

COURSE CONTENT

TEACHING-LEARNING ACTIVITIES (TLA)

TEACHING
LEARNING

ASSESSMENT TASKS (AT)

ASSESSMENT
TOOLS

RESOURCES

19

Knowledge in the
different Algorithm
Manually and
through program

20
o

Knowledge in Data
Compression by
reducing static
redundancy

21

10. Algorithms
10.1 Sorting Algorithms
10.2 Searching Algorithms
10.3 Graph Algorithms

10. Data Compression

Algorithm
10.1 Machine Learning
10.2 Data Difference
10.3 Huffman Coding
10.4 Lempel-Ziv Coding

Lecture
o Didactic
Lecture
o Inductive
Lecture
Laboratory
o Demonstration
o Discovery
teaching

Lecture
o Didactic
Lecture
o Inductive
Lecture
o Problem
Solving &
Decision
Making
Laboratory:
o Demonstrate
o Simulation
o Discovery
teaching

Lecture
o Lecture

o
o

Discussion
Problem
Solving &
Analysis

Laboratory
o Simulation
o Work activities
Lecture
o Lecture

o
o

Discussion
Problem
Solving &
Analysis

o
o

Performance
Based
Simulation

Performance
Based
Simulation

o
o

Answer Key
Rubric

o
o

Course Syllabus
Textbook

o
o

Answer Key
Rubric

o
o

Course Syllabus
Textbook

Laboratory:

o
o
o

Discussion
Simulation
Work
Activities

FINAL EXAMINATION

V. Grading System

: Reminders: Final grades should be whole number (rounded off)

Highest grade is 96. Lowest passing grade is 75 (if 74 or 73, round it off to 75)
Failing grade is 70 (if 72 or 71, round it off to 70). Final Grade is the average grade of PL, MT, PF, F,

Use conversion/transmutation table to get equivalent of scores

IX. References

PREPARED BY:

ENDORSED BY:

APPROVED BY:

ARCHIE S. LASALITA

JOAN F. PAVIA

LYDIA B. LOZANO

Instructor

Dean, College of Computer Studies

VP-ACADEMIC AFFAIRS