Welcome to the Fall, 2014, Dr. Hugue’s CMSC 420!
Latest Project Specification
The BIG 420 Meesh Project's Part 3 Specification is ready:
Part 3 Specification (PDF)
Part 3 Sample Input, .Submit file
Part 2 Specification (PDF) (PS) (HTML). Part2 Stater Kit
Part 1 Specification (PDF) (PS) (HTML). Part1 Stater Kit
Hopefully, the webpage should be enough for project specification, for more resources, please visit (http://www.cs.umd.edu/users/meesh/420/).
- Lectures (09/02/2014--12/17/2013) located in CSIc 3120):
- M W .... 3:30--4:45pm
- Instructor: Michelle Hugue
- Email: meeshATumd.edu
- Office: 1109a AV Williams
- Hours: TBD, after class, and by appointment
- Class accounts: Unix accounts will be on the GRACE ( Glue Research and Academic Computing Environment) cluster. Development tools, such as Eclipse, and JAVA 1.7 are available on the cluster; we will grade your projects using the submit server. To use the cluster, you will need a TerpConnect account. If you do not have one, or if you are not sure if you have one, you must request one asap.
- Book(s): A Practical Introduction to Data Structures and Algorithms (Shaffer (Free) --Required) Design and Analysis of Spatial Data Structures (Samet--Optional--Out of Print) or Foundations of Multidimensional and Metric Data Structures (Samet--Optional) Morgan Kaufmann, San Francisco, CA, 2006.
- TA: Ruofei Du
- Email: ruofei [at] cs [dot] umd [dot] edu
- Hours: Wed/Fri 9:15-11am at AVW 4103
- TA: Shri Tanna
- Hours: Mod/Wed 2-3:30 & Fri 2-3 9:15-11am at AVW 4103
Major Scheduled Grading Events
- Two 80 minute in-class Tests: 10/1, 11/5 (20% each)
- Cumulative Final Exam: 12/17 1:30-3:30pm (32%)
- Project (28%):
- Part 1: (100 pts) Due 9/26/14 23:59PM with 48 hour grace period. No later submissions accepted for credit--only good faith effort.
- Part 2: (250 pts) Due 11/14/14 23:59PM with 48 hour grace period . No later submissions accepted for credit--only good faith effort.
- Part 3: (250 pts) Due 12/12/14 23:59PM with 48 hour grace period. Extensions limited to university rules.
- Note 1: we reserve the right to fail you in the absence of a good-faith effort on the project. Dr. Hugue is the sole arbiter of this issue, and the minimum number of project points to pass the class will be no fewer than 300.
- Note 2: in the presence of a good faith effort and a minimum number of project points bounded above by 450, your final grade will be the maximum of the following: 20% per test + 28% project + 32% final exam; 20% max test + 28% project + 52% final exam; 20% per test + 35% project + 25% final exam.
- UNIX, Emacs and other Tutorials
- A few (well actually a lot of) words of wisdom on debugging
- Java Language Resources
- Tree Structure and Algorithms Resources
- AVL Tree
- Binary Search Tree
- B+ Tree
- B+ Tree Insertion Step-by-Step Notes
- Fibonacci Heap
- Huffman Coding
- Quadtree Animations
- Point QuadTree DEMO
- PR QuadTree DEMO
- PM1 QuadTree DEMO
- PM2 QuadTree DEMO
- PM3 QuadTree DEMO
- Mount lecture notes
- Splay Tree Notes by Dave Mount
- Splay Tree Visualizer
- Graph Structure and Algorithms Resources
- Algorithms Implemented as Java Applets (mostly graphs)
- Dijkstra's Shortest Path Algorithm Link 1 Link 2 Link 3
- Other Structure and Algorithms Resources