CIT 594 Programming Languages & Techniques II
Spring 2013, David Matuszek

When you send me email about this course, please:

• For CIT 594, put 594 as part of the Subject: line.
• For general email about the MCIT program, put MCIT as part of the Subject:line.
• Send plain text only (not HTML or RTF).
• Do not include any attachments.
• Make sure your computer is virus-free.

Meeting times Lecture TR 4:30-6:00 Towne 303  Office hours (check Piazza for changes) Whenever my door is open. Moore 176 Questions and course support This page Announcements, scheduling updates, and assignment changes will be posted here. Updated 3 or 4 times a week. Piazza Use Piazza to ask and answer questions about the course. Available 24/7 Canvas Use Canvas to submit assignments and check on grades. Assignments posted weekly Gokul Office hours Mondays 3-5 Moore 207 Wei Office hours Wednesdays 4:30-6:30 Moore 207 Office hours: TR 1-2 and R 6-7 or whenever my door is open Moore 176

Links Last year's CIT594 Eclipse FAQ and Eclipse Tips Academic Integrity Policy SwingExamples.jar Textbook Regular Expression Applet Java version test page Older exam questions Java Syntax Pages (online) or as a downloadable .zip file Academic Resources Dr. Dave's schedule Using Piazza and Canvas

Lectures and lecture materials
Date	PowerPoint lectures	Reading and assignments
Thursday, January 10	Introductions. Stacks, queues, and deques. Array and linked-list representations.	01 Linked Lists (Stacks, Queues, and Deques) StudentChooser.java
Tuesday, January 15	More about linked lists.	Analysis of algorithms
Thursday, January 17	Analysis of algorithms. Logarithms.	02 Minimizing Big-O Running Time EqualPilesTest.java Logarithms
Tuesday, January 22	Binary Trees.	Binary Trees
Thursday, January 24	Abstract Data Types.	03 Trees and Expressions Abstract Data Types Trees
Tuesday, January 29	Trees. Storage.	Using Maps
Thursday, January 31	Backtracking.	Hashing 04 Hash Maps
Tuesday, February 5	State machines. Tokenizers.	State Machines Tokenizers
Thursday, February 7	BNF. Parsers.	05 BNF Tokenizer and Parser BNF for BNF (use at your own risk) All About Recursion Recursion
Tuesday, February 12	Recognizers and parsers.	Recognizers
Thursday, February 14	Recognizers and parsers.	Parsers BNF example Little Logic Language, lll.zip
Tuesday, February 19	Depth-first searches, Breadth-first searches, Iterative deepening depth-first searches	Tree Searching
Thursday, February 21	Tree Searching, A*, IDA*
Tuesday, February 26	Midterm Exam
Thursday, February 28	State-space searches	State-Space Searches
Tuesday, March 5 Spring break
Thursday, March 7 Spring break
Tuesday, March 12	Bubble sort, Selection sort, Insertion sort, Quicksort	Simple sorting techniques 06 Funl Parser and Interpreter Funl Evaluator Funl Parser Tests (HTML) ParserTest.java tree-parser.java Example Funl functions
Thursday, March 14	Quicksort, Heapsort	Quicksort Heapsort
Tuesday, March 19	Priority queues	Priority queues
Thursday, March 21	Backtracking	Backtracking
Tuesday, March 26	Threads and Concurrency	Threads Concurrency 07 Backtracking
Thursday, March 28	ForkJoin, Parallelism	Parallelism
Tuesday, April 2	Grossman 1	Introduction to Multithreading and Fork-Join Parallelism  pptx  pdf ForkJoin (Dave) Prime numbers
Thursday, April 4	Grossman 2	Analysis of Fork-Join Parallel Programs  pptx  pdf
Tuesday, April 9	Grossman 3	Parallel Prefix, Pack, and Sorting  pptx  pdf Registration Madness
Thursday, April 11	Grossman 4	Shared-Memory Concurrency and Mutual Exclusion  pptx  pdf
Tuesday, April 16	Grossman 5	Programming with Locks and Critical Sections  pptx  pdf
Thursday, April 18	Grossman 6	Data Races and Memory Reordering, Deadlock, Reader/Writer Locks, Condition Variables  pptx  pdf
Tuesday, April 23
Thursday, May 2	Final Exam 3:00pm to 5:00pm. Moore 216.

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 offsite)
An article; indicates offsite	Example	Quiz or exam