Experiential Learning in module order

This page collects together all of the “experiences” associated with individual modules.

In this site, experiences represent “active” learning opportunities, as opposed to readings, which represent “passive” learning opportunities. In many courses, readings and experiences together constitute the “assignments”.

Module: Analysis examples

More on linear and binary search

Analyze linear and binary search (homework)

Homework

Module: Abstract data types

Asymptotic analysis: Homework

Practice asymptotic analysis.

Homework

Battle of the Dynamic Sets

Provide four implementations of the Dynamic Set ADT and compare their performance.

Programming

Module: Probabilistic Analysis

Battle of the Dynamic Sets

Provide four implementations of the Dynamic Set ADT and compare their performance.

Programming

Module: Hash Tables

Analysis of data structures

Consolidate your understanding of data structures

Homework

Module: Divide and conquer

Understanding master method and substitution

Apply your knowledge of the master method and substitution.

Homework

Module: Binary Search Trees

More reasoning about binary search trees

Apply your learning about binary trees some more.

Homework

Battle of the Dynamic Sets

Provide four implementations of the Dynamic Set ADT and compare their performance.

Programming

Module: Heapsort

Applying your understanding of heaps (again)

Learn about heaps (at home).

Homework

Module: Quicksort

Applying your understanding of quicksort (again)

Learn about quicksort (at home).

Homework

Module: Balanced Trees

Applying your understanding of red-black trees

Learn about balanced trees (at home).

Homework

Battle of the Dynamic Sets

Provide four implementations of the Dynamic Set ADT and compare their performance.

Programming

Module: Dynamic Programming

Dynamic programming sample problem: matrix chain multiplication

Apply dynamic programming principles again

Homework

Module: Graphs

Breadth first search and depth first search

Working with breadth first search and depth first search

Homework

Module: Minimum spanning tree

More minimum spanning trees

Minimum spanning trees and Kruskal’s algorithm

Homework

Module: Single source shortest paths

Experience single source shortest paths (again)

Playing with Bellman-Ford, Dijkstra’s algorithm, and DAGs

Homework

Module: Maximum flow

Experience maximum flow (again)

maximum flow

Homework