CS 302 - Advanced Data Structures and File Processing

Description:
Sequential, random access and indexed file organizations; B-trees; external searching and sorting; I/O buffering.

Prerequisites:
Prerequisites: CS 301 and MATH 172.

Credits: (4)

Learner Outcomes:
Upon successful completion of this course, the student will be able to:

List the advanced data structures
Design advanced data structures
Write programs involving advanced data structures in Visual C++
Describe and apply the advanced data structures
- Binary Tree
- Binary SearchTree
- ADT Table
- Hash Table
- AVL Tree
- Red-black Tree
- 2-3 Tree, 2-3-4 Tree,B-tree
- B-plus Tree
- File Structures
- Graph
Describe how advanced data structures are implemented
Decide and explain the choice of an advanced data structure for an application
Describe and apply internal and external sorting algorithms
Describe and apply internal and external searching algorithms and methods.

Learner Outcomes Approval Date:
2/21/02