COLAND SYSTEMS TECHNOLOGY INCORPORATED

Peñas Building, Sinsuat Avenue

Cotabato City

COLLEGE OF COMPUTER STUDIES

Course Title: Data Structures and Algorithms

Course Code: CS 122/IT 213
Credit Units 3 Units
Course Prerequisite: Computer Programming 2, Fundamentals of Programming
Course Description Solving computational problems that involves manipulating collections of data, study a core set of data abstractions, data structures and
algorithms that provide a foundation for writing efficient programs.

Vision Statement:
As an institution, Coland Systems Technology Incorporated envisions to:
 Inculcate patriotisms, nationalism, love of humanity and environment, respect for human rights, personal discipline and critical thinking.
 Constantly strive in making a positive difference in the lives of the graduates and the people in the community.

Mission Statement:
 Provide, promote and protect the rights of students to quality education at all levels and shall take appropriate and concrete steps to make education accessible, as well as
affordable to all.
 Establish, maintain and support adequate, complete and integrated system of education, catering the relevant needs of Filipino people at present time.
 Institute and maintain a system of scholarship grants, loan program and other form of incentives, which shall be available to the marginalized, underprivileged and most
especially to the poorest of the poor, but deserving students.
 Encourage non - formal, informal, indigenous learning's, as well as self - learning systems, and out - of - study programs, responsive to the needs of the community.
 Provide adult education to the disabled, out - of - school youth with trainings in civics, vocational efficiency and other skills.

Institutional Learning Outcomes Program Outcomes Course Outcomes

1. Creative and Critical Thinking
Graduates use their imaginative as well as rational
thinking abilities to life situations in order to push
boundaries, realize possibilities, and deepen their
interdisciplinary and general understanding of the
world.
2. Effective Communication
Graduates are proficient in the four macro skills in
communication (reading, writing, listening and
By the time of graduation, the students of the program shall have After completing the course, the student must
the ability to: be able to:
a. Apply knowledge in mathematics and science to solve  Recognize the different linear and non
complex engineering problems; - linear data structures
b. Design and conduct experiments, as well as to analyze and
interpret data;  Graphically represent any data
c. Design a system, component, or process to meet desired structures
needs within realistic constraints such as economic,
 COLAND SYSTEMS TECHNOLOGY INCORPORATED
speaking) and are able to use these skills in solving
problems. Making decisions and articulating thoughts
when engaging with people in various circumstances.
3. Strong Service Orientation
Graduates exemplify the potentialities of an efficient,
well – rounded and responsible professional deeply
committed to service excellence.
4. Community Engagement
Graduates take an active role in the promotion and
fulfillment of various advocacies (educational, social
and environmental) for the advancement of
community welfare.
5. Adeptness in the Responsible Use of Technology
Graduates demonstrate optimized use of digital
learning abilities, including technical and numerical
skills.
6. Passion to Lifelong Learning
Graduates are enabled to perform and function in the
society by taking responsibility in their quest to know
more about the world through lifelong learning.
7. High Level of Leadership and Organizational Skills
Graduates are developed to become the best
professionals in their respective disciplines by
manifesting the appropriate skills and leadership
qualities.
8. Sense of Personal and Professional Ethics
Graduates show desirable attitudes and behavior either
in their personal and professional circumstances.
9. Sense of National and Global Responsiveness
Graduates deep sense of national compliments the
need to live in a global village where one’s culture and
other people culture are respected.
Peñas Building, Sinsuat Avenue
Cotabato City
environmental, social, political, ethical, health and safety,  Have a clear understanding of the
manufacturability and sustainability, in accordance with algorithm for creating, accessing and
standards; destroying structural information
d. Function on multidisciplinary teams;
e. Identify, formulate and solve complex engineering  Write programs using the different
problems data structures
f. Understanding of professional and ethical responsibility
g. Communicate effectively  Apply programming techniques like
h. Broad education necessary to understand the impact of searching and sorting in problem
engineering solutions in a global, economic, environmental, solving
and societal context;
i. Recognition of the need for, and an ability to engage in life
– long learning;
j. Knowledge of contemporary issues;
k. Use technique, skills and modern engineering tools
necessary for engineering practice and
l. Knowledge and understanding of engineering and
management principles as a member and leader in a team,
to manage projects and in multidisciplinary environments.
 COLAND SYSTEMS TECHNOLOGY INCORPORATED
Peñas Building, Sinsuat Avenue
Cotabato City
Course Plan
Week Topic Learning Outcomes Methodology Resources Assessment
Class orientation with Vision, Mission, Familiarize student on Outcome – Based Orientation
Goal and Objective Education Course None
Review of the syllabus, Syllabus
Discussion of course goals, expected Orient the student on the course syllabus, grading learning activities and
outcomes, course policies and grading system and classroom rules assessment
system
Getting to know
activity

Ice breaker Activity

1 Introduction to Data Structures Quiz
Learn what are data structures Lecture/Discussion Goodrich,
 What are data structures? Michael and Machine Problem
 Types of data structures Identify the different types of data structures Program Demonstration Roberto
 Importance of data structures Data Structure Program Tracing
 Application of data structures Know the importance and applications of data Recitation/Board Word and Algorithm
structures Lab Activity
2 Array and Review on Functions
 One – dimensional and two Learn how to declare arrays in programs Lecture/Discussion Goodrich, Quiz
dimensional arrays Michael and
 Review of Programmer – defined Differentiate one – dimensional from two Program Demonstration Roberto Machine Problem
and predefined functions dimensional arrays Data Structure
Recitation/Board Work and Algorithm Program Tracing
Review functions
Lab Activity
Functions calling and returning arrays

3 Structures Understand the structure values and member Lecture/discussion Quiz

 Ways of declaring a structure values
 Accessing structure members Program demonstration Machine Problem
 Declaring nested structures Demonstrate how to declare a structure
 Accessing members in a nested Recitation/Board Work Program Tracing
structure Understand the differences between a structure
and function Lab Activity

4 Pointers
 Declaration, assignment and
referencing
 Relationship between array and
pointers
 Structure and pointers
 Pointers arithmetic
5–6 Linked List
 Concept of linked list
 Adding, deleting, inserting and
searching in a link list
 Types of linked list
 Applications of linked list
7–8 Stacks
 Push and Pop
 Stack used in arithmetic operation
 Infix, postfix and prefix notation
 Conversion between infix, postfix,
and prefix
 Applications of stacks
COLAND SYSTEMS TECHNOLOGY INCORPORATED
Peñas Building, Sinsuat Avenue
Cotabato City
Understand the differences between a structures
and pointers
Explore the use of structures in a program
Learn about the pointers and its syntax definition Lecture/discussion Quiz
Demonstrate how to declare a pointer just like Program demonstration Machine Problem
declaring an ordinary variable of a certain type
Recitation/board work Program Tracing
Use of assignment operator with pointer variables
Lab Activity
Learn about the type of definitions
Explore the use of pointers as Call – by – Value
Explore in creating a program implementing
dynamic arrays and pointer arithmetic
Learn the concept of linked list Lecture/discussion Quiz
Identify the basic characteristics of linked list and Program demonstration Machine Problem
the different types of linked list
Recitation/board work Program Tracing
Implement linked list using programs
Lab Activity
Explore the adding, deleting, inserting and
searching of nodes in a linked list
Learn the concept of stacks and queues Lecture/discussion Quiz
Identify the basic characteristics of stacks Program demonstration Machine Problem
Explore in creating programs that implements Recitation/board work Program Tracing
stacks using programming language
 COLAND SYSTEMS TECHNOLOGY INCORPORATED
Peñas Building, Sinsuat Avenue
Cotabato City
Lab Activity
Understand the importance and application of
stacks and queues

Learn how to convert infix, postfix, and prefix

expressions
9 MIDTERM EXAMINATION
10 – 11 Queues and Dequeues
Learn the concept of queues and dequeues Lecture/Discussion Quiz
 Differences between stacks and
queues Identify the basic characteristics of queues Program Demonstration Machine Problem
 Differences between queues and
dequeues Explore in creating programs that implement Recitation/Board work Program Tracing
 Types of Queues Queues and Dequeues using ____ programming
 Applications of Queues and language Lab Activity
Dequeues
Understand the importance and application of
Queues and Dequeues
12 – 13 Binary Tree
 Binary tree concepts and Familiarize binary tree and detailed terminologies Lecture/discussion Quiz
terminologies needed for comprehensive understanding of tree
 Adding, deleting and searching in a Program demonstration Machine Problem
tree Learn how to organize data in a binary search tree
 Traversing a binary tree and perform insertion and deletion of items in a Recitation/Board work Program Tracing
 Binary search tree binary search tree
 Arithmetic expression tree Lab Activity
 Application of binary tree Learn the structure of binary trees and how to
perform various binary tree traversal algorithms
14 Sorting and Searching Algorithms
 Selection sort Learn the different sorting techniques Lecture/discussion Quiz
 Bubble sort
 Insertion sort Apply programming techniques like searching and Program demonstration Machine Problem
 Merge sort sorting in solving problems
 Quick sort Recitation/board work Program Tracing

Lab Activity
 COLAND SYSTEMS TECHNOLOGY INCORPORATED
Peñas Building, Sinsuat Avenue
Cotabato City
15 Graph Give the formal definition of a directed graph and
 Graph definition of an undirected graph Lecture/discussion
 Representation of graphs Quiz
 Topological sort Differentiate directed and undirected graphs Program demonstration
 Shortest path algorithm Machine Problem
 Network flow problem Define path in a graph, a cycle in a graph Recitation/board work
 Minimum spanning tree Program Tracing
Define the conditions when two vertices in a
graph connected Lab Activity

Define the conditions when would a path in a

graph be known as a simple path
16 Application Project Presentation Culminating activity given to the grouped students
to test their mastery of the course by developing Project presentation Application Project deliberation
application programs utilizing all the theories and project
concepts acquired System Walk – through documentation

Simulation Developed
system
18 FINAL EXAMINATION
Course Besides the Quizzes, assignments, recitation, major examination and lab activities, before the end of the semester, the students are required to present an
Requirement application project in groups of four to five members dealing with the application of Data Structure and algorithm in the field of Computer Science and
s Information Technology such the development of Information System that will utilize arrays, linked list, stacks and queues, trees and graph.

Reading
And Gaddis, Tony, Starting out with C++, Prentice Hall
References Goodrich, Michael and Tamassia, Roberto Data Structure and Algorithms
Malik, D.S. C++ Programming
Shaffer, C.A. Data Structure and Algorithm Analysis in C++
Zak, Diane, An Introduction to Programming with C++
 COLAND SYSTEMS TECHNOLOGY INCORPORATED
Peñas Building, Sinsuat Avenue
Cotabato City

Prepared By: Date Reviewed By: Date

REYMAR S. BELLOSILLO RYL R. RAMOS, MIM

Permanent Faculty Dean, College of Computer Studies

Noted By: Date Date

RYL R. RAMOS, MIM

Dean, College of Computer Studies

Approved By: Date

ENGR. RIGE MAE G. MUESCO, MIM

Academic Program Head