CIT 594 Programming Languages
& Techniques II
Spring 2014, David Matuszek
| When you send me email about this course, please: | |
|---|---|
|
|
|
|||||||||||||||||||||||||||||||||||
The following schedule will be developed as the semester progresses.
| Lectures and lecture materials |
||
|---|---|---|
Date |
PowerPoint lectures |
Reading and assignments |
| Thursday, January 16 | Introduction Analysis of algorithms I |
|
| Tuesday, January 21 | University closed due to snow | |
| Thursday, January 23 | Searching (with logarithms) Sorting (and loop invariants) |
Pages 21 to 24 in textbook Sorting |
| Tuesday, January 28 | Pointers and references Data structures bestiary |
Pages 25 to 59 in textbook |
| Thursday, January 30 | Linked Lists Binary Trees Trees |
Tree ADT |
| Tuesday, February 4 | Tree Searching Stacks, Queues, and Deques |
|
| Thursday, February 6 | Class cancelled due to winter storm | |
| Tuesday, February 11 | Hashing |
Bucket Hash |
| Thursday, February 13 | University closed due to snow |
|
| Tuesday, February 18 | Stacks State Machines |
|
| Thursday, February 20 | Tokenizers BNF |
Tokenizer Notes on the Tokenizer assignment DavesTokenizerTest.java |
| Tuesday, February 25 | Backtracking Graphs |
|
| Thursday, February 27 | Hypergraphs |
Graphs and Backtracking Pages 71 to 89 in textbook |
| Tuesday, March 4 | GitLearning @ Scale, March 4 & 5 |
|
| Thursday, March 6 | Midterm Exam SIGCSE Atlanta 2014, March 5-8 |
|
| Tuesday, March 11 | Spring break | |
| Thursday, March 13 | Spring break | |
| Tuesday, March 18 |
Recognizers Trigonometry |
Recognizer |
| Thursday, March 20 | Quicksort Analysis II |
Pages 49 to 59 in textbook |
| Tuesday, March 25 | Recursive Descent Parsing |
|
| Thursday, March 27 | Heapsort Priority queues |
Pages 90 to 101 in textbook |
| Tuesday, April 1 | Algorithm Types Greedy Algorithms Spanning Trees |
Interpreter GUI for Interpreter The Big Picture Example Logo Programs |
| Thursday, April 3 | Huffman Encoding Dynamic Programming |
Pages 106 to 114 and 158 to 167 in textbook |
| Tuesday, April 8 | Graph Algorithms Dijkstra's Algorithm Effective Programming |
Pages 91 to 101 in textbook |
| Thursday, April 10 | State-Space Searching Alpha-Beta Pruning |
(optional) Tokenizer in Scala |
| Tuesday, April 15 | Threads Concurrency Fork-Join |
Counting Words with ForkJoin Beginner's Introduction to Java's ForkJoin Framework |
| Thursday, April 17 | MapReduce Parallelism |
|
| Tuesday, April 22 | Concurrent Algorithms Randomized Algorithms Preferences |
|
| Thursday, April 24 | Abstract Data Types Data Structure Design (BNF grammar) |
|
| Tuesday, April 29 | Genetic Algorithms |
|
| Tuesday, May 6 | Final
Exam 3:00pm to 5:00pm. DRLB A4. |
Older exam questions (primarily data structures, doesn't cover much on algorithms) |
| Key | ||
|---|---|---|
A PowerPoint document, usually one of my lectures |
An assignment |
Software that will be useful in this course |
A tutorial |
Additional information about the assignment or
topic |
Official specification (always |
An article; |
Example |
|