CS 2240

Data Structures and Algorithms

Presented here is a subset of materials for use in CS 2240 Data Structures and Algorithms. What follows is incomplete, and subject to revision, deletion, and rearrangement.

Feedback, including reports of errata, criticisms, suggestions, and proposed revisions, is warmly encouraged.

Preliminaries

• Textbook

Foundations

• Overview
• Introduction to data structures and algorithms
• Modular arithmetic and Euclid’s algorithm
• Recursive functions
• Hello World! in C++
• Introduction to C++
• File input

C++ essentials

• Overview
• Output manipulation
• Pointers and addresses
• Reference variables and passing by reference
• this is a pointer
• The arrow operator
• What exactly does a pointer store?
• C++ templates
• Overloading operators
• Linked lists
• Node class

Memory; stack and queue; introduction to complexity

• Overview
• Memory: stack and heap
• What is a stack?
• Node class and stack class
• What is a queue?
• Introduction to complexity
• Asymptotic notation
• C++ supplement

Trees

• Overview
• Complexity, continued
• Trees
• Representing trees
• Depth-first search
• Breadth-first search
• Expression trees

Search and self-balancing trees

• Overview
• Binary search trees (BST)
• Adelson-Velsky and Landis trees (AVL)
• Splay trees
• B-trees

Binary heaps and priority queue; d-heaps; introduction to sorting

• Overview
• Binary heaps
• Priority queue
• d-heaps
• Introduction to sorting

Sorting: selection, insertion, and merge sort

• Overview
• Selection sort
• Insertion sort
• Merge sort (von Neumann)

Sorting: quicksort, bucket and radix sort, heap sort

• Overview
• Quicksort (Hoare)
• Bucket sort and radix sort
• Radix sort for strings
• Heap sort (Williams)

Binary search and interpolation search; hashing, collisions, and separate chaining

• Overview
• Searching: binary search, interpolation search
• Hashing
• Hash collisions
• Separate chaining

Linear probing, quadratic probing, and double hashing

• Overview
• Linear probing
• Quadratic probing
• Double hashing

Sets and relations; the dynamic equivalence problem

• Overview
• Sets, relations, and equivalence relations
• The dynamic equivalence problem

Disjoint sets; introduction to graphs; topological sort

• Overview
• Disjoint sets; path compression
• Introduction to graphs
• Topological sort

Graph algorithms: Dijkstra, Bellman-Ford, Ford-Fulkerson, Edmonds-Karp

• Overview
• Shortest path: Dijkstra’s algorithm, Bellman-Ford algorithm
• Network flows: Ford-Fulkerson and Edmonds-Karp algorithms; max flow–min cut
• Graph theory

Minimum spanning tree: Prim and Kruskal

• Overview
• Minimum spanning tree: Prim’s algorithm, Kruskal’s algorithm