Course Outline / Syllabus for Class Under Ms. Irlyn Janette E. Lomboy

COURSE NUMBER: CS_MJ2
TITLE: DATA STRUCTURES

DEPARTMENT / PROGRAM: BSCS
SCHOOL: AGOO COMPUTER COLLEGE

SEMESTER AND SCHOOL YEAR: 2nd Semester,SY 2007-2008
INSTRUCTOR: MS. IRLYN JANETTE E. LOMBOY

COURSE DESCRIPTION

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

COURSE OBJECTIVES (DESIRABLE OBJECTIVES)

At the end of this course, the student should be able to:

1. Choose, implement and evaluate the appropriate data structures for specific programming problems and

2. Use and manage memory effectively in data presentation.

COURSE OUTLINE AND TIMEFRAME

TOPICS AND READINGS

1. Basic Data Structures
1.1 Arrays
http://www.nus.edu.ws/virtualclassroom/file.php/4/week4/hcs181Lect4.ppt
1.2 Linked Lists
http://www.comp.nus.edu.sg/~huangzy/MFE5008/llsq01.ppt
1.3 Stacks
http://www.cis.upenn.edu/~matuszek/cit594-2005/Lectures/23-stacks-queues-deques.ppt
1.4 Queues
http://web.mae.cornell.edu/mae409/elementary.doc
2. Trees
2.1 Binary Trees
http://www.cs.auckland.ac.nz/software/AlgAnim/trees.html
http://en.wikipedia.org/wiki/Tree_data_structure
2.2 Binary Search Trees
http://www.cs.hofstra.edu/courses/2006/fall/Algorithms/handouts/L15DynamicSetAVL_RB_trees.ppt
2.3 AVL
http://www.cs.hofstra.edu/courses/2006/fall/Algorithms/handouts/L15DynamicSetAVL_RB_trees.ppt
2.4 RB Trees
http://www.cs.virginia.edu/~luebke/cs332/lecture17.ppt
3. Graphs
3.1 Representations
http://www.codeproject.com/cs/algorithms/DotNet2Datastructures.asp
3.2 Search Algorithms (BFS, DFS)
http://www.comp.nus.edu.sg/~stevenha/myteaching/notes/9_graph5.html
3.3 Shortest Path Problems
http://www.cs.princeton.edu/introcs/40algorithms/
3.4 Spanning Trees
http://www.cs.auckland.ac.nz/software/AlgAnim/mst.html
4. Sets
http://web.mae.cornell.edu/mae409/elementary.doc
5. Hashing
http://cs.nyu.edu/~cconway/teaching/cs1007/notes/data-structures.9up.pdf

REQUIRED READINGS
Theory and Problems of Data Structures - By Seymour Lipschutz

SUGGESTED READINGS

COURSE REQUIREMENTS
Assignments, Quizzes, Term Paper, Exams, Blog, forums, Links, Tree Planting

STANDARD COURSE OUTLINE / SYLLABUS to be used starting 2007

COURSE NUMBER: CS_MJ2
TITLE: DATA STRUCTURES

DEPARTMENT / PROGRAM: BSCS
SCHOOL: AGOO COMPUTER COLLEGE

INSTRUCTOR: ___________________

COURSE DESCRIPTION

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

COURSE OBJECTIVES (DESIRABLE OBJECTIVES)

At the end of this course, the student should be able to:

1. Choose, implement and evaluate the appropriate data structures for specific programming problems and

2. Use and manage memory effectively in data presentation.


COURSE OUTLINE AND TIMEFRAME

TOPICS AND READINGS

1. Basic Data Structures
1.1 Arrays
1.2 Linked Lists
1.3 Stacks
1.4 Queues
2. Trees
2.1 Binary Trees
2.2 Binary Search Trees
2.3 AVL
2.4 RB Trees
3. Graphs
3.1 Representations
3.2 Search Algorithms (BFS, DFS)
3,3 Shortest Path Problems
3.4 Spanning Trees
4. Sets
5. Hashing

REQUIRED READINGS
Theory and Problems of Data Structures - By Seymour Lipschutz

SUGGESTED READINGS

COURSE REQUIREMENTS
Assignments, Quizzes, Term Paper, Exams, Blog, forums, Links, Tree Planting
.
.
.
.
.
.
.
.
.
.
.
.
.
13hq.com