Data Structures

COURSE: BSCS TITLE: Data Structures

DEPARTMENT / PROGRAM: BS Computer Science
SCHOOL: Agoo Computer College

SEMESTER AND SCHOOL YEAR: 2nd Semester, SY 2008 – 2009
INSTRUCTOR: Engr. Arthur N. Villanueva Jr.


COURSE DESCRIPTION

This course covers fundamental and advanced theories on data structures and algorithms in C language. It includes studies on the nature of data structures, the primitive data types as well as analysis and methods to represent data in computer programming.
The course also tackles efficiency in sorting algorithm. Furthermore it involves data structures such as trees and linked list.


COURSE OBJECTIVES (DESIRABLE OBJECTIVES)

By the end of this course the students should be able to:
1. Understand the fundamental data structures.
2. Understand and apply the sorting algorithm to promote efficiency in programming
3. Choose, implement and evaluate the appropriate data structures for specific programming problems




COURSE OUTLINE AND TIMEFRAME


Data Structures

Chapter 1: Basic Data Structures

A. Arrays

B. Linked Lists

C. Stacks

D. Queues

E. Trees

Chapter 2: Binary trees

A. Binary Trees

B. Binary Search Trees


C. AVL

D. RB Trees



Chapter 3: Graphs
A. Representations

B. Search Algorithms (BFS, DFS)

C. Shortest Path Problems

D. Spanning Trees

E. Hashing




http://www.nus.edu.ws/virtualclassroom/file.php/4/week4/hcs181Lect4.ppt

http://www.comp.nus.edu.sg/~huangzy/MFE5008/llsq01.ppt

http://www.cis.upenn.edu/~matuszek/cit594-2005/Lectures/23-stacks-queues-deques.ppt

http://web.mae.cornell.edu/mae409/elementary.doc



http://www.cs.auckland.ac.nz/software/AlgAnim/trees.html

http://en.wikipedia.org/wiki/Tree_data_structure

http://www.cs.hofstra.edu/courses/2006/fall/Algorithms/handouts/L15DynamicSetAVL_RB_trees.ppt


http://www.cs.hofstra.edu/courses/2006/fall/Algorithms/handouts/L15DynamicSetAVL_RB_trees.ppt

http://www.cs.virginia.edu/~luebke/cs332/lecture17.ppt


http://www.codeproject.com/cs/algorithms/DotNet2Datastructures.asp

http://www.comp.nus.edu.sg/~stevenha/myteaching/notes/9_graph5.html

http://www.cs.princeton.edu/introcs/40algorithms/

http://www.cs.auckland.ac.nz/software/AlgAnim/mst.html

http://web.mae.cornell.edu/mae409/elementary.doc

http://cs.nyu.edu/~cconway/teaching/cs1007/notes/data-structures.9up.pdf

SUGGESTED READINGS


 Lipsschutz,Seymour , Theory and Problems of Data Structures
 M. Tenembaum and Moshe J. Augenstein., Data Structures Using Pascal. 2nd ed., Rizal: Jemma, Inc., 1986
 Clifford A. Shaffer. A Practical Introduction to Data Structures. New Jersey: Prentice Hall, 1998.
 Deitel & Deitel, Java How to Program, New Jersey: Prentice Hall, 1998.

COURSE REQUIREMENT

 Class Attendance
 Recitation
 Quizzes
 Project
 Major Examination
 Blogs