|
|
COURSE SYLLABUS |
|
|
COURSE SYLLABUS |
This class has students attending in three distinct modes:
The content, objectives, assignments, assessments, and grading are the same for all students. Obviously, however, on-campus, mixed-mode, and distance students sometimes participate in different ways.
For all students: Regular participation via the Blackboard course interface is required. Official course announcements, lecture materials, assignments, and help archives will all be on-line at this site. Note that all registered students should have the course web site listed on their My FSU portal page. Be sure to test this and resolve any difficulties no later than the first week of classes.
For on-campus/local students: Class (lecture and recitation) will be met and attendance is required. (See schedule details below.) All exams will be given in class during scheduled class time.
For on-line/distance students: All exams must be proctored and taken during the exam window. It is the student's responsibility to arrange for proctored exams in compliance with the FSU standards. Go to the URL http://online.fsu.edu/learningresources/proctoredexam/ for details.
Note that students may be required to identify themselves with official FSU ID to sit an exam.
Event Location Dates Day Time Lecture TEC Teaching Lab Jan 11 - Apr 26 (excluding Mar 8) Tue 5:00pm - 7:30pm (Central Time)
There will be two exams in COP 4531, a midterm exam and a final exam. The dates for the two exams are shown in the following table.
Exam Calendar Exam On-Campus Distance Window (Inclusive) Midterm Exam Tue Mar 1 Wed Mar 2 - Sat Mar 5 Final Exam Tue Apr 26 Fri Apr 22 - Tue Apr 26
Chris Lacher, Faculty
Responsibilities: Course Policies and Standards, On-Site and On-Line Instruction, Assessment
Office: 112 Faculty Annex B / Panama City Campus Office Phone (during office hours): 850-522-5502 or 850-644-2090 ext 251 Mobile Phone/Voice Mail (24/7): 850-510-5575 Email: lacher@cs.fsu.edu Fax: 850-872-7720 Mail & Delivery: Florida State University
4750 Collegiate Drive
Panama City, FL 32405-1099
Lacher Weekly Schedule Effective Jan 5 - Apr 29, 2005 (excluding Jan 17 and Mar 7-11)
Keith Rupert, Associate Faculty
Responsibilities: Associate Instructor, On-Line Instruction, On-Line Mentor, Project Assessment
Office Phone (during business hours): 386-754-4216 Email: krupert@fsu.edu
The courses COP 4530; MAD 3105 or 3107; and STA 4442 are required prerequisites for this course. In addition, note that MAD 2104 and CDA 3101 are prerequisites for COP 4530. These prequisites will be enforced. Students not having credit for these prequisite courses will be dropped from the class.
This course continues the study of data structures and algorithms begun in COP 4530, with emphasis evolving to more sophisticated structures, more complex analyses, and higher levels of abstraction. Data structures and algorithms form the foundation of both the theory and practice of all computing disciplines. Mastery of these materials is an essential ingredient to becoming a computer scientist.
This is a continuation of the course COP 4530 Data Structures, Algorithms, and Generic Programming, with emphasis evolving to more sophisticated structures, more complex analyses, and higher levels of abstraction.
The courses COP 4530 and this one (COP 4531) are about efficiency of programs and programming, in various meanings of efficient. It is efficient to re-use code instead of re-writing code (or, worse, re-inventing code). It is efficient to select only the linguistic features you need without having to use costly extra features you do not need. It is efficient to minimize the run time of code, especially code that is destined for re-use. It is also efficient to minimize the memory and storage needs of code, recognizing that there may be a tradeoff between speed and memory requirements. It is efficient to spend less time writing a program of equal quality, and even more efficient to spend the same time writing a program of higher quality. In many applications, correctness is the ultimate form of efficiency, while in others efficiency means getting the best result possible in the limited time (or space) available.
Efficiency can happen at different levels. Take code: source code can be small in size, easy to read, and easy to understand. Executable code can be fast or compact (or both). The code production process can be efficient by applying good software engineering methodology. Code can run efficiently, in either a temporal or spatial sense. Savings in human effort also represent efficiency. Effort can be saved by good design, by careful (error-free) programming, and by re-using both code itself and patterns of problem solving that are known to be successful.
All these ideas of efficiency are central to this course sequence. It is also true that all of these ideas of efficiency are fundamental to the design and specification of the C++ language, which is one of many reasons C++ is a great choice for the core language in our curriculum and for this course.
The three topics mentioned in the title of the course are data structures, algorithms, and generic programming. Data structures will be discussed in abstract terms (as abstract data types, or ADTs) but they will also be looked at in very concrete ways, actually implemented using C++. Algorithms are just formalizations of processes that result in predictable and desirable outcomes. Algorithms are used in a variety of contexts. Particularly, data structures are made usable by implementing algorithms for searching, sorting, and indexing the structures. Generic programming is the science of component re-use. We will explore coding for re-use of both data structures and algorithms in C++. Coding for re-use and re-use of code are important aspects of software engineering.
We will also have several substantial programming projects that involve the implementation and use of data structures, algorithms, and generic programming.
At the end of this course, the student should have experienced, and should permanently retain a working knowledge of, the following topics and concepts. (Those that are introduced or reviewed in this continuation course are in color.)
Data Structures
- Definition, implementation, and use of the following concepts:
Positional ADTs: vector, list, deque, stack, queue, binary tree, graph, directed graph, directed acyclic graph (DAG), network
Associative ADTs: table, associative array, priority queue, set, map, multiset, multimap
- Definition and use of iterators associated with these ADTs
- Familiarity and experience implementing these abstractions, including their associated iterator classes and including performance constraints (in terms of runtime complexity) on the operations. Implementations will include the following: vector, list, deque, stack, queue, priority queue, hash table, associative array, hash set, sorted list, binary tree, binary search tree, red-black tree, graph, directed graph, network. Note that this implies the detailed study of trees of several types a implementation structures and the use of template classes as well as the elementary study of algorithms and their complexity.
Algorithms
- Familiarity and experience with algorithm theory: proof of correctness and informal complexity analysis
- Familiarity and experience with specific algorithms (covered or reviewed in this course shown in color): Sequential Search, Binary Search, Push and Pop Heap, Heap Sort, Insertion Sort, Merge Sort, Quick Sort, Depth-First Search, Breadth-First Search, Topological Sort, Minimum Spanning Trees, Shortest Paths, Maximum Flows, Implementations of ADT Operations.
Generic Programming
- Familiarity and experience with generic containers as class templates with typename template parameters
- Familiarity and experience with generic algorithms as function templates with iterator template parameters
The overall grade for COP 4531 is an average of two equally weighted parts: Exams and Assignments. Exams consist of a midterm exam and a final exam. Assignments consist of four programming projects. The dates for the two exams are shown in the Exam Calendar above. Due dates for other deliverables will be available on the Course Calendar.
There are 1000 total points that may be earned in the course (not counting possible extra credit opportunities), distributed as shown in Table 1. At least 350 exam points (midterm and final exams) and 350 assignment points (programming projects and homework) must be earned to get a course grade of C or better. In addition, working solutions for every assignment must be submitted in order to be eligible for the grade of A. Once meeting these constraints, the final grade is determined using Table 2. Extra credit points in one category may not be used in the other category.
|
|
||||||||||||||||||||||||||||||||||||||||||||||||||||
NOTE: You must earn at least 350 points in both Exams and Assignments to be awarded a course grade of C or better. In addition, you must submit a working version of every assignment in order to be eligible for the grade of A.
Project Assessment: Projects will be assessed using Table 3 as a guide, with minor modifications depending on the specific assignment. Note that these assignments are more open-ended than assignments in the predecessor course and that assessment of these assignments will also be more open-ended. There is room for creativity and thoroughness that is left unspecified. Moreover, it is expected that all programming aspects of a project should be completed with appropriate attention to good software engineering practice: separate compilation of code files, correct inclusion of header files, a correct portable makefile, well-designed solutions, readable and self-documenting code, etc. Students at this level should not expect partial credit for projects that will not compile or code that produces incorrect output or runtime errors. Straightforward testing can eliminate such problems.
Table 3: Project Assessment Guidelines Criterion Percentage Points Range Deliverables Received and Project Compiles 0 ... 25 Results of Testing 0 ... 25 Project Meets Requirements 0 ... 25 Design, Readability, and Style -25 ... 25 Assessment will be done in two stages. First an objective assessment will be done to test compilation and correctness of the running program. Then a member of the instructional staff will add subjective assessment based on the test results and source code. A report will be emailed to the student after assessment is complete.
- You may earn up to approximately 75 percentage points for a correctly functioning project meeting all requirements. (The exact percentage will depend on the particular assignment.)
- Your project score may change by plus or minus the remaining percent during the subjective assessment.
- You must understand your project work. If you are asked to explain your work, and if you cannot do so, you may be assigned a grade of zero.
Late Assignments: To receive full credit, assignments must be turned in by 11:59:59pm Eastern Time on the due date. The time stamp on email sent from a CS machine will determine the time of submission. An assignment that is turned in no more than 24 hours late will be scored with a 10% penalty. An assignment that is turned in more than 24 and no less than 48 hours late will be scored with a 20% penalty. An assignment that is turned in more than 48 hours late will receive the score of zero (0).
The following materials are required:
The following optional reference books are sanctioned for this course:
- Lecture Notes: Slides and Narrative: available through Blackboard under "Lecture Notes"
- Code Distribution Library: progressively released to members of the course group only at /home/courses/cop4531p/spring05/ (see Chapter 1 of Lecture Notes for details)
- Cormen, T.H., Leiserson, C.E, and Rivest, R.L. (2001). Introduction to Algorithms (2nd ed.). New York: McGraw-Hill.
ISBN 0-262-03293-7
- Stroustrup, Bjarne (1997). The C++ Programming Language (3rd edition). Addison-Wesley.
ISBN 0-201-88954-4- Deitel, H.M. and Deitel, P.J. (2003). C++: How to Program (4th ed.). New Jersey: Prentice Hall.
ISBN 0-13-038474-7- Ford, W. and Topp, W. (2002). Data Structures with C++ Using the STL (2nd edition). New Jersey: Prentice Hall.
ISBN 0-13-085850-1- Austern, M. (1998). Generic Programming and the STL. Massachusetts: Addison-Wesley, 1998.
ISBN 0-201-30956-4- Oram, A. and Talbott, S. (1991). Managing Projects with make. Sebastopol, CA: O'Reilly & Associates.
ISBN 0-937175-90-0- Cameron, D., Rosenblatt, B., and Raymond, E. (1996). Learning GNU Emacs, 2nd Edition. Sebastopol, CA: O'Reilly & Associates.
ISBN 1-56592-152-6The following are useful on-line references:
First Day Attendance Policy: Official university policy is that any student not attending the first class meeting will be automatically dropped from the class. For distance students, this policy is interpreted as posting to the discussion forum "First Day Attendance" no later than the first day of the semester.
Regular Attendance Policy: The university requires attendance in all classes. Attendance in distance classes shall mean regular access to the course web site via campus.fsu.edu and regular participation in the class discussion forums. Here, "regular" shall mean a substantial amount of time on a weekly basis. Note that individual access statistics are maintained by Blackboard.
Proctored Exam Policy: All exams must be proctored and taken at an approved testing site during the exam window or in class on the designated date. It is the student's responsibility to arrange for proctored exams in compliance with the FSU standards. Go to http://online.fsu.edu/learningresources/proctoredexam/ for details.
Exam Makeup Policy: An exam missed without an acceptable excuse will be recorded as a grade of zero (0). The following are the only acceptable excuses:
- If submitted prior to the day of the scheduled exam:
- A written and signed explanation as to why the exam will missed. Illness or required professional travel are acceptable, while discretionary or personal travel are not. In any case the explanation should be accompanied by corroborating documentation, including names and contact information, and the explanation must be accepted by the instructor prior to missing the exam.
- Evidence from a university official that you will miss the exam due to university sanctioned travel or extracurricular activity.
- If submitted on or after the day of the scheduled exam:
- A note from a physician, university dean, spouse, parent, or yourself indicating an illness or other extraordinary circumstance that prevented you from taking the exam and could not be planned for in advance. Again, corroborating information should be supplied.
All excuses must be submitted in writing, must be signed by the excusing authority, and must include complete contact information for the authority, including telephone numbers and address.
Missed exams with acceptable excuse will be made up or assigned the average grade of all other exams, at the option of the course instructor.
Missed, and acceptably excused, final exams will result in the course grade of 'I' and must be made up in the first two weeks of the following semester.
Grade of 'I' Policy: The grade of 'I' will be assigned only under the following exceptional circumstances:
- The final exam is missed with an accepted excuse for the absence. In this case, the final exam must be made up during the first two weeks of the following semester.
- Due to an extended illness or other extraordinary circumstance, with appropriate documentation, the student is unable to participate in class for an extended period. In this case, arrangements must be made to make up the missed portion of the course prior to the end of the next semester.
All students are expected to uphold the Academic Honor Code published in The Florida State University Bulletin and the Student Handbook. The Academic Honor System of The Florida State University is based on the premise that each student has the responsibility (1) to uphold the highest standards of academic integrity in the student's own work, (2) to refuse to tolerate violations of academic integrity in the university community, and (3) to foster a high sense of integrity and social responsibility on the part of the university community.
Complete explanation of the Academic Honor Code: http://www.fsu.edu/Books/Student-Handbook/codes/honor.html
The complete Student Handbook: http://www.fsu.edu/Books/Student-Handbook/In particular, note that students may not give or receive help of any kind on programming projects. This means, among other things, that students are not permitted to read each others code (on paper OR on screen) or discuss design or implementation of programming projects with anyone other than the instructional personnel. Violations of this policy will result in the grade of zero for all parties involved.
