Module 3 - Core Materials-Module 3 - Divide and Conquer
What is Algorithmic Thinking?
()
The sorting problem
()
A simple quadratic algorithm
()
Illustrating MergeSort
()
The recurrence for MergeSort
()
The Master Theorem and MergeSort efficiency
()
Linear vs. binary search
()
Efficiency of binary search
()
Module 3 - Core Materials-More Class Material (review as necessary)
Class structure (from part 1)
()
Class notes
Coding notes
Coding styles and standards - PoC
()
Testing and machine grading - PoC
()
Plotting data - PoC
()
Peer assessment - "We want a shrubbery!" - IIPP
()
Module 3 - Project and Application-Project #3 - Closest Pairs and Clustering Algorithms
Project #3 Description
Tests and Tips for Implementing the Clustering Methods
Module 3 - Project and Application-Application #3 - Comparison of Clustering Algorithms
Application #3 Description
Application #3 Solution
Module 4 - Core Materials-Module 4 - Dynamic Programming
The RNA secondary structure problem
()
A dynamic programming algorithm
()
Illustrating the DP algorithm
()
Running time of the DP algorithm
()
DP vs. recursive implementation
()
Global pairwise sequence alignment
()
Local pairwise sequence alignment
()
Module 4 - Project and Application-Project #4 - Computing Alignments of Sequences
Project #4 Description
Module 4 - Project and Application-Application #4 - Applications to Genomics and Beyond
Application #4 Description
Application #4 Solution
Module 4 - Project and Application-Post-Class
Class wrap-up
()