DATA STRUCTURES AND ALGORITHMS

I. VISION

“PCT is the center of excellence that provides innovative programs and services geared towards global competitiveness
through quality training and education to various local and foreign stakeholders.”

II. MISSION

“PCT is a new generation college that provides secondary, tertiary and vocational education, skills certification and
manpower to industry. It features competency based approach and laddered programs with strong industry linkages
serving diverse students, professionals industry partners through modern and innovative programs and services.

III. GOALS

To achieve its mission, the College aims to:

A. Create competitive advantages in the marketplace that are not only unique and valuable but also difficult for competitors
to copy or substitute.
B. Invigorate curricula and teaching methods to improve learning outcomes and produce graduates that meet global
demands.
C. Prepare profession-ready learners who can contribute to the socio-economic development of their community.
D. Ensure that PCT is a great place to learn and work.
E. Ensure a diverse and healthy community that reflects the mission and culture of PCT.

Date Effective: Date Revised: Prepared by Checked by: Approved by:

JOSWE A. BAGUIO KATHRYN ANN SICAM GENER A. BALILI, BSC, MBA, PHPh.d Page 1 of 8
INSTRUCTOR PCT VICE-PRESIDENT CEO/FOUNDER OF PCT
 VI. CURRICULUM MAPPING (INFORMATION TECHNOLOGY EDUCATION)

Student Learning Outcomes Bachelor of Science in Information Technology Courses

Student learning outcomes (adapted from SEOUL ACCORD Outcomes for Computing BASIC ITE CORE COURSES
Introduction to Computing - c, g, j, k, l, m
Professional Graduates): Computer Programming 1 - a, g, i
a. Can apply knowledge of computing, science, and mathematics appropriate to the Computer Programming 2 - a, b, e, g, i, j
discipline. Data Structures and Algorithms - a, g, i
Information Management - a, b, c, d, e, f, g, h, j
b. Can understand best practices and standards and their applications. Application Dev. and Emerging Tech. - a, b, c, d, e, f
c. Can analyze complex problems, and identify and define the computing
requirements appropriate to its solution. ITE PROFESSIONAL COURSES
Intro to Human Computer Interaction 1 - b, c, d, e, f, g
d. Can identify and analyze user needs and take them into account in the selection, Information Assurance and Security 1 - b, c, g, k, l
creation, evaluation and administration of computer-based systems. Information Assurance and Security 2 - b, c, f, g, k, l
Fundamentals of Database Systems - a, b, c, d, g
e. Can design, implement, and evaluate computer-based systems, processes, Advanced Database Systems - a, b, c, d, g
components, or programs to meet desired needs and requirements under Integrative Programming and Technologies 1 - a, b, d, e, f, g
various constraints. Discreet Mathematics - a, b, c, d, e
Quantitative Methods (incl. Modeling & Simulation) - b, c, f
f. Can integrate IT-based solutions into the user environment effectively. Networking 1 - a, b, c, g
g. Can apply knowledge through the use of current techniques, skills, tools and Networking 2 - a, b, c, f, g, k, l
practices necessary for the IT profession. Practicum - a, b, c, d, e, f, g, h, I, j, k,
l, m
h. Can function effectively as a member or leader of a development team System Administration and Maintenance - d, f, g, k, l
recognizing the different roles within a team to accomplish a common goal. System Integration and Architecture 1 - a, b, c, d, f, g, h, i, k, l
Social and Professional Issues - c, h, i, j, k, l, m
i. Can assist in the creation of an effective IT project plan. Capstone Project and Research 1 - a, b, c, d, g, h, i, j, k, l, m
j. Can communicate effectively with the computing community and with society at Capstone Project and Research 2 - a, b, e, f, g, h, I, j, k, l, m
large about complex computing activities through logical writing, presentations,
Date Effective: Date Revised: Prepared by Checked by: Approved by:

JOSWE A. BAGUIO KATHRYN ANN SICAM GENER A. BALILI, BSC, MBA, PHPh.d Page 2 of 8
INSTRUCTOR PCT VICE-PRESIDENT CEO/FOUNDER OF PCT
 and clear instructions. RECOMMENDED ITE ELECTIVES
Human Computer Interaction 2 - c, d, e, g, h, j, k
k. Can analyze the local and global impact of computing information technology on Platform Technologies - b, c, d, e, f
individuals, organizations, and society. Object-Oriented Programming - a, b, e, f, g, i, j
l. Can understand professional, ethical, legal, security and social issues and Integrative Programming Technologies 2 - a, b, f, g
Web Systems and Technologies - a, b, c, d, e, g, l
responsibilities in the utilization of information technology. Systems Integration and Architecture 2 - a, b, c, d, f, g, h, i, k, l
m. Can recognize the need for and engage in planning self-learning and improving
performance as a foundation for continuing professional development.

COURSE INFORMATION:

Course Code: Data Structures and Algorithm

College: College of Information Technology
Department: ITE Department
Date Effective: Date Revised: Prepared by Checked by: Approved by:

JOSWE A. BAGUIO KATHRYN ANN SICAM GENER A. BALILI, BSC, MBA, PHPh.d Page 3 of 8
INSTRUCTOR PCT VICE-PRESIDENT CEO/FOUNDER OF PCT
 Degree Program: BSIT
Faculty Member: Joswe A. Baguio
Consultation Period:
Contact Information: 09509604997

Course Description: The course covers the standard data representation and algorithms to solve computing problems efficiently
(with respect to space requirements and time complexity of algorithm). This covers the following: Stacks, Queues, Trees, Graphs,
Maps, and Sets. A thorough discussion of sorting and searching algorithms and hashing is covered.

COURSE OUTCOMES (CO):

At the end of the course, the students:

Design, implement, test and debug a program based on a given specifications that use and implement abstract data
CO1
types (stacks, queues, priority queues, sets, maps).
Argue strengths and weaknesses among multiple implementations for a problem (e.g. on the aspects of iterative or
CO2 recursive solutions and on the aspects of abstraction, encapsulation and information hiding)

V. TARGET STUDENT LEARNING OUTCOMES (S.L.O.): a, g, i

X. COURSE CONTENT
Time Teaching-Learning Activities
Topics Desired Learning Outcomes (DLO) Assessment Tasks (AT)
Allotment (TLA)
Introduction to Data Structures Week 1 & 2  understand the concept of data  Individual participation in class
(6 hours) structures. discussion  Rating of students’
Date Effective: Date Revised: Prepared by Checked by: Approved by:

JOSWE A. BAGUIO KATHRYN ANN SICAM GENER A. BALILI, BSC, MBA, PHPh.d Page 4 of 8
INSTRUCTOR PCT VICE-PRESIDENT CEO/FOUNDER OF PCT
  identify the different types of data
structure.
 solve problems using algorithm.
summative/formative
 understand the programming principle.
 Use the PPT Presentation test.
 convert algorithm into programming
solution.
 learn and acquire knowledge about
Abstract Data Type and Class
 learn the linear structures such as List,
Stack, Queue ADT and its application.
Week 3 & 4  acquire knowledge and skills on list.  Rating of students’
(6 hours)
 create a program on Array Implementation.  Individual participation in class summative/formative
 Present a program on Link List discussion and laboratory test.
Implementation. activity using a rubric to assess  Assess using rubric for
 Formulate a program on Doubly Link Lists.  Use the PPT presentation product
 create a program on Cursor
Implementation.
 apply list in solving a problem.
Linear Structures  acquire knowledge and skills on Stack
ADT.
 create program on Stack ADT Array
 Rating of students’
Implementation.  Individual participation in class
summative/formative
 Produce a program on Stack ADT Link List discussion and laboratory
test.
Implementation. activity using a rubric to assess
 Assess using rubric for
 apply Stack ADT in solving a problem.  Web Research
Week 5 & 6 product
(6 hours)  acquire knowledge and skills on Queue

ADT.
 create program on Circular Queue.
 apply Queue ADT in solving a problem.
Sorting Week 7 & 8  learn about different sorting such as  Individual participation in  Rating of students’
6 hours Bubble Sort, Selection Sort, Insertion Sort, class discussion and group summative/formative test.
Date Effective: Date Revised: Prepared by Checked by: Approved by:

JOSWE A. BAGUIO KATHRYN ANN SICAM GENER A. BALILI, BSC, MBA, PHPh.d Page 5 of 8
INSTRUCTOR PCT VICE-PRESIDENT CEO/FOUNDER OF PCT
 presentation using a rubric  Assess using rubric for
Merge Sort, Quick Sort and Shell Sort. to assess quality of product
 create program using the different sorting. participation.  Graded submission of
 Use the PPT Presentation individual activities
 understand Tree, Binary Search Tree
ADTs.
 describe the structure of a Binary Search
Tree.  Individual participation in class  Rating of students’
 draw Binary Search Tree after inserting a discussion and group summative/formative test.
Week 9 & 10 number of elements in specific order. presentation using a rubric to  Assess using rubric for
Tree Structures
6 hours  understand the basic operation of Binary assess quality of participation. product
Search Tree such as Insert, Search,  Web Research  Graded submission of
Preorder Traversal, Inorder Traversal and  Use PPT Presentation individual activities
Postorder Traversal.
 use Binary Search Tree in program
Implementation.
 learn about AVL, Splay, B-Tree, Heaps
and its application.  Rating of students’
AVL Trees summative/formative
- Single and double rotation  Individual participation class
test.
Week 11 & 12 - Implementation discussion and activity using a
Balanced Trees  Assess using rubric for
6 hours Splay Trees rubric to assess.
product
B-Trees  Web Research
 Graded submission of
Heaps
individual activities
- Binary Heaps
- Application
Graphs Week 13 & 14  learn about graph data structures, shortest  Individual participation class  Rating of students’
6 hours path algorithms and its traversals. discussion and activity using a summative/formative
- Representations rubric to assess. test.
- Search Algorithms (BFS, DFS)  Use the PPT Presentation  Assess using rubric for
- Shortest path algorithms product
- Spanning Trees  Graded submission of
Date Effective: Date Revised: Prepared by Checked by: Approved by:

JOSWE A. BAGUIO KATHRYN ANN SICAM GENER A. BALILI, BSC, MBA, PHPh.d Page 6 of 8
INSTRUCTOR PCT VICE-PRESIDENT CEO/FOUNDER OF PCT
 individual activities
 learn the different algorithm and its
application.
 Greedy algorithm  Rating of students’
 Individual participation class
 Divide and conquer summative/formative
discussion and laboratory
 Dynamic programming test.
Week activity using a rubric to
 Backtracking assess.  Assess using rubric for
Algorithm Design and Analysis 15,16,17 & 18
12 hours  Branch and Bound  Web Research
product
 Randomized algorithms  Graded submission of
 Online Discussion
 Algorithm analysis individual laboratory
 Use PPT Presentation
 Asymptotic notations activities
 Recurrences,NP completeness
problems
TOTAL NO. OF HOURS 54 HOURS
REFERENCES:

 https://www.geeksforgeeks.org/introduction-to-data-structures-10-most-commonly-used-data-structures/
 https://www.studytonight.com/data-structures/introduction-to-data-structures
 https://www.geeksforgeeks.org/difference-between-linear-and-non-linear-data-structures/
 https://www.geeksforgeeks.org/overview-of-data-structures-set-1-linear-data-structures/
 https://www.studytonight.com/data-structures/introduction-to-sorting
 https://www.tutorialspoint.com/data_structures_algorithms/sorting_algorithms.htm
 https://www.tutorialspoint.com/data_structures_algorithms/tree_data_structure.htm
 https://www.geeksforgeeks.org/graph-data-structure-and-algorithms/
 https://www.tutorialspoint.com/design_and_analysis_of_algorithms/index.htm

Course Evaluation Policy: (VPAA Memo #01SY201152016)

Date Effective: Date Revised: Prepared by Checked by: Approved by:

JOSWE A. BAGUIO KATHRYN ANN SICAM GENER A. BALILI, BSC, MBA, PHPh.d Page 7 of 8
INSTRUCTOR PCT VICE-PRESIDENT CEO/FOUNDER OF PCT
 To conform with the new educational reform of the country which is the Outcomes-based Education, effective the first semester of SY 2015-2016, the following
grading system shall be followed:

Examinations (40%) Performance Tasks (40%) Other Requirements (20%)

 Preliminary Examinations  Oral recitations  Quizzes
 Final Examinations  Classroom Presentations/Reports  Assignments
 Laboratory/Demonstrations  Projects/Portfolios
 Research Outputs
Moreover, a new baseline shall be used in the computation of grades to elevate the academic standards of the school.

Date Effective: Date Revised: Prepared by Checked by: Approved by:

JOSWE A. BAGUIO KATHRYN ANN SICAM GENER A. BALILI, BSC, MBA, PHPh.d Page 8 of 8
INSTRUCTOR PCT VICE-PRESIDENT CEO/FOUNDER OF PCT