- 18th Dec: Lisp database grades emailed to class accounts. Please check them and get back to me as soon as possible if you think there's a problem. Here is the input I tested it with.
- 11th Dec: The exam will be in room 3258 AVW at 8am on Thursday, 13th December.
- 3rd Dec: Lisp mst grades mailed to class accounts. If you got points taken off, your code did not produce correct results for one or more of these inputs.
- 21st Nov: Sample input posted for min_spanning_tree.
- 20th Nov: Lisp project grades mailed to class accounts. If you are wondering why I took points off for sortlist, dup or duplist_of_lists, please see here.
- 25th Oct: Lisp projects posted.
- 25th Oct: Extra class on Monday October 29th at 7PM. No class on Tuesday, October 30th.
- 16th Oct: New LISP assignments posted.
- 11th Oct: Midterm on Tue Oct 23.
- 11th Oct: Lisp assignment posted
- 10th Oct: Sample input posted for advanced operations
- 9th Oct: Next hw assignment posted.
- 8th Oct: Project 1 advanced operations due before midnight, Monday, Oct 15th.
- 4th Oct: Project deadline for basic operations extended by a day. Please check your mail.
- 2nd Oct: If you registered in this course and did not attend class today, please send an email to indrajit@cs.umd.edu. This is important.
- 2nd Oct: There are some modifications in the requirements for DISPLAY(). Please check your class account mailbox.
- 28th Sep: Due date for the basic operations has been postponed to the 4th of October. The assignment on sorting is still due on the 4th.
- 28th Sep: Sample input posted
- 25th Sep: Dr. Samet will be away on Thursday, Sep. 27th. For people who missed Monday's lecture, I will review sorting. -Indrajit
- 21st Sep: Class on Monday, September 24th, 7pm-8:15pm in Room AVW1112. No class on Thursday, September 27th.
- 20th Sep: Homework 3 posted
- 17th Sep: Check email in your class account for command decoder grade
Information regarding the class accounts may be found here.
Procedure for electronic submission
Java applet demos of many of the spatial data structures discussed in the class can be executed here.
Drawing routines needed to see the output of the programming project
A description of a library of drawing routines that can be called from C, C++, and PASCAL can be found here. (Please do not use the project submission guidelines described here. These are old ones!)
Project Deadlines:
- Part 1 (data structures) is due Thu Sep 6, 02:00pm.
- Part 2 (command decoder) is due Thu Sep 13, before midnight. Sample Input
- Part 3 (bas. operations) is due Fri Oct 5, before midnight. Sample Input Sample Output
- Part 4 (adv. operations) is due Mon Oct 15, before midnight. Sample Input Sample Output
Homework Assignments:
- Homework 1 Due on Tue Sep 11
- Homework 2 Due on Thu Sep 20
- Homework 3 Due on Tue Oct 2
- Homework 4 Due on Tue Oct 16
LISP References / Assignments:
- Short reference manual.
- Complete CMU Common Lisp manual.
- Lisp Homework #1 Due Tue Oct 16
- Lisp Homework #2 Due Thu Oct 18
- Lisp Warmup Due Thu Oct 25
- Project #3 (Lisp Misc) Due Tue Nov 13 before midnight (sample input)
- Project #4 (Lisp MST) Due Mon Nov 26 before midnight (sample input)
- Project #5 (Lisp DB) Due Mon Dec 10 before midnight
(fexpr code) (sample input)
If you have difficulty viewing the postscript files, please look here to get versions of ghostscript for different operating systems.
Slides from the lectures:
There are two sets. The "animated" sets consist of a sequence of overlays that are sequenced through one by one. The "cumulative" sets contain all the layers that comprise each slide. You should print the cumulative slides and bring them to class with you as the lecture will follow them. The pace of the lectures assumes that you have the slides in front of you and that you are annotating them, as necessary. It is strongly suggested that you bring to class a set of colored pens or pencils consisting of the colors black, red, blue, green, and violet (or some other color that is different from the black, red, blue, and green).
"Cumulative" slides:
- List structures.
- Trees.
- Graphs.
- Winged Edge data structure.
- Triangulations.
- Searching Techniques.
- Sorting Techniques.
- Dynamic Storage Allocation.
- Garbage Collection.
- Representation of Point Data.
- Rectangle data.
- Range trees.
- Hashing methods.
- LISP.
- Nearest neighbor.
- Bulk loading.
- Quadtrees.
- Surface data.
- 3D data.
"Animated" slides:
- Dynamic Storage Allocation.
- Garbage Collection Methods.
- Graphs.
- Hierarchical Representations of Point Data.
- Hashing Methods.
- List Structures.
- Rectangle Data.
- Range Trees.
- Searching Techniques.
- Sorting Techniques.
- Triangulations.
- Trees.
- Winged-Edge Data Structure.
- Nearest neighbor.
- Bulk loading.
- Quadtrees.
- Surface data.
- 3D data.
Send comments and suggestions for this page to your TA.