VPAA-QF-10

Republic of the Philippines CvSU Mission

CvSU Vision CAVITE STATE UNIVERSITY Cavite State University shall provide
excellent, equitable and relevant educational
The premier university in Gen. Trias City Campus opportunities in the arts, science and
historic Cavite recognized  235-7997 ǀ 410-5247 ǀ 437-0693 technology through quality instruction and
for excellence in the
development of globally www.cvsu.edu.ph relevant research and development activities.
It shall produce professional, skilled and
competitive and morally morally upright individuals for global
upright individuals. DEPARTMENT OF ARTS, SCIENCES, EDUCATION AND TECHNOLOGY competitiveness.

COURSE SYLLABUS
Second Semester, AY 2021-2022
Lecture 
Course Code DCIT 25 Course Title Data Structures and Algortihms Type Credit Units 3
Laboratory 
Course The course covers the standard data representation and algorithms to solve computing problems efficiency (with respect to space requirements and time complexity of
Description algorithm). This covers the following: Stacks, Queues, Trees, Graphs, Maps and Sets. Thorough discussion of sorting and searching algorithms and hashing is covered.

Pre-
Lecture: .
DCIT 50 Course Schedule Laboratory: Mon. 7-10am; Mon. 10am-1pm; Mon. 2-5pm;
requisites
Mon. 5-8pm; Tues. 2-5pm
Students are expected to live by and stand for the following University tenets:

TRUTH is demonstrated by the student’s objectivity and honesty during examinations, class activities and in the development of projects.
Core Values
EXCELLENCE is exhibited by the students’ self-confidence, punctuality, diligence and commitment in the assigned tasks, class performance and other course requirements.

SERVICE is manifested by the students’ respect, rapport, fairness and cooperation in dealing with their peers and members of the community.
In addition, they should exhibit love and respect for nature and support for the cause of humanity.
The Campus shall endeavor to:
Goals of the
1. provide high quality instruction in order to produce skilled, morally upright, and globally competitive graduates;
College/
2. develop and pursue advance research activities through arts, sciences, and technology to support instruction; and
Campus
3. develop and conduct extension activities that will empower local people and communities.

The department of Information Technology shall endeavor to:

Objectives of
the 1. support the university’s mission and vision in providing globally competitive individuals through technological advancements;
Department 2. equip students with knowledge in the field of information and computer technology; and
3. strengthen students’ skills through research development and extension activities that will endow their personal and social growth.
Program Educational Objectives (based on the program CMO)
The program aims to produce graduates who can:
1. design, implement, test and debug a program based on a given specification that uses implements abstract data types (stacks, queues, priority queues, sets, maps); and
2. argue strengths and weaknesses among multiple implementations for a problem (i.e. on the aspects of iterative vs recursive solutions and on the aspects of abstraction
encapsulation and information hiding)

V02-2020-06-01
 Student Outcomes and Relationship to Program Educational Objectives
Program Educational Objectives Code
Program/Student Outcomes (based on the program CMO)
(based on the program CMO)
The students should: 1 2
a. apply knowledge of computing, science, and mathematics appropriate to the discipline; ✓ ✓
b. understand best practices and standards and their applications; ✓ ✓
analyze complex problems, and identify and define the computing requirements appropriate ✓ ✓
c.
to its solution;
identify and analyze user needs and take them into account in the selection, creation, ✓ ✓
d.
evaluation and administration of computer-based systems;
design, implement, and evaluate computer-based systems, processes, components or ✓ ✓
e.
programs to meet desired needs and requirements under various constraints;
f. integrate IT-based solutions into the user environment effectively; ✓ ✓
apply knowledge through the use of current techniques, skills, tools and practices ✓ ✓
g.
necessary for the IT profession;
function effectively as a member or leader of a development team recognizing the different ✓ ✓
h.
roles within a team to accomplish a common goal;
i. assist in the creation of an effective IT project plan; ✓ ✓
communicate effectively with the computing community and with society at large about ✓ ✓
j.
complex computing activities through logical writing, presentations, and clear instructions;
analyze the local and global impact of computing information technology on individuals, ✓ ✓
k.
organizations, and society;
understand professional, ethical, legal, security and social issues and responsibilities in the ✓ ✓
l.
utilization of information technology; and
recognize the need for and engage in planning, self-learning and improving performance as ✓ ✓
m.
a foundation for continuing professional development.
Course Outcomes and Relationship to Student Outcomes
Program Outcomes Addressed by the Course Program Outcomes Code
After completing this course, the students will be able to: a b c d e f g h i j k l m
1. design, implement, test and debug a program based on a given specification that
uses implements abstract data types (stacks, queues, priority queues, sets, I I D D D D I E I E E E E
maps); and
2. argue strengths and weaknesses among multiple implementations for a problem
(i.e. on the aspects of iterative vs recursive solutions and on the aspects of I D D D D D I D I D D E E
abstraction encapsulation and information hiding).
*Level : I-Introductory E- Enabling D-Demonstrative

COURSE COVERAGE
Teaching and Due Date of
Mode of Resources Outcomes-based
Week No. Intended Learning Outcomes (ILO) Topic Learning Activities Submission of
Delivery Needed Assessment (OBA)
(TLA) Output
After the completion of the unit, students I. Introduction Synchronous and/or Online Course Syllabus
will be able to: A. University VMGO and asynchronous Learning
1 1. explain the vision, mission and Quality Policy discussion Student
quality policy of the University; B. Gender and Development Handbook
C. Disaster Management Plan
V02-2020-07-01
 2. discuss the importance of gender D. Waste Management Plan Interactive Online
and development awareness; E. The Course class discussion
3. identify the disaster management a. Description
plan; b. Content Informal/ Creative
4. explain blended learning c. Guidelines and Learning
approach; policies
5. determine the course description, Reflection
content and guidelines; and
6. reflect personal goal as a student
to CvSU VMGO.
After the completion of the chapter, II. Intro to Algorithms Synchronous and/or Face-to-face Module Same day
students should be able to: A. Algorithm Basics asynchronous submission
1. detail what an algorithm is; B. Basic Algorithm discussion Multimedia
2. describe what asymptomatic resources
Approaches
analysis’ purpose is; and Interactive Online (PowerPoint
3. learn about the three algorithm a. Greedy Approach class discussion Presentation,
approaches and algorithm b. Divide & Conquer video clips, etc.)
2 examples where they can be c. Dynamic Informal/ Creative
applied. Programming Learning References
(textbooks/
Small Group eBooks)
Discussion/
Brainstorming Computer unit/
laptop/ tablet
mobile phone
After the completion of the chapter, III. Data Structure Basics Synchronous and/or Face-to-face Module Same day
students should be able to: A. Introduction asynchronous submission
1. have an idea what data B. Data Types discussion Multimedia
structures are; a. Built-in Data resources
2. learn about the data types which Interactive Online (PowerPoint
Type
can be considered as a data class discussion Presentation,
structure; and b. Derived Data video clips, etc.)
3. know the basic operations such Type Informal/ Creative
3 as traversing, searching, C. Basic Operations Learning References
insertion, deletion sorting and a. Traversing (textbooks/
merging which are used in b. Searching Small Group eBooks)
manipulating data structures c. Insertion Discussion/
during implementation. Brainstorming Computer unit/
d. Deletion
laptop/ tablet
e. Sorting mobile phone
f. Merging
After the completion of the chapter, IV. Array Data Structure Synchronous and/or Face-to-face Module Same day
students should be able to: A. Introduction asynchronous submission
1. have a brief knowledge about B. Array representation discussion Multimedia
arrays; C. Basic Operations resources
4 2. understand the structure of an a. Traversing Interactive Online (PowerPoint
array through depicted b. Searching class discussion Presentation,
illustrations; and c. Insertion video clips, etc.)
3. learn how to apply the basic Informal/ Creative
d. Deletion
operations in an array. Learning
e. Sorting
V02-2020-07-01
 f. Merging References
Small Group (textbooks/
Discussion/ eBooks)
Brainstorming
Computer unit/
Hands-on Activities laptop/ tablet
mobile phone
After the completion of the chapter, V. Linked Lists Synchronous and/or Face-to-face Module 1. Same day
students should be able to: A. Single Linked List asynchronous submission
1. understand what single linked Representation discussion Multimedia
list is and its types; a. Types of Single resources
2. know how to use the basic Linked List Interactive Online (PowerPoint
operations especially the b. Basic Operations class discussion Presentation,
insertion, deletion, and reverse c. Insertion Operation video clips, etc.)
operation in single linked lists; d. Deletion Operation Informal/ Creative
5 3. learn the difference of a doubly e. Reverse Operation Learning References
linked list with a singled linked B. Doubly Linked List (textbooks/
list; Representation Small Group eBooks)
4. describe a doubly linked list and a. Types of Doubly Discussion/
recognize an example easily; Linked List Brainstorming Computer unit/
5. have an idea about the basic b. Basic Operations laptop/ tablet
operations c. Insertion Operation Hands-on Activities mobile phone
d. Deletion Operation
e. Reverse Operation
After the completion of the chapter, VI. Stacks Synchronous and/or Face-to-face Module Same day
students should be able to: A. Introduction asynchronous submission
1. grasp the idea of stacks through B. Stack Representation discussion Multimedia
basic definitions and C. Basic Operations resources
explanations; a. push Interactive Online (PowerPoint
2. understand how a stack works b. pop class discussion Presentation,
through graphical illustrations; c. peek video clips, etc.)
6 and d. isFull Informal/ Creative
3. implement through the use of e. isEmpty Learning References
code the basic operations of a (textbooks/
stack. Small Group eBooks)
Discussion/
Brainstorming Computer unit/
laptop/ tablet
Hands-on Activities mobile phone

V02-2020-07-01
 After the completion of the chapter, VII. Queue Synchronous and/or Face-to-face Module Same day
students should be able to: A. Introduction asynchronous submission
1. have an idea what the data B. Representation discussion Multimedia
structure queue is; C. Basic Operations resources
2. learn how its basic operations a. enqueue Interactive Online (PowerPoint
are similar and dissimilar to b. dequeue class discussion Presentation,
stacks; c. peek video clips, etc.)
3. practice basic operations of a d. isfull Informal/ Creative
7-8 queue using written activities; e. isempty Learning References
D. Enqueue Operation (textbooks/
E. Dequeue Operation Small Group eBooks)
Discussion/
Brainstorming Computer unit/
laptop/ tablet
Hands-on Activities mobile phone

9 MIDTERM EXAMINATION
After the completion of the chapter, VIII. Linear Search Synchronous and/or Face-to-face Module Same day
students should be able to: A. Introduction to Linear asynchronous submission
1. be introduced about linear Search discussion Multimedia
search; B. Algorithm resources
2. understand the algorithm of C. Pseudocode Interactive Online (PowerPoint
linear search; class discussion Presentation,
3. read and analyze the video clips, etc.)
pseudocode of linear search; Informal/ Creative
10
and Learning References
4. implement a program that will (textbooks/
demonstrate a linear search. Small Group eBooks)
Discussion/
Brainstorming Computer unit/
laptop/ tablet
Hands-on Activities mobile phone

After the completion of the chapter, IX. Binary Search Synchronous and/or Face-to-face Module 1. Same day
students should be able to: A. Introduction to Binary asynchronous submission
1. learn the basics of binary Search discussion Multimedia
search; B. How Binary Search resources
2. know the algorithm of binary Works Interactive Online (PowerPoint
search; C. Pseudocode class discussion Presentation,
3. make an analysis of the video clips, etc.)
pseudocode for binary search; Informal/ Creative
11
and Learning References
4. create a program that will (textbooks/
implement a binary search. Small Group eBooks)
Discussion/
Brainstorming Computer unit/
laptop/ tablet
Hands-on Activities mobile phone

V02-2020-07-01
 After the completion of the chapter, X. Interpolation Search Synchronous and/or Face-to-face Module Same day
students should be able to: A. Introduction to asynchronous submission
1. be knowledgeable about Interpolation Search discussion Multimedia
interpolation search; B. Positioning in Binary resources
2. compare the positioning in Search Interactive Online (PowerPoint
binary search and positioning of C. Position Probing in class discussion Presentation,
indices in interpolation search; Interpolation Search video clips, etc.)
3. study the algorithm of D. Algorithm Informal/ Creative
12
interpolation search; E. Pseudocode Learning References
4. understand the pseudocode for (textbooks/
interpolation search; and Small Group eBooks)
5. make a program that will Discussion/
implement an interpolation Brainstorming Computer unit/
search. laptop/ tablet
Hands-on Activities mobile phone

After the completion of the chapter, XI. Sorting Algorithms Synchronous and/or Face-to-face Module Same day
students should be able to: A. Introduction to Sorting asynchronous submission
1. have basic knowledge about B. In-place Sorting and discussion Multimedia
sorting data structures; Not-in-place Sorting resources
2. understand the differences Interactive Online (PowerPoint
between an in-place and not-in- C. Stable and Not Stable class discussion Presentation,
place sorting; Sorting video clips, etc.)
13 3. know the difference of stable and D. Adaptive and Non- Informal/ Creative
not stable sorting; Adaptive Sorting Learning References
4. recognize an adaptive and non- (textbooks/
Algorithm
adaptive sorting algorithm; and Small Group eBooks)
5. grasp important key terms in E. Additional Key Terms Discussion/
sorting such as increasing order, F. Examples of Sorting Brainstorming Computer unit/
decreasing order, etc.; Algorithms laptop/ tablet
mobile phone
After the completion of the chapter, XII. Bubble, Insertion, and Synchronous and/or Face-to-face Module Same day
students should be able to: Selection Sort asynchronous submission
1. understand how each sorting A. Bubble Sort discussion Multimedia
technique works; a. How it Works resources
2. learn about the algorithms used b. Algorithm Interactive Online (PowerPoint
in each sorting technique; c. Pseudocode class discussion Presentation,
3. have an in-depth understanding d. Implementation video clips, etc.)
of their pseudocodes; and B. Insertion Sort Informal/ Creative
14-15
4. apply those pseudocodes in an a. How it Works Learning References
actual program. b. Algorithm (textbooks/
c. Pseudocode Small Group eBooks)
C. Selection Sort Discussion/
a. How it Works Brainstorming Computer unit/
b. Algorithm laptop/ tablet
c. Pseudocode Hands-on Activities mobile phone

After the completion of the chapter, XIII. Merge and Shell Sort Synchronous and/or Face-to-face Module Same day
students should be able to: A. Merge Sort asynchronous submission
16-17
1. understand how each sorting a. How it Works discussion Multimedia
technique works; b. Algorithm resources
V02-2020-07-01
 2. how they differ with the previous c. Pseudocode Interactive Online (PowerPoint
three sorting techniques; B. Shell Sort class discussion Presentation,
3. learn about the algorithms used a. How it Works video clips, etc.)
in each sorting technique; b. Algorithm Informal/ Creative
4. have an in-depth understanding c. Pseudocode Learning References
of their pseudocodes; and (textbooks/
5. implement those pseudocodes Small Group eBooks)
by creating an actual program. Discussion/
Brainstorming Computer unit/
laptop/ tablet
Hands-on Activities mobile phone

18 FINAL EXAMINATION
COURSE REQUIREMENTS
Lecture Requirements:
1. Quizzes/Activities
2. Mid-Term Examination
3. Final Examination
4. Class Participation/Recitation

Laboratory Requirements:
1. Laboratory Activities
2. Portfolio/ e-Portfolio
3. Class Participation/Recitation

*All exams must follow a Table of Specifications (TOS) and Rubrics for evaluation of student’ performance or projects.

GRADING SYSTEM
Grading system (for 2 units lecture and 1 unit laboratory)
Lecture – 40% Laboratory – 60%
Quizzes/Seatworks/Assignments 30% Laboratory Activities 30%
Class Participation/ Recitation 10% Class Participation/ Recitation 10%
Midterm Exam 30% Practical Exam 60%
Final Exam 30% 100%
100%

Passing Grade is 70%

STANDARD TRANSMUTATION TABLE FOR ALL COURSES

96.7 – 100.0 1.00 86.7 – 90.0 1.75 70.00 – 73.3 3.00

93.4 – 96.6 1.25 80.1 – 83.3 2.25 50.0-69.9 4.00
90.1 - 93.30 1.50 76.7 – 80.0 2.50 Below 50 5.00
83.4 – 86.6 2.00 73.4 – 76.6 2.75 INC Passed the course but lack some requirements.

Dropped If did not submitted at least 80% of Laboratory activities and/or did not took major examinations. / 3 consecutive absences.

Total Class Hours/Semester: (1 unit Lec – 36 hrs; 2 unit Lab – 54 hrs) 90 hours

V02-2020-07-01
A. Classroom Decorum

During face to face mode

Students are required to:
1. wear identification cards at all times;
2. wear face mask at all times
3. observe physical/social distancing at all times
4. clean the classroom before and after classes;
5. avoid unnecessary noise that might disturb other classes;
6. practice good manners and right conduct at all times;
7. practice gender sensitivity and awareness inside the classroom; and
8. come to class on time.

During distance mode

Students are required to:
1. sign an honor system pledge;
2. avoid giving or receiving unauthorized aid of any kind on their examinations, papers, projects and assignments,
3. observe proper netiquette during on-line activities, and
4. submit take home assignments on time.

B. Examination/ Evaluation
1. Quizzes may be announced or unannounced.
2. Mid-term and Final Examinations are scheduled.
3. Cheating is strictly prohibited. A student who is caught cheating will be given a score of ”0” for the first offense. For the second offense, the student will be automatically given a failing
grade in the subject.
4. Students who will miss a mid-term or final examination, a laboratory exercise or a class project may be excused and allowed to take a special exam, conduct a laboratory exercise or
pass a class project for any of the following reasons:
a. participation in a University/College-approved field trip or activity;
b. due to illness or death in the family; and
c. due to force majeure or natural calamities.

REFERENCES & SUPPLEMENTARY READINGS

References:

A. Required Textbook/Workbook

B. Laboratory Manual (if with laboratory)

C. Electronic References (E-books/Websites)

Bullinaria, John. “Data Structures and Algorithms.” University of Birmingham-School of Computer Science, 27 March 2019, www.cs.bham.ac.uk/~jxb/DSA/dsa.pdf

“Data Structure and Algorithms - Linked List.” Tutorialspoint: Simply Easy Learning, www.tutorialspoint.com/data_structures_algorithms/linked_list_algorithms.htm

Edpresso Team. “How to create a Linked List in Python.” Educative, www.educative.io/edpresso/how-to-create-a-linked-list-in-python

“Linked List | Set 3 (Deleting a node).” GeeksForGeeks, 22 Nov, 2021, www.geeksforgeeks.org/linked-list-set-3-deleting-node/

V02-2020-07-01
 REVISION HISTORY

Revision Number Date of Revision Date of Implementation Highlights of Revision

1 February 8, 2022 2nd Semester, AY 2021-2022 Revised some OBA’s and added references.

2 March 10, 2023 2nd Semester, AY 2022-2023 Face-to-face mode

Prepared by: Evaluated by: Approved:

GLENN CAVIN D. DOCE MICHAEL PAREJA PROF. MARILOU P. LUSECO

Instructor Department Chairperson Campus Administrator
Department of Information Technology Department of Information Technology Cavite State University – General Trias City Campus

E-mail Address: E-mail Address:

glenncalvin.doce@cvsu.edu.ph michael.pareja@cvsu.edu.ph

Date Prepared: March 1, 2023 Date Evaluated: _______________________ Date Approved: ___________________________

V02-2020-07-01