CS 3512 Lecture Notes
Lecture Notes:

Section 1.1

Section 1.2

Section 1.3

Most of Section 1.4 will be skipped, except binary trees, which are covered in
Sections 3.1, 3.2, and 4.4.

Sections 2.1, 2.2, and 2.3

Section 2.4

Sections 3.1 and 3.2

Section 3.3 will be deferred until later in the course.

Sections 4.1, 4.2, and 4.3 will be skipped; they have some material
leading up to Section 4.4, which we treat a bit differently than the text.

Section 4.4

Section 5.6 Asymptotic notation
(Sections 5.1  5.5 discuss other math analysis techniques),
skip "DivideandConquer Recurrences" pages 381389.

Sections 11.1, 11.2, 11.3

Distinguishability

Grammars, PDA's, Turing Machines
Ambiguous Headlines
Page URL: http://www.d.umn.edu
/~ddunham/cs3512s15/notes/index.html
Page Author: Doug Dunham
Last Modified: Monday, 06Apr2015 16:40:38 CDT
Comments to: ddunham@d.umn.edu