Help

Coding styles and standards (11:53) - PoC

Testing and machine grading (9:53) - PoC

Plotting data (14:22) - PoC

Peer assessment - "We want a shrubbery!" (15:46) - IIPP

What is Algorithmic Thinking? (9:24)

Class structure (4:46)

Pseudo-code (11:05)

The small-world problem (11:56)

Graphs and representation (15:20)

Paths and distances (8:35)

Brute force (11:57)

What Is algorithm efficiency? (9:29)

Measuring efficiency (12:48)

Efficiency of brute force distance (14:50)

Number of steps of brute force distance (12:01)

Orders of growth (13:00)

Asymptotics (12:33)

Illustrating "Big O" (11:12)

Illustrating BFS (16:53)

Video Lectures
Having trouble viewing lectures? Try changing players. Your current player format is html5. Change to
flash.
Pre-class
Module 1 - Graphs and brute-force algorithms
Module 2 - Algorithmic efficiency and BFS

Queues and boundary cases (8:53)

Pseudocode (12:29)

BFS running time - loose analysis (9:32)

BFS running time - tighter analysis (11:52)

BFS-based distance distribution (12:27)

The sorting problem (11:45)

A simple quadratic algorithm (10:26)

Illustrating MergeSort (13:17)

The recurrence for MergeSort (9:55)

The Master Theorem and MergeSort efficiency (12:21)

Linear vs. binary search (12:07)

Efficiency of binary search (10:44)

The RNA secondary structure problem (16:15)

A dynamic programming algorithm (14:05)

Illustrating the DP algorithm (11:39)

Running time of the DP algorithm (8:20)

DP vs. recursive implementation (13:58)

Global pairwise sequence alignment (14:33)

Local pairwise sequence alignment (8:09)

Class wrap-up (6:21)
Module 3 - Divide and conquer
Module 4 - Dynamic programming
Post-class