Data Structures and Algorithms: Exercises

Doing these exercises will:

Help you to understand and remember the ideas presented in lectures.
Help you to assess whether or not you understand and remember the ideas presented in lectures.
Help you prepare for assessment.

Answers will be posted in some cases.

Checking Your Prerequisite Knowledge
Imperative Programs: Building a Library
Data Abstraction and Encapsulation: ADTs
ADTs and C++: Implementing a complex number ADT
The Array as an ADT: Array representation
The Array as an ADT: Implementing a one dimensional array ADT
Algorithms: Writing algorithms
Algorithms: Examining algorithms
Performance Analysis: Counting steps
Performance Analysis: Asymptotic analysis
The Sparse Matrix ADT: Analysis of sparse matrix operations
The Sparse Matrix ADT: Sparse matrix representation with a dynamic number of terms
Bag, Stack, and Queue ADTs: Using a stack
Bag, Stack, and Queue ADTs: Postfix expressions
Bag, Stack, and Queue ADTs: Stack algorithms
Bag, Stack, and Queue ADTs: Defining ADTS
Linked Lists: Singly linked lists
Linked Lists: Circular linked lists
Linked List Based ADTs: Linked queues
Linked List Based ADTs: Circular polynomials
Linked List Based ADTs: Operations on,linked sparse matrices
More Linked Lists: Generalized lists
More Linked Lists: Heterogeneous lists
The Tree ADT: Forests
Binary Trees: The binary tree ADT
Binary Trees: Binary tree representation
Binary Trees: Binary tree operations
Binary Trees: Binary tree traversal
Binary Trees: Threaded binary trees
Heaps: Min heap insertion
Search Trees: Deletion of an element from a BST
The Graph ADT: Graphs
The Graph ADT: Graph representation
Graph Algorithms: Graph searches
Graph Algorithms: Connected components
Graph Algorithms: Minimum Cost Spanning Trees
Graph Algorithms: Shortest Paths
Graph Algorithms: Transitive Closure
Activity Networks: Activity on Edge
Static Hashing: Hash Tables