Republic of the Philippines

City of Lipa

KOLEHIYO NG LUNGSOD NG LIPA

Marawoy, Lipa City

Information Technology Department

First Semester, AY 2010-2011

CS 212
(Course Code)

Data Structures
(Course Title)

COURSE DESCRIPTION:

This course introduces the students to the design and implementation of basic and
advanced data structures. Topics include data structures, trees, graphs and hashing.

COURSE CREDIT: 3 units

TOTAL HOURS: 54

GENERAL OBJECTIVES:

At the end of the course, the students are expected to:

1. understand the concept and technique of structuring data in computer

storage.
2. create and develop the program with fitting the data structure.

Maraouy, Lipa City, Batangas Tel. No. 784-2532 CS 212 1 of 5

 MID-TERM (27 hours)
Specific Objectives Course Content Total Hours
At the end of the term, students
should have at least 85%
competency to:

1. read with understanding the 1. Overview of the Course 1

course syllabus

2. review material on discrete 2.1 Mathematics Review 2.5

math and recursion 2.1.1 Exponents
2.1.2 Logarithms language
2.1.3 Series
2.1.4 Modular Arithmetic
2.1.5 The P Word
2.2 A Brief Introduction to Recursion

3. deals with algorithm analysis. 3. Algorithm Analysis 2

Explains asymptotic analysis 3.1 Mathematical Background
and its major weaknesses 3.2 Model
3.3 What to Analyze
3.4 Running Time Calculations

4. discuss on coding data 4. Lists, Stacks and Queues 6

structures using ADTs, fast 4.1 Abstract Data Types
implementation on data 4.2 The List ADT
structures, and an exposition 4.3 The Stack ADT
of some of their uses 4.4 The Queues ADT

5. an emphasis on search trees, 5. Trees 6

including external search 5.1 Preliminaries
trees 5.2 Binary Trees
5.3 The Search Tree ADT-Binary
Search Trees
5.4 AVL Trees
5.5 Splay Trees
5.6 Tree Traversals
5.7 B-Trees

6. analysis and extendible study 6. Hashing

concerning hash tables 6.1 General Idea 4
6.2 Hash Function
6.3 Open Hashing
6.4 Closed Hashing
6.5 Rehashing
6.6 Extendible Hashing

Maraouy, Lipa City, Batangas Tel. No. 784-2532 CS 212 2 of 5

 7. discuss priority queues. 7. Priority Queues (Heaps)
Binary heaps are covered and 7.1 General Idea 4
there is additional material on 7.2 Hash Function
some of the theoretically 7.3 Open Hashing
interesting implementations of 7.4 Closed Hashing
priority queues. 7.5 Rehashing
7.6 Extendible Hashing

MIDTERM EXAMINATION 1.5

FINAL TERM (27 hours)
Specific Objectives Course Content Total Hours
At the end of the term, students
should have at least 85%
competency to:
1. covers sorting. Understanding 1. Sorting
coding details and analysis 1.1 Working with Windows 10
1.2 Working with Frames and
other Objects
1.3 Insertion Sort
1.4 A Lower Bound
1.5 Shellsort
1.6 Heapsort
1.7 Mergesort
1.8 Quicksort
1.9 Sorting Large Structures
1.10 A General Lower Bound
for sorting
1.11 Bucket Sort
1.12 External Sorting
2. discuss the disjoint set 2. Disjoint Set ADT
algorithm with proof of the running 2.1 Equivalence Relations 5
time 2.2 The dynamic Equivalence
Problem
2.3 Basic Data Structure
2.4 Smart Union Algorithms
2.5 Path Compression
2.6 Worst Case for Union-by-Rank
and Path Compression
2.7 An Application
3. discuss algorithm on graphs. 3. Graph Algorithms
Algorithms on graphs are interesting 3.1 Definitions 3.5
not only because they frequently 3.2 Topological Sort
occur in practice but also because 3.3 Shortest-Path Algorithms
their running time is so heavily 3.4 Network Flow Problems
dependent on the proper use of data 3.5 Minimum Spanning Tree
structures. 3.6 Applications of Depth-First
search
3.7 Introduction to NP-
Completeness

Maraouy, Lipa City, Batangas Tel. No. 784-2532 CS 212 3 of 5

 4. covers algorithm design 4. Algorithm Design Techniques 3.5
examining common problem- 4.1 Greedy Algorithms
solving techniques 4.2 Divide and Conquer
4.3 Dynamic Programming
4.4 Randomized Algorithms
4.5 Minimum Spanning Tree
4.6 Backtracking Algorithms

5. discuss amortized analysis 5. Amortized Analysis 3.5

5.1 An Unrelated Puzzle
5.2 Binomial Queues
5.3 Skew Heaps
5.4 Fibonnacci Heaps
5.5 Splay Trees

FINAL EXAMINATION 1.5

METHODOLOGIES:

Lectures/Discussion/Recitation
Demonstration
Applications (Computer Laboratory)
Graded SeatWork
Evaluation method

COURSE REQUIREMENTS:

Attendance
Practical Examinations/Assignments/Exercises
Projects
Major Examinations

MEANS OF EVALUATION:
Attitude 5%
Attendance 5%
Major Examination 40%
Class Standings 50%
o Quizzes 10%
o Assignments 5%
o Recitations 5%
o Projects 10%
o Practical Examination 20%
Total = 100%

Maraouy, Lipa City, Batangas Tel. No. 784-2532 CS 212 4 of 5

 REFERENCES:

Mark Allen Weiss. Data Structures and Algorithm Analysis in C. Florida

International University. The Benjamin/Cummings Publishing Company Inc. 390
Bridge Parkway Redwood City, California 94065

Prepared and submitted by:

MARY ANGELENE D. SUYAT MARIA LOURDES CALINGASAN

Instructor I Instructor I

MARCO SAPALON
Instructor I

Approved by:

MRS. NOREEN V. TADEJA

Dean, Information Technology Department

Noted by:

ARMANDO MENDOZA,
OIC, College President

Maraouy, Lipa City, Batangas Tel. No. 784-2532 CS 212 5 of 5