Achievers International College of Culinary Arts and Technology, Inc.
Zamboanga City
Information and Communication Technology PQF Level 5 (Diploma Program)
3 – year Diploma in Information and Communication Technology
Leading to Bachelor of Science in Information Technology
SYLLABUS IN INTRODUCTION TO HUMAN COMPUTER INTERACTION
COURSE NAME CC 104 – DATA STRUCTURES AND ALGORITHMS
COURSE CREDITS 3
COURSE DESCRIPTION This course covers the standard data representation and algorithms to solve computing
problems efficiently. This covers the following: Stacks, Queues, Trees, Graphs, Maps and
Sets. Thorough discussion of sorting and searching algorithms and hashing are covered.
CONTACT HOURS 3 hours lecture, 6 hours laboratory/week
PREREQUISITES
COURSE OUTCOMES This course intends to:
A. Design, implement, test, and debug a program based on a given specification that
uses and implements abstract data types;
B. Select, implement, and evaluate the data structures for specific programming
problems;
C. Argue strengths and weaknesses among multiple implementations for a problem;
and
D. Use and manage memory effectively in data representation.
REQUIRED Data Structures and Algorithms made easy
TEXTBOOKS/REFERENCES Revised Edition 2010
By: Klarumanchi, N.
ASSESSMENT METHODS Basic requirements of Data Structures and Algorithms that includes:
1. Presentation of the preliminaries.
2. Oral recitation for the specific questions ask during reporting of students
3. Assignments, quizzes and demonstrations
LEARNING PLAN/DETAILED COURSE OUTLINE:
A. PRELIM
WK HRS LEARNING OUTCOME TOPIC STRATETIGES/ ASSESSMENT OF
LEARNING OUTCOMES
ACTIVITIES
LO1:Identify the abstract Fundamentals of Data Discussions Regular lectures and
data types Structures and Researching discussions
2 10 Algorithms Hands-on-activity Oral Recitation
Data Structures Quiz
Algorithm Laboratory
LO2:Determine the output Recursion Discussion Quizzes
of recursive methods Fundamentals of Demonstration Oral Recitation
1 5 Recursion Hands-on-activity Laboratory
Recursion versus
Iteration
Types of Recursion
LO3: Distinguish linked list Linked Lists Discussion Quizzes
from array Linked List Demonstration Oral Recitation
1 5 Operations Hands-on-activity Laboratory
Linked List versus Major
Array Examination
Types of a Linked List
B. MIDTERM
LO4: Analyze the Stacks Discussion Quizzes
differences among stack Fundamentals Demonstration Oral Questioning
1 5 Stacks Applications Hands-on-activity Laboratory
operations
LO5: Differentiate the built Queues Discussion Quizzes
– in Java and Python Fundamentals Demonstration Oral Questioning
1 5 Other Queue Hands-onactivity Laboratory
methods
Methods
LO6: Identify the parts of a Trees Discussion Quizzes
node Fundamentals Demonstration Oral Questioning
1 5 Tree Traversal Hands-on activity Laboratory
Programming Trees Major
Examination
C. SEMI-FINALS
LO7:Determine what type Heaps and Priority Discussion Quizzes
of heap is Queues Demonstration Oral Questioning
1 5 Heaps Hands-on-activity Laboratory
Priorities Queues
LO8: Perform common set Sets and Maps Discussion Quizzes
operations Sets Demonstration Oral Questioning
2 10 Maps Hands-on-activity Laboratory
Major
Examination
D. FINALS
LO9: Identify the vertices, Graphs Discussion Quizzes
edges, and paths in a graph Fundamentals Demonstration Oral Questioning
1 5 Graph Hands-on-activity Laboratory
Representation
LO10: Compare the types of Sorting Algorithms Discussion Quizzes
sorting Fundamentals Demonstration Oral Questioning
1 5 Hands-on-activity Laboratory
1 5 LO11: Cite examples of Machine Learning Discussion Quizzes
machine learning Fundamentals Demonstration Oral Questioning
Machine Learning Hands-on-activity Laboratory
Models Major
Examination
CRITERIA PRELIM MIDTERM SEMI-FINAL FINAL
ATTENDANCE 10% 10% 10% 10%
QIUZ/ORAL PARTICIPATION 20% 20% 20% 20%
LABORATORY/MAJOR OUTPUTS 40% 40% 40% 40%
MAJOR EXAMINATION 30% 30% 30% 30%
TOTAL 100% 100% 100% 100%
Prepared by: Approved by: Noted by:
DR. NELLY SUAN YTING
Faculty Member Chairperson School President
