Announcements

9/23: We'll have a quiz on 10/3 on Master theorem. Please review material in Slide 3.

For next week, please read Section 1 (Counting Inversion) in Scribe 2, and the coresponding part in Slide 2.

Course information

- Lectures to date - grow with each class.
- Course information sheet. Please read it - you are responsible for everything on it.
- Instructor: Viet Tung Hoang (Tung). Office hours: TueFri (4 pm - 5 pm), virtual. See Canvas for Zoom link.

- Homework solution must be typed via LaTeX. LaTeX is the standard for typesetting scientific papers, and will likely come in handy outside CIS 4930.

- Homework template: Here's a Latex template (sample.tex) for typesetting homework and the pdf file (sample.pdf) that it produces. The file needs an image file mapping.pdf.

- Guides to using LaTeX: An introduction to LaTeX can be found here. Another guide can be found at Wikibooks.

- Online Environments: If you don't want to install LaTeX, ShareLaTeX and Overleaf are online environments which compile previews of your LaTeX documents as you type.

- LaTeX Editors: There are many LaTeX editors which allow you to use GUI to edit your LaTeX. LyX is a free one.

- Finding symbols: Detexify lets you draw the symbol that you are looking for and get LaTeX code. A static guide is here.

Slides and scribes

- Logistics
- Slide 0: Review of Algorithm Analysis
- Scribe 0: Comparison-based Sorting and Proving bounds
- Scribe 1: How to Design Basic Algorithms
- Slide 2: Divide-and-Conquer
- Scribe 2: Divide-and-Conquer
- Slide 3: Master Theorem
- Scribe 3: Substitution Method
- Slide 4: Generalization-Specialization
- Scribe 4: Generalization-Specialization
- Slide 5: Graphs
- Scribe 5: Graphs
- Slide 6: Weighted Graphs
- Scribe 6: Weighted Graphs
- Slide 7: Dynamic Programming
- Scribe 7: Dynamic Programming
- Slide 8: Graphs and Dynamic Programming
- Scribe 8: Graphs and Dynamic Programming

Last updated: 9/23/2022