COLLEGE OF COMPUTER STUDIES

Bonifacio Street, Baranggay 3, Pio Duran, Albay

OUTCOMES-BASED EDUCATION SYLLABUS FOR DATA STRUCTURES AND ALGORITHMS

1st SEMESTER, SY 2019-2020

I. Course Title : CC104: DATA STRUCTURES AND ALGORITHMS

II. Course Description : This course presents the study of data structures, a fundamental component of a computer science education,
which serves as the foundation upon which many other computer science fields are built. Some knowledge of data structures is a must for students who wish to do
work in design, implementation, testing, or maintenance of virtually any software system.
This course divided into……………….

III. Course Unit : 3 units

IV. Time Allotment : 54 hours

V. Course Pre-requisite : None

VI. Course Learning Outcome : At the end of the course, the students will be able to:
1. understand the basic concepts and principles in data structures and algorithm.
2. solve problems on simple interest, compound interest, annuity, amortization, sinking funds, perpetuity,
depreciation, and bonds.
3. correlate what has been learned in this course with other fields of knowledge.
 VII. Course Contents

COURSE COVERAGE – PRELIMS

TEACHING LEARNING ACTIVITIES (TLA) ASSESSMENT TASKS (AT)

WEE UNIT EXPECTED TEACHING LEARNING ASSESSMENT TOOL

COURSE CONTENT RESOURCES
K OUTCOMES (UEO)

COURSE ORIENTATION 1.COURSE ORIENTATION Lecture Lecture  Selected Response  Answer key  Student Handbook
(MCQ)  Course Syllabus
 Explain the 1.1 IDC VMV  Lecture with  Facilitated
1 importance of discussion discussion
the course 1.2 PEO, PO, CO
content in
1.3 Course Outline
relation to
software
development

 Explain the 2.ALGORITHM AND DATA Lecture Lecture  Performance  Answer Key  Course Syllabus
importance of STRUCTURE Based  Rubric  Textbook
abstraction in  Deductive  Simulation  Online Materials
2.1 Concept of abstraction  Reporting
programming
2.2 Review of type definition Laboratory
Laboratory
2.3 Parameters and parameter  Problem Solving
passing  Demonstration  Programming
2  Program Sample
2.4 Design, implement and test Exercise
programmer-defined/abstract
data types involving arrays

2.5 Abstract Data Types

 Design ADT’s 3.ABSTRACT DATA STRUCTURE Lecture/Laboratory Lecture/Laboratory  Performance  Answer Key  Course Syllabus
using type Based  Rubric  Textbook
defs/structs/c 3.1 Classes/Structures  Demonstration  Simulation  Quiz
3 lasses  Program Example  Problem-based
 Design,  Problem Solving learning
 implement  Reporting (Programming)
and test
programmer-
defined/abstr
act data types 3.2 Class Definition/Type
4 definition involving structures
using
structures/cla
sses,
functions/met
hods.

 Illustrate the 4.LINK-LIST Lecture Lecture  Performance  Answer Key  Course Syllabus
behaviour of Based  Rubric  Textbook
different 4.1 Link-list  Discussion  Analogy  Quiz  Online Materials
linked list  Reporting
4.2 Link-list operations Laboratory
operations
5 and explain Laboratory
4.3 Link-list traversal  Program Exercise-
the
advantages  Program Simulation based learning
and
disadvantages
of using
linked list
 Design,
implement
and test
programmer-
defined/abstr
act data types
using linked
lists

6 PRELIMINARY EXAMINATION
 COURSE COVERAGE - MIDTERM
TEACHING LEARNING ACTIVITIES (TLA) ASSESSMENT TASKS (AT)

WEEK UNIT EXPECTED COURSE CONTENT TEACHING LEARNING ASSESSMENT TOOL RESOURCES
OUTCOMES (UEO)

 Describe and 5.STACK Lecture/Laboratory Lecture/Laboratory  Performance  Answer key  Course Syllabus
illustrate the Based  Rubric  Textbook
behavior of the 5.1 Stack definition  Programming  Problem Solving  Simulation
Stack abstract Exercises involving  Drills
5.2 Stack Application
data type stack like postfix
calculator, balanced
 Identify Sample 5.3 Stack implementation
symbols
applications using an array
7  Lecture
using a Stack
5.4 Stack implementation  Discussion
 Implement the
ADT Stack using
using a linked-list  Use of presentation
slides
arrays and
linked-list and
test each
operation
 Solve problems
using the Stack
ADT

 Describe and 6.QUEUES Lecture/Laboratory Lecture/Laboratory  Performance  Answer Key  Course Syllabus
illustrate the Based  Rubric  Textbook
6.1 Queue definition 
behavior of the Program Simulation  Problem Solving  Simulation
Queue abstract  Programming  Drills
6.2 Queue application
data type exercises involving  Simulation
8  Identify sample queues like first-
applications come-first-serve
using a Queue scheduling
problems
 Power Point
presentation
  Implement the 6.3 Queue implementation Lecture/Laboratory Lecture/Laboratory  Problem Solving  Answer Key  Course Syllabus
Queue ADT using using an circular array  Drills  Rubric  Textbook
arrays and  Program Simulation  Problem Solving  Simulation
linked-list and 6.4 Queue implementation  Programming  Drills
test each using a linked-list exercises involving  Simulation
9 operation queues like first-
 Solve problems come-first-serve
using Queues scheduling
problems
 Power Point
presentation

 Describe and 7.LIST & LINKED LIST Lecture/Laboratory Lecture/Laboratory  Problem Solving  Answer Key  Course Syllabus
illustrate the  Drills  Rubric  Textbook
behavior of the 7.1 List definition  Lecture  Problem Solving  Simulation
list abstract data  Discussion  Drills
7.2 List application
type  Use of presentation  Simulation
10  Implement the slides
ADT list using  Program Simulation
arrays and  Programming
linked-list and Exercises involving
test each lists
operation
 Solve problems
using Lists
 Compare the
performance/beh
avior of the
different
operations using 7.3 List implementation
array or linked- using an array
list
11 implementation
7.4 List implementation
using a linked-list

12
MIDTERM EXAMINATION

COURSE COVERAGE-PREFINALS
 TEACHING LEARNING ACTIVITIES (TLA) ASSESSMENT TASKS (AT)

WEEK UNIT EXPECTED COURSE CONTENT RESOURCES

TEACHING LEARNING ASSESSMENT TOOL
OUTCOMES (UEO)

 Define binary 8. Binary Trees Lecture: Lecture:  Performance  Answer  Course Syllabus
trees and binary Based Key  Textbook
8.1 Binary tree 
search trees  Lecture  Lecture Rubric
13  Discussion  Discussion
 Use of  Problem
presentation Solving &
slides Analysis
 Illustrate the  Illustrations
8.2 Binary tree Laboratory:
behavior of the
different binary representation of Laboratory:
search tree expression  Discussion
14 operations
 Demonstration  Simulation
 Simulation  Programming
Activities
with tree
application

 Perform binary 9. TREE TRAVERSAL Lecture: Lecture:  Performance  Answer  Course Syllabus
tree traversals; Based Key  Textbook
9.1 Binary traversal   
pre-order, post- Didactic lecture  Lecture Simulation Rubric
order, in-order  Inductive  Discussion
9.2 Binary search
lecture
trees  Problem
 Problem
solving &
solving &
analysis
15 decision
making
Laboratory:
Laboratory:
 Discussion
 Simulation
 Demonstration
 Work
 Simulation
Activities
 Discovery
teaching
  Draw tree 9.3 Binary traversal Lecture: Lecture:  Performance  Answer  Course Syllabus
representations Based Key  Textbook
9.4 Binary search   
of infix Didactic lecture  Lecture Simulation Rubric
expressions trees  Inductive  Discussion
 Implement binary lecture
9.5 Heap  Problem
trees and test  Problem
each operation
solving &
solving &
decision analysis
making
Laboratory:
16
Laboratory:
 Discussion
 Simulation
 Demonstration
 Work
 Simulation
Activities
 Discovery
teaching

17 PRE-FINAL EXAMINATION

COURSE COVERAGE-FINALS
WEEK UNIT EXPECTED COURSE TEACHING LEARNING ACTIVITIES (TLA) ASSESSMENT TASKS (AT) RESOURCES
OUTCOMES (UEO) CONTENT
TEACHING LEARNING ASSESSMENT TOOL

 Define a hash- 10. DEFINING HASH- Lecture: Lecture:  Performance  Answer  Course Syllabus
18 table TABLE Based Key  Textbook
 Lecture  Lecture  Simulation  Rubric
10.1 Hash-table  Discussion  Discussion
 Use of
presentation
 slides  Problem
 Illustrations Solving &
 Illustrate the 10.2 Hash-table  Program Analysis
behavior of operations Simulation
different hash- Laboratory:
19 table operations Laboratory:
 Discussion
 Demonstration  Simulation
 Simulation  Work
 Discovery Activities
teaching

 Explain the 10.3 Open Hashing Lecture: Lecture:  Performance  Answer  Course Syllabus
advantages of Based Key  Textbook
10.4 Closed Hashing   
using hash-table Didactic lecture  Lecture Simulation Rubric
in improving  Inductive lecture  Discussion
add, search, and  Problem solving  Problem
20 delete & decision
operations solving &
making
analysis
Laboratory:
Laboratory:
 Demonstration
 Discussion
 Simulation
 Simulation
 Discovery  Work
teaching Activities

 Define and 11. GRAPHS Lecture: Lecture:  Performance  Answer  Course Syllabus
characterize Based Key  Textbook
11.1 Graph   
graphs Didactic lecture  Lecture Simulation Rubric
21 definition  Inductive lecture  Discussion
 Problem solving  Problem
11.2 Graph
& decision
 Identify sample application solving &
making
applications of analysis
graphs
 Laboratory: Laboratory:
 Represent
graphs using 11.3 Graph  Demonstration  Discussion
adjacency matrix Representation  Simulation  Simulation
and adjacency  Discovery  Work
22 list
11.4 Graph Activities
Traversal teaching

 Illustrate the
process of graph
traversals BFS
and DFS

23 FINAL EXAMINATION
 VIII. Course Requirements : Active Class Participation
Regular Attendance
Written Outputs, Researches, Seat Works, Group Works, and Presentations/Projects.

IX. Grading System : Class Standing 70%

Quizzes/Attendance 30%
Recitation 25%
Presentations/Projects 15%
Term Examinations 30%
Total 100%
X. References:

Websites:

Prepared by: Noted by: Recommending Approval: Approved:

Ali C. Olleres ________________________ ___________________________

Instructor Dean/Coordinator VPAA President/CEO