CS251 Toolbar


MWF 12:30 PM, BCHM 105

CS251 Home Page Instructors for the class Text Book for CS251 Your Grades and Grading Policy Class Schedule Class notes and slides Assignments and their solutions Class Project Ananth's Home Page

Study Aids

This page contains supplementary material for your class.

These transparencies accompany the text "Data Structures and Algorithms in Java" by Michael T. Goodrich and Roberto Tamassia. These slides are also Copyright 1998, Michael T. Goodrich and Roberto Tamassia.

Chapter 0: Java Stuff (week 1)

Chapter 1: Design Principles (week 2)

Chapter 2: Analysis Tools (week 3-4)
Analysis of Algorithms

Chapter 3: Stacks, Queues, and Linked Lists (week 5)
Stacks, Queues and Lists

Chapter 4: Sequences (week 6)
Ranked Sequences and Positional Sequences

Chapter 5: Trees (week 7)
Trees and Binary Trees

Chapter 6: Priority Queues (week 8)
Priority Queues and Elementary Sorting

Chapter 7: Dictionaries (week 9-10)
Binary Searching
AVL Trees

Chapter 13: Balanced Search Trees (week 11-12)
(2,4) Trees
Red-Black Trees
Red-Black Tree Deletion

Chapter 9: Graph Traversal (week 13-14)
General Graphs
Depth-First and Breadth-First Searches
Directed Graphs
Connectivity and Biconnectivity

Chapter 10: Weighted Graphs
Shortest Path
Minimum Spanning Tree
Maximum Flow

Chapter 14: Multi-Dimensional Search Trees
None Yet.

Chapter 11: Strings
Pattern Matching and Tries

Chapter 8: Sorting and Selection
Merge Sort
Quick Sort
Radix Sort

Chapter 12: Fundamental Techniques

Chapter 15: Computational Geometry
CCW (Geometry)
Convex Hull
Segment Intersection
Closest Points

Chapter 16: Caches and Disks
External Memory