CSCI 223
Data Structures and Algorithms

Course Description:

CSCI 223  Data Structures and Algorithms    Three Credit Hours
     Prerequisites: CSCI 202 and MATH 206
     Required for B.S. degree in computer science.
     Formal specification and implementation of abstract data types, and analysis of algorithms. Topics include list and set representation methods, sorting, trees, and graphs. Data structures used include arrays, queues, binary trees, hash tables, priority queues, search trees, balanced trees.

Major Topics:

• Algorithmic efficiency
• Lists, stacks, and queues
• Hashing
• Heaps and the heap sort
• Binary search trees
• Balanced trees
• Graphs
• Sets

Course Outcomes:

Upon successful completion of this course, a student will be able to

• Explain the theory and implementation issues related to trees, heaps, hash tables, and graphs
• Analyze problems to identify an appropriate ADT and implementation to be used in the problem solution
• Use a modern IDE to create, compile, debug, test and execute Java programs where an ADT implementation is of primary importance in the solution
• Explain and apply the basic concepts of algorithm analysis.

Textbook:

Data Structures & Algorithms in Java (Fourth Edition) by Michael T. Goodrich and Roberto Tamassia, John Wiley & Sons, Inc., 2006.

Projected Schedule:

Every Spring

Recent Syllabi:

Spring 2008, Francel