Prerequisites:
CS 112 (C or better)
Format:
Lecture and Lab
Instructor:
Name | Office | Hours | |
---|---|---|---|
Prof. Archange Giscard Destiné | adestine@gmu.edu | Buchanan Hall D215F | Tuesday 3-5 pm |
Name | Office | Hours | |
---|---|---|---|
Rezoan Ahmed Nazib | rnazib@gmu.edu | Buchanan Hall D215F | Thursday 3-5 pm |
Section | Day | Time | Location |
---|---|---|---|
B01 | MW | 1:30 pm - 4:10 pm | Exploratory Hall L004 |
BP1 | MW | 1:30 pm - 4:10 pm | Exploratory Hall L004 |
Lab Section | Day | Time | Instructor | Location |
---|---|---|---|---|
CS211-2B1 | TR | 12:30 pm | Rezoan Ahmed Nazib | ENGR 5358 |
CS211-2B2 | TR | 1:30 pm | Rezoan Ahmed Nazib | ENGR 5358 |
Course Description: Thorough treatment of programming according to object-oriented principles. Introduces classes, interfaces, inheritance, polymorphism, and single dispatch as means to decompose problems. Covers intermediate programming techniques including error handling through exceptions, arrangement of source code into packages, and simple data structures. Intermediate debugging techniques and unit testing are covered.
Outcomes
Readings:
online textbook with practice problems; weekly deadlines; automated grading
Class participation:
attendance and quizzes
Labs:
programming exercises during recitation(lab) sessions; collaboration/group work allowed
Exercises:
small programming assignments (5 days); individual or group work
Projects:
large programming assignments (10 days); individual work only
Exams:
in-class; computer-based; require the Respondus Lockdown Browser
Grade Distribution
Coursework | Weight | Notes |
---|---|---|
Class participation | 5% | |
Readings | 5% | lowest 15 subsections dropped |
Labs (14) | 10% | lowest 2 dropped |
Exercises (4-5) | 15% | no drops |
Projects (2-3) | 20% | no drops |
Midterm Exam | 15% | replaced by final exam grade if final exam score is higher |
Final Exam | 30% | must pass final to pass the course |
.java
source rather than compiled .class
files or word documents containing the source.
It also means that the code must be submitted rather than simply saved.
Grading Scale
grade: | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
range: | [98,100] | [92,98) | [90,92) | [88,90) | [82,88) | [80,82) | [78,80) | [72,78) | [70,72) | [60,70) | [0,60) |
Unless specific instructions are given to the contrary, programming assignments are an individual effort, no group work is allowed. In addition to code, this includes the sharing of test cases, pseudocode, or approaches, receiving assistance in debugging code, as well as the use of external Internet sites.
Both the GMU Honor Code and the CS Department Honor Code apply in this class. Any use of a direct contribution on any program, homework, quiz, or exam will be reported as a violation of the honor code.
We take the honor code quite seriously. Any attempts at copying or sharing code, algorithms, or other violations of the honor code simply will not be tolerated. We use automated software to flag suspicious cases, and then review them to find the cases that must be submitted to the Office of Academic Integrity. The penalty for cheating will always be far worse than a zero grade, to ensure it's not worth taking the chance. Confirmed cases of cheating almost always translate into course failure.
Some kinds of participation in online study sites violate the Mason Honor code: these include accessing exam or quiz questions for this class; accessing exam, quiz, or assignment answers for this class; uploading of any of the instructor's materials or exams; and uploading any of your own answers or finished work. Always consult your syllabus and your professor before using these sites.
Students who have a right to accommodations due to disabilities or other conditions should discuss this with the instructor as soon as possible. Accommodations will follow the recommendations of the University's Office of Disability Services.
We are in unprecedented times. For our collective safety, please follow these guides.
Week | Dates | Topic | Supplemental reading | zyBooks reading | Assignments | Notes (deadlines) |
---|---|---|---|---|---|---|
week 1 | 5/31 | Introduction; Basics; Control Flow | 1, 2, A2 | 1, 2, 3 | E1 | - |
6/05 | Arrays; Input/Output; File I/O | 3, 5 | 4, 5 | - | ||
week 2 | 6/07 | Classes; Objects; Methods; Fields | 4, 6 | 6, 7 | E2, P1 | E1 is due |
6/12 | Command line args; Packages; Javadocs | 11, 13 | 8 | - | ||
week 3 | 6/14 | Inheritance; Polymorphism; Dynamic dispatch | 7 | 10 | E2 is due | |
6/19 | Juneteenth Observance (University Closed) | |||||
week 4 | 6/21 | Abstract classes; Interfaces; Enums | 8, 9 | 11 | E3, P2 | P1 is due |
6/26 | Exceptions; Unit testing | 10, 12 | 12 | - | ||
week 5 | 6/28 | Midterm Review | E4 | E3 is due | ||
7/03 | --- Midterm Exam --- | |||||
7/04 | Independence Day (University Closed) | |||||
week 6 | 7/05 | OOP Concepts review | - | |||
7/10 | Generics | 14 | 13 | P2 is due | ||
week 7 | 7/12 | Collections, Lists & Queues | 9,14 | P3 | E4 is due | |
7/17 | Recursion | 15 | 15 | - | ||
week 8 | 7/19 | Searching & Sorting | 16 | 16 | E5 | - |
7/24 | Nested classes; Lambda functions | A1 | 19 | P3 is due | ||
week 9 | 7/26 | Final Review | E5 is due | |||
7/28 | --- Final Exam --- |