Changes

The following contents are planned to be covered. The details are subject to change without prior notice.

The following contents are planned to be covered. The details are subject to change without prior notice.

=== Part II : Algorithms 101 ===

 

=== Part II : Algorithms ===

* Understanding of Computational Time Complexity

* Understanding of Computational Time Complexity

* Searching - Sequential and Binary Search

* Sorting

* Recursions, Divide and Conquer

* Divide and Conquer Algorithms

* Sorting - Bubble Sort, Merge Sort, Quick Sort

* Searching

* Data Structure : List, Stack, Queue, Tree, Hash

* Key Data Structure

* Dynamic Programming

* Dynamic Programming

=== Part III : Matrix Operations and Numerical Optimizations ===

=== Part III : Matrix Operations and Numerical Optimizations ===

* Introduction to BLAS/LAPACK

* Matrix decomposition (LU, QR, SVD)

* LU decomposition, QR decomposition, and Singlar Value Decomposition

* Implementation of Linear Models

* Implementation of linear models

* Numerical Optimizations

* Numerical optimization in one-dimensional space

=== Part IV : Advanced Statistical Methods ===

=== Part IV : Advanced Statistical Methods ===

* Hidden Markov Models

* Hidden Markov Models

* Expectation Maximization

* Expectation Maximization

* Markov-Chain Monte Carlo Method

* Markov-Chain Monte Carlo Methods

== Class Notes ==

== Class Notes ==