CS210
Intermediate Computing with Data Structures
Home
Course Info
Calendar
Lecture Material
Assignments
Resources
Swami Iyer
·
CS
·
UMB
Lecture Material
Course Mechanics (
slides
)
Programming Environment (
slides
)
Chapter 1: Fundamentals
Programming Model (
slides

exercises
)
Data Abstraction (
slides

exercises
)
Analysis of Algorithms (
slides

exercises
)
Basic Data Structures (
slides

exercises
)
Unionfind (
slides

exercises
)
Chapter 2: Sorting
Elementary Sorts (
slides

exercises
)
Merge Sort (
slides

exercises
)
Quick Sort (
slides

exercises
)
Priority Queues (
slides

exercises
)
Applications (
slides

exercises
)
Chapter 3: Searching
Symbol Tables (
slides

exercises
)
Binary Search Trees (
slides

exercises
)
Balanced Search Trees (
slides

exercises
)
Hash Tables (
slides

exercises
)
Applications (
slides

exercises
)
Chapter 4: Graphs
Undirected Graphs (
slides

exercises
)
Directed Graphs (
slides

exercises
)
Minimum Spanning Trees (
slides

exercises
)
Shortest Paths (
slides

exercises
)