|
||||||||||
| ||||||||||
| ||||||||||
|
None.
Liang, Y. Daniel. Introduction to Java Programming, Comprehensive Version. 12th Edition. Pearson. 2020.
Note: Assignments and readings in the course will be based on the twelfth edition of the text. If you choose to get a previous edition, it is your responsibility to make sure you have the correct assignments and sections.
| Variables | Data types | Objects | Classes |
| Methods | Documentation | Design | Iteration |
| Selection | Logical Operations | Random Numbers | Multidimensional Arrays |
| Call stacks | Arrays | Fundamental Algorithms | Variable Scope |
| Unix Fundamentals | Compilation | Problem Solving | Java Fundamentals |
The federal government defines a credit hour as the equivalent amount of work as 50 minutes in class and two hours out of class for one semester.
Therefore, this course should be the equivalent work of three hours and twenty minutes in class and 8 hours outside of class. Since the course meets two and a half hours per week, the schedule contains a "fourth hour" item each week which will typically be an online quiz.
You are expected to attend class regularly and keep up with the reading. A comprehensive list of readings is given on the calendar on the class web page.
The course contains a classwork component which must be completed in class during class time.
Homework assignment deadline will be posted on Moodle. Typically the deadline will be set at 12 pm (noon) on the due date. Late homework will be penalized 20%. Homework submitted after the assignment is graded or after an answer key is distributed will NOT be accepted.
Homework will be graded on the third class meeting or one week after they are submitted, whichever is later. Otherwise, all students who have turned in the assignment on time will receive a 10% bonus.
Unless otherwise specified, all homework assignments are weighted equally. Such changes will be noted on the assignment specifications.
Each student is required to attend at least two Computer Science, Mathematics, or Science related events during the semester. Department colloquia and ACM events often include a sign-in form, which will allow you to receive credit. If you attend an event other than a Computer Science Colloquium, there is an assignment in Moodle which will include some questions to answer regarding the event.
There will be 3 tests during the semester, their dates are given below. Make-up tests will only be given under special circumstances.
| Homework | 20% |
|---|---|
| Fourth Hour Quizzes | 12% |
| Classwork | 20% |
| Event Attendance | 2% |
| Tests | 36% |
| Final Exam | 10% |
| A+ | 98 - 100 | A | 93 - 97.99 | A- | 90 - 92.99 |
|---|---|---|---|---|---|
| B+ | 87 - 89.99 | B | 83 - 86.99 | B- | 80 - 82.99 |
| C+ | 77 - 79.99 | C | 73 - 76.99 | C- | 70 - 72.99 |
| D+ | 67 - 69.99 | D | 60 - 67 | F | below 60 |
All Gettysburg College students are expected to abide by the Honor Code. All work in this course is to be done individually unless the instructor specifically states otherwise. This includes assigned projects as well as regular class work. The use of the computer may make it more tempting and easier to pass off another person’s work as your own. This is UNACCEPTABLE. The department is always very aggressive about enforcement of the Honor Code.
For this course the following are guidelines for following the honor code.
| Week | Date | Day | Topics | Reading | Notes |
|---|---|---|---|---|---|
| 1 | 1/20/25 | M | Introduction, Linux, Programs | ||
| 1 | 1/22/25 | W | Basic Java Output, Errors | Ch 1 | |
| 1 | 1/24/25 | F | Variables and input | Ch 2 | |
| 2 | 1/27/25 | M | Arithmetic Operations | Ch 2 | |
| 2 | 1/29/25 | W | Type conversion | Ch 2 | |
| 2 | 1/31/25 | F | If, if-else | Ch 3 | Last day to Add/Drop |
| 3 | 2/3/25 | M | Logical operators | Ch 3 | |
| 3 | 2/5/25 | W | Random numbers | Ch 3 | |
| 3 | 2/7/25 | F | switch, conditionals | Ch 3 | |
| 4 | 2/10/25 | M | Mathematical functions | Ch 4 | |
| 4 | 2/12/25 | W | Characters, Strings, Formatted output | Ch 4 | |
| 4 | 2/14/25 | F | while loops | Ch 5 | |
| 5 | 2/17/25 | M | do-while loops | Ch 5 | |
| 5 | 2/19/25 | W | Test 1 | Ch 1-4 | |
| 5 | 2/21/25 | F | for loops | Ch 5 | |
| 6 | 2/24/25 | M | loops with ifs | Ch 5 | |
| 6 | 2/26/25 | W | nested loops | Ch 5 | |
| 6 | 2/28/25 | F | Loop control | Ch 5 | |
| 7 | 3/3/25 | M | Loop control | Ch 5 | |
| 7 | 3/5/25 | W | Defining methods | Ch 6 | |
| 7 | 3/7/25 | F | Calling methods | Ch 6 | |
| 8 | 3/10/25 | M | No class | Spring Break | |
| 8 | 3/12/25 | W | No class | Spring Break | |
| 8 | 3/14/25 | F | No class | Spring Break | |
| 9 | 3/17/25 | M | Parameter passing | Ch 6 | |
| 9 | 3/19/25 | W | Method overloading | Ch 6 | |
| 9 | 3/21/25 | F | Variable scope | Ch 6 | |
| 10 | 3/24/25 | M | Creating and accessing arrays | Ch 7 | |
| 10 | 3/26/25 | W | Test 2 | Ch 5-6 | |
| 10 | 3/28/25 | F | Arrays Continued | Ch 7 | |
| 11 | 3/31/25 | M | Passing and returning arrays | Ch 7 | |
| 11 | 4/2/25 | W | Searching | Ch 7 | 4/3 Rising Senior Registration |
| 11 | 4/4/25 | F | Searching | Ch 7 | Last day to withdraw |
| 12 | 4/7/25 | M | Sorting | Ch 7 | |
| 12 | 4/9/25 | W | Multi-dimensional arrays | Ch 8 | 4/10 Rising Junior Registration |
| 12 | 4/11/25 | F | Indexing multi-dimensional arrays | Ch 8 | |
| 13 | 4/14/25 | M | Non-rectangular arrays | Ch 8 | |
| 13 | 4/16/25 | W | Recursion | (Ch 18) | 4/17 Rising Soph Registration |
| 13 | 4/18/25 | F | Recursion | (Ch 18) | |
| 14 | 4/21/25 | M | Classes and Objects | Ch 9 | |
| 14 | 4/23/25 | W | Test 3 | Ch 7-8, 18 | |
| 14 | 4/25/25 | F | Classes and Objects | Ch 9 | |
| 15 | 4/28/25 | M | Classes and Objects | Ch 9 | |
| 15 | 4/30/25 | W | More about classes | Ch 10 | |
| 15 | 5/2/25 | F | Exam Review | ||
| 16 | 5/5/25 | M | Final Exam (A) | 1:30 pm - 4:30 pm | |
| 16 | 5/10/25 | Sat | Final Exam (B) | 1:30 pm - 4:30 pm |