Republic of the Philippines

North Eastern Mindanao State University

Lianga, Surigao del Sur
Telefax No. 086-214-4221
086-214-2723
www.nemsu.edu.ph

OUTCOMES-BASED COURSE SYLLABUS IN

CS213 – DATA STRUCTURES AND ALGORITHMS
1st Semester, A.Y. 2023 – 2024

PHILOSOPHY

NEMSU believes that higher education is an instrument for the improvement of life through democratized access to quality education in the development
of a well-rounded person.

VISION
A transformative leading University in Asia and the Pacific.

MISSION
NEMSU shall provide competency-based higher education training through transformative instruction, relevant research, sustainable extension and
production responsive to local, regional and global trends.
1. Produce competent and skilled graduates prepared for gainful employment;
2. Develop graduates who shall not only foster economic progress but also care for the environment, adhere to positive value system, and preserve
cultural heritage;
3. Engage in high-impact research for instruction and develop technology for food security and renewable energy;
4. Collaborate with government and non-government agencies to help improve the lives of the marginalized groups; and
5. Promote cooperation/partnership among regional, national, and ASEAN institutions in Higher Education.

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 1

CORE VALUES

Competence
A combination of observable and measurable knowledge, skills, abilities, and personal attributes that contribute to enhance SDSSU
employee and student performance and ultimately result in organizational success.

Accountability
Responsibility for own actions, decisions and commitment to accomplish work in an ethical, efficient, cost-effective and transparent manner
manifesting the value of sound stewardship in the wise use of resources for common good.

Responsiveness
A prompt action, consistent communication, quality information, and a focus on providing a superior experience to stakeholders.

Excellence
The quality spectrum at exceptional levels demonstrated by learning outcomes and the development of shared culture of quality consistent
with the vision, mission and goals of University.
Service
Dedication for a continuous improvement of services, stakeholder’s relationships and partnership which stresses interdependence and
collaboration for a sustainable success of clients and their communities in helping build a just, peaceful, stable and progressive Filipino
nation.

NEMSU CARES…

These core values are not descriptions of the work we do, nor the strategies we employ to accomplish our University vision. They are the core
values that underlie our works and interactions as we internalize responsibilities to fulfil our mission. They are the basic elements of how we go about
our work and how we deal with stakeholders, molds students to become competent, innovative, globally competitive and service-oriented.

QUALITY POLICY

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 2

 The North Eastern Mindanao State University commits itself to produce highly motivated, globally competitive, and morally upright human
resource through the delivery of transformative and quality higher education that conforms to international standards driven by excellent instruction,
relevant researches, sustainable extension, and production services. Together with our stakeholders, we shall endeavor for continual improvement of
our quality management system in consonance with statutory and regulatory requirements for clients and industry satisfaction for quality of life.

INSTITUTIONAL LEARNING OUTCOMES (ILOs)

ILO1. Imbue global competency and innovation for a future-ready workforce.

ILO2. Acculturate the values of professionalism, honor, and excellence that promote productivity in the workplace and the community.
ILO3. Propagate the culture of research, extension, and production for sustainable economic viability, environmental stewardship, and social equity in
North Eastern Mindanao and beyond.

PROGRAM GOALS
The College of Information Technology Education (CITE) with its competent faculty, ensures that graduates are equipped to join the national and
international workforce imbued with ethical values and ideals in humane environment supportive to national thrust for social transformation and
responsibilities in the selection, development, application, integration and management of computing technologies.
The College is committed to:
5.1. Ensure high standard in instruction to produce quality and competent graduates;
5.2. Guarantee involvement faculty, staff and students in enhancement and training programs to be able to come up with environment-
friendly and practical innovation that shall aid in the transfer of technology for community outreach activities;
5.3. Strengthen sense of professionalism and ethical values to maintain morals of the society;
5.4. Conduct relevant researches and experiments that shall add to existing body of scientific knowledge;
5.5. Promote linkages with other academic units and industries, locally, and globally to keep pace with the fast and constantly evolving
technology.

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 3

PROGRAM LEARNING OUTCOMES(PLOs)

Graduates of a BSCS program should be able to:

PROGRAM
PROGRAM LEARNING LEARNING
DESIRED GRADUATE OUTCOMES DESCRIPTOR
OUTCOMES OUTCOMES
CODE

Knowledge for Apply knowledge of computing fundamentals, knowledge of a computing

Solving Computing specialization, and mathematics, science, and domain knowledge
CS01 Enabler
Problems appropriate for the computing specialization to the abstraction and
conceptualization of computing models from defined problems and
requirements.

Identify, analyze, formulate, research literature, and solve complex

Problem Analysis CS02 computing problems and requirements reaching substantiated Enabler
conclusions using fundamental principles of mathematics, computing
sciences, and relevant domain disciplines.

An ability to apply mathematical foundations, algorithmic principles and

CS03 computer science theory in the modeling and design of computer-based Enabler
systems in a way that demonstrates comprehensions of the tradeoffs
Design/Development involved in design choices.
of Solutions
Design and evaluate solutions for complex computing problems, and
CS05 design and evaluate systems, components, or processes that meet Introductory
specified needs with appropriate consideration for public health and
safety, cultural, societal, and environmental considerations.

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 4

COURSE CODE : CS 213
COURSE DESCRIPTIVE TITLE: Data Structures and Algorithms
COURSE PRE-REQUISITE : CS 122- Intermediate Programming (Java)
CREDIT UNITS : 3 units
NO. OF HOURS : 2 hours lecture and 3 hours laboratory per week

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. Thorough discussion of sorting and
searching algorithms and hashing is covered.

COURSE LEARNING OUTCOMES(CLOs):

Course Learning Outcomes ILO Code/s PLO Code/s

CLO1. Argue strengths and weaknesses among multiple implementations for a problem (i.e. on the ILO2 CS01/CS02
aspects of abstraction, encapsulation, and information hiding.

CLO2. Design, implement, test, and debug a program, based on a given specification, that uses and ILO1 CS03/CS05
implements abstract data types (stacks queues, priority queues, sets, maps)

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 5

Detailed Course Learning Plan

Time Course Intended Learning Topics/Content Instructional Learning Assessment CLOs Code
Frame Outcomes (CILOs) Methodology Materials/Res
(Face-to-Face and ources
Remote Teaching) ]
At the end of the lesson, the
students are expected to Face-to-Face
understand: Orientation of the Thareja R.,
Course:  Interactive discussion (2020). Data
 a. Define course outline, Course syllabus of the topics Structures
Week 1-2 syllabus, grading system etc. Grading System  Brainstorming Using C
 b. Explain computer and Course performance  Quizzing  Oral graded
programming basics. indicators  Think-pair-share recitation
Class/course policy  Cooperative learning  Quiz Show
Introduction and structures  Memory
Overview of the Matrix
Course  Discussion
UNIT 1: Introduction to Remote Teaching  Quizzes
C  Open-
o Introduction  Self-paced ended/
o Identifiers and Learning https:// Essay
keywords  Online platforms for www.geeksforg  Recitation
o Basic DT posting deliverables eeks.org/learn-
o Operators and  Distribution of Course data-
Expressions Materials structures-and-
o Functions  Focused Listing algorithms-dsa-
o Pointers  Problem Solving tutorial/

 Define basic terminology related UNIT 2: Introduction to Face-to-Face Thareja R.,

Week 3-4 to data structures and Data Structures and (2020). Data

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 6

 algorithms. Algorithms  Interactive Structures
 Explain abstract data types o Basic Discussion Using C
(ADTs) and their importance. Terminology  Mind mapping
 Identify different algorithms. o Abstract DT  Brainstorming(Think,  Forum Post
 Implement basic data structures o Algorithms Pair and Share) Quizzes
like arrays and linked lists. o Time and Space  Collaborative  Drag-And-
 Explain the concept of arrays Complexity Learning/ Buzz Drop
and their relevance. UNIT 3: Arrays Session Activities
 Demonstrate practical o Introduction  Problem Solving  Hands-on
implementation of array o Declaration of . Activities
operations. Remote Teaching  Quiz
Arrays
 Oral graded
o Operations on
 Self-paced https://
Arrays
Learning www.geeksforg
 Online platforms for eeks.org/learn-
posting deliverables data-
 Distribution of Course structures-and-
Materials algorithms-dsa-
 Focused Listing tutorial/
 Problem Solving

At the end of the lesson, the

students are expected to UNIT 4: Strings Face-to-Face  Think-
distinguish: Operations on Strings Thareja R., Pair-Share
o Arrays of  Interactive (2020). Data  Concept
Week 5-8  Define and describe the Strings Discussion Structures Mapping
operations that can be performed o Pointers and  Mind mapping Using C  Quiz Show
on strings. Strings  Brainstorming(Think,  Memory
Pair and Share) Matrix
 Utilize pointers to manipulate and UNIT 5: Structures and

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 7

 process strings effectively. Unions  Collaborative  Hands-on
 Introduce the concept of o Introduction Learning/ Buzz Activities
structures, unions and basic  Structure Session  Long Quiz
terminologies associated with linked Declarati  Problem Solving  Oral graded
on
lists. Remote Teaching
 Typedef
 Create and manipulate nested Declarati
structures. ons  Self-paced
 Develop algorithms to o Initialization of Learning https://
manipulate and traverse linked lists. Structures  Online platforms for www.geeksforg
UNIT 6: Linked Lists posting deliverables eeks.org/learn-
o Introduction  Distribution of Course data-
 Basic Materials structures-and-
Terminol  Focused Listing algorithms-dsa-
ogies  Problem Solving tutorial/.
 Singly
Linked
Lists
 Circular
Linked
Lists
 Doubly
Linked
Lists
MIDTERM

At the end of the lesson, the  Forum Post

Week 10 - students are expected to examine: UNIT 7: Stacks Face-to-Face Thareja R., Quizzes
12 o Introduction to (2020). Data  Drag-And-
 Define and explain the concept Stacks  Interactive Structures Drop
of stacks and their o Operations on Discussion Using C Activities
characteristics and also the Stack  Mind mapping  Dialog
concept of queues and their UNIT 8: Queues  Brainstorming(Think, Simulations

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 8

 significance in computing. o Introduction to Pair and Share)  Hands-on
 Apply basic queue operations Queues  Collaborative Activity
such as enqueue and dequeue. o Types of Learning/ Buzz  Oral graded
Queues Session
 Problem Solving

Remote Teaching

 Self-paced https://
Learning www.geeksforg
 Online platforms for eeks.org/learn-
posting deliverables data-
 Distribution of Course structures-and-
Materials algorithms-dsa-
 Focused Listing tutorial/
 Problem Solving


At the end of the lesson, the Face-to-Face

students are expected to construct: UNIT 9: Trees Thareja R.,
Week 13 -  Define and categorize various o Types of  Interactive (2020). Data
17 types of trees, including binary Trees Discussion Structures  Think-
trees, binary search trees, and o Efficient  Mind mapping Using C Pair-Share
balanced trees. Binary Trees  Brainstorming(Think,  Concept
 Introduce and explain UNIT 10: Graphs Pair and Share) Mapping
fundamental graph terminology, o Graph  Collaborative  Quiz Show
including vertices and edges, Terminology Learning/ Buzz  Memory
along with essential searching Session Matrix
and sorting algorithms.  Problem Solving  Hands-on
Additionally, covers different UNIT 10: Searching and Activities
types of graphs. Sorting Remote Teaching  Oral graded

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 9

  Develop algorithms for common  Long Quiz
tree operations such as  Self-paced https://
insertion, deletion, and traversal. Learning www.geeksforg
 Online platforms for eeks.org/learn-
posting deliverables data-
 Distribution of Course structures-and-
Materials algorithms-dsa-
 Focused Listing tutorial/
 Problem Solving

FINALS

COURSE REFERENCES AND SUPPLEMENTAL READINGS

a. Textbooks/E- books

 Thareja R., (2020). Data Structures Using C.

Sahni S. and Ellis H.,et.al. Fundamentals of Data Structures in C.
 Seymour L., (2020). Data structures with C.
 Robert K., C.L Tondo, et. al. Data Structures and Program Design in C.
 Jhon B., (2019). Data Structures and Algorithms.
b. Online References

 https://www.geeksforgeeks.org/learn-data-structures-and-algorithms-dsa-tutorial/
for-beginners.html.July, 15, 2022.
 https://medium.com/javarevisited/top-10-free-data-structure-and-algorithms-courses-for-beginners-best-of-lot-ad807cc55f7a
 https://www.freecodecamp.org/news/these-are-the-best-free-courses-to-learn-data-structures-and-algorithms-in-depth-4d52f0d6b35a/
 https://www.udemy.com/course/data-structures-in-c/

Other Readings:

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 10

  https://medium.com/javarevisited/top-10-free-data-structure-and-algorithms-courses-for-beginners-best-of-lot-ad807cc55f7a

COURSE REQUIREMENTS

 Individual and Pair Hands-on Activities

 Individual Projects/Requirements for Midterm and Final Term

GRADING SYSTEM

Laboratory Subject

Class standing……………………………………………. .30%

Requirements……………………………………………… 40%
Examinations……………………………………………… 30%
TOTAL 100%

COURSE POLICIES

Academic Integrity
Academic honesty is required of all students. Plagiarism--to take and pass off as one’s own work, the work or ideas of another--is a form of
academic dishonesty. Penalties may be assigned for any form of academic dishonesty” (See Student Handbook/College Manual). Sanctions for

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 11

 breaches in academic integrity may include receiving a grade of “Failed” on a test or assignment. In addition, the Director of Student Affairs may
impose further administrative sanctions.
Description 0 1 2 3
Follows
appropriate coding / Program
Rubric for Script
or guidelines /
Description
template 0 1 2 3
Use appropriate
1
control
variablestructure
name /
YES 2 YES
desired method 1 YES 2 YES
Use appropriate No and and 1 YES
Apply the No and 2
variable type 2 NO 1 YES
and
techniques of NO NO
NO
decomposition
Use appropriate to
break
controlastructure
program
into smaller pieces
or follows the
Rubric for
required Coding Style
technique
Description 0 1 2
Follows the
naming 1 YES
convention No and 1 YES
Follows indention NO
rule

Rubric for Project

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 12

Date Revised /Prepared : Sept. 06, 2023
Effectivity : 1st Semester 2023-2024

Recommending
Prepared by Content Noted Reviewed by Approved by
Approval
JOSEPHINE L. BULILAN, ESMAEL V. MALIBERAN, DIT
MIT Chair, Department of Computer
BSCS Program Studies, Tandag Campus
Coordinator, Tandag Date:________________
Campus
JENAME R. TADLIP Date:_________________
CITE Faculty _ NELYNE LOURDES Y.
Date: Sept 6, 2023 PLAZA,PhD
JOEL GRACIA, MSCS Chair, Department of Computer
BSCS Program Studies, Cantilan Campus
Coordinator, Cantilan Date:________________

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 13

 Campus
Date:_________________
_ CHRISTINE W. PITOS,MSCS
Chair, Department of Computer BORN CHRISTIAN A. MARIA LADY SOL A.
SHARON G. ARREZA,MIT Studies,Lianga Campus ISIP, DTE SUAZO, PhD
BSInfoTech Program Date:__________________ Dean, College of Vice President for
Coordinator, Cantilan Information Technology Academic Affairs
Campus Education Date: _________________
Date:_________________ Date:______________
_ _

BETCHIE CLAIRE E. MYELINDA A.

DUERO,MIT BALDELOVAR,DIT
BSInfoTech Program Chair, Department of Computer
Coordinator, Cagwait Studies,Tagbina Campus
Campus Date:__________________
Date:_________________
_

CHRISTINE W.
PITOS,MSCS
Program Coordinator,
BSCS Lianga Campus
Date:_________________
_

MYELINDA A.
BALDELOVAR,DIT
Program Coordinator,
BSCS Tagbina Campus
Date:_________________
_

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 14

CS213 – DATA STRUCTURES AND ALGORITHMS FM-ACAD-011/Rev.003/1.26.2023/Page 15