CMSC132: Object-Oriented Programming II

Class

Syllabus

Introduction

Object-Oriented Programming II is a second programming course for Computer Science majors with a focus on object-oriented programming. The goal of the course is to develop skills such as program design and testing as well as the implementation of programs using a graphical IDE. All programming will be done in Java.  

Prerequisites

PrequisitesCMSC131, MATH140
Credits4

Course Coordinator

Name Office
Nelson Padua-Perez AVW 1203

For office hours and other contact information, visit the staff link.

Please be aware of the TA room usage policy.

Textbook (Required)

Title Authors ISBN-13
Data Structures and Abstractions with Java, 4th Edition Frank M. Carrano
Timothy M. Henry
978-0-13-374405-7

Course Topics (Subject to Change)

Topics

  • Object-oriented software development
    • Software life cycle
    • Requirements & specifications
    • Designing objects & classes
    • Testing & code coverage
    • Programming paradigms
    • Design patterns
  • Algorithms & data structures
    • Asymptotic efficiency
    • Lists, stacks, queues
    • Trees, heaps
    • Sets, maps, graphs
    • Recursion
  • Programming skills
    • Inheritance in Java
    • Java collection framework
    • Threads, synchronization
    • Exceptions

Grading

Final grades will be computed according the following weights:

25% Projects
15% Quizzes/Lab/Lecture Work
30% Midterms (3)
30% Final Exam

Once we have graded any class material (e.g., exams, projects, etc.) we will post an announcement and a deadline by which you must submit any regrade request (if necessary). It is your responsibility to submit regrade requests by the specified deadline; no regrade requests will be processed afterwards.

Projects

  • Deadlines - All projects are due at 11 pm on the specified day in the project description. You have until 11 pm of the next day to submit your project with a 12% penalty. Notice that after the late period, you will not receive any points for your project. For example, if a project is due on Wednesday at 11 pm, you have until Thursday at 11 pm to submit a late project with a 12% penalty. Any submission after Thursday 11 pm will receive 0 pts.
  • Submit Server - You need to use the submit server for project submissions. We will not accept projects submitted otherwise (e.g., e-mail, etc.). Make sure that your project works in the submit server, otherwise you will not get any credit.
  • Which Project Gets Graded - Your grade for an project will be based on the submission with the highest score after the late penalty (if any) has been applied.
  • Good Faith Attempt - You must satisfy a minimum set of requirements for each project (Good Faith Attempt) otherwise you will not pass the course (automatic grade of F). Each project defines its own good faith attempt criteria and a deadline to provide an implementation that satisfies it. If you start a project on time and look for assistance (if required) you should have no problems satisfying the Good Faith Attempt. The Good Faith Attempt guarantees you have the skills necessary for upper-level courses. Notice that you will not receive extra points for completing the good faith attempt. The grade you obtain for a project will be based on your ontime/late submission.
  • Closed Projects - All programming assignments in this course are to be written individually (unless explicitly indicated otherwise). Cooperation between students is a violation of the Code of Academic Integrity. Remember the purpose of projects is for you to learn the class material and do well in projects.

TA Room/Office Hours

Office hours get extremely busy the day before a project deadline. Therefore do not wait to start your projects. Regarding office hours and the TA Room:

  • Once you have been helped by a TA please leave the TA room. We have a large number of students in all of our classes and the TA room is really crowded.
  • If there is a line of students waiting, a TA should spent at most 5 minutes with a student. Please remind TAs about this rule.

Online Posting of Project Implementations Not Allowed (READ)

  • Do not post your assignments' implementation online (e.g., GitHub, PasteBin) where they can be seen by others. Making your code accessible to others can lead to academic integrity violations.
  • Even if the course is over, do not make your code available to others.
  • Notice we constantly monitor online sources.

Backups

You need to keep backups of your projects as you develop them. No extensions will be granted because you accidentally erased your project. Feel free to use the submit server as a backup tool by submitting often. You can also use tools like git, etc. Do not post code in any online system that is accessible to others (e.g., GitHub).

Academic Integrity

Note that academic dishonesty includes not only cheating, fabrication, and plagiarism, but also includes helping other students commit acts of academic dishonesty by allowing them to obtain copies of your work. In short, all submitted work must be your own. Cases of academic dishonesty will be pursued to the fullest extent possible as stipulated by the Office of Student Conduct.

It is very important for you to be aware of the consequences of cheating, fabrication, facilitation, and plagiarism. For more information on the Code of Academic Integrity or the Student Honor Council, please visit http://www.shc.umd.edu.

Examples of Academic Integrity Violations

The following are examples of academic integrity violations:

  • Hardcoding of results in a project assignment. Hardcoding refers to attempting to make a program appear as if it works correctly (e.g., printing expected results for a test).
  • Using any code available on the internet/web or any other source. For example, using code from Sourceforge.
  • Hiring any online service to complete an assignment for you.
  • You may not post the implementation of your assignments, materials related to the class (e.g., project description), or any other material associated with this course. Even if the class is over and you have graduated, you may NOT post any material.
  • Sharing your code or your student tests with any student.
  • Using online forums (other than Piazza) in order to ask for help regarding our assignments.

Additional information can be found in the sections titled "Academic Integrity" and "Code of Student Conduct" available at Course Related Policies.

Posting of your projects in a private repository where only selected people (e.g., potential employers) can see them is OK. Just make sure is not a public site.

Piazza

We will be using (Piazza) for class communication. You will not be able to register to Piazza yourself. Your instructor will register you using the e-mail you have in the school system.

Excused Absence and Academic Accommodations

See the section titled "Attendance, Absences, or Missed Assignments" available at Course Related Policies.

Disability Support Accommodations

See the section titled "Accessibility" available at Course Related Policies.

Miscellaneous

  • Please bring your laptop to your discussion (lab) session and to lecture. If you don't have a laptop, we will pair you up with a classmate.
  • As you work on a project submit your project often even if you have not finished. We monitor submit server submissions and can provide assistance based on submit server results.
  • At the end of the course visit (www.courseevalum.umd.edu) to complete your course evaluations.
  • If you are experiencing difficulties in keeping up with the academic demands of this course, you may contact the Learning Assistance Service located at 2202 Shoemaker Building.
  • UMD Course related policies can be found at http://www.ugst.umd.edu/courserelatedpolicies.html

Copyright

All course materials are copyright UMCP, Department of Computer Science © 2016. All rights reserved. Students are permitted to use course materials for their own personal use only. Course materials may not be distributed publicly or provided to others (excepting other students in the course), in any way or format.

Schedule

Course Schedule

This schedule is tentative and subject to change. Keep in mind that the slides may not include all the material discussed in lecture. You are responsible for any material we present in lecture, even if it does not appear in the posted slides.

Week Topics Slides/Code   Work   Textbook (Carrano/Henry)
CMSC132 (Secs 040x/Honors) Schedule
Week #1
(Aug 29)
Course Intro, Abstraction/Encapsulation, Enumerated Types, Comparable, Debugger CourseIntro.pdf
OOPAbstraction.pdf
OOPAbstractionCode.zip
JavaConstructsI.pdf
JavaConstructsICode.zip
Eclipse installation
E1 Out (Thu)
Appendix A, B, C
Week #2
(Sep 5)
Inheritance InheritanceOne.pdf
InheritanceCode.zip
InheritanceTwo.pdf
InheritanceTwoCode.zip
Quiz (Wed)
E1 Due (Thu)
Appendix D, Java Interlude 7
Week #3
(Sep 12)
Inheritance, Abstract Classes, Testing, Correctness, Exceptions, Comparator Interface (Lab), Inner Classes InheritanceThree.pdf
InheritanceThreeCode.zip
TestingCorrectness.pdf
Exceptions.pdf
ExceptionsCode.zip
P1 Out (Mon)
Quiz (Wed)
Java Interlude 2, 5
Week #4
(Sep 19)
Inner Classes, OO Design Intro Levels of Copying, Cloning, Constructor/Destructor, Initialization Blocks InnerClasses.pdf
InnerClassesCode.zip
OODesign.pdf
JavaConstructsII.pdf
JavaConstructsIICode.zip
P1 Due (Tue)
P2 Out (Tue) Quiz (Debugging) (Wed)
Prelude, Java Interlude 6, 9
Week #5
(Sep 26)
Event-Driven Programming, GUI, UML (Lab), JavaFX, Lambda Expressions GUI.pdf
GUICode.zip
Midterm #1 (Wed)
P2 Due (Thu)
P3 Out (Fri)
Week #6
(Oct 3)
Algorithmic Complexity, Dynamic System/State Design Pattern (Lab), Iterator/Marker/Observer Design Patterns (Lab), Generic Programming, Collections, Linear Data Structures AlgorithmicComplexityI.pdf
Generics.pdf
GenericsCode.zip
Collections.pdf
LinearDataStructures.pdf
LinearDataStructuresCode.zip
P3 Due (Fri)
Chapter 4, Java Interlude 1, 3, 8
Week #7
(Oct 10)
Linear Data Structures, Recursive Algorithms, Memory Maps RecursiveAlgorithms.pdf
RecursiveAlgorithmsCode.zip
P4 Out (Wed)
Early Warning Grades(Oct 13)
Chapters 3, 6, 7, 12, 13, 14, 15, 16, 17
Week #8
(Oct 17)
Hashing, Sets/Maps, Simplified List Implementation, File I/O Hashing.pdf
HashingCode.zip
SetsMaps.pdf
SetsMapsCode.zip
JavaIO.pdf
JavaIOCode.zip
P4 Due (Fri)
P5 Out (Fri)
Chapters 21, 22, Appendix E
Week #9
(Oct 24)
Trees, Algorithmic Complexity II, Heaps/Priority Queues Network Basics (Lab) Trees.pdf
LectureBinaryTreeCode.zip
AlgorithmicComplexityII.pdf
HeapsPriorityQueues.pdf
Quiz (Wed)
Chapters 23, 24, 25, 26
Week #10
(Oct 31)
Polymorphic Lists/Trees PolymorphicListsTrees.pdf
PolymorphicListsTreesCode.zip
P5 Due (Wed)
Midterm #2 (Fri)
Week #11
(Nov 7)
Trees, Threads ThreadsI.pdf
ThreadsICode.zip
ThreadsII.pdf
ThreadsIICode.zip
P6 Out (Mon)
Week #12
(Nov 14)
Synchronization I/II, Graphs Intro/Graph Traversals SynchronizationI.pdf
SynchronizationICode.zip
SynchronizationII.pdf
SynchronizationIICode.zip
GraphsTraversal.pdf
P6 Due (Wed)
P7 Out (Wed)
Chapters 28, 29
Week #13
(Nov 21)
Dijkstras, Thanksgiving (no class Wed, Fri) DijkstrasAlgorithm.pdf
DijkstrasExample.pdf
PriorityQueueCode.zip
Thanksgiving
Week #14
(Nov 28)
Graph Implementation (Lab), Effective Java (Lab), Sorting GraphImplementation.pdf
EffectiveJava.pdf
Sorting.pdf
P7 Due (Tue)
Midterm #3 (Wed)
P8 Out (Wed)
Chapters 8, 9
Week #15
(Dec 5)
Algorithm Strategies, Advanced Tree Structures (Lab), Software Life Cycle, Software Process Models, Problem Specification & Design, Testing AlgorithmStrategies.pdf
AdvancedTreeStructures.pdf
SoftwareDevelopmentSEI.pdf
SoftwareProcessModelsSEII.pdf
ProbSpecificationSoftArchSEIII.pdf
ProgramTestingSEIV.pdf
P8 Due (Fri)
Course Evaluations

Chapter 27
Week #16
(Dec 12)
Final Exam Review Last Day of Classes (Mon Dec 12)
Final Exam
(Thu Dec 15, 4pm - 6pm)

Staff

Coordinator

Name Nelson Padua-Perez
Office AVW 1203
Office Hours Mon, Wed → 1:30 pm - 3:30 pm
E-Mail nelson [AT] cs [DOT] umd [DOT] edu

Office Hours Information

Please see Office Hours Guidelines. Also, please be aware of the TA room usage policy.

All TA office hours take place in AVW 1112.


Teaching Assistants

Name E-mail Pic
Saurabh Kumar kumarsa [AT] cs.umd [DOT] edu TAImage
Ladan Najafizadeh ladann [AT] cs.umd [DOT] edu TAImage
Andrej Rasevic arasevic [AT] terpmail.umd [DOT] edu TAImage
Travis White twhite6 [AT] terpmail.umd [DOT] edu TAImage
Roozbeh Yousefzadeh roozbeh [AT] cs.umd [DOT] edu TAImage

Office Hours

Coordinator

Name Nelson Padua-Perez
Office AVW 1203
Office Hours Mon, Wed → 1:30 pm - 3:30 pm
E-Mail nelson [AT] cs [DOT] umd [DOT] edu

Office Hours Information

Please see Office Hours Guidelines. Also, please be aware of the TA room usage policy.

All TA office hours take place in AVW 1112.


Teaching Assistants

Name E-mail Pic
Saurabh Kumar kumarsa [AT] cs.umd [DOT] edu TAImage
Ladan Najafizadeh ladann [AT] cs.umd [DOT] edu TAImage
Andrej Rasevic arasevic [AT] terpmail.umd [DOT] edu TAImage
Travis White twhite6 [AT] terpmail.umd [DOT] edu TAImage
Roozbeh Yousefzadeh roozbeh [AT] cs.umd [DOT] edu TAImage

Lectures

Course Schedule

This schedule is tentative and subject to change. Keep in mind that the slides may not include all the material discussed in lecture. You are responsible for any material we present in lecture, even if it does not appear in the posted slides.

Week Topics Slides/Code   Work   Textbook (Carrano/Henry)
CMSC132 (Secs 040x/Honors) Schedule
Week #1
(Aug 29)
Course Intro, Abstraction/Encapsulation, Enumerated Types, Comparable, Debugger CourseIntro.pdf
OOPAbstraction.pdf
OOPAbstractionCode.zip
JavaConstructsI.pdf
JavaConstructsICode.zip
Eclipse installation
E1 Out (Thu)
Appendix A, B, C
Week #2
(Sep 5)
Inheritance InheritanceOne.pdf
InheritanceCode.zip
InheritanceTwo.pdf
InheritanceTwoCode.zip
Quiz (Wed)
E1 Due (Thu)
Appendix D, Java Interlude 7
Week #3
(Sep 12)
Inheritance, Abstract Classes, Testing, Correctness, Exceptions, Comparator Interface (Lab), Inner Classes InheritanceThree.pdf
InheritanceThreeCode.zip
TestingCorrectness.pdf
Exceptions.pdf
ExceptionsCode.zip
P1 Out (Mon)
Quiz (Wed)
Java Interlude 2, 5
Week #4
(Sep 19)
Inner Classes, OO Design Intro Levels of Copying, Cloning, Constructor/Destructor, Initialization Blocks InnerClasses.pdf
InnerClassesCode.zip
OODesign.pdf
JavaConstructsII.pdf
JavaConstructsIICode.zip
P1 Due (Tue)
P2 Out (Tue) Quiz (Debugging) (Wed)
Prelude, Java Interlude 6, 9
Week #5
(Sep 26)
Event-Driven Programming, GUI, UML (Lab), JavaFX, Lambda Expressions GUI.pdf
GUICode.zip
Midterm #1 (Wed)
P2 Due (Thu)
P3 Out (Fri)
Week #6
(Oct 3)
Algorithmic Complexity, Dynamic System/State Design Pattern (Lab), Iterator/Marker/Observer Design Patterns (Lab), Generic Programming, Collections, Linear Data Structures AlgorithmicComplexityI.pdf
Generics.pdf
GenericsCode.zip
Collections.pdf
LinearDataStructures.pdf
LinearDataStructuresCode.zip
P3 Due (Fri)
Chapter 4, Java Interlude 1, 3, 8
Week #7
(Oct 10)
Linear Data Structures, Recursive Algorithms, Memory Maps RecursiveAlgorithms.pdf
RecursiveAlgorithmsCode.zip
P4 Out (Wed)
Early Warning Grades(Oct 13)
Chapters 3, 6, 7, 12, 13, 14, 15, 16, 17
Week #8
(Oct 17)
Hashing, Sets/Maps, Simplified List Implementation, File I/O Hashing.pdf
HashingCode.zip
SetsMaps.pdf
SetsMapsCode.zip
JavaIO.pdf
JavaIOCode.zip
P4 Due (Fri)
P5 Out (Fri)
Chapters 21, 22, Appendix E
Week #9
(Oct 24)
Trees, Algorithmic Complexity II, Heaps/Priority Queues Network Basics (Lab) Trees.pdf
LectureBinaryTreeCode.zip
AlgorithmicComplexityII.pdf
HeapsPriorityQueues.pdf
Quiz (Wed)
Chapters 23, 24, 25, 26
Week #10
(Oct 31)
Polymorphic Lists/Trees PolymorphicListsTrees.pdf
PolymorphicListsTreesCode.zip
P5 Due (Wed)
Midterm #2 (Fri)
Week #11
(Nov 7)
Trees, Threads ThreadsI.pdf
ThreadsICode.zip
ThreadsII.pdf
ThreadsIICode.zip
P6 Out (Mon)
Week #12
(Nov 14)
Synchronization I/II, Graphs Intro/Graph Traversals SynchronizationI.pdf
SynchronizationICode.zip
SynchronizationII.pdf
SynchronizationIICode.zip
GraphsTraversal.pdf
P6 Due (Wed)
P7 Out (Wed)
Chapters 28, 29
Week #13
(Nov 21)
Dijkstras, Thanksgiving (no class Wed, Fri) DijkstrasAlgorithm.pdf
DijkstrasExample.pdf
PriorityQueueCode.zip
Thanksgiving
Week #14
(Nov 28)
Graph Implementation (Lab), Effective Java (Lab), Sorting GraphImplementation.pdf
EffectiveJava.pdf
Sorting.pdf
P7 Due (Tue)
Midterm #3 (Wed)
P8 Out (Wed)
Chapters 8, 9
Week #15
(Dec 5)
Algorithm Strategies, Advanced Tree Structures (Lab), Software Life Cycle, Software Process Models, Problem Specification & Design, Testing AlgorithmStrategies.pdf
AdvancedTreeStructures.pdf
SoftwareDevelopmentSEI.pdf
SoftwareProcessModelsSEII.pdf
ProbSpecificationSoftArchSEIII.pdf
ProgramTestingSEIV.pdf
P8 Due (Fri)
Course Evaluations

Chapter 27
Week #16
(Dec 12)
Final Exam Review Last Day of Classes (Mon Dec 12)
Final Exam
(Thu Dec 15, 4pm - 6pm)
Grades Server Submit Server

Good Faith Attempt

Good Faith Attempt Deadlines

You must satisfy a minimum set of requirements for each project (Good Faith Attempt) otherwise you will not pass the course (automatic grade of F). Each project defines its own good faith attempt criteria. Notice that you will not receive extra points for completing the good faith attempt. The grade you obtain in the project will be based on your ontime/late submission.

        Project / ExerciseGood Faith Attempt   Deadline   
Exercise #1 Public TestsThu Sep 15
Project #1 Public TestsThu Sep 29
Debugging Quiz See Teaching TAMon Oct 3
Project #2 (ClearCellGame)Public Tests Tue Oct 11
Project #3 (Interest Table)NoneNone
Project #4 (Linked Lists)Release tests score of at least 10 ptsFri Oct 28
Project #5 (OnlineTest)6 Public TestsMon Nov 14
Project #6 (BST) Public TestsTue Nov 22
Project #7 (OrdersProcesor) Public TestsMon Dec 5
Project #8 (Graphs) Public TestsTue Dec 13

Grading Concerns

Regrades Deadlines

After any class material is graded, you have a period to address any grading concerns. Unfortunately we will not be able to address any grading concerns after the specified deadline.

Class MaterialGrading Concerns Deadline
Project #1 (Part a)Tue Sep 27
Exercise #1Tue Sep 27
Quiz #1/#2Tue Sep 27
TimeLabThu Sep 29
Project #2 (Part a)Wed Oct 5
Project #1Mon Oct 10
Midterm #1Wed Oct 19
Project #2 (ClearCellGame)Wed Oct 19
Exercise #2Thu Oct 20
Project #3 (Interest Table)Mon Oct 31
Quiz #4Wed Nov 9
Exercise #3 (Scientific Calculator)Wed Nov 16
Project #4 (LinkedLists)Tue Nov 29
Midterm #2Fri Dec 2
Project #5 (Online Test)Wed Dec 7
Project #6 (BST)Fri Dec 9
Midterm #3Mon Dec 12
Project #7/#8Tue Dec 12

Assignments

Projects

Projects/Exercises

The planned dates when projects/exercises will be handed out and due is given in the course schedule. Beware that the exact dates are subject to change, but we will try to give you fair notice of any changes.

Project/exercise descriptions can be found at Project/Exercise Descriptions.

Quizzes

Quizzes

A few days prior to each quiz we plan to post a worksheet on this page. The dates for the quizzes are given in the course schedule. Beware that the exact dates are subject to change, but we will try to give you fair notice of any changes.

Worksheets are not turned in and they are not graded. The problems on the worksheet are for your own benefit and are designed to prepare you for the quiz. We will not be giving answers to the worksheet problems, but if you have a question you can talk to the course TA(s).

WorksheetQuiz Date
Worksheet #1Wed Sep 7
Worksheet #2Wed Sep 14
Debugging QuizWed Sep 21
Worksheet #4Wed Oct 26

Exams

Exams

This page provides information regarding course exams.

ExamDate
Midterm IWed Sep 28
Midterm IIFri Nov 4
Midterm IIIWed Nov 30
FinalThu Dec 15

Resources

Links

Links

Piazza

Piazza

We will be using (Piazza) for class communication. Regarding Piazza:

  • We will use Piazza to communicate in lecture and to provide class announcements.
  • Posting of code is not allowed is Piazza. Anyone posting any kind of code may receive an XF in the course. Please carefully read the Piazza Guidelines.
  • In Piazza you can see the class announcements by selecting "Resources", "Course Information".
  • When we post an announcement we will select the Piazza option that allows you to receive an immediate e-mail. The e-mail will have a subject line that starts with "[Instr Note]." If you are filtering piazza messages make sure that those messages are not placed in the junk folder.
  • You are responsible for checking class announcements.
  • The prefered mechanism to address course questions (projects, lecture material, etc.) is during office hours, in lab, and lecture.
  • Students' questions can only be answered by CS staff (TAs and instructors). Although we will try to check Piazza often, there is no guarantee we will respond to messages immediately.
  • You will not be able to register to Piazza yourself. Your instructor will register you using the e-mail you have in the school system.. If you would like to use a different e-mail address see your teaching TA in lab.
  • If you access the link provided for Piazza on the class web page and it asks for an access code, try the following:
    • Visit http://www.piazza.com
    • Click "log in" on the top right
    • Click "forgot password"
    • Enter the e-mail address registered to piazza (e-mail address registered with the school).
    • Access your e-mail account to receive a link that will bring you to the registration site.

Introduction

Object-Oriented Programming II is a second programming course for Computer Science majors with a focus on object-oriented programming. The goal of the course is to develop skills such as program design and testing as well as the implementation of programs using a graphical IDE. All programming will be done in Java.  

Coordinators

Nelson Padua-Perez

@2016 University of Maryland College Park, MD 20742

Web Accessibility