CP_CC104 – DATA STRUCTURES AND
ALGORITHMS
I. INSTITUTIONAL VISION
To become the leading institution for professional development and the foremost provider of quality,
affordable, and sustainable education that transforms learners into competent and globally competitive
professionals.
II. INSTITUTIONAL MISSION
To provide excellent and accessible education for the holistic development of students, nurturing
responsible, innovative, and skilled professionals equipped with strong values and dignity.
III. CORE VALUES
• Star that Shines – Strive for excellence in all endeavors.
• Truthfulness – Uphold honesty in thoughts, words, and actions.
• Compassion – Show genuine care and concern for others.
• Love – Cultivate self-respect, empathy, and commitment to noble causes.
• Amiable – Demonstrate kindness and positive relationships.
• Righteousness – Uphold integrity and ethical standards.
• Ever Loyal – Remain steadfast to the ideals of the institution.
IV. INSTITUTIONAL OUTCOMES
• Intellectual creativity, critical thinking, and innovativeness.
• Effective communication skills in reading, writing, listening, and speaking.
• Leadership effectiveness and managerial skills.
• Strong sense of nationalism and global responsiveness.
• Ethical standards of excellence in personal and professional life.
• Commitment to quality service and collaboration.
• Proficiency in Information and Communication Technology (ICT).
• Community engagement and social responsibility.
• Passion for lifelong learning.
• Strong spiritual and moral values.
V. COURSE DESCRIPTION
This course introduces students to fundamental concepts of data structures and algorithms,
emphasizing efficient data organization and problem-solving strategies. Topics include arrays, lists,
stacks, queues, trees, graphs, hashing, sorting, searching, and dynamic programming. Students will
also gain experience in analyzing algorithmic complexity and applying solutions to real-world
computational problems.
VI. COURSE EXPECTED OUTCOMES
• Understand the importance of data structures and algorithms in software development.
• Analyze algorithm efficiency using time and space complexity.
• Implement and utilize fundamental data structures and algorithms.
• Apply computational techniques to solve real-world problems.
• Develop problem-solving and critical thinking skills through coding exercises and projects.
VII. COURSE PLAN
Weeks Course Content
1 Orientation and Introduction to Data Structures and Algorithms
Basics of algorithms, importance of analysis, asymptotic notation (Big-O, Θ, Ω)
2-3 Arrays and Lists: 1D/2D arrays, linked lists, doubly linked lists, dynamic arrays
4-5 Stacks and Queues: Concepts, implementation, applications, and real-world use cases
6-7 Trees: Binary trees, binary search trees, AVL trees, traversals
8-9 Graphs: Representation, BFS, DFS, shortest paths (Dijkstra, Floyd-Warshall)
10-11 Sorting and Searching: MergeSort, QuickSort, Binary Search, Hashing techniques
12-13 Dynamic Programming: Concepts, recursion, optimization problems
14-15 Advanced Topics: Heaps, Tries, B-Trees, introduction to parallel/distributed algorithms
16-17 Review, Final Project Preparation, Case Studies
18 Final Examination
VIII. REFERENCES
• Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms. MIT
Press.
• Sonza, R. L., & Pascual, V. C. Data Structures and Algorithms.
• Weiss, M. A. (2014). Data Structures and Algorithm Analysis in Java. Pearson.
• Sedgewick, R., & Wayne, K. (2011). Algorithms. Addison-Wesley.
IX. GRADING SYSTEM
Component Percentage
Class Performance (activities, quizzes, reports, group work) 40%
Project 25%
Examinations 35%
X. COURSE REQUIREMENTS
• Attendance
• Class performance
• Examinations
• Final project
XI. CLASSROOM POLICIES
• Attend class regularly.
• Submit all written and oral requirements on time.
• Actively participate in discussions and group work.
• Observe academic integrity (no cheating or plagiarism).
• Accomplish the final project presentation.
Prepared by: Mark Feliciano
Instructor
Recommending Approval:
__________________________
Assistant Dean
Approved by:
__________________________
President/VP for Academic Affairs
