CSE 21: Mathematics for Algorithm and System Analysis
Fall 1996

Eric Mjolsness, PhD.
AP&M 4018
emj@cs.ucsd.edu

Office Hours: MW 3:45-5pm
TA's:  Lukman Ramsey      lramsey@ucsd.edu      Office Hours: Tues 2-3, Thurs 4-5, AP&M 3337D
       George Marnellos                                       Fri  3:30-4:30
       Tom Langley        tlangley@mathgrad.ucsd.edu
					

http://www-cse.ucsd.edu/classes/fa96/cse21

text: Maurer and Ralston, Discrete Algorithmic Mathematics

Review  - ch. 0-2			1.5 wk
	sets, functions, summation notation
	algorithm complexity, induction

Counting - ch. 4.			2 wk
	Permutations
	Binomial Coefficients
	Partitions
	Algorithms

Midterm Exam -- Nov. 1st  (in section)

Graphs - ch. 3.				2 wks.
	Adjacency Matrix
	Paths
	Search
	Coloring
	Trees and DAG's

Probability - ch. 6			2 wks.
	Independence and Bayes' Theorem
	Selected Distributions
	Random Variables
	Markov Chains (ch. 8.10)
	Applications

Linear Algebra - ch. 8.			2 wks.
	Matrices and Vectors
	Gaussian Elimination
	Vector Spaces
	Eigenvalues and Singular Value Decomposition

Final Exam