BACHELOR OF SCIENCE IN INFORMATION TECHNOLOGY

OBE Course Syllabus in Data Structures and Algorithm

Second Semester, S.Y. 2023-2024

College Vision A Globally – recognized Scientific and Technological University by 2027

ASCOT shall produce globally – competitive, ethically – upright and gender – responsive graduates in the fields of arts and
College Mission sciences, forestry, agriculture, education, information technology, industrial technology, engineering, marine and environmental
sciences by promoting quality instruction, research, extension and production towards sustainable development.

● Achieve academic excellence in IT education through the provision and implementation of a comprehensive and responsive
curriculum;

● Establish strong engagement in relevant research endeavors and promote ethical application of generated outputs;
Department Goals
● Develop technological innovations applying effective concepts and principles to provide solutions to the problems of the
organization and the community it serves, and;

● Produce quality projects that will bring valuable impact to the college and other developmental stakeholders.

Department Objectives
● To produce competitive graduates through effective implementation of quality information technology education;

● To provide innovative solutions and responsive support to meet the needs of the community;

● To empower the community by providing timely and appropriate training, and;

 ● To identify production priorities and IT investments aligned with the College strategic plan

Course Name: Data Structures and Algorithms

Course Code: CC 103 Credit Units: 3 units
Pre-requisite/s: CC 101 – Programming 1 Co-requisite/s: None
Lecture Hours: 2 hours Laboratory Hours: 3 hours

Course Description:
Course covers data structures and algorithms. Topics: arrays, linked lists, stacks, queues, trees, graphs, hashing; sorting: insertion, selection, merge,
quicksort; searching: linear, binary, hash-based. Focus on algorithm efficiency through complexity analysis. Hands-on experience implementing and analyzing
structures and algorithms through programming assignments and projects.

Week Course Content/Subject Matter

Week 1 1. Introduction to Course
Week 2 2. Introduction to the Data Structures and Algorithms
Week 3-4 3. Data Structures
Week 5-6 4. Linked List
Week 7-8 5. Stack and Queue
Week 9-12 6. Graph Data Structured

Week 13-17 7. Tree Data Structure

Week 18-19 8. Recursion

One week (for an equivalent of 3 hours) Allotted for Prelim, Midterm, and Final Exams
 TEACHING AND
DESIRED LEARNING ASSESSMENT TASK
COURSE CONTENT LEARNING RESOURCE MATERIALS TIMEFRAME
OUTCOMES (DLOs) (ATs)
STRATEGIES
1. Class Orientation  Reflection 1 Week
⮚ Explain the ASCOT ⮚ Online or Face ⮚ Google Classroom
Paper
Mission & Vision 1.1 ASCOT Mission & to Face
Vision Orientation ⮚ Google Meet
1.2 Goals & Objective of
⮚ Individual
⮚ Explain the Goals & BSIT Department ⮚ Laptop/Desktop
Sharing
Objectives of BSIT 1.3 Course Overview Computer
Department
1.4 Course Requirements ⮚ Internet
1.5Class Policies Connectivity
o Understand the
course 1.6 Grading System ⮚ PowerPoint
overview, Presentation
course
requirements,
class policies,
and grading
system
2. Introduction to the Data ➢ Face to Face  Research about  Module/Powerpoint 1 Week
⮚ Understand the scope
Structures and Lecture or the practical/real presentation in Data
and purpose of the Algorithms Online world uses of Structures and
course application Discussion data structures Algorithms
software. and algorithms
2.6 Overview of the Course  Written
➢ Demonstration assessment  Laptop/cellphone/
2.7 Importance of Data
⮚ Recognize the and/or recitation tablet
Structures and about the
significance of efficient
 algorithms Algorithms. ➢ Laboratory importance of
Exercise data structures
& algorithms in  Internet connectivity
the IT world,
⮚ Demonstrate the ability 2.8 Application of Data and the career
to choose and opportunities  Rubrics in grading
Structure and students’ tasks
implement suitable related to DSA.
data structures to Algorithms
address specific
computational
challenges.
2.9 Careers and Opportunity
in Professional as DSA
⮚ Identify career paths in
DSA

3. Data Structures ➢ Face to Face  Module/Powerpoint 2 weeks

⮚ Identify and explain the
Lecture or presentation in Data
characteristics of Online  Group research
Structures and
various data structures. Discussion and
3.6 Data Structure Basis Algorithms
presentation
⮚ Demonstrate
proficiency in ➢ Demonstration  Laptop/cellphone/
 Written
manipulating arrays, 3.7 Data Structure and tablet
assessment/Gra
including insertion,
Types ded recitation
deletion, and searching ➢ Laboratory
operations. Exercise  Internet connectivity

⮚ Design algorithms that ➢ Group  Coding activities

3.8 Array and Data Research
leverage arrays, linked  Rubrics in grading
Structure
lists, stacks, and students’ tasks
queues to solve
 diverse computational
problems.

4. Linked List ➢ Face to Face  Conduct  Module/Powerpoint 2 weeks

⮚ Evaluate the time and
Lecture or research & presentation in Data
space complexity of Online present Structures and
common linked list Discussion information Algorithms
4.6 Linked List Data
operations. about the data
Structured structures
➢ Demonstration aforementioned,  Laptop/cellphone/
how and when tablet
⮚ Define and explain the
should they be
concept of double 4.7 Double Linked List used
➢ Laboratory
linked lists. Structured Exercise  Implementation  Internet connectivity
of the data
structures via
⮚ Implement algorithms ➢ Research coding  Rubrics in grading
4.8 Circular linked List Activity
that specifically benefit students’ tasks
from the circular nature Data Structured
of linked lists.

5. Stack and Queue ➢ Face to Face  Implementation  Module/Powerpoint 2 weeks

⮚ Define the concept of a
Lecture or of the topics via presentation in Data
stack in computer Online coding activities. Structures and
science and explain the Discussion Algorithms
5.6 Stack Data Structured
key characteristics and
operations of a stack.  Written tests
➢ Demonstration  Laptop/cellphone/
 5.7 Expression Parsing tablet
⮚ Implement algorithms
for parsing infix ➢ Laboratory  Problem
expressions and Exercise solving/Analysis
of real world  Internet connectivity
convert expressions 5.8 Queue Data Structured
between infix, postfix, problems that
and prefix notations. can be solved
by the topics  Rubrics in grading
included students’ tasks

⮚ Identify and
differentiate between
various types of
queues (e.g., circular
queues, priority
queues) and implement
specialized queues for
specific scenarios.

6. Graph Data Structured ➢ Face to Face  Conduct  Module/Powerpoint 3 weeks

⮚ Define the fundamental
Lecture or activities where presentation in Data
concepts of graph Online students’ Structures and
theory, including Discussion logical, critical & Algorithms
6.6 Graph Data Structured
vertices, edges, and problem-solving
graphs. abilities can be
➢ Demonstration exercised.  Laptop/cellphone/
 Conduct of tablet
⮚ Describe the concept analysis &
6.7 Depth First Traversal ➢ Laboratory coding activities
of depth-first traversal
Exercise where students  Internet connectivity
and its applications in
graph theory and can implement
analyze the time and what they've
learned to solve  Rubrics in grading
space complexity of
real world students’ tasks
 depth-first traversal. scenarios

6.8 Breadth First Traversal

⮚ Evaluate the time and

space complexity of
breadth-first traversal
and apply breadth-first
traversal to solve 6.9 Spanning Tree
problems in various
domains.

⮚ Analyze the properties

and characteristics of
spanning trees and
solve practical
problems involving the
construction and
application of spanning
trees.

7. Tree Data Structure ➢ Face to Face  Conduct written  Module/Powerpoint 4 weeks

⮚ Identify and distinguish
Lecture or & coding presentation in Data
between key Online assessments Structures and
components such as Discussion where students Algorithms
7.6 Tree Data Structure
nodes, edges, root, should
leaves, and siblings in implement the
a tree. ➢ Demonstration data structures  Laptop/cellphone/
7.7 Tree Traversal & operations tablet
⮚ Understand the that will be
iterative and recursive ➢ Laboratory discussed in this
implementations of session
Exercise  Internet connectivity
 each traversal 7.8 Binary Search Tree  Conduct of
technique researching
➢ Research activities/recitati  Rubrics in grading
Activity students’ tasks
⮚ Define Binary Search ons to assess
7.9 AVL Tree their
Tree (BST) and
understanding
understand the
about the
properties that
advantages and
distinguish it from other
7.10 Red Black Trees disadvantages
trees.
of each concept
and when each
⮚ Understand AVL tree type is most
rotations for 7.11 B Trees and B+ appropriate to
maintaining balance implement.
during insertions and Trees
deletions.

⮚ Evaluate the time

7.12 Splay Trees
complexity of these
operations and
compare them with
other tree structures. 7.13 Tries

⮚ Explore the
advantages of B Trees
in database systems 7.14 Heap Data
and file systems and Structure
implement insertion
and deletion operations
on B+ Trees.

⮚ Define Splay Trees and

understand the
 splaying operation for
restructuring the tree.

⮚ Define Tries and

discuss their
applications, especially
in the context of storing
and searching for
strings.

⮚ Analyze the time

complexity of heap
operations and their
relevance in solving
real-world problems.

8. Recursion ➢ Face to Face  Implementation  Module/Powerpoint 2 weeks

⮚ Explain how recursive
Lecture or of recursive presentation in Data
functions work and Online functions via Structures and
their role in problem- Discussion coding activities. Algorithms
8.6 Recursion Algorithms
solving.
 Written
⮚ Explain how the assessment
➢ Demonstration tasks to assess  Laptop/cellphone/
algorithm works and 8.7 Tower of Hanoi Using their tablet
the rationale behind its understanding
Recursion
recursive structure. ➢ Laboratory on when
Exercise recursions are  Internet connectivity
⮚ Understand the trade- appropriate to
offs between recursive 8.8 Fibonacci Series Using implement
and iterative  Rubrics in grading
Recursion
approaches for students’ tasks
Fibonacci.
SUGGESTED REFERENCES:

● https://www.tutorialspoint.com/data_structures_algorithms/index.htm

● https://www.programiz.com/dsa

● https://techdevguide.withgoogle.com/paths/data-structures-and-algorithms/#sequence-2

● https://dl.ebooksworld.ir/books/Introduction.to.Algorithms.4th.Leiserson.Stein.Rivest.Cormen.MIT.Press.9780262046305.EBooksWorld.ir.pdf

COURSE REQUIREMENTS:
 Face to Face or On-line quizzes
 Face to Face or On-line written examinations (Prelim, Midterm and Finals)
 Laboratory Exercises
 Research works

GRADING SYSTEM: (Depends upon the Instructor and the needs/requirements of the course)
Prelim Midterm Finals
10% Attendance/Values 10% Attendance/Values 10% Attendance/Values
20% Activity/Quiz/Laboratory 20% Activity/Quiz/Laboratory 20% Activity/Quiz/Laboratory
15% Assignment 15% Assignment 15% Assignment
15% Project 15% Project 15% Project
40% Prelim Exam 40% Midterm Exam 40% Final Exam

CLASS POLICIES:
1) In alternating face-to-face and online classes, Google Meet will be the primary platform for virtual sessions.
2) Attendance during face-to-face classes is required and online synchronous classes are encouraged but not compulsory. Recorded sessions will be
available for students to access at their convenience. However, all assignments should be submitted before or during the specified deadline.
3) Formative and summative examinations may be conducted in face-to-face or online formats. Remote assessments will primarily utilize platforms such as
Google Forms, Quizzizz, etc.
 4) Students are always expected to display proper decorum and behavior during on-line or face to face meetings.
5) Consultations will be via the class group chat.
6) Tasks in hard copies should be submitted before or during the specified deadline. It is advised that students should always observe safety protocols.
7) All tasks which will be submitted in hard copies should be done/encoded/pasted in a short bond paper, times new roman, font size 12, 1” margin on all
sides.

INSTRUCTOR’S INFORMATION:
● Name: Cheska Cate P. Victorio

● Email Address: [email protected]

● Contact Number: 09703462809

● Office Hours/Consultation Hours: 8:00 AM to 5:00 PM, Monday to Friday

● Specialization: Information Technology

● Subjects Taught: Programming 1, Programming for Beginners, Fundamentals of Database System and Web and Multimedia System

Prepared by: Recommending Approval: Approved:

CHESKA CATE P. VICTORIO MAYREEN V. AMAZONA, DIT RB J. GALLEGO, PhD

Instructor Director, Department of Information Technology Vice President for Academic Affairs