CS 211 - Computer Science II - Fall 2007

Contact Info | Location |  Course Description | Textbook | Schedule (with slides) | Grading

Contact Information(top)
Instructor: Dan Fleck

   Email:  dfleck (at) gmu.edu
   Phone: 703-993-4198
   AOL IM: danpf1

   Office: ST-II 405
   Office Hours: Tues 12:30-1:20, Wed 3:30-4:30, or anytime by appointment

TA:  Doug Corner
   Email: dcorner (at) gmu.edu

Class Location(top)

   CS 211 - 001 - 72524 -  2:30 - 3:20 - MWF - Science & Tech I - 122

Course Description(top)
 211 Computer Science II (3:3:0) Prerequisite: grade of C or better in CS 112. Continuation of CS 112. Topics include abstract data types and data structures (sets, files, strings, linked lists, stacks, queues, trees, graphs) and examples of applications. Emphasis on program development reinforced through several larger programming projects. Additional programming language instruction supplements major topics.

Carrano book coverCarrano, Data Abstraction and Problem Solving with Java, 2nd Edition


Grading Policy (top)
Quiz and exam dates in the schedule below most likely will not be changed. If you know in advance that you will miss a midterm exam, please let me know ahead of time so that I may schedule one make-up exam date for all. If an emergency occurs and you miss an exam without prior arrangements, I will expect some proof of the emergency. The make-up exam more than likely will not be the same as the scheduled exam. There will be no make-ups for quizzes. However, you do not need to take all quizzes; see my grading policy below.

Quizzes and Labs15%Each lab and quiz will have equal weight. Your average will be calculated from at most the top 75% of your lab and quiz grades.
Projects40%There will probably be 4 projects.
Midterm Exams25%There will be two midterm exams. The first will be 10% and the second will be 15%
Final Exam20%You must take the final exam to pass this course.

Your final grade will be no worse than the higher of the grades determined from your percentage grade and your class percentile as determined by the table below. If I adjust the grading policy, it will be in your favor and will apply to the class as a whole.


As with all GMU courses, this course is governed by the GMU Honor Code. In this course, all assignments, exams, and project submissions carry with them an implicit statement that it is the sole work of the author, unless joint work is explicitly authorized. Help may be obtained from the instructor or other students to understand the description of the problem and any technology, but the solution, particularly the design portion, must be the student's own work. If joint work is authorized, all contributing students must be listed on the submission. Any deviation from this is considered an Honor Code violation, and as a minimum, will result in failure of the submission and as a maximum, failure of the class.

Plagiarism is stealing the work of others and presenting it as your own. This includes written papers, but also computer programs, presentations, etc... anything that was not created by you should be referenced. When in doubt, add a reference. If you have any questions about whether you can or cannot use something you've found ask your professor or TA. If another student let you copy their work you are BOTH guilty. Any plagiarism violations will be sent to the Honor Committee. If you are found guilty of plagiarism twice in your university career you will be expelled. This is a very seriuous offense! More information about plagiarism is on the writing center website and at plagiarism.org. If you feel the need to do this for any reason, come talk to your professor and we'll work out a better plan. There is ALWAYS a better plan than plagiarising!

This class will use automated tools to detect plagiarism (including written materials and source code).

If you are a student with a disability and you need academic accommodations, please see me and contact the Disability Resource Center (DRC) at 703.993.2474. All academic accommodations must be arranged through that office.