Programming Languages & Techniques II

Course Overview: This course will cover the following topics

Data structures--what they are for, what Java provides for you (the Collections Framework), and how to go about constructing your own.

Recursion--an essential programming technique for working with data structures.

Algorithms--an introduction to a few of the "recipes" that people have discovered for solving certain kinds of problems (usually, but not necessarily, involving data structures).

Analysis of algorithms--the basic mathematics needed for determining how fast an algorithm runs, and (to a lesser extent) how much memory it requires.

Lecture	Download PPT lectures, assignments, etc.
Lecture 1	About this course  (HTML)  Introduction to CIT 594 (PPT)  Lisp (PPT)  A Concise Introduction to Lisp (HTML)  Lisp Primer at Texas A&M (Reading)
Lecture 2	Recursion (PPT)  Pretest for first assignment First assignment (Assign)  CLisp (actually, XLisp) download (SW)  Using XLisp (Windows) and Liquid Common Lisp (Suns) (HTML)
Lecture 3	Writing LISP Functions (PPT)  Lisp Internals (PPT)
Lecture 4	Analysis of algorithms (PPT)
Lecture 5	Arrays (PPT)  Sorting (PPT)  Sorting in Lisp (Assign)
Lecture 6	Linked Lists (PPT)  Implementing Lisp in Java, part I (Assign)  Parsing Lisp (pseudocode) (PPT)
Lecture 7	Collections--A First Glimpse (PPT)
Lecture 8	Searching (PPT)
Lecture 9	Implementing Lisp in Java, part II (Assign)  Help Implementing Lisp (parse() and toString(Sexpr)) (EX)  My version of the assignment: LispInterpreter.zip (EX)  Stacks (PPT)
Lecture 10	Hashing (PPT)
Lecture 11	ADTs (PPT)
Lecture 12	First midterm exam (15%) (TEST)  Answers to first midterm (EX)
Lecture 13	Binary Trees (PPT)  Gender in Computer Science (PPT)  (Here are some links to the research.)  A BinaryTree Editor (Assign)  Binary Tree Editor suggestions (EX)
Lecture 14	A Binary Tree ADT  (PPT)  ADTs, II (PPT)
Lecture 15	Stacks, Queues, and Deques (PPT)  Java I/O (Serialization in particular) (PPT)
Lecture 16	Comparisons (PPT)  Static (PPT)
Lecture 17	Lists (PPT)
Lecture 18	Sets and Maps (PPT)  Creating a Maze (Assign)
Lecture 19	Using Maps (PPT)
Lecture 20	Study guide for second midterm (HTML)  Second midterm exam (15%) (TEST)  Answers to second midterm (EX)
Lecture 21	Trees (PPT)  Tree searches (PPT)
Lecture 22	Graphs (PPT)  Shortest Path (Assign)  Tree Traversals and Searches (EX)
Lecture 23	Spanning Trees (PPT)  Greedy Algorithms (PPT)
Lecture 24	Heapsort (PPT)  Priority Queues (PPT)
Lecture 25	Quicksort (PPT)  Algorithm Types (PPT)
Lecture 26	Backtracking (PPT)  State-Space Searches (PPT)  Ricochet (Assign)
Lecture 27	Alpha-Beta Search (PPT)  Animation series (HTML)
Lecture 28	Algorithm Types  (PPT)
	Study guide for the final exam (HTML)  Final exam,  (TEST) Answers to final exam (EX)
	Most important links:      Blackboard      Dr. Dave's Schedule      Textbooks for CIT 594      Programming Requirements      Collections Framework Tutorial      Java API online      Java API download