Republic of the Philippines

Department: VP FOR ACADEMIC AFFAIRS

ILOILO SCIENCE AND TECHNOLOGY UNIVERSITY
La Paz, Iloilo City
Document Code QP-VPAA-13
LA PAZ CAMPUS
Rev. No.: 03
OUTCOME-BASED COURSE SYLLABUS IN ICT 34: DATA STRUCTURE AND ANALYSIS OF ALGORITHM Effective Date: November 2, 2017

I. NAME OF THE UNIVERSITY: Iloilo Science and Technology University

VISION: ISAT U as a leading science and technology university in Southeast Asia by 2030
MISSION: The University is committed to provide quality and relevant advanced education, higher technological, professional
instruction and training arts, sciences, education, architecture, engineering, agriculture, forestry and other field so study,
thereby producing locally oriented, globally competitive and eco- friendly human resources. It shall promote research and
development programs to advance science and technology and undertake sustainable extension and production activities.
CORE VALUES: Integrity, Commitment, Accountable, Responsiveness, Excellence

INSTITUTIONAL GOALS:
1. To provide a nurturing environment where academic freedom is guaranteed and respected for the optimum development of human potential.
2. To produce highly competent and eco-friendly graduates, who will become leaders and experts in their fields of specialization?
3. To conduct research towards the advancement of science and technology.
4. To provide extension and production activities for the improvement of the quality of life in the community.
5. To provide effective and efficient delivery of services through responsive management of human, physical, financial, and information resources.

INSTITUTIONAL OUTCOMES:
1. ISAT U graduates will demonstrate:
a. love of God and Nation;
b. expertise in their field of specialization;
c. leadership in the practice of their profession;
d. social responsiveness, gender sensitivity and respect towards people and environment;
e. awareness of and concern to domestic and global issues;
f. ability to communicate effectively and think critically and creatively.
2. ISAT U graduates will work:
a. with integrity and commitment in their respective fields of endeavors;
b. harmoniously in a multi-disciplinary and multi-cultural environment
3. ISAT U graduates will engage in:
a. life-long learning by keeping abreast with the latest development in the society;
b. the development and transfer of technology.
II. PROGRAM/DEGREE: BSIS/BSIF/BSCS
III. PROGRAM/DEGREE OUTCOMES:
The graduate of BSCS, BSIS, and BSIF must have the ability to:
1. Analyze complex problems and identify and define the computing requirements needed to design an appropriate solution.
2. Apply computing and other knowledge domains to address real world problems.
3. Design and develop computing solutions using a system level perspective.
4. Utilize modern computing tools.

Page 1 of 9
 Republic of the Philippines
Department: VP FOR ACADEMIC AFFAIRS
ILOILO SCIENCE AND TECHNOLOGY UNIVERSITY
La Paz, Iloilo City
Document Code QP-VPAA-13
LA PAZ CAMPUS
Rev. No.: 03
OUTCOME-BASED COURSE SYLLABUS IN ICT 34: DATA STRUCTURE AND ANALYSIS OF ALGORITHM Effective Date: November 2, 2017

IV. COURSE NUMBER AND TITLE: ICT 34 – Data Structures and Analysis of Algorithm
V. COURSE PRE-REQUISITE : ICT 4 – Programming 1
VI. COURSE CREDIT/UNITS: 3
VII. CONTACT HOURS/WEEK: 5
VIII. YEAR /SEMESTER OFFERED: 2nd Semester SY 2017-2018
IX. COURSE DESCRIPTION: This course will deal on data abstraction and algorithmic use of complex data structures (files, lists, queues, stacks, trees,
etc); dynamic variables and their implementation in memory: development of recursive algorithms, their implementation and comparison with iteration and file
accessing techniques. Set relational and hierarchical data models. Sorting algorithms like quicksort, shellsort, heapsort, mergesort and bucketsort. C is the
programming language used.
X. COURSE OUTCOMES: Common to the Discipline (BSIF,BSIS and BSCS)
1. Identify fundamental data structures and algorithms and summarize their typical uses, strengths, and weaknesses
2. Analyse the complexity of algorithms
3. Solve problems computationally through the application of fundamental data structures and algorithms Convey results of data analysis to
organizational stakeholders at various levels

XI. LEARNING PLAN:

DESIRED LEARNING COURSE CONTENT/SUBJECT TEACHING AND LEARNING

TEXTBOOKS/REFERENCES ASSESSMENT OF TASKS (AT’s) RESOURCE MATERIAL TIME TABLE
OUTCOMES (DLO) MATTER ACTIVITIES (TLA’s)
Lecture Laboratory Lecture Laboratory
At the end of the unit, the Unit O: University Code Discussion laboratory Written examination PowerPoint 2 hrs lec
students must have: Vision, Mission, Core Values Question and orientation presentations 3 hrs lab
1. Identified, described and Outcomes Student Handbook Answer (1st Week Nov)
and explained the Activity Sheets (Nov. 6-10, 2017)
vision, mission, core 1. The university Vision, Bulletin of Information
values of the University Mission, Core Values and
and the institutional, Outcomes
college/campus, 2. Class Orientation
degrees and course
outcomes
1. defined an algorithm Unit 1: The Basis Data Structures & Algorithms Board work hands on Paper and Pen 4 hrs
2. computed the 1. Overview (2016). Tutorials Point (I) Pvt. Lecture and activity using test Graded Slide Presentation 6 hrs lab
complexity of (2nd- 3rd Week Nov)

Page 2 of 9
 Republic of the Philippines
Department: VP FOR ACADEMIC AFFAIRS
ILOILO SCIENCE AND TECHNOLOGY UNIVERSITY
La Paz, Iloilo City
Document Code QP-VPAA-13
LA PAZ CAMPUS
Rev. No.: 03
OUTCOME-BASED COURSE SYLLABUS IN ICT 34: DATA STRUCTURE AND ANALYSIS OF ALGORITHM Effective Date: November 2, 2017

DESIRED LEARNING COURSE CONTENT/SUBJECT TEACHING AND LEARNING

TEXTBOOKS/REFERENCES ASSESSMENT OF TASKS (AT’s) RESOURCE MATERIAL TIME TABLE
OUTCOMES (DLO) MATTER ACTIVITIES (TLA’s)
Lecture Laboratory Lecture Laboratory
algorithms and 2. Algorithm basics Ltd. discussion Java or C Assignment Laboratory Sample Problem (Nov. 6-17, 2017)
determined its 3. Asymptotic Analysis Demonstratio Solving the Seatwork Exercises Soft copy of the
efficiency a. Substitution Shaffer,Clifford A. (2012). Data n running time Board work references
b. Iteration
Structures and Algorithm Question and of a program
c. Master Theorem
Analysis Answer
Edition 3.2 (Java version) Brainstorm
Group work

1. Explained the Unit 2: Algorithm Paradigms Data Structures & Algorithms Board work Hand on Quiz Hands on PowerPoint 2 hrs lec
concepts and a. Divide and Conquer (2016). Tutorials Point (I) Pvt. Demonstrati Activity using Seat Work Graded presentation 3 hrs lab
performed algorithm Strategy Ltd. on C /Java activity in Laboratory Sample problem (4th Week Nov)
analysis and design. b. Greedy Algorithms Binary Search (Nov. 20-24, 2017)
Question Board work java Exercises
2. Distinguished, Dynamic Programming algorithm
compared and Shaffer,Clifford A. (2012) Data and Answer Reflective
Structures and Algorithm Brainstorm implementatio discussion
performed the
different type and Analysis Group work n
concepts of Edition 3.2 (Java version) Lecture and
algorithms. discussion

1. Defined data, data UNIT 3: Introduction to Data Data Structures & Algorithms Board work Program Quiz Computer Slide Presentation 2 hrs lec
objects, data type Structures (2016). Tutorials Point (I) Pvt. Lecture and tracing Assignment Hands-on Sample Problem 3 hrs lab
2. Enumerated and Ltd. discussion Computer Homework Exercises Soft copy of the (1st Week Dec)
differentiated basic references (Dec 4-8, 2017)
Basic Concepts Demonstratio hands-on Exams Practical Exams
data structure
operations Arrays Shaffer,Clifford A. (2012) Data n activities Recitations
3. Defined an array and 1. What is Array Structures and Algorithm Question and using C or
syntax in C 2. Declaring Analysis Answer Java
4. Solved programming 3. Initializing Edition 3.2 (Java version). Brainstorm Arrays
problems using 4. Accessing
Group work Implementati
Arrays Multi-dimensional Arrays
Problem on
solving

Page 3 of 9
 Republic of the Philippines
Department: VP FOR ACADEMIC AFFAIRS
ILOILO SCIENCE AND TECHNOLOGY UNIVERSITY
La Paz, Iloilo City
Document Code QP-VPAA-13
LA PAZ CAMPUS
Rev. No.: 03
OUTCOME-BASED COURSE SYLLABUS IN ICT 34: DATA STRUCTURE AND ANALYSIS OF ALGORITHM Effective Date: November 2, 2017

DESIRED LEARNING COURSE CONTENT/SUBJECT TEACHING AND LEARNING

TEXTBOOKS/REFERENCES ASSESSMENT OF TASKS (AT’s) RESOURCE MATERIAL TIME TABLE
OUTCOMES (DLO) MATTER ACTIVITIES (TLA’s)
Lecture Laboratory Lecture Laboratory
5. Defined a pointer and Pointers K. Raghava Rao (2013). Board work Program Quiz Computer Slide Presentation 2 hrs lec
syntax in C 1. What is Pointer Introduction to Design Analysis Lecture and tracing Assignment Hands-on Sample Problem 3 hrs lab
6. Solved programming 2. Declaring of Algorithms. discussion Computer Homework Exercises Soft copy of the (2nd Week Dec)
problems using 3. Initializing https://www.smashwords.c references (Dec 11-15, 2017)
Demonstratio hands-on Exams Practical Exams
Pointers 4. Accessing om/Essay/Technology. n activities Recitations
Data Structures &
Question and using C -
Algorithms (2016). Tutorials
Answer Pointer
Point (I) Pvt. Ltd.
Brainstorm Implementati
Shaffer,Clifford A. (2012) Group work ons
Data Structures and Problem
Algorithm Analysis solving
Edition 3.2 (Java version). Pseudocodin
g

7. Defined a structure Structures Data Structures & Algorithms Board work Program Quiz Computer Slide Presentation 4 hrs lec
and syntax in C 1. What is Structure (2016). Tutorials Point (I) Pvt. Lecture and tracing Assignment Hands-on Sample Problem 6 hrs lab
8. Solved programming 2. Declaring Ltd. discussion Computer Homework Exercises Soft copy of the (1st - 2nd Week Jan)
problems using 3. Initializing references (Jan 2-13, 2018)
Demonstratio hands-on Exams Practical Exams
Structures 4. Accessing Shaffer,Clifford A. (2012) Data n activities Recitations
Structures and Algorithm Question and Structure
Analysis Edition 3.2 (Java Answer Implementati
version). Brainstorm on using C
Group work
Problem
solving
Pseudocodin
g

Midterm Exam – 3rd week of January 16 – 19, 2018

Page 4 of 9
 Republic of the Philippines
Department: VP FOR ACADEMIC AFFAIRS
ILOILO SCIENCE AND TECHNOLOGY UNIVERSITY
La Paz, Iloilo City
Document Code QP-VPAA-13
LA PAZ CAMPUS
Rev. No.: 03
OUTCOME-BASED COURSE SYLLABUS IN ICT 34: DATA STRUCTURE AND ANALYSIS OF ALGORITHM Effective Date: November 2, 2017

DESIRED LEARNING COURSE CONTENT/SUBJECT TEACHING AND LEARNING

TEXTBOOKS/REFERENCES ASSESSMENT OF TASKS (AT’s) RESOURCE MATERIAL TIME TABLE
OUTCOMES (DLO) MATTER ACTIVITIES (TLA’s)
Lecture Laboratory Lecture Laboratory
9. Added, deleted, Lists Data Structures & Algorithms Board work Program Quiz Computer Slide Presentation 2 hrs lec
and inserted 1. What is a List (2016). Tutorials Point (I) Pvt. Lecture and tracing Assignment Hands-on Sample Problem 3 hrs lab
elements in a list 2. Declaring Ltd. discussion Computer Homework Exercises Soft copy of the (4th Week Jan)
3. Initializing references (Jan 22-26, 2018)
Demonstratio hands-on Exams Practical Exams
4. Accessing
Shaffer,Clifford A. (2012) Data n activities Recitations
5. Types of Lists
Structures and Algorithm Question and Lists
Analysis Edition 3.2 (Java Answer Implementati
version). Brainstorm on Using C
Group work
Problem
solving
Pseudocodin
g
10. Performed stack Stacks, Queues, Heaps Data Structures & Algorithms Board work Program Quiz Computer Slide Presentation 4 hrs lec
operations and 1. What is a Stack (2016). Tutorials Point (I) Pvt. Lecture and tracing Assignment Hands-on Sample Problem 6 hrs lab
implement in C 2. What is a Queue Ltd. discussion Computer Homework Exercises Soft copy of the (1st - 2nd Week Feb)
11. Defined, illustrated 3. Declaring references (Jan 30-Feb 10, 2018)
Demonstratio hands-on Exams Practical Exams
and implemented 4. Initializing
Priority Queues Shaffer,Clifford A. (2012) Data n activities on Recitations
5. Accessing
Structures and Algorithm Question and Stacks,
Priority Queues(Heaps) Analysis Answer Queues,
1. What is a heap Edition 3.2 (Java version). Brainstorm Heaps
2. Declaring Group work Implementati
3. Initializing Problem ons using C
4. Accessing solving

12. Defined linear, Searching techniques Data Structures & Algorithms Board work Program Quiz Computer Slide Presentation 4 hrs lec
binary, a. Linear (2016). Tutorials Point (I) Pvt. Lecture and tracing Assignment Hands-on Sample Problem 6 hrs lab
interpolation and b. Binary Ltd. discussion aid/slide Homework Exercises Soft copy of the (3rd – 4th Week Feb)
Hash tables. references (Feb13-24, 2018)
c. Interpolation Demonstratio presentation Exams Practical Exams
13. Defined Selection,

Page 5 of 9
 Republic of the Philippines
Department: VP FOR ACADEMIC AFFAIRS
ILOILO SCIENCE AND TECHNOLOGY UNIVERSITY
La Paz, Iloilo City
Document Code QP-VPAA-13
LA PAZ CAMPUS
Rev. No.: 03
OUTCOME-BASED COURSE SYLLABUS IN ICT 34: DATA STRUCTURE AND ANALYSIS OF ALGORITHM Effective Date: November 2, 2017

DESIRED LEARNING COURSE CONTENT/SUBJECT TEACHING AND LEARNING

TEXTBOOKS/REFERENCES ASSESSMENT OF TASKS (AT’s) RESOURCE MATERIAL TIME TABLE
OUTCOMES (DLO) MATTER ACTIVITIES (TLA’s)
Lecture Laboratory Lecture Laboratory
Insertion, and d. Hash table Shaffer,Clifford A. (2012) Data n Computer Recitations
Merge Sort Structures and Algorithm Question and hands-on
14. Implemented in Sorting Techniques Analysis Answer activities on
the laboratory
a. Selection Edition 3.2 (Java version). Brainstorm Searching
searching and
sorting techniques b. Insertion Group work techniques
c. Merge Problem
solving
Pseudocodin
g
1. Defined and illustrate Trees Data Structures & Algorithms Board work Problem Quiz Computer Slide Presentation 4 hrs lec
the concepts of trees. 1. What is a tree (2016). Tutorials Point (I) Pvt. Lecture and solving Assignment Hands-on Sample Problem 6 hrs lab
2. Declaring Ltd. discussion Pseudocodin Homework Exercises Soft copy of the (1st – 2nd Week Mar)
2. Declared, Initialized, 3. Initializing references (Feb 27-Mar 10,
Demonstratio g Exams Practical Exams
Accessed Binary, AVL 4. Accessing 2018)
and Expression Trees Shaffer,Clifford A. (2012) Data n Program Recitations
5. Binary Tree
6. AVL Tree Structures and Algorithm Question and tracing
7. Expression Trees Analysis Edition 3.2 (Java Answer Computer
version). Brainstorm hands-on
Group work activities
Trees
Implementati
on using C
Graph Data Structure Data Structures & Algorithms Board work Problem Quiz Computer Slide Presentation 2 hrs lec
a. Intro (2016). Tutorials Point (I) Pvt. Lecture and solving Assignment Hands-on Sample Problem 3 hrs lab
b. Breadth First Search Ltd. discussion Pseudocodin Homework Exercises Soft copy of the (3rd Week Mar)
references (Mar 13-17, 2018)
c. Depth First Search Demonstratio g Exams Practical Exams
Shaffer,Clifford A. (2012) Data n Computer Recitations
Structures and Algorithm Question and hands-on
Analysis Edition 3.2 (Java Answer activities
version). Brainstorm Graph Data

Page 6 of 9
 Republic of the Philippines
Department: VP FOR ACADEMIC AFFAIRS
ILOILO SCIENCE AND TECHNOLOGY UNIVERSITY
La Paz, Iloilo City
Document Code QP-VPAA-13
LA PAZ CAMPUS
Rev. No.: 03
OUTCOME-BASED COURSE SYLLABUS IN ICT 34: DATA STRUCTURE AND ANALYSIS OF ALGORITHM Effective Date: November 2, 2017

DESIRED LEARNING COURSE CONTENT/SUBJECT TEACHING AND LEARNING

TEXTBOOKS/REFERENCES ASSESSMENT OF TASKS (AT’s) RESOURCE MATERIAL TIME TABLE
OUTCOMES (DLO) MATTER ACTIVITIES (TLA’s)
Lecture Laboratory Lecture Laboratory
Group work Structure
Implementati
on using C
Program
tracing

Final Exam – Week 18 March 20-23, 2018

XII. COURSE REQUIREMENTS

C Programs to be performed in the laboratory, Major Exams, Quizzes

XIII. CRITERIA FOR GRADING:

To pass this course, one must accumulate at least 60 % through the course requirements. The maximum points that a student can obtain through each requirement are
shown below.

Requirement/Assessment Task Maximum Percentage

Quizzes 20%
Midterm/Final Exam 40%
Laboratory Exercises 40%
100%

Note: In the normal course of operation, this course syllabus shall be revisited every two years for possible revision of its content. If new DepEd/CHED programs, CMO’s and university
policies or other policies that will greatly affect the course content, it shall be revised immediately to cater to the demands of the new programs, CMO’s, policies, etc.

Latest revision date:

Prepared and designed for the Computer Department.

Page 7 of 9
 Republic of the Philippines
Department: VP FOR ACADEMIC AFFAIRS
ILOILO SCIENCE AND TECHNOLOGY UNIVERSITY
La Paz, Iloilo City
Document Code QP-VPAA-13
LA PAZ CAMPUS
Rev. No.: 03
OUTCOME-BASED COURSE SYLLABUS IN ICT 34: DATA STRUCTURE AND ANALYSIS OF ALGORITHM Effective Date: November 2, 2017

MAY FLORENCE J. FRANCO ERNEST ANDREIGH CENTINA CHRISTIAN LESTER GIMENO

Instructor Instructor Instructor

Noted and checked: Concurred:

PROF. TRACY N. TACUBAN DR. ALEJO P. BITON

Department Head, Computer Department Dean, College of Arts and Sciences

Approved for Use:

DR. MANUEL SANCHEZ JR.

Vice President for Academic Affairs

Date Suggested Enhancement/Teacher

Page 8 of 9
 Republic of the Philippines
Department: VP FOR ACADEMIC AFFAIRS
ILOILO SCIENCE AND TECHNOLOGY UNIVERSITY
La Paz, Iloilo City
Document Code QP-VPAA-13
LA PAZ CAMPUS
Rev. No.: 03
OUTCOME-BASED COURSE SYLLABUS IN ICT 34: DATA STRUCTURE AND ANALYSIS OF ALGORITHM Effective Date: November 2, 2017

SUBJECT ENHANCEMENTS TO BE CONSIDERED DURING SUBJECT REVISION

Note: This page shall be reserved for suggested revisions on the subject which will be taken up during the deliberation/revisit of the course syllabus. Revisions may be in the form of the
methods of teaching, references, and logical flow of the course topics, the style of evaluation, and anything that will effectively produce positive results.

Page 9 of 9