Republic of the Philippines Course Syllabus

DAVAO DEL SUR STATE COLLEGE

Format V 3.0
INSTITUTE OF COMPUTING, ENGINEERING AND TECHNOLOGY INFORMATION SPAMAST
TECHNOLOGY DEPARTMENT

COURSE SYLLABUS
2nd Semester School Year 2019-2020
Course No. : ITC 123
Course Title : DATA STRUCTURE AND ALGORITHM Prepared by: ROGER A. SUSADA JR.
Faculty
rogersusada@gmail.com
Course Description :
The course covers analysis and design of fundamental data
Checked/ DOMINGO V. ORIGINES JR., MIM
structures and engages learners to use data structures as Reviewed by: Chairperson, IT Dept.
tools to algorithmically design efficient computer programs 0929-2238-555
that will cope with the complexity of actual applications. It
focuses on basic and essential topics in data structures, Approved by: MARK JUDE F. TRONDILLO,
including array-based lists, linked lists, skiplists, hash tables, PH.D.
Dean, ICET
recursion, binary trees, scapegoat trees, red–black trees, icet@spamast.edu.ph
heaps, sorting algorithms, graphs, and binary trie.
Course Credit 4.01
:
Prerequisite/s __
:
Contact Hours/ Week : Lecture (2 hours Per Week)
: Laboratory(3 Hours Per Week)

Page 1 of 8
PROGRAM OBJECTIVES

The graduates have the ability to:

1-5 (Common to all programs in all types of schools)
1. Articulate and discuss the latest developments in the specific field of practice (PQF level 6 descriptor)
2. Effectively communicate orally and in writing using both English and Filipino
3. Work effectively and independently in multi-disciplinary and multicultural teams (PQF level 6 descriptor)
4. Act in recognition of professional, social, and ethical responsibility
5. Preserve and promote “Filipino historical and cultural heritage” (based on RA 7722)

6-13 (Common to the discipline Teacher Education)

6. Demonstrate corporate and social responsibility;
7. Implement the basic functions of management and marketing;
8. Use Information and Communication Technology (ICT) effectively and efficiently;
9. Work well with others;
10. Use the proper decision tools to critically, analytically and creatively solve problems and drive results;
11. Understand and apply the concepts of agricultural productivity and sustainability in the context of national, regional and global developments;
12. Engage in agricultural production and post-production activities; and
13. Promote sound agricultural technologies to various clients and in the manpower development for agriculture.

14-15 (Common to graduates of a horizontal type of institution as defined in CMO 46, s. 2012)
14. Graduates of college are qualified for various types of employment and participate in various types of employment, development activities, and
public discourses, particularly in response to the needs of the communities one serves
15. Graduates of State Universities and Colleges (SUCs) must have the competencies to support “national, regional and local development plans”
(RA7722).

Page 2 of 8
 SPAMAST GRADUATE ATTRIBUTES
(A SPAMAST Graduate shall possess. . .)

InnovativenesCreativity and

al skillsEntrepreneuri

s and gender environmental

communicatioLanguage and

teamwork and

responsivenes Socio-cultural,
learningCapability for
competencyProfessional

thinking skillsCritical

competencyoutlook and
interpersonal
skills Leadership,

Universal
PROGRAM OUTCOMES

life-long
1. Articulate and discuss the latest developments in the specific field of practice.

global


sensitivity
(PQF level 6 descriptor)

n skills
2. Effectively communicate orally and in writing using both English and Filipino 
3. Work effectively and independently in multi-disciplinary and multicultural teams.

(PQF level 6 descriptor)
4. Act in recognition of professional, social, and ethical responsibility 
5. Preserve and promote “Filipino historical and cultural heritage” (based on RA

7722)
6. Demonstrate mastery of subject matter/discipline. 
7. Facilitate learning using a wide range of teaching methodologies and delivery

modes appropriate to specific learners and their environments.
8. Develop innovative curricula, instructional plans, teaching approaches, and

resources for diverse learners.
9. Apply skills in the development and utilization of ICT to promote quality, relevant,
 
and sustainable educational practices.
10. Demonstrate a variety of thinking skills in planning, monitoring, assessing, and

reporting learning processes and outcomes.
11. Practice professional and ethical teaching standards sensitive to the local,

national, and global realities.
12. Pursue lifelong learning for personal and professional growth through varied

experiential and field-based opportunities.
13. Exhibit competence in mathematical concepts and procedures.  
14. Graduates of college are qualified for various types of employment and
 
participate in various types of employment
15. Graduates of State Universities and Colleges (SUCs) must have the
competencies to support “national, regional and local development plans” 
(RA7722).

Page 3 of 8
 PO10

PO11

PO16

PO17

PO18
PO12

PO13

PO14

PO15
COURSE INTENDED LEARNING OUTCOMES

PO1

PO2

PO3

PO4

PO5

PO6

PO7

PO8

PO9
At the end of the course, the students can:

CO 1. Explain the systematic methods of efficiently organizing and accessing data

I
in data structures and algorithms.
CO 2. Analyze algorithms using a mathematical notation and experimental studies
and perform comparative analysis of the typical data structures and P P
algorithms.
CO 3. Write code in pseudo code and high-level programming languages for the
P P
implementation of various data structures and algorithms.

LEGEND:
I-INTRODUCED (The student get introduced to the concepts/principles)
P-PRACTICED (The student practices the competencies with supervision)
D-DEMONSTRATED (The student practices the competencies across different settings with minimal supervision)

COURSE PLAN
TEACHING AND
TIME STUDENT LEARNING MA COURSE CONTENT/ SUBJECT LEARNING ASSESSMENT RESOURCES
FRAME OUTCOMES P MATTER ACTIVITIES TASKS (ATs) NEEDED
(TLAs)
Week 1 At the end of the lesson, the -  SPAMAST’s Vision, Mission and Core Power point Oral Recitation DLP
students will be able to: Values (TOP ACCESS) presentation (Collect ideas from Institutions
 Converse the importance of  Program Educational Objectives (Lecture) the student what is InfoGraphics
the course in relation to the  Classroom Policies the implication of
attainment of the Institutions  Grading System Class Discussion OBE)
directions.  Assessment and Evaluation Guidelines
 identify the course and course Written Reflection
requirements (List at least 5
acquired traits in the
core values “TOP
ACCESS” for 2 years
staying in the
institution)

 Know the techniques Introduction  Lecture/Discussio Class Participation

will make algorithms Chapter 1 n Quiz DLP
and data structures  Collections  Guided hands on Oral Recitation Laptop
Week 2 more general and easier  Arrays and ArrayLists session Laboratory exercise White Board
to modify  Direct Marker
 Understand the concept CO1 observation and
of the collection, questioning
describing the two
major collection

Page 4 of 8
 TEACHING AND
TIME STUDENT LEARNING MA COURSE CONTENT/ SUBJECT LEARNING ASSESSMENT RESOURCES
FRAME OUTCOMES P MATTER ACTIVITIES TASKS (ATs) NEEDED
(TLAs)
classifications (linear
and nonlinear).
 Know the importance of
Array that commonly
used data structure in
computer programming.

Week 4  Understand the three Chapter 2:  Lecture/Discussio Class Participation DLP

algorithms for sorting  Basic Sorting Algorithms n Quiz Laptop
data: the Selection sort,  Basic Searching Algorithms  Guided hands on Oral Recitation White Board
the Bubble sort, and the session Laboratory exercise Marker
Insertion sort CO1  Direct
 Understand the CO2 observation and
behavior of Binary questioning.
Searching

Week 5-6  discuss how to use Chapter 3:  Lecture/Discussio Class Participation DLP
these classes Stacks  Stacks and Queues n Quiz Laptop
and Queues  The BitArray Class  Guided hands on Oral Recitation White Board
 Know how to use this session Laboratory exercise Marker
data structure and CO2/  Direct s
examine some CO3 observation and
problems that can be questioning
solved using sets of bits

Week 7 Chapter 4:  Lecture/Discussio Class Participation DLP

 Understand how VB.NET  Strings, the String Class, and the n Quiz Laptop
works with strings, how StringBuilder Class  Guided hands on Oral Recitation White Board
to use the String class, session Laboratory exercise Marker
and how to work with CO2/  Direct
the StringBuilder class CO3 observation and
questioning

Week 8  Know how to form regular Chapter 5:  Lecture/Discussio Class Participation DLP
expressions and how to use  Pattern Matching and Text n Quiz Laptop
them to solve common text- Processing  Guided hands on Oral Recitation White Board
processing tasks. CO2/  Building Dictionaries: The session Laboratory exercise Marker
 Examine the behavior of the CO3 DictionaryBase Class and the

Page 5 of 8
 TEACHING AND
TIME STUDENT LEARNING MA COURSE CONTENT/ SUBJECT LEARNING ASSESSMENT RESOURCES
FRAME OUTCOMES P MATTER ACTIVITIES TASKS (ATs) NEEDED
(TLAs)
SortedList class SortedList Class  Direct
observation and
questioning

Written and practical Questionnaire

Week 9 examination Rubrics
MIDTERM EXAMINATION

Week 10-  Implement a custom hash Chapter 6:  Lecture/Discussio Class Participation DLP
11 table CO1/  Hashing and the Hashtable Class n Quiz Laptop
 Explore one particular type CO3  Linked Lists  Guided hands on Oral Recitation White Board
of list, the linked list. session Laboratory exercise Marker
Although the  Direct Rubrics
observation and
questioning

Week 12-  Implement the Binary tree Chapter 7:  Lecture/Discussio Class Participation DLP
14 and Binary Search tree CO2/  Binary Trees and Binary Search n Quiz Laptop
 discusses the development CO3 Trees  Guided hands on Oral Recitation White Board
of a Set class  Sets session Laboratory exercise Marker
 Examine algorithms for  Advanced Sorting Algorithms  Direct Rubrics
sorting data observation and
questioning

Week 15-  Perform searching Chapter 8:  Lecture/Discussio Class Participation DLP

17 advanced data structures
and algorithms
 Understand how networks
are modeled with graphs
 Examined two advanced
techniques for algorithm
design: dy-namic programs
and greedy algorithms
CO3  Advanced Data Structures and n Quiz Laptop
Algorithms for Searching  Guided hands on Oral Recitation White Board
session Laboratory exercise Marker
 Graphs and Graph Algorithms  Direct Rubrics
observation and
 Advanced Algorithms questioning

Week 18 Written and practical Questionnaire

FINA TERM EXAMINATION
examination Rubrics
COURSE GRADING SYSTEM CLASSROOM POLICY
REQUIREMENTS
Page 6 of 8
 Quizzes 50% - Midterm Grade Attendance is counted from the first day of regular classes regardless of the date of
 Major Exams 50% - Final Term Grade the student’s enrolment thus classes missed due to late enrolment shall be
 Assignments Final Grade = (MTG + FTG)/2 considered absent
 Compilation of
laboratory output Lecture (40%) A student who has incurred absences of more than 20% of total class meeting in a
30%: Classroom given time shall not be given credit for the course or subject
Participation
30% : Project Subjects with or without laboratory and more than 3 units subjects is as follows:
40% : Periodical Examination Any subject meeting 1 x a week = 3 absences max. = 4 absences over cut
(Mid Term and Final Term Any subject meeting 2 x a week = 7 absences max. = 8 absences over cut
100%Exam) Any subject meeting 3 x a week = 10 absences max.= 11 absences over cut
Any student who exceeds the prescribed maximum numbers of cuts for a particular
Laboratory (60%) subject is considered dropped, and shall receive a corresponding remark in the
30% : Laboratory Exercises Report of Grades of DROPPED for the semester regardless of his performance in the
30% : Project class as of the date of debarment.
40% : Practical Examination Note: Other classroom policies, please refer to the student handbook
(Mid Term and Final Term
100% Exam)

Grade Equivalent
0 Base equivalent percentage
computations is used with 75% for
Licensure programs & 50% for non-
board programs.

SUGGESTED READINGS AND REFERENCES Counterchecked by:

TEXTBOOK
 DATA STRUCTURES AND ALGORITHMS USING VISUAL BASIC.NET
MICHAEL MCMILLAN
Pulaski Technical College MABELL B. BRIGOLE,
MAED-LS
Director, Library Services

DOMINGO V. ORIGINES JR.,

MIM
IT-Department Chairperson

Page 7 of 8
Page 8 of 8