PHILIPPINE COLLEGE OF SCIENCE AND TECHNOLOGY

Nalsian, Calasiao, Pangasinan, Philippines, 2418

ISO 9001:2015 CERTIFIED, Member: Philippine Association of Colleges and Universities (PACU), Philippine Association of Maritime Institutions (PAMI)
SYLLABUS FOR BACHELOR OF SCIENCE IN INFORMATION TECHNOLOGY (BSIT)
(Effective School Year 2024-2025)
DETAILED TEACHING SYLLABUS (DTS) AND INSTRUCTORS GUIDE (IG’S)
CC104 (Data Structure and Algorithms Lec/Lab)

PHILOSOPHY
The PHILIPPINE COLLEGE OF SCIENCE AND TECHNOLOGY is committed to the pursuit of excellence relative to student’s professional growth and development.
VISION
PHILIPPINE COLLEGE OF SCIENCE AND TECHNOLOGY envisions producing quality graduates fully equipped with knowledge, attitudes, values, and skills and who are globally competitive
in their chosen profession ever ready to render quality services.
MISSION STATEMENT
PHILIPPINE COLLEGE OF SCIENCE AND TECHNOLOGY provides quality education to every student through a well-balanced research-oriented learning environment that develops critical
and creative thinking for maximum development of individual’s talents and capabilities.
INSTITUTIONAL OBJECTIVES
In pursuit of its Vision and Mission, PHILIPPINE COLLEGE OF SCIENCE AND TECHNOLOGY will achieve the following:
1. Provide programs and activities that will enhance the development of the students physically, intellectually, culturally, emotionally, socially, spiritually and morally.
2. Provide college education opportunities to poor but deserving students through the PHILIPPINE COLLEGE OF SCIENCE AND TECHNOLOGY scholarship grants.
3. Train students with globally competitive technical skills that will make them competent and capable of handling challenges in life.
4. Provide manpower needs of the country with professionally qualified graduates imbued with dignity and high moral values who are mature, productive, self-reliant,
responsible and self-disciplined citizens.
SPECIAL OBJECTIVES
To provide the country with globally competitive and professionally licensed graduates as integral part of the total manpower needed for the economic development in the national and
international levels.
CORE VALUES
P Professionalism
H High Spirituality
I Integrity
L Love of Humanity
C Compassionate and Competent
S Solidarity
T Transformative

Issue Date June, 2018 Prepared by: Reviewed by: Recommended by: Approved by:
________________________ __________________________ __________________________ __________________________
Revision Status 3 College of Computer Studies Engr. Charo G. Almonte, MIT Rachelle N. Camacho, MIT Engr. Raul B. Gironella, DMin
Revision Date June, 2018 Instructor Department Head College Dean VP for Academic Affairs/QAM

Page | 1 CONTROLLED COPY FORM NO.: BSITIG#CC104 APPROVED BY: SCHOOL PRESIDENT
 COLLEGE OF COMPUTER STUDIES
MISSION STATEMENT
In line with the Philippine College of Science and Technology Vision, Mission, and Objectives, the College of Computer Studies is strongly committed to direct and operate its program through the
following objectives.
GENERAL OBJECTIVES
To produce globally competitive Computer Science and Information Technology graduates with quality professional skills and competencies that are imbued with high moral character in the
practice of the profession within national and international standards.
SPECIFIC OBJECTIVES
The above goal will be achieved through the following specific objectives:
1. To enhance the training of the students on the theoretical skills in computer science and information technology.
2. To provide the students with adequate knowledge and technical skills in the conduct of research-oriented application of theories and principles in dealing with laboratory problems
and exercises, computer system and design, program software and projects.
3. To equip students with social awareness and concern with a high sense of responsibility in the conduct of research and adoption of current and new technology to render quality
services.
BACHELOR OF SCIENCE IN INFORMATION TECHNOLOGY
INSTITUTIONAL OUTCOMES
A graduate of Philippine College of Science and Technology should:
1. Exercise leadership in the practice of the profession;
2. Demonstrate professional and social responsibilities;
3. Pursue lifelong learning for continuous development; and
4. Possesses creativity and critical thinking skills to become globally competitive guided with values of integrity and honesty
PROGRAM OUTCOMES (PO’s)
A Bachelor of Science in Information Technology graduates of PhilCST should be able to:
1. Integrate knowledge learned into their application of sotware development and networking/systems;
2. Utilizes modern coding standards and industry bst practices to develop software solutions for problems facing users and organizations;
3. Designs proper network configuration, and perform network troubleshooting;
4. Manage databases for common workplace needs;
5. Install and maintain client and server operating systems aand their associated network services, users, and file systems;
6. Build an interactive software application interface using iterative design methodology based on the user centered development practices;
7. Apply project management principles;
8. Communicate effectively with peers and stakeholders in oral and written modes;
9. Demonstrates collaborative problem-solving and teaming skills; and
10. Apply professionalism and the importance of ethics in the workplace.

Page | 2 CONTROLLED COPY FORM NO.: BSITIG#CC104 APPROVED BY: SCHOOL PRESIDENT
 COURSE CODE : CC104
COURSE DESCRIPTIVE TITLE : Data Structure and Algorithm PREREQUISITE : CC103/L
LECTURE CONTACT LABORATORY CONTACT
COURSE CREDITS : 3 Unit : 2 Hours : 3 hours
HOURS / WEEK HOURS / WEEK
This course covers the standard data representation and algorithms to solve computing problems efficiently. This covers
COURSE DESCRIPTION : the following: Arrays, Stacks, Queues, Trees. Graphs and Sets. Thorough discussion of sorting and searching algorithms is
covered.
After completion of the course, the student should be able to:
CO1: Design, implement, test and debug a program based on a given specification that uses and implements elementary data
COURSE OUTCOME/S structures (arrays, stacks, queues) and advanced data structures (trees and graphs).
:
CO2: Discuss strengths and weaknesses among multiple implementations for a problem on the aspects of iterative vs recursive
solutions.

PROGRAM OUTCOMES ADDRESSED INTRODUCTORY ENABLING DEMONSTRATIVE

Integrate knowledge learned into their application of sotware development and
PO1 X
networking/systems ;
Utilizes modern coding standards and industry bst practices to develop software
PO2 X
solutions for problems facing users and organizations;

DISCRETE MATHEMATICS
LEARNING OUTCOMES TEACHING / LEARNING ASSESSMENT (METHOD/TASK) REFERENCES / EQUIPMENT /
TOPICS
(LO’s) ACTIVITIES (TLA’s) (AT’s) MATERIALS USED

State the objectives, Orientation; discussion of Prelim Recitation #1 Icebreaker Data Structure and Algorithm
activities, and requirements course goals and expected activity Detailed Teaching Syllabus and
of the course. outcomes; discussion of Instructional Guide; Student
course policies, grading Handbook
system

Page | 3 CONTROLLED COPY FORM NO.: BSITIG#CC104 APPROVED BY: SCHOOL PRESIDENT
 Discuss the various data Lesson 1: Data Types  Discussion and  Prelim Assignment #1 –  Malik, D. S. C++ Programming:
Types including data  Data Abstraction demonstration various Research on various data types Program Design Including Data
abstraction and Abstract  Abstract Data Types data Types including  Prelim Quiz #1 Quiz on using Structures. Cengage Learning.
Data Types (ADTs). data abstraction and ADT’s to solve basic problems 2014
(ADTs)
Abstract Data Types  Laboratory Activity #1: Using  Zak, Diane. Introduction to
Explain and demonstrate Lesson 2: Basic Data ADT’s in computation Programming C++. Cengage
Structures (ADTs).
the basic data structures  Laboratory Activity #2: Activity Learning. 2014
 The Students will learn
such as Arrays. Static arrays  Arrays on using operations associated  Drozdek, Adam Data
and Dynamic arrays. general concepts of with basic data structures Structures and Algorithm in
 Linked Lists
ADTs and apply them to  Check-Up Examination- C++. Cengage Learning. 2014
 Stacks
Execute operations solve basic problems Multiple-Choice Examination
associated with basic data  Queues  Demonstration on using which covers declaration, Teaching Aids: Whiteboard, Pentel
structures  Trees ADTs for computation initialization and operations pen, Computer, multimedia
 The students will do associated ADT’s and basic data presentation.
laboratory activity 1 in structures Write a program for
using ADT’s the given problems.
 Demonstration of
Time Allotment
executing operations 6 hours lecture
associated with basic 9 hours lab
data structures
 The students will do
laboratory activity #2in
performing operations
associated with basic
data structures

CHECK-UP EXAMINATION

Demonstrate the Lesson 3: Implementation  Discussion and  Malik, D. S. C++ Programming:

implementation of arrays Using Arrays (Static and  Prelim Quiz #2 Quiz on using Program Design Including Data
demonstration on the
(static and dynamic) as well Dynamic) 2- arrays to solve basic Structures. Cengage Learning.
implementation using
problems
as the basic operations on a  Introduction to Arrays arrays 2014
 Laboratory Activity #3:
List  Static Arrays  The Students will apply  Zak, Diane. Introduction to
Performing basic operations
 Dynamic Arrays the steps in declaring, Programming C++. Cengage
on a list
Explain basic operations and  Array Operations initializing as well as Learning. 2014
implementation in using  Laboratory Activity #4:  Drozdek, Adam Data
 Memory Management entering and displaying
Implementation in using
Singly linked-lists Lesson 4: Basic Operations data data using arrays Structures and Algorithm in
Singly linked-lists.
on a List  Demonstration of C++. Cengage Learning. 2014
Page | 4 CONTROLLED COPY FORM NO.: BSITIG#CC104 APPROVED BY: SCHOOL PRESIDENT
  Introduction to Lists operations associated  Preliminary Examination-
 List Operations with basic operations on Multiple-Choice Teaching Aids: Whiteboard, Pentel
 List Traversal a list Examination which covers pen, Computer, multimedia
 List Performance  The students will do implementation using presentation.
Lesson 5: Linked-List laboratory activity 3 arrays (static and dynamic)
 Introduction to Linked performing basic as well as basic operations
Lists operations on a list on a List. Write a program
 Types of Linked Lists  Demonstration of for the given problems.
 Linked List Operations operations associated
 Memory Management with basic operations on Time Allotment
 Performance a Linked-list 6 hours lecture
Considerations  The students will do 9 hours lab
laboratory activity #4 in
solving problems using
Singly linked-lists.

PRELIM EXAMINATION

Define the fundamental Lesson 6: Stacks and  Discussion on  Final Assignment #1- Research  Malik, D. S. C++ Programming:
concepts of stacks and Queues. terminology, behavior, on stacks and queues Program Design Including Data
queues, including their  Introduction to Stacks basic operations and  Final Recitation #1-recitation Structures. Cengage Learning.
structure and purpose. and Queues syntax of Tree data on the basic operations on a 2014
 Understanding Stacks structure stack  Zak, Diane. Introduction to
Explain the differences  Understanding Queues  The students read and  Final Quiz #1: Quiz on stacks Programming C++. Cengage
between stacks and queues,  Types of Queues analyze simple, pre- and queues Learning. 2014
particularly in terms of their  Stack and Queue written C++ programs  Laboratory Activity #8: stacks  Drozdek, Adam Data
data handling strategies Algorithms on tree data structure and queues Structures and Algorithm in
(LIFO and FIFO). Lesson 7: Basic operations to determine their  Final Quiz #2 –quiz on Basic C++. Cengage Learning. 2014
on a Stack. function, and develop queue operation
Implement stack operations  Introduction to Stack tests to evaluate these  Midterm Examination – Teaching Aids: Whiteboard, Pentel
in a programming language, Operations same programs for Multiple-Choice Examination pen, Computer, multimedia
such as pushing and  Push Operation correctness. which covers Midterm period presentation.
popping elements.  Pop Operation  Demonstration of the
 Peek (or Top) steps for tree traversal Time Allotment
Illustrate the process of Operation  The student will perform 12 hours lecture
queue operations with activities on tree 18 hours lab
 isEmpty Operation
practical examples and traversal
Lesson 8: Basic queue
diagrams to show the order  Discussion and
operation
of element processing. demonstration basic
 Introduction to Queue
Operations operations of binary

Page | 5 CONTROLLED COPY FORM NO.: BSITIG#CC104 APPROVED BY: SCHOOL PRESIDENT
 Analyze the performance of  Enqueue Operation search trees.
queue operations and  Dequeue Operation  The students will
discuss scenarios where  Peek (or Front) develop a program on
queue-based data Operation BSTs
structures are preferable.

MIDTERM EXAMINATION

Explain the basic definition, Lesson 9: Tree data  Discussion on  Final Assignment #1- Research  Malik, D. S. C++ Programming:
properties and structure of structure terminology, behavior, on the basic concept of tree Program Design Including Data
the Tree data structure  Introduction to Trees basic operations and data structure Structures. Cengage Learning.
including Binary and  Types of Trees syntax of Tree data  Final Recitation #1-Design a 2014
nonbinary trees.  Tree Concepts structure program using tree data  Zak, Diane. Introduction to
Lesson 10: Structure of  The students read and structure Programming C++. Cengage
Demonstrate and explain Binary Tree analyze simple, pre-  Final Quiz #1; Quiz on Tree Learning. 2014
tree traversal  Introduction to Binary written C++ programs Traversal  Drozdek, Adam Data
Trees on tree data structure  Laboratory Activity #8: Binary Structures and Algorithm in
Implement the concept of  Types of Binary Trees to determine their Search Trees C++. Cengage Learning. 2014
binary trees  Binary Tree Structure function, and develop  Final Quiz #2 –quiz on Binary
 Binary Tree Properties tests to evaluate these Search Trees Teaching Aids: Whiteboard, Pentel
 Binary Tree Operations same programs for  Semi-Final Examination – pen, Computer, multimedia
Lesson 11: Traversing a correctness. Multiple-Choice Examination presentation.
Binary Tree  Demonstration of the which covers Trees
 Introduction to Tree steps for tree traversal
Traversal  The student will perform Time Allotment
activities on tree 6 hours lecture
 Depth-First Traversal
traversal 9 hours lab
 Breadth-First Traversal
 Traversal Algorithms  Discussion and
demonstration basic
operations of binary
search trees.
 The students will
develop a program on
BSTs

SEMIFINAL EXAMINATION

Page | 6 CONTROLLED COPY FORM NO.: BSITIG#CC104 APPROVED BY: SCHOOL PRESIDENT
 Explain the concept of Lesson 12: Algorithm  Discussion on the  Final Quiz #3 – Analysis  Malik, D. S. C++ Programming:
Algorithm analysis. analysis concept of Algorithm Techniques Program Design Including Data
 Introduction to analyis  Laboratory Activity #9: Hands Structures. Cengage Learning.
Demonstrate the steps in
Algorithm Analysis  The students read and on practice Getline (), Ignore 2014
Analysis techniques as well analyze simple, pre- Function  Zak, Diane. Introduction to
as efficiency of algorithms  Time Complexity written C++ programs  Laboratory Activity #11: Programming C++. Cengage
 Space Complexity on sample algorithms Algorithm analysis Learning. 2014
Compare efficiency of  Asymptotic Analysis  Demonstration of the  Final Examination – Multiple-  Drozdek, Adam Data
various algorithms  Analyzing Recursive steps for analysis Choice Examination which Structures and Algorithm in
techniques covers elementary data C++. Cengage Learning. 2014
Algorithms
 The students read and structures (arrays, stacks,
 Algorithmic Efficiency queues) and advanced data Teaching Aids: Whiteboard, Pentel
analyze simple, pre-
 Data Structures and written C++ programs structures (trees and graphs). pen, Computer, multimedia
Algorithm Efficiency on sample algorithms to presentation.
test newly acquired Time Allotment
analysis techniques as 6 hours lecture
well as the efficiency of 9 hours lab
the algorithms
 Discussion and
comparison of the
efficiency of various
algorithms
 The students will
compare efficiency of
various algorithms

IT201COA#1: Explain and apply the concept of graphs and trees as well as perform operations such as searching and traversal

FINAL EXAMINATION

Page | 7 CONTROLLED COPY FORM NO.: BSITIG#CC104 APPROVED BY: SCHOOL PRESIDENT
The final course grade will be computed according to the following formula:
1. The passing standard shall be the grade of 50%. To get the percentile grade, the number of correct answers called raw score shall be divided by the total number of test points
and multiplied by 100. Percentage (%) is used in determining and expressing a student’s raw scores in all assessments. The table below shows a sample of the range of percentage
marks and their corresponding equivalents.
2. The five-point grading scale is use to indicate the result of the assessment as shown below.

PERCENTAGE GRADE LETTER GRADE DESCRIPTIVE RATING FIVE POINT GRADING REMARKS
90% – 100% A Excellent 1.0 Meets minimum competence with exceptional score
80% – 89% B Very Good 1.5 Meets minimum competence with over and above average score
70% – 79% C Good 2.0 Meets minimum competence with above average score
60% – 69% D Satisfactory 2.5 Meets minimum competence with average score
50% – 59% E Passed 3.0 Meets minimum competence
0% – 49% F Failed 5.0 Does not meet the minimum competence

COURSE POLICIES: (Requirements)

A. Attendance Procedure: Attendance will be taken at the beginning of each class using the CLASS CARD which is issued to each student upon enrolment. Students are expected to
attend every class. Students are responsible for all material covered during any absence and assignments must be completed by the due date for credit. The absence of more
than twenty percent of the required number of meetings in lectures and/or laboratory will result in a “DROPPED” grade (DRP). Missed exams will require proof of extenuating
circumstances for any make-up consideration.
B. Absence due to Illness: If you are sick, DONOT ATTEND THE CLASS. Contact the instructor by e-mail, telephone, or cell phone to discuss how you will keep up with the coursework
assignments and complete the Laboratory Experiments.
C. Methods of Instruction: Methods will include round-robin discussion and demonstrations that discuss key terms, concepts and formulae of the assigned chapter. During the
discussion, a quiz about the basic concepts of each chapter will be given. The student is expected to read one chapter and solve the assigned problems each week. This will
require an average of five hours of study outside of the classroom each week. The previously assigned problems will be collected for grading and the solutions will be derived in
class. This process is designed to help the student thoroughly understand the concepts and applications of the material covered.
D. Academic Honesty: All students are expected to behave with academic honesty. It is not academically honest, for example, to misrepresent another person’s words or ideas as
one’s own, to take credit for someone else’s work or ideas, to copy and paste material from another document or from the internet, to accept help on a test or to obtain advanced
information or confidential test materials, or to act in a way that might harm another student’s chance for academic success. When the instructor believes that a student has
failed to maintain academic honesty, he or she may be given an “F” grade, either for the assignment, laboratory report, quiz, examination, or the course depending upon the
severity of the offense.
CORRECTIVE ACTIONS: (Remedial Assessment)
1. Any student that fails on category 1 assessment (written assessments) is not allowed to take remedial assessment unless there is a valid reason such as sickness which must be
supported by a medical certificate. The remedial assessment if proven valid must be given as soon as possible (at least one week after the students have submitted the supporting
documents).
2. Any student that fails on category 2 assessment (practical assessment) is subject for remedial assessment after one week of the first assessment.

Page | 8 CONTROLLED COPY FORM NO.: BSITIG#CC104 APPROVED BY: SCHOOL PRESIDENT