Data Structures and Algorithms Syllabus
Data Structures and Algorithms Syllabus
Data Structures and Algorithms Syllabus
CORE SUBJECT INTENDED LEARNING OUTCOMES(CILOs): At the end of the semester, the learners should be able to do the following:
Utilize and implement the following:
1. Stacks
2. Binary trees
3. Trees
4. Graphs
5. Lists
6. Tables
7. Binary search trees
8. Hash tables
2
30 Mins. Oral Questioning
Lab Activity
1 Hour
Queues Learners are Lecture/Presentation of 2 Hours Oral Questioning Smart TV
o Sequential Representation expected to learn the subject to the
o Linked Representation the most effective Learners. PowerPoint
o Circular Queues and appropriate Lab Activity Presentation
o Application: Topological Menu and 2 Hours
Sorting Navigation Desktop Unit
Week 4
Design for a Eclipse IDE
Product. Lab Activity: The
learners are going to
prepare a java program
implementing stacks.
TOTAL – 100%
8
PREPARED AND SUBMITTED BY: REVIEWED BY : APPROVED:
ALVIN S. GALLO
FACILITATOR DR. EVA P. UNAY
VP for Academic Affairs
Date: Date: Date: