Republic of the Philippines

LA UNION COLLEGES OF SCIENCES AND TECHNOLOGY INC.

OUTCOME-BASED COURSE SYLLABUS IN ICT 34: DATA STRUCTURE AND ANALYSIS OF ALGORITHM

I. NAME OF THE UNIVERSITY: La Union Colleges of Sciences and Technology Inc.

VISION: La Union Colleges of Sciences and Technology Inc. envisions itself to be a learning community characerized by
academic
excellence, crerative activity social responsibility and integrity.
MISSION: La union Colleges of Sciences and Technology Inc. Commits itself to provide well- rounded
educational training and experiences to students whose knowledge, skills, and value system will
enable them to adjust to an ever-changing society, be competitive in global market and contribute
to the improvement of quality of life.
INSTITUTIONAL GOALS:
Guided by the aforementioned educational philosophy, as a private educational institution, the ultimate goal of LUCST is to
produce holistic graduates who have realized their vast potentials and responsibilities to the society and to the world as whole aided
by relevant curriculum and instruction, competent learning facilitators, meaningful life-long experiences, as well as the presence of
complete facilities. It is expected that their stay in this institutions, the graduates will have been molded as men and women who:
1. Realize roles and obligations to themselves, to their fellowmen, to their country and to their Creator;
2. Convey academic competence and moral decency.
3. Respect and maintain Filipino identity and share their giftedness to the rest of the world; contribute to nation building and
sustainable development.
II. PROGRAM/DEGREE: DIPLOMA IN INFORMATION TECHNOLOY
III. PROGRAM/DEGREE OUTCOMES:
The graduate of DIT 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
14
 IV. COURSE NUMBER AND TITLE: Data Structures and Analysis of Algorithm
V. COURSE PRE-REQUISITE : Programming 1
VI. COURSE CREDIT/UNITS: 3
VII. CONTACT HOURS/WEEK: 3 times a week
VIII. YEAR /SEMESTER OFFERED: st
1 semester 2024-2025
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 (DIT)
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 TEACHING AND LEARNING RESOURCE

TEXTBOOKS/REFERENCES ASSESSMENT OF TASKS (AT’s) TIME TABLE
OUTCOMES (DLO) CONTENT/SUBJECT MATTER ACTIVITIES (TLA’s) MATERIAL
Lecture Laboratory Lecture Laboratory
At the end of the unit, Unit O: University Code Discussion laboratory Written examination PowerPoint 1hrs lec
the students must Vision, Mission, Core Values Question and orientation presentations 2hrs lab
have: and Outcomes Student Handbook Answer (1st Week AUG.)
1. Identified, Activity Sheets (AUG. 5-9, 2024)
described and 1. The university Bulletin of Information
explained the Vision, Mission, Core
vision, mission, Values and Outcomes
core values of the 2. Class Orientation
University and the
institutional,
college/campus,
Page 2 of
14
degrees and course
outcomes

Page 3 of
14
 DESIRED LEARNING COURSE TEACHING AND LEARNING RESOURCE
TEXTBOOKS/REFERENCES ASSESSMENT OF TASKS (AT’s) TIME TABLE
OUTCOMES (DLO) CONTENT/SUBJECT MATTER ACTIVITIES (TLA’s) MATERIAL
Lecture Laboratory Lecture Laboratory
1. defined an Unit 1: The Basis Data Structures & Board hands on Paper and 4 hrs
algorithm 1. Overview Algorithms (2016). work activity Pen test Graded Slide 6 hrs lab
2. comput 2. Algorithm basics Tutorials Point (I) Pvt. Ltd. Lecture using Java Assignment Laboratory (2nd- 3rd Week
ed the 3. Asymptotic Analysis Presentation AUG.) (AUG. 12-23,
and or C Seatwork Exercises
complexity a. Substitution Sample 2024)
of Shaffer,Clifford A. (2012). discussion Solving the Board work
b. Iteration Problem Soft
algorithms c. Master Theorem Data Structures and Demonstrati running copy of the
and Algorithm Analysis on time of a references
determined Edition 3.2 (Java version) Question and program
its Answer
efficiency Brainstorm
Group work
1. Explained the Unit 2: Algorithm Paradigms Data Structures & Board Hand on Quiz Hands on PowerPoint 2hrs lec
concepts and a. Divide and Algorithms (2016). work Activity Seat Graded presentation 1hrs lab
performed Conquer Tutorials Point (I) Pvt. Ltd. Demonstra using C Work Laboratory Sample (4th Week AUG.)
algorithm analysis Strategy /Java problem (AUG. 26-30,
ti on activity Exercises
and design. b. Greedy Algorithms Binary 2024)
Shaffer,Clifford A. (2012) Question in
2. Distinguished, Dynamic Search
compared Programming Data Structures and and Board work
algorithm
and Algorithm Analysis Answer java Reflective
performed Edition 3.2 (Java version) implementat
Brainstor discussion
the different io n
m
type and Group
concepts of
work
algorithms.
Lecture
and
discussio
n
1. Defined data, UNIT 3: Introduction to Data Data Structures & Board Progra Quiz Computer Slide 1hrs lab
data objects, Structures Algorithms (2016). work m Assignmen Hands-on (1st Week
data type Tutorials Point (I) Pvt. Ltd. Lecture tracing t Exercises Presentation SEPT.)
2. Enumerated Sample (SEPT. 2-6,
Page 4 of
14
 and Basic Concepts and Comput Homewor Practical Problem Soft 2024)
differentiated Arrays Shaffer,Clifford A. (2012) Data discussion er k Exams Exams copy of the
basic data 1. What is Array Structures and Algorithm Demonstrati hands- Recitation references
structure 2. Declaring Analysis on on s
operations 3. Initializing Edition 3.2 (Java version). Question and activitie
3. Defined an array 4. Accessing
and syntax in C Answer s using
Brainstorm C or
Java
2hrs lec

Page 5 of
14
 DESIRED LEARNING COURSE TEACHING AND LEARNING RESOURCE
TEXTBOOKS/REFERENCES ASSESSMENT OF TASKS (AT’s) TIME TABLE
OUTCOMES (DLO) CONTENT/SUBJECT MATTER ACTIVITIES (TLA’s) MATERIAL
Lecture Laboratory Lecture Laboratory
4. Solved Multi-dimensional Arrays Group work Arrays
programming Problem Implementat
problems using solving io n
Arrays
5. Defined a pointer Pointers K. Raghava Rao (2013). Board Program Quiz Computer Slide 1hrs lec
and syntax in C 1. What is Pointer Introduction to Design work tracing Assignmen Hands-on 2hrs lab
6. Solved 2. Declaring Analysis of Algorithms. Lecture Computer t Exercises Presentation (2nd Week
programming 3. Initializing https://www.smashwords.com Sample SEPT.) (SEPT. 9-
and hands-on Homewor Practical
problems using 4. Accessing /E ssay/Technology. Problem Soft 13, 2024)
discussion activities k Exams Exams copy of the
Pointers Data Structures &
Algorithms (2016). Demonstrati using C - Recitation references
Tutorials Point (I) Pvt. Ltd. on Pointer s
Question Implementat
Shaffer,Clifford A. (2012) Data and io ns
Structures and Algorithm Answer
Analysis
Brainstorm
Edition 3.2 (Java version).
Group
work
Problem
solving
Pseudocodi
ng
7. Defined a Structures Data Structures & Board Program Quiz Computer Slide 1hrs lec
structure and 1. What is Structure Algorithms (2016). work tracing Assignmen Hands-on 2 hrs lab
syntax in C 2. Declaring Tutorials Point (I) Pvt. Ltd. Lecture Computer t Exercises Presentation (1st - 2nd Week Jan)
8. Solved 3. Initializing Sample (Jan 1-10, 2024)
and hands-on Homewor Practical
programming 4. Accessing Problem Soft
Shaffer,Clifford A. (2012) Data discussion activities k Exams Exams
problems using copy of the
Structures Structures and Algorithm Demonstrati Structure Recitation references
Analysis Edition 3.2 (Java o n Implementat s
version). Question and io n using C
Answer
Page 6 of
14
Brainstorm
Group work
Problem
solving

Page 7 of
14
DESIRED LEARNING COURSE TEACHING AND LEARNING RESOURCE
TEXTBOOKS/REFERENCES ASSESSMENT OF TASKS (AT’s) TIME TABLE
OUTCOMES (DLO) CONTENT/SUBJECT MATTER ACTIVITIES (TLA’s) MATERIAL
Lecture Laboratory Lecture Laboratory
Pseudocodi
ng

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

2018
9. Added, Lists Data Structures & Board Progra Quiz Computer Slide 1hrs lec
deleted, and 1. What is a List Algorithms (2016). work m Assignmen Hands-on 2hrs lab
inserted 2. Declaring Tutorials Point (I) Pvt. Ltd. Lecture tracing t Exercises Presentation (4th Week Jan)
elements in a 3. Initializing Sample (Jan 27-31, 2024)
and Compute Homewor Practical
list 4. Accessing Problem
Shaffer,Clifford A. (2012) Data discussion r hands- k Exams Exams
5. Types of Lists Soft copy of the
Structures and Algorithm Demonstrati on Recitation references
Analysis Edition 3.2 (Java o n activitie s
version). Question s Lists
and Implementat
Answer io n Using
Brainstorm C
Group
work
Problem
solving
Pseudocodi
n
g

Page 8 of
14
10. Performed Stacks, Queues, Heaps Data Structures & Board Program Quiz Computer Slide 4 hrs lec
stack 1. What is a Stack Algorithms (2016). work tracing Assignmen Hands-on 6 hrs lab
operations 2. What is a Queue Tutorials Point (I) Pvt. Ltd. Lecture Computer t Exercises Presentation (1st - 2nd Week
and 3. Declaring Sample Feb) (Feb 10-14,
and hands-on Homewor Practical
implement in 4. Initializing Problem Soft 2024)
Shaffer,Clifford A. (2012) Data discussion activities k Exams Exams copy of the
C 5. Accessing
11. Defined, Structures and Algorithm Demonstrati on Stacks, Recitation references
illustrated and Priority Queues(Heaps) Analysis on Queues, s
implemented 1. What is a Edition 3.2 (Java version). Question and Heaps
Priority heap Answer Implementat
Queues 2. Declaring Brainstorm io ns using
3. Initializing
Group work C
4. Accessing
Problem
solving

Page 9 of
14
 DESIRED LEARNING COURSE TEACHING AND LEARNING RESOURCE
TEXTBOOKS/REFERENCES ASSESSMENT OF TASKS (AT’s) TIME TABLE
OUTCOMES (DLO) CONTENT/SUBJECT MATTER ACTIVITIES (TLA’s) MATERIAL
Lecture Laboratory Lecture Laboratory
12. Defined Searching techniques Data Structures & Board Program Quiz Computer Slide 4 hrs lec
linear, a. Linear Algorithms (2016). work tracing Assignmen Hands-on 6 hrs lab
binary, b. Binary Tutorials Point (I) Pvt. Ltd. Lecture aid/slide t Exercises Presentation (3rd – 4th Week
interpolation Sample Feb) (Feb17-28,
c. Interpolation and presentatio Homewor Practical
and Hash Problem Soft 2024)
d. Hash table Shaffer,Clifford A. (2012) Data discussion n k Exams Exams copy of the
tables.
13. Defined Structures and Algorithm Demonstrati Computer Recitation references
Selection, Sorting Techniques Analysis on hands-on s
Insertion, and a. Selection Edition 3.2 (Java version). Question activities
Merge Sort b. Insertion and on
14. Implemented c. Merge Answer Searching
in the
Brainstorm technique
laboratory
searching and Group s
sorting work
techniques Problem
solving
Pseudocodi
n
g
1. Defined and Trees Data Structures & Board Problem Quiz Computer Slide 4 hrs lec
illustrate the 1. What is a tree Algorithms (2016). work solving Assignmen Hands-on 6 hrs lab
concepts of trees. 2. Declaring Tutorials Point (I) Pvt. Ltd. Lecture Pseudocodi t Exercises Presentation (1st – 2nd Week
3. Initializing Sample Mar)-(Mar 10-
and ng Homewor Practical
2. Declared, 4. Accessing Problem Soft 21,2024)
Initialized, Accessed Shaffer,Clifford A. (2012) Data discussion Program k Exams Exams
5. Binary Tree copy of the
Binary, AVL and 6. AVL Tree Structures and Algorithm Demonstrati tracing Recitation references
Expression Trees 7. Expression Trees Analysis Edition 3.2 (Java o n Computer s
version). Question and hands-on
Answer activities
Brainstorm Trees
Group work Implementat

Page 10
of 14
 io
n using C
Graph Data Structure Data Structures & Board Problem Quiz Compute Slide 2hrs lec
a. Intro Algorithms (2016). work solving Assignment r Hands- 3hrs lab
b. Breadth First Search Tutorials Point (I) Pvt. Ltd. Lecture Pseudocodin on Presentation (3rd Week Mar)
Sample (Mar 24-28, 2024)
c. Depth First Search and g Exercise
Problem Soft
discussio s copy of the
n Practical references
Exams

Page 11
of 14
DESIRED LEARNING COURSE TEACHING AND LEARNING RESOURCE
TEXTBOOKS/REFERENCES ASSESSMENT OF TASKS (AT’s) TIME TABLE
OUTCOMES (DLO) CONTENT/SUBJECT MATTER ACTIVITIES (TLA’s) MATERIAL
Lecture Laboratory Lecture Laboratory
Shaffer,Clifford A. (2012) Data Demonstrati Computer Homewor
Structures and Algorithm on hands-on k Exams
Analysis Edition 3.2 (Java Question and activities Recitation
version). Answer Graph s
Brainstorm Data
Group work Structure
Implementat
io n using C
Program
tracing

Final Exam

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 30%
Midterm/Final Exam 40%
Laboratory Exercises 30%
100%

Page 12
of 14
Latest revision date:

Prepared and designed for the Computer Department.

Prepared By: Checked By: Approved By:

ABEGAIL MAUREEN TABUSO RENATO C. CADORNA SHEILA F. TABIAN, MAED
Instructor Tech-Voc Head Executive Vice
President/Principal

Page 13
of 14
 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.

Date Suggested Enhancement/Teacher

Page 14
of 14