What this course is about

CS2102 is not an introductory programming course! The course assumes programming background at the depth of CS1101 (or CS1102). Students who have not had CS1101 or CS1102 should consult with the instructor before attempting the course; you will be responsible for teaching yourself the terminology of those courses at the start of the term.

Additional information about the course is available in the WPI undergraduate catalog course description for CS 2102.

Staff

Instructor: Joshua Cuneo

Lab Manager: Hao Loi

Teaching Assistants: Sylvia Inyang, Cory Neville

Senior Assistants: Benjamin Anderson, Samuel Coache, Quyen Hoang, Matthew McDonald, Cormac Lynch-Collier, Alissa Ostapenko, Joseph Petitti, Harutyun Sadoyan, Andrew Robbertz, Augusto Wong, Alexander Wurtz

Office Hour Schedule

Day/Time

9:00

10:00

11:00

12:00

1:00

2:00

3:00

4:00

5:00

6:00

7:00

8:00

Sunday

Monday

Alissa

Augusto

Harry

Harry

Ben

Cory

Cory

Tuesday

Alissa

Joseph

Cormac

Cormac

Joshua

Joshua

Andrew

Wednesday

Augusto

Sam

Andrew

Augusto

Augusto

Sylvia

Alex

Alex

Thursday

Sam

Augusto

Alex

Ben

Sylvia/Quyen**

Alex/Quyen**

Alissa

Friday

Matt

Matt

Joseph

Joshua

Joshua

Andrew

Saturday

MASH:

CS 2102 has a MASH leader who is available to help. For more information about the MASH program, please check out the MASH website.

CS 2102 MASH Leaders: Griffin Bishop and Caitlin Enright

CS 2102 MASH Times:
Mondays at 6:00 PM
Wednesdays at 8:00 PM
Thursdays at 10:00 AM
Fridays at 10:00 AM

Class Discussion Forum

If you send a message to an individual staff member that should have gone to the forum, we will ask you to use the forum instead. We aren't being rude. We are simply trying to handle the large volume of email that we get in a large course. The less time we spend managing email, the more time we can spend actually helping you!

The forum has different categories for your messages. When you create a message, tag it with the most appropriate category (which will help direct it to the right person on our end).

If you have a question that really should go only to the instructor, you may email Joshua at jmcuneo@cs.wpi.edu. We expect that most questions will be sent via the InstructAssist forum.

Lecture and Lab Times

Textbook and Software

Software: You should plan to use Eclipse for this course.

Setting up Eclipse and JUnit

Grading

There are no makeups for exams. Absence from an exam will be excused only for medical or emergency reasons. In such cases your final grade will be recorded as Incomplete and you will be allowed to take a makeup exam the next time the course is offered (D Term 2019).

Quizzes (20%)

• Monday, October 29
• Friday, November 2
• Friday, November 9
• Friday, November 30
• Friday, December 7

Homework (40%)

Labs (10%)

Note that each student is allowed to miss a number of labs/quizzes with no questions asked, and to submit one homework assignment late with no penalty. Do not send email to the instructors or to the TAs requesting makeup or extra-credit work, or extra time for homework.

Academic Honesty Policy

Homework

Students are likewise forbidden from facilitating other students, current or future, in plagiarism or cheating. Students may not distribute their code publicly on the Internet, or in other means, during the term or even after the class has concluded. Students may share their code with potential employers or other individuals privately, so long as the code would not become available to other WPI students.

As examples, each of the following scenarios would constitute cheating (this list is not exhaustive!):

• Two different homework pairs/individuals share a solution to a single question on a homework assignment.
• Students from different homework pairs sit side-by-side while writing up their solutions and one student copies down what the other student types up.
• You send the code for a completed homework question to a friend in another homework pair "just so he can look at it to figure out how to do the problem".
• You obtain a solution to a homework problem (or a problem similar to a homework problem) from the Internet or from someone who took the course in a previous term.

In contrast, the following scenarios would not constitute cheating:

• Students from two different homework pairs discuss a pair-assignment (its goal, what it is asking you to do, what the challenging parts are, or how to approach the problem).
• You ask any member of the course staff (professor, TAs, or SAs) for help in understanding or completing an individual assignment.
• Students from the same homework pair share code to a solution.
• Students from one homework pair show their code to a student from a different pair and ask for help in understanding why their code is wrong. (This would become cheating if the non-pair student provided or dictated a reasonable amount of the solution to the original pair).

Cheating will not be tolerated. If you are unsure whether a given activity would constitute cheating, ask one of the instructors. Violations of the Academic Honesty Policy can result in an NR for the course, and violators will be subject to the procedures outlined in Section 14, Academic Honesty Policy of the WPI Code of Conduct.

Late Policy

Homework Submission Policy

Classroom Expectations

Schedule

Week	Notes and Readings	Topics	Assignments
Oct 23 - 26	Lecture 1 objectives Lecture 2 objectives Lecture 3 objectives Notes: Migrating to Java (sections 1-9) Video: OOP: An Introduction Overview: Overview of CS 2102 topics Practice: Practice with Classes Practice: Practice with Methods Practice: Code review Methods Practice : Tracing Code Simple Methods Lecture Materials: Slides (T): Syllabus Slides Code (T): Dillo in Java Slides (TH): Racket and Memory Mapping Slides Code (TH): Dillo and Boa in Java (with comments) Slides (F): Racket and Memory Mapping Slides Code (F): Interfaces in Java	Classes, Objects, Methods, Interfaces	Homework 1 (due: Tuesday, October 30, at 5pm) Lab 1 , Tues/Wed Oct 24/25
Oct 29 - Nov 2	Lecture 4 objectives Lecture 5 objectives Lecture 6 objectives Lecture 7 objectives Notes (M): Types and Nested Objects Extra: How to get started on problems Handout (M): Starter file for Monday Notes (M/T): Abstract Classes Notes (T): Adding functionality to an existing class hierarchy: Interfaces vs. Abstract Classes Practice (M): Programming Interfaces Practice (T): Programming Abstract Classes Notes (T): Updating Objects Handout (Th): Handout for Thursday's Think-Pair-Share Notes (Th): Lists in Java Code (Th): Racket-style lists (incomplete - you should fill in the countUses() method) Code (F): Racket-style lists (complete) Code (F): WordList class Lecture Materials: Slides (M): Abstract Class UML Code (M): Abstract Classes in Java Slides (T): Abstract Class UML and Diagrams Code (T): More Abstract Classes and Cell Biology Slides (TH): Mutators and Lists Code (TH): More Inheritance, Mutators, and Lists Code (F): Linked Lists API (F): Linked Lists	Interfaces, Abstract classes, Lists, and Variables	Homework 2 (due: Wednesday, November 7, at 5pm) Lab 2, Tues/Wed Oct 30/31
Nov 5 - 9	Lecture 8 objectives Lecture 9 objectives Lecture 10 objectives Lecture 11 objectives Notes (M): Equality on Objects Notes (M/T): Starter file for Design Exercise Notes (M/T): Design Exercise Practice (M/T): Designing Class Hierarchies Notes (Th/F): Planning programs Exam Preparation: Midterm Exam Preparation Java API Lecture Materials: Slides (M): Loops and Equality Code (M): Loops and Equality Slides (T): Design Tasks Handout (T): Code Handout Code (T): Modified Handout Code	Equality, Design Review, Planning	Homework 3 (due Thursday, November 15 at 5pm) Lab 3, Tues/Wed, Nov 6/7
Nov 12 - 16	Lecture 12 - review/catch up Lecture 13 - Exam date Lecture 14 objectives Lecture 15 objectives Notes (Th): Binary Search Trees Notes (F): Heaps Lecture Materials: Slides and Notes(M): Planning Code (M): Planning Code Slides (TH): Sets Slides (F): BSTs Slides (F): Heaps and AVL Trees	Sets, Binary Search Trees, Heaps Exam 1 Nov 13	Homework 4 (due: Tuesday, November 27 at 5pm) Lab 4, Tues/Wed, Nov 13/14
Nov 19-20	Lecture 16 objectives Lecture 17 objectives Notes (M): AVL Trees (balanced BSTs) Notes (M): AVL rotations Practice (M): Add an element to an AVL tree Starter Code (T): Banking starter Notes (T): Encapsulation and Access Modifiers Lecture Materials: Notes (M): Merge Algorithm Code (M): Encapsulation Notes (T): Encapsulation Slides Code (T): Encapsulation and Data Structures	AVL Trees, Encapsulation, Access Modifiers	No lab this week. Happy Thanksgiving! Homework 5 (due: Tuesday, Dec 4 at 5pm)
Nov 26 - 30	Lecture 18 objectives Lecture 19 objectives Lecture 20 objectives Lecture 21 objectives Notes (M): Encapsulation and Access Modifiers Notes (T): Exceptions Notes (Th): Generics (Abstract over Data) Notes (F): Hashtables Lecture Materials: Notes (M): Exceptions Code (M): Exceptions Code Notes (T): Generics Code (TH): Generics Code Notes (TH): Hashing Code (F): Hashing	Encapsulation (cont.), Exceptions, Generics, Hash Tables	Homework 6 (due: Tuesday, Dec 11) Lab 5 Tues/Wed, Nov 27/28
Dec 3 - 7	Lecture 22 objectives Lecture 23 objectives Lecture 24 objectives Lecture 25 objectives Notes (M): Arrays (Code)(M): Fibonacci code Notes (Th): Avoiding infinite loops Notes (F): Returning routes (Extra)(F): Encapsulating routes (not on exam) Lecture Materials: Notes (M): More Hashing and Fibonacci Code (M): Fibonacci Code Notes (T): Hashing Notes from PollEverywhere Notes (T): Graphs and Infinite Loops Notes (TH): More Graphs Code (TH): Graph Code Notes (F): ArrayLists, Stacks, and Queues Final Exam Preparation Guide	Arrays, Graphs, Encapsulating Routes	Lab 6 Tues/Wed, Dec 4/5
Dec 10-14	Lecture 26 objectives Lecture 27 - Exam date Lecture 28 - Exam return; Java Collections Framework Handout (M): Stack implemented as a Linked List Extra: Java Collections Framework overview Lecture Materials: Code (M): Stacks and Queues	Exam 2 December 13	No lab this week

Frequently Asked Questions (FAQs)

• Where can I find feedback on my homework assignments?

  A grade sheet will be filled out for every graded homework assignment. The grader will upload a copy of the grade sheet to the InstructAssist accounts of both homework partners. You can access the grade sheet for a particular assignment by choosing the "Grades" tab in InstructAssist, and "Display Grades". There's an "Attachment" for each Homework assignment listed in the Grade Report. Click on the attachment to see your feedback.

• My classmate has received her homework feedback on InstructAssist, but my feedback isn't posted. Why?

  There is a staff of 13 people grading CS 2102 homework assignments. The graders will be uploading your feedback as soon as they can, but expect that the feedback will be available at different times from different graders. We'll try to guarantee that the feedback for any given assignment will be posted within a week of the due date.

• What should I do if I think my assignment has been graded incorrectly?

  Post a question on the Grading Error forum of InstructAssist.

• When will I get my graded quizzes back?

  Graded quizzes will be returned on Tuesdays/Wednesdays during lab sections.

• Where are TA/SA office hours held?

  The TA office hour room is FL A22, in the sub-basement of Fuller Labs. The sub-basement is the bottom-most level of Fuller. Follow the signs to the "Zoo Lab", which is next door to the office hour room.

https://web.cs.wpi.edu/~cs2102/b18