Republic of the Philippines

BATANGAS STATE UNIVERSITY

The National Engineering University
JPLPC-Malvar Campus
G. Leviste St., Brgy. Poblacion, Malvar, Batangas Philippines 4233
Tel. Nos.: (043) 778-2170/ (043) 406-0830
Email Address: cit.malvar@g.batstate-u.edu.ph | Website Address: http://www.batstate-u.edu.ph

College of Informatics and Computing Sciences

Bachelor of Science in Information Technology

COURSE INFORMATION SYLLABUS (CIS)

VISION A premier national university that develops leaders in the global knowledge economy.
MISSION A university committed to producing leaders by providing a 21st century learning environment through innovations in
education, multidisciplinary research, and community and industry partnerships in order to nurture the spirit of nationhood,
propel the national economy, and engage the world for sustainable development.

Course Title Data Structures and Algorithms Course Code CS131

Course Category Professional Course Prerequisite(s) IT11
Semester/year 2nd Semester/ AY 2023-2024 Credit Unit(s) 3
Course Instructor Noel L. Virrey 38463 Reference CMO CMO No. 25, Series of 2015
Master of Science in Computer Science (30 units) Date Prepared January 8, 2024
noel.virrey@g.batstate-u.edu.ph Prerequisite(s) 0
Miguel Edward N. Rosal
Bachelor Science in Computer Science
migueledward.rosal@g.batstate-u.edu.ph
Anjeline Jaurigue
Master of Science in Informatiion Technology
anjeline.jaurigue@g.batstate-u.edu.ph
Period of Study AY 2023-2024 Revision Date
Course Rationale This course covers the standard data representation and algorithms to solve computng problems efficiently (with respect to
and Description space requirements and time complexity of algorithm). This covers the following: Stacks, Queues, Trees, Graphs, Maps, and
Sets. Thorough discussion of sorting and searching algorithms and hashing is covered.

Contact Hours 3 Hours Laboratory

2 Hours Lecture
Criteria for 10% Quizzes, Recitation, Assignment
Assessment 25% Midterm Exam
25% Final Exam
20% Laboratory Exercises
20% Final Project
Teaching, This course adopts a face to face mode of delivery. Students shall be able to write and debug programs aided by e-learning
Learning, and programming materials and activities provided by the course facilitator. Students performance in will be assessed through
Assessment the following:
Strategies
Module Quizzes
Students will also be given 6 quizzes that can be taken in a secure and proctored environment. The student will be assessed
and the result shall not be less than 60%.

Midterm
Exam/ Final Exam
Students will also be given two (2) Major examinations that can be taken in a secure and proctored environment. The result
shall not be less than 60%.

Laboratory Exercises
Every module has a laboratory exercise to prepare the students for the Final Project Output.

Final Project
For the students’ final project, they (in pair) will be required to develop an output using a Data Structures and Algorithms with
the use of C++ . The proposed design/solution shall be comprehensively documented and presented in class.

Intended ILO Upon completion of this course, the students should be able to:
Learning ILO1 Analyze and simulate results of an algorithm that uses (1) data structures, arrays, stacks, queues, trees, linked lists
Outcomes (ILO) and sorting.
ILO2 Design, implement, and debug a program based on a given specification that uses and implements abstract
datatypes (stacks, queues, sets, maps, and graphs)
ILO3 Argue the strengths and weaknesses among multiple algorithms
ILO4
ILO5
ILO6
ILO7
Assessment Assessment Tasks (AT) Distribution Intended Learning Outcomes Domains
Method & Code Assessment Tasks I/R/D (%) 1 2 3 4 5 6 7 C P A
Distribution Map
Assessment
Method &
Distribution Map QR Quizzes, Recitation I 10 5 5 5 5
ME Midterm Exam D 25 10 10 5 10 10 5
FE Final Exam 25 15 10 10 10 5
LE Laboratory Exercises I/R 20 10 10 10 10
FP Final Project D 20 10 10 5 10 5
Total 100 15 50 35 40 45 15
Books and Other 1 1.http://www.nitjsr.ac.in/course_assignment/CS01CS1302A%20Book%20Fundamentals%20of%20Data20Structure
References %20(1982)%20by%20Ellis%20Horowitz%20and%20Sartaj%20Sahni.pdf
2 https://www.geeksforgeeks.org/graph-data-structure-and-algorithms/
3 https://www.geeksforgeeks.org/prims-mst-for-adjacency-list-representationgreedy-algo-6/
4 https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithmgreedy-algo-2/
5 http://wccclab.cs.nchu.edu.tw/www/images/Data_Structure_105/chapter6.p df
6
7
8
Institutional IGAs Institutional Graduate Attributes (IGA) Statements
Graduate IGA1 Knowledge Competence. Demonstrate a mastery of the fundamental knowledge and skills required
Attributes (IGA) for functioning effectively as a professional in the discipline, and an ability to integrate and apply them
effectively to practice in the workplace.
IGA2 Creativity and Innovation. Experiment with new approaches, challenge existing knowledge boundaries and design
novel solutions to solve problems.
IGA3 Critical and Systems Thinking. Identify, define, and deal with complex problems pertinent to the future professional
practice or daily life through logical, analytical and critical thinking.
IGA4 Communication. Communicate effectively (both orally and in writing) with a wide range of audiences, across a range
of professional and personal contexts, in English and Pilipino.
IGA5 Lifelong Learning. Identify own learning needs for professional or personal development; demonstrate an eagerness
to take up opportunities for learning new things as well as the ability to learn effectively on their own.
IGA6 Leadership, teamwork, and Interpersonal Skills. Function effectively both as a leader and as a member of a team;
motivate and lead a team to work towards goal; work collaboratively with other team members; as well as connect
and interact socially and effectively with diverse culture.
IGA7 Global Outlook. Demonstrate an awareness and understanding of global issues and willingness to work, interact
effectively and show sensitivity to cultural diversity.
IGA8 Social and National Responsibility. Demonstrate an awareness of their social and national responsibility; engage in
activities that contribute to the betterment of the society; and behave ethically and responsibly in social, professional
and work environments.
Student SO Student Outcomes (SO) Statements
Outcomes (SO)
SO1 Ability to analyze a complex computing problem and to apply principles of computing and other relevant disciplines to
identify solutions.

SO2 Ability to design, implement, and evaluate a computing-based solution to meet a given set of computing requirements
in the context of the program’s discipline.

SO3 Ability to communicate effectively in a variety of professional contexts.

SO4 Ability to recognize professional responsibilities and make informed judgments in computing practice based on legal
and ethical principles.

SO5 Ability to function effectively as a member or leader of a team engaged in activities appropriate to the program’s
discipline.

Ability to identify and analyze user needs and to take them into account in the selection, creation, integration,
SO6 evaluation, and administration of computing-based system.
CDIO Framework CDIO CDIO Skills
Skills CDIO1 Disciplinary Knowledge & Reasoning
Knowledge of underlying mathematics and sciences, core engineering fundamental knowledge, advanced
engineering fundamental knowledge, methods and tools

CDIO2 Personal and Professional Skills & Attributes

Analytical reasoning and problem solving; experimentation , investigation and knowledge discovery; system thinking;
attitudes, thoughts and learning; ethics, equity and other responsibilities

CDIO3 Interpersonal Skills: Teamwork & Communication

Teamwork, communications, communication in a foreign language
CDIO4 Conceiving, Designing, Implementing & Operating Systems
External, societal and environmental context, enterprise and business context, conceiving, systems engineering and
management, designing, implementing, operating

Sustanable SDG SDG Skills

Development SDG1 Envisioning
Goals Skills Establish a link between long-term goals and and immediate actions, and motivate people to take action by
harnessing their deep aspirations.

SDG2 Critical Thinking and Reflection

Examine economic, environmental, social and cultural structures in the context of sustainable development, and
challenges people to examine and question the underlying assumptions that influence their world views by having
them reflect on unsustainable practices.
SDG3 Systemic Thinking
Recognise that the whole is more than the sum of its parts, and it is a better way to understand and manage complex
situations.
SDG4 Building Partnerships
Promote dialogue and negotiation, learning to work together, so as to strengthen ownership of and commitment to
sustainable action through education and learning.
SDG5 Participation in Decision Making
Empower oneself and others through involvement in joint analysis, planning and control of local decisions.
COURSE POLICIES
A. GRADING SYSTEM
A.
The grading system adopted by this course is as follows:
Excellent 1.00 98 - 100
Superior 1.25 94 - 97
Very Good 1.50 90 - 93
Good 1.75 88 - 89
Meritorious 2.00 85 - 87
Very Satisfactory 2.25 83 - 84
Satisfactory 2.50 80 - 82
Fairly Satisfactory 2.75 78 - 79
Passing 3.00 75 - 77
Failure 5.00 Below 70
Incomplete INC
*Students who got a computed grade of 70-74 will be given an appropriate remedial activity in which the final grade should be either
passing (3.0) or failure (5.0).

B. CLASS POLICY
Prompt and regular attendance of students is required. The course has 18 sessions with 5 hours per session (1 session per week). Total
unexcused absences shall not exceed two(2) sessions.

MISSED EXAMINATIONS
Students who failed to take the exam during the schedule date can be given a special exam provided he/she has valid reason. If it is
health reason, he/she should provide the faculty with the medical certificate signed by the attending Physician. Other reasons shall be
assessed first by the faculty to determine its validity.

ACADEMIC DISHONESTY
Academic dishonesty includes acts such as cheating during examinations or plagiarism in connection with any academic work. Such acts
are considered major offenses and will be dealt with according to the University’s Student Norms of Conduct.

DROPPING
Dropping must be made official by accomplishing a dropping form and submitting it at the Registrar’s Office before the midterm
examination. Students who officially drop out of class shall be marked “Dropped” whether he took the preliminary examination or not and
irrespective of their preliminary grades.

A student who unofficially drops out of class shall be given a mark of “5.0” by the instructor.
C. OTHER COURSE POLICIES AND REQUIREMENTS
Teaching, Learning, and Assessment (TLA) Activities
Ch. Topics / Reading List Wks Topic Outcomes ILO SO Delivery Method
Orientation & Introduction to Data Structures
and Algorithms
Basic Concepts, Classifications and Operations of
Data Structure Understand the concepts, classifications
Discussion,
and operations of data structure. ILO1,
1 Classifications of Data Stucture 1 ILO2
SO1 Quizzes,
Algorithm complexity and Algorithmic
Assignments
Abstract Data Type Analysis. Basic operations in an Array
Algorithms and its complexity
Array Data Structure
Linked List
Linked List Data Structure ILO1 Discussion,
Linked list vs. Arrays, Types of Linked SO
2 2 , Quizzes,
Doubly Linked List Data Structure List, Basic operations of Linked List 1, 2
ILO2 Assignments, Laboratory
Circular Linked List Data Structure
Stack and Queue
Stack and Data Structure Basic Operations in Stacks, Prefix, ILO1 Discussion,
SO
3 3--4 Postfix and Infix Notation, Parsing , Quizzes,
Expression Parsing 1, 2
Expression, Basic Operations in Queue ILO2 Assignments, Laboratory
Queue Data Structure
Searching Algorithms
Linear Search Algorithm
Binary Search Algorithm
1. Interpolation Search Algorithm Evaluating Searching Algorithm, Linear ILO1
Search, Binary Search, Interpolation , SO Discussion, Presentatiom
4 2. Jump Search Algorithm 5--6 Search, Jump Search, Exponential ILO2 1, Quizzes,
3. Exponential Search Algorithm Search, Fibonacci Search, Sublist Search , 2,3 Assignments, Laboratory
and Hash Table ILO3
4. Fibonacci Search Algorithm
5. Sublist Search Algorithm
6. Hash Table
Sorting Algorithms
7. Bubble Sorting Algorithm
8. Insertion Sorting Algorithm
9. Selection Sorting Algorithm
10. Merge Sorting Algorithm ILO1
11. Shell Sorting Algorithm In-place Sorting and Not-in-place Sorting, , SO Discussion, Pesentation
5 7--8 Stable and Not Stable Sorting, Adaptive ILO2 1, Quizzes,
12. Heap Sorting Algorithm and Non-Adaptive Sorting Algorithm , 2,3 Assignments, Laboratory
ILO3
 ILO1
In-place Sorting and Not-in-place Sorting, , SO Discussion, Pesentation
5 7--8 Stable and Not Stable Sorting, Adaptive ILO2 1, Quizzes,
and Non-Adaptive Sorting Algorithm , 2,3 Assignments, Laboratory
13. Bucket Sorting Algorithm ILO3
14. Counting Sorting Algorithm
15.Radix Sorting Algorithm
16. Quick Sorting Algorithm
MIDTERM EXAMINATION 9
Graph Data Structure Graph Data Structure, Operations of
Depth First Traversal ILO1, SO Discussion,
Graphs, Representation of Graphs, Types
6 Breadth First Traversal 10 ILO2, 1, Quizzes,
of Graphs, Depth First Traversal, Breadth ILO3 2,3 Asignments, Laboratory
First Traversal, Spanning Tree
Tree Data Structure
ILO1, SO Discussion,
Tree Traversal General Trees, Binary Trees, Inorder
7 11 ILO2, 1, Quizzes,
Binary Search Tree Traversal, Post Order Traversal ILO3 2,3 Asignments, Laboratory
Heap Data Structure
Recursion
Recursion Algorithms Analysis of Recursion, Tower of Hanoi ILO Discussion,
SO 1,
8 Tower of Hanoi using Recursion Algorithms 12 Rules and Algorithms, Fibonacci Series 1, Quizzes,
2, 3
Using Recursion 2,3 Asignments, Laboratory
Fibonacci Series Using Recursion
Divide and Conquer
Max and Min Problems
Travelling Salesman Problem Components of Greedy Algorithm, Areas
Prim’s Minimal Spanning Tree of Application, Coins Counting Problem,
Travelling Salesman Problem, Prim's
Kruskal’s Minimal Spanning Tree Algorithm ILO SO Discussion,
Spanning Tree, Kruskal's Minimal
9 Dijkstra’s Shortest Path Algorithm 13-14 1, 1, 2, Quizzes,
Spanning, Dijkstra's Shortest Path
Map Colouring Algorithm 2,3 3 Asignments, Laboratory
Algorithm, Map Colouring Algorithm,
Fractional Knapsack Problem Fractional Knapsack Problem, Optimal
Job Sequencing with Deadline merge Pattern
Optimal Merge Pattern Algorithm

9 Dynamic Programming
Matrix Chain Multiplication Overlapping Sub-Problems, Optimal Sub-
Floyd Warshall Algorithm Structures, Dynamic Programming vs.
ILO SO1, Discussion,
Greedy vs. Divide and Conquer, Matrix
0-1 Knapsack Algorithm 15-16 1, 2, 3, Quizzes,
Chain Multiplication, Floyd Warshall
Longest Common Subsequence Algorithm 2,3 6 Asignments, Laboratory
Algorithm, Knapsack Algorithm,
Travelling Salesman Problem (Dynamic Subsequence Algorithm
Approach)
Final Examination 17
Encoding and Submission of Grades 18
Assessment Schedule Week No.
Distribution 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
Assessment

Module Quizzes x x x x x x
Method

Midterm Exam x
Final Exam x
Laboratory Exercises x x x x x x
Final Project x

STUDENT OUTCOMES (SO): Mapping of Assessment Tasks (AT)

ILOs
ILO-SO and ILO-CPA

SO1 SO2 SO3 SO6 C P A

ILO1 x x x x
Mapping

ILO2 x x x x
ILO3 x x x x x x
ILO4
ILO5
ILO6
ILO7

INSTITUTIONAL GRADUATE ATTRIBUTES (IGA): Mapping of Assessment Tasks (AT)

ILOs
IGA1 IGA2 IGA6
ILO-IGA Mapping

ILO1 x
ILO2 x x
ILO3 x x x
ILO4
ILO5
ILO6
ILO7
CDIO SKILLS SDG Skills
ILO-CDIO and ILO-SDG

ILOs CDIO1 CDIO2 CDIO3 CDIO4 SDG2 SDG4 SDG5

ILO1 x x x x
x x x x x
Mapping

ILO2
ILO3 x x x x x x x
ILO4
ILO5
ILO-CDIO and ILO-S
Mapping
ILO6
ILO7

Prepared by: Reviewed by: Approved by:

MR. NOEL L. VIREY

Faculty Mr. JOSEPH RIZALDE GUILLO Asst. Prof. SHIELA MARIE G. GARCIA
Department Chairperson, CICS Dean, CICS

Mr. MIGUEL EDWARD A. ROSAL

Faculty

Ms. ANJELINE JAURIGUE

Faculty

Date: Date: Date:

Remarks:
1 The syllabus is to be distributed to the students in the first week of the semester.
2 Any changes to the syllabus shall be communicated (in writing) to the Program Chair and the approved revised version must be
communicated to the students.
3 The course instructor may set a more stringent similarity percentage (minimum 20%) for their respective courses pertaining to student's
submissions. However, it must be communicated in writing to the respective Program Chair and the approved revised version must be
communicated to the students.