|
Course Organizer
COP 4531 Complexity and Analysis of Data Structures and Algorithms
Fall Semester 2014
Root View: Course Components Syllabus
The course syllabus establishes course policies on grading, attendance, and exams. The syllabus should be read in detail at beginning semester. Calendar
The course calendar provides a detailed temporal view of the course, including lecture coverage, assignments, and due dates. The calendar will be updated regularly. Lectures
Notes
Lecture notes are in one of two forms: (a) a slide show with an accompanying narrative (click "Narrative on" to see the narrative, click "Frames[Windows]" to toggle between displaying the narrative in a separate frame or a separate resizeable window.) (b) a pdf document suitable for detailed reading. These notes provide a compact view of the important topics of the course. They also serve to ground the text material in a real programming environment. Lecture slides and other documents will be created and updated "on the fly" during the semester, so you should visit them regularly. Report bugs/corrections in the appropriate Blackboard discussion forum. Assignments Assignments will be released through the Calendar. See also Submitting Assignments (below), Grading Assignments (in Syllabus) and Grading Programs LIB The course code distribution library LIB = /home/courses/cop4531p/fall14 My FSU
The FSU/Blackboard Portal, where you will find this course. The course site is the main communication resource for the class. Here you can get help, talk to other students, retrieve your grades, and generally keep up with course news and announcements. Textbook
The textbook for the course is Cormen, T.H., et al, Introduction to Algorithms (3rd ed.), MIT Press, 2009 (ISBN 978-0-262-03384-8). The textbook provides many details and extra material not covered directly in the notes, as well as a more mathematical treatment of algorithms. Reading and understanding the assigned portions of the text is essential for deeper understanding of many topics in the course. Report bugs/corrections in the appropriate Blackboard discussion forum. Office Schedule, office hours, and contact information for Chris Lacher
Extras: Miscellaneous Resources and References COP 3330
COP 4530Lecture notes from previous courses in the sequence Parts 1-4
Part 5An alternate text has been approved for COP 4530, and you may use it now as a reference for this course: Robert Sedgewick, Algorithms in C++ (any edition, or the newer Java edition). C++ Style Coding style manual for this course SSH
The version of ssh software that FSU pays for and recommends. Unix/Emacs Hints
A few Unix and Emacs hints to get started Make1
Make2Two tutorials on the make utility and makefiles Stats The NIST Engineering Statistics Handbook TreeDemo Nifty demonstrator for various binary search tree implementations SortDemo Nifty animation for various key-comparison sorts, plus some good references. The Hungarian Dance Sort is worth a look. Formulas A short collection of frequently used formulas. FAQ Frequently asked questions on nuts and bolts of programming in C++ and compiling using g++, ld, and make
Temporal View: Course Calendar Week Coverage Assignments / Videos # Dates Course Notes / Videos Text Chapters / Demos Written Programming Due Date 1 8/25 - 8/31 0: Introduction 1: Positional Containers
2: Associative Containers10
11, 12, 13Review COP 4530 Lecture Notes Assignment 0: Portfolio Creation
8/31
2 9/1 - 9/7 3: Hash Tables HashTables.mp4
4: Algorithms11 (emphasize chaining) Assignment 1 Latex
Project 1: Hash Analysis proj1.mp49/14
9/213 9/8 - 9/14 5: Generic Set Algorithms
6: Data Structure Algorithms
1,2,3 Assignment 2 Latex
Assignment 3 Latex9/28
10/54 9/15 - 9/21 7: Generic Heap Algorithms
8: Sorts
6
6,7,8
Project 2: Generic Sort Algorithms 10/5 5 9/22 - 9/28 9: Amortized Analysis 17 Assignment 4 Latex 10/19 6 9/29 - 10/5 10: Disjoint Set Algorithms DisjointSets.mp4
21 RQ1 available Week 6 only Project 3: RanMaze proj3.avi
10/26 7 10/6 - 10/12 Midterm Exam: See Syllabus for exact dates. 10/11 (Sat) 8 10/13 - 10/19 11: Graphs 1 (1,2,3)
GraphBasics.mp4 GraphSearch.mp422.1 - 22.5 Project 4: Graph Algorithms
proj4.avi
11/9
9 10/20- 10/26 11: Graphs 1 (4,5) 10 10/27 - 11/2 12: Graphs 2 23, 24 (Kruskal, Prim, Dykstra) Project 5: Movie Match
11/23 11 11/3 - 11/9 13: String Sort Overview [notes from class]
13: Strings: Sorting by String Keys
12 11/10 - 11/16 14: Strings: Searching by String Keys Trie TST
Project 6: Teams & Topics
12/7 13 11/17 - 11/23 15: Substring Search Overview [class]
15: Strings: Substring Search
16: Strings: Regular Expression Pattern Matching32 (KMP, Rabin-Karp) KMP
ConstructNFA RunNFA
14 11/24 - 11/30 Thanksgiving Week 15 12/1 - 12/7 Review / Projects RQ2 available Week 15 only 16 12/8 - 12/14 Final Exam: See Syllabus for exact dates. 12/13 [Sat] Ω 12/15 - 1/1 Semester Break - you've completed a capstone course!
Blackboard Submission Process and Requirements:
Written assignments must be submitted via Blackboard | Assignments | [specific assignment name].
The only format that is acceptable for written assignments is "portable document format" (.pdf). Mathematical discussions must be typeset appropriately and converted to pdf before submission.
Unix Script Submission Process:
Most programming assignments will be submitted via a specific Unix script from your CS Majors account logged in to shell.cs.fsu.edu. The submission script for a particular assignment will be located in the assignment distribution directory.
Submission via script should generate two email responses:
- When your submission is received, a receipt is sent via email. The date/time stamp of this email is the official submission time.
- After your submission has been unpacked and placed in your portfolio, a second message is sent containing a copy of all files that were unpacked. This is a record of exactly what was received and placed in your portfolio.
After submission, be sure to check your email for these two messages. Normally these would arrive within a few seconds of submission. If you do not get both email responses, a malfunction occurred. When you do receive these confirmation emails, save them. If a problem were to arise with your files, these emails are your proof of submission.
Note that revisions may be submitted any time prior to the deadline and will automatically replace the previous submission.