University of Cincinnati Logo
 

20-CS-472 - Analysis of Algorithms II
Electrical Engineering and Computing Systems

   
Lecture Notes Date
 
Algorithms    
templates
4 Jan - 14 Jan
 
Linear Programming    
Scheduling     14 Jan
Gaussian Elimination     19 Jan
Introduction to the Simplex Method     19 Jan
Simplex Method     19 Jan
 
Satisfiability    
What is SAT?     21 Jan
SAT and Scheduling     21 Jan
Sudoku     21 Jan
 
Matroids and the Greedy Method    
definitions
7 Jan
presentation
7 Jan
minimum spanning tree
7 Jan
integer deadline scheduling
10 Jan
  - naive solution
10 Jan
  - faster solution
10 Jan
  - really fast solution
10 Jan
 
Divide and Conquer    
Satisfiability     19 Jan
Vertex Cover     19 Jan
 
Dynamic Programming    
Partition and Knapsack     12 Jan
Vertex Cover     19 Jan
 
Backtracking and Branch-and-Bound    
Sudoku     14 Jan
  - code     14 Jan
 
Complexity    
    algorithm complexity     24 Jan - 28 Jan
    mergesort     24 Jan
    quicksort     24 Jan
    quicksort - pivot     24 Jan
 
Complexity Classes    
    polynomial time solvable (P) 28 Jan
    non-deterministic polytime solvable (NP) 28 Jan
    NP-complete 28 Jan
    CoNP-complete 31 Jan
    Reductions 2 Feb
 
Approximation Algorithms    
approximation algorithms
4 Feb
 
Algorithms in Computer Security    
secret key/public key overview
14 Feb
Merkle-Hellman
14 Feb
   -  Java source     applet
14 Feb
Diffie-Hellman
14 Feb
   -  DH     client     server
14 Feb
RSA
16 Feb
   -  use     rsa     applet
16 Feb
Crypto Math
16 Feb
   -  fermat     inverse     generator     modulo
16 Feb
Zero Knowledge Authentication
18 Feb
Hashing in Crypto
XX Feb
Karn Symmetric Algorithm
XX Feb
Secret Key Ciphers
21 Feb
 
Fast Fourier Transform    
DFT, IDFT, FFT, IFFT
23 Feb
Matlab sin example
23 Feb
Matlab several sin example
23 Feb
Matlab audio example
25 Feb
Matlab audio example
25 Feb
Mathworld definition
25 Feb
Notes 1
25 Feb
Notes 2
25 Feb
 
Pattern Matching    
Pattern Matching
25 Feb
Pattern Matching, notes
25 Feb
 
Parallel Computing*    
Simple CUDA examples
28 Feb, 2 Mar
CUDA toolkit
28 Feb, 2 Mar
CUDA Tutorial
28 Feb, 2 Mar
CUDA basics
28 Feb, 2 Mar
Intro to GPU programming
2 Mar
GPU Programming Guide
XX Xxx
CUDA Programming - Seland's notes
28 Feb, 2 Mar
CUDA code 1 - add two vectors
2 Mar
CUDA code 2 - add two matrices
2 Mar
CUDA code 3 - transpose a matrix
2 Mar
CUDA code 4 - Julia sets
2 Mar
CUDA code 5 - 3D Spheres
9 Mar
Bitonic sort
9 Mar
Bitonic sort example
9 Mar
odd-even mergesort
9 Mar
odd-even mergesort
9 Mar
odd-even transposition sort
9 Mar
4-way mergesort
9 Mar
 
Probability    
distributions
XX Xxx
 
Probabilistic Algorithms    
    Quicksort     XX Xxx
    Primality Testing     XX Xxx
    Satisfiability     XX Xxx
 
Lower and Upper Bounds    

*
 
 
Materials available publicly from nvidia.com have been reposted on gauss.ececs.uc.edu for the convenience of the students of 20-CS-472 with permission of NVIDIA. See the license
ERC
MainStreet
Paul Erdos
NIT
Ladies on Campus
Oscar Robinson