CIS2166 - Fall 2019 - Schedule

Dr. Longin Jan Latecki TA: Sidra Hanif

Section	Topic	Class date
3.1	Algorithms	Aug. 27
3.2	Growth of Functions	Aug. 29
3.3	Complexity of Algorithms	Sep. 3
3.3	Complexity of Algorithms	Sep. 5
5.1	Mathematical Induction	Sep. 10
5.2, 5.3	Strong Induction, Recursive Definition	Sep. 12
5.4	Recursive Algorithms	Sep. 17
10.3	Representing Graphs	Sep. 19
10.4	Connectivity	Sep. 24
10.5	Euler and Hamilton Paths	Sep. 26
10.6	Shortest Path	Oct. 1
	Review: Practice questions	Oct. 3
10.7	Planar Graphs	Oct. 8
	Midterm exam	Oct. 10
	Midterm discussion	Oct. 15
10.8	Graph Coloring	Oct. 17
	Matrix Algebra 1, Google PageRank	Oct. 22
	PageRank notes, Google PageRank	Oct. 24
	Matrix Algebra 2, example, Linear Equations	Oct. 29
	Matrix Algebra 2	Oct. 31
	Matrix Algebra 2, Eigenppt	Nov. 5
	Matrix Algebra 2, EigenEx, Linear Classification	Nov. 7
13.1	Modeling Computation	Nov. 12
13.1	Modeling Computation	Nov. 14
13.2	Finite State Machines with Output	Nov. 19
13.3	Finite State Machines with No Output	Nov. 21
13.5	Turing Machine	Dec. 3
	Review: Practice Questions	Dec. 5
	Final Exam, 10:30 - 12:30, TL401B	Dec. 17

For Matrix Algebra watch the 15 short videos on Essence of linear algebra by 3Blue1Brown:
https://www.youtube.com/playlist?list=PLZHQObOWTQDPD3MizzM2xVFitgF8hE_ab