GRANBY COLLEGES OF SCIENCE AND TECHNOLOGY

College of Information and Communication Technology

Naic, cavite Philippines
Tel: (046) 412-0437

Subject: Data Structures and Algorithms

Subject Code: ITC5
Units: 5
Pre-requisite: PRG1-Computer Programming 1 and PRG2-Computer Programming 2

Course Description

Introduces fundamental data structures, algorithms, and abstract data types. Main topics
include data structures such as arrays, linked lists, stacks, queues, graphs, and trees, and
algorithms such as those that are used for list manipulation, graph searches, sorting, searching,
and tree traversals.

Learning Objectives

As a result of successfully completing this course, I should be able to:

1. Explain and utilize linked lists, stacks, queues, and trees.
2. Describe the techniques of algorithm analysis.
3. Discuss the advantages and disadvantages of various algorithms.
4. Incorporate algorithmic design know-how and data structures to create reliable and
structured programs.
5. Describe the design and performance of various searching and sorting algorithms.
6. Use advanced object-oriented concepts such as abstract base classes, friend classes and
operator overloading in the implementation of data structures.
7. Discuss graph algorithms.

Course Outline

TEACHING AND
LEARNING OUTCOME BASE
TOPIC LEARNING
OUTCOMES ASSESSMENT
ACTIVITIES
After the completion I. Orientation  Discussion
of the chapter, A. Subject  Small Group
students will be able Guidelines and Discussion
to: Policies  Informal/
1. identify the B. Class Policy Creative Learning
course C. Grading System
description, D. Course
content, Requirements
requirements,
grading
system as well
as class
policy.
After the completion I. Basics  Lecture  Quiz
of the chapter, 1. Algorithm discussion  Written
students should be Specifications:  Interactive activities.
able to: Performance learning  Hands-on
1. Understand Analysis and  Guided discovery activities.
the algorithm Measurement learning
specifications, (Time and space
performance analysis of
1|Page
 GRANBY COLLEGES OF SCIENCE AND TECHNOLOGY
College of Information and Communication Technology
Naic, cavite Philippines
Tel: (046) 412-0437

analysis and algorithms-

measurement. Average, best-
and worst-case
analysis).
After the completion II. Introduction to  Lecture  Quiz
of the chapter, Data Structure: discussion  Written
students will be able 1. Data  Interactive activities.
to: Management learning  Hands-on
1. Learn the data concepts  Guided discovery activities.
management 2. Data types – learning
concepts. primitive and
2. Use different non-primitive
data types in 3. Types of Data
programming. Structures-
3. Differentiate Linear & Non-
linear and Linear Data
non-linear Structures
data
structures.
After the completion III. Linear Data  Lecture  Quiz
of the chapter, Structure discussion  Written
students will be able 1. Array  Interactive activities.
to: 2. Stack learning  Hands-on
1. Construct a 3. Queue  Guided discovery activities.
program that 4. Linked List learning
uses each type
of linear data
structure
After the completion IV. Nonlinear Data  Lecture  Quiz
of the chapter, Structure discussion  Written
students will be able 1. Trees  Interactive activities.
to: 2. Threaded binary learning  Hands-on
1. Construct a tree  Guided discovery activities.
program that 3. Binary search learning
uses each type trees
of non-linear 4. Conversion of
data general trees to
structures. binary trees
2. Convert 5. Application of
general trees trees
into binary 6. Graph
trees.
After the completion V. Sorting and  Lecture  Quiz
of the chapter, Searching discussion  Written
students will be able 1. Insertion sort  Interactive activities.
to: 2. Quick Sort learning  Hands-on
1. construct a 3. Merge sort  Guided discovery activities.
program using 4. Heap sort learning
different 5. Sorting on
sorting several keys
algorithms. 6. List and table
2|Page
 GRANBY COLLEGES OF SCIENCE AND TECHNOLOGY
College of Information and Communication Technology
Naic, cavite Philippines
Tel: (046) 412-0437

2. Construct a sort
program using 7. Linear Search
different 8. Binary Search
searching
algorithms
After the completion VI. Hashing and File  Lecture  Quiz
of the chapter, Structures discussion  Written
students will be able 1. Hashing: The  Interactive activities.
to: symbol table learning  Hands-on
1. Learn the 2. Hashing  Guided discovery activities.
process of Functions learning
hashing and 3. Collision-
file structures. Resolution
2. Construct a Techniques
program using 4. File Structure:
hashing and Concepts of
different file fields, records,
structures and files
5. Sequential,
Indexed and
Relative/Random
File Organization
6. Indexing
structure for
index files
7. hashing for
direct files
8. Multi-Key file
organization and
access methods.

Assessment Strategy

LECTURE LABORATORY
QUIZ – 20% LAB QUIZ – 20%
ASSIGNMENT – 10% LAB ASSIGNMENT – 10%
MIDTERM EXAM – 35% LAB MIDTERM EXAM – 35%
FINAL EXAM – 35% LAB FINAL EXAM – 35%

TOTAL = 100% TOTAL = 100%

LECTURE = 40%
LABORATORY = 60%
FINAL GRADE = (LEC X .4) + (LAB X .6)

1.0 to- 5.0 SCALE PERCENTAGE EQUIVALENT

1.00 99-100%
1.25 96-98%
1.50 93-95%

3|Page
 GRANBY COLLEGES OF SCIENCE AND TECHNOLOGY
College of Information and Communication Technology
Naic, cavite Philippines
Tel: (046) 412-0437

1.75 90-92%
2.00 87-89%
2.25 84-86%
2.50 81-83%
2.75 78-80%
3.00 75-77%
4.00 65-74%
5.00 FAILED
Satisfactory
Credited
Incomplete
Dropped
Withdrawn (Authorized)
Non-Credit

Learning Material References:

 An Introduction to Data Structures with Applications. by Jean-Paul Tremblay & Paul G.

Sorenson Publisher-Tata McGraw Hill.
 Data Structures using C & C++ -By Ten Baum Publisher – Prenctice-Hall International.
 Fundamentals of Computer Algorithms by Horowitz, Sahni,Galgotia Pub. 2001 ed.
 Fundamentals of Data Structures in C++-By Sartaj Sahani.
 Data Structures: A Pseudo-code approach with C -By Gilberg & Forouzan Publisher-
Thomson Learning.

4|Page