City College of Calamba

Dalubhasaan ng Lungsod ng Calamba

Department of Computer Education

COURSE TITLE: Data Structures and Algorithm

COURSE CODE: PROG201

NO. OF UNITS: 3

COURSE DESCRIPTION: This 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. Through discussion of sorting and searching algorithms and hashing
covered.

COURSE OUTLINE / TIME FRAME:

PRELIM

1. Basic of Data Structure

1st Week to 2rd week
1.1 Data Structure & Algorithm
1.2 Foundation Terms of a Data Structure
1.3 Characteristics of a Data Structure
1.4 Need for Data Structure
1.5 Execution Time Cases
1.6 Basic Terminology

2. Algorithm Basics
3rd to 4th Week 2.1 Categories of Algorithms
2.2 Characteristics of Algorithms
2.3 Writing an Algorithm
2.4 Algorithm analysis
2.5 Algorithm Complexity
2.6 Space Complexity
2.7 Time Complexity
2.8 Data Structures and algorithm in several disciplines

3. Array
5th to 6th Week 3.1 Array Operation
3.2 Dimensionality
-Single Array
-Multi-Dimensionality
3.3Array using Characters and Strings

MIDTERM

4. Sorting Algorithms
7th Week to 8th Week
4.1 Categories of sorting
4.2 Complexity of sorting algorithms
4.3 In-place and not-in-place sorting
4.4 Stable and not-stable sorting
4.5 Adoptive and non-adaptive sorting
4.6 Types of sorting techniques
-Bubble sort
-Selection sort
-Merge sort
-Insertion sort
-Quick sort
-Heap sort
 City College of Calamba
Dalubhasaan ng Lungsod ng Calamba
Department of Computer Education

5. Linked Lists

9th to 10th Week 5.1 Singly Linked Lists

5.2 Doubly Linked Lists
5.3 Circular Lists
5.4 Skip Lists

6. Stacks and Queues

11th to 12th Week 6.1 Stacks
6.2 Queues
6.3 Priority Queues
-Simple Implementations
-Binary Heap
- Application of Priority Queues
FINALS

7. Searching Algorithms
13th Week to 14th Week 7.1 Search Algorithm
7.2 Linear Search
7.3 Binary Search
7.4 Jump Search

8. Trees
15th Week to 17th Week 8.1 Introduction to Trees
8.2 Binary Trees
8.3 Binary Search Trees
8.4 AVL Trees
8.5 Splay Trees
8.6 Tree Traversals
8.7 B-Trees

Prepared by:

Prof. Marco Paulo J. Burgos

Prof. Shane Maglapuz
Prof. Roda Flor Andrea B. Teodocio
Checked by:
 City College of Calamba
Dalubhasaan ng Lungsod ng Calamba
Department of Computer Education

Noted by:

Prof. Arwie H. Fernando

Director
Department of Computer Education
Approved by:

Dr. Ronald A. Gonzales

Vice President for Academic Affairs, Research and Development