CMSC131

Class

Syllabus

Introduction

This is the first 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

Corequisite → MATH 140
Credits → 4

Course Coordinator

Name Office
Nelson Padua-Perez AVW 1203

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

Textbooks

Title Authors ISBN Type
Java Foundations, Third Edition Lewis 9780133370461 Recommended
(You don't need to buy it)

Course Topics (Subject to Change)

  • Intro to Computer Systems
  • Programming Basics: Variables, Operators, Expressions, Statements, Methods
  • Java Text Input/Output
  • Conditionals
  • Loops
  • Principles of Object Oriented Programming
  • Basics of Program Design
  • Testing and Debugging
  • Java Memory Map
  • Arrays and Java ArrayLists
  • Java interfaces
  • Inheritance Overview
  • Recursion

Grading

Final grades will be computed according the following weights:

26% Projects
3% In-lecture Exercises
15% Quizzes, Exercises, Lab Work
28% Midterms(2), (12% and 16%)
28% 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 8 pm on the specified day in the project description. You have until 8 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, even though you still need to satisfy the good faith attempt (see information below). For example, if a project is due on Wednesday at 8 pm, you have until Thursday at 8 pm to submit a late project with a 12% penalty. Any submission after Thursday 8 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.). Notice that we use the submit server results to compute a significant portion of your project's grade. You need to 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.

Regarding Online Posting of Project Implementations

  • 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.
  • 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.
  • Even if the course is over, do not make your code publicly available to others.
  • Notice we constantly monitor online sources.

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.

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.

Computer Science Department Academic Integrity Information

The CS Department takes academic integrity seriously. Information on how the CS Department views and handles academic integrity matters can be found at Academic Integrity.

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.
  • 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.

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 © 2017. 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/Column   Work  
CMSC131 Schedule
Week #1
(Aug 28)
Course Intro, Computer Systems, Software Tools, Object-Oriented Teminology, Rules for Java Identifiers, Assignment, Primitive Types, Simple Output Course-Intro.pdf
CompOrgEclipseIntro.pdf
JavaIntro.pdf
JavaVariablesTypes.pdf
JavaVariablesTypesCode.zip
P1 Out (Fri)
Week #2
(Sep 4)
Strings, Operators, Comparison, Input (Scanner), Conditionals, Logical Operators Block Statements, Style, Symbolic Constants StringCompScanner.pdf
StringCompScannerCode.zip
CondBlockStmtStyle.pdf
CondBlockStmtStyleCode.zip
P1 Due (Thu)
Week #3
(Sep 11)
Loops (while/do while), Input (JOptionPane), Loops (for), Nesting of Loops, Assignment Operators LoopsWhileDoWhile.pdf
LoopsWhileDoWhileCode.zip
ForNestedLoops.pdf
ForNestedLoopsCode.zip
Q1 (Wed)
P2 Out (Mon)
Week #4
(Sep 18)
Precedence Rules, Short-circuiting, Static Methods, Intro to Design, Intro to Classes PrecAssocStaticMethods.pdf
PrecAssocStaticMethodsCode.zip
ClassesIntroI.pdf
ClassesIntroICode.zip
Design.pdf
FlagMakerLecture.java
Q2 (Wed)
P2 Due (Thu)
P3 Out (Thu)
Week #5
(Sep 25)
Memory Organization (stack/heap), equals method, Class/Method Declaration, Parameter Passing, Static vs. Non-Static methods, Constructors ClassesIntroII.pdf
ClassesIntroIII.pdf
ClassesIntroIIICode.zip
ClassesIntroIV.pdf
ClassesIntroIVCode.zip
Week #6
(Oct 2)
Access Specifiers, Get/Set/equals/toString methods, Current Object (this) ClassesIntroV.pdf
ClassesIntroVCode.zip
ClassesIntroVI.pdf
ClassesIntroVICode.zip
P3 Due (Mon)
Midterm #1 (Wed)
P4 Out (Thu)
Week #7
(Oct 9)
Call Stack, Memory Maps, Copy Constructor, Visibility, Encapsulation MemMapsPassingValues.pdf
MemMapsPassingValuesCode.zip
CopyConstructorsThisRef.pdf
CopyConstructorsThisRefCode.zip
MathBreakContinue.pdf
MathBreakContinueCode.zip
Mid-Term Grades (Thu, Oct 12)
P4 Due (Fri)
Week #8
(Oct 16)
Switch statement, Round-off Errors, Java Packages/libraries, Exception Handling, Mutability, StringBuffer SwitchLibraries.pdf
SwitchLibrariesCode.zip
ExceptionsI.pdf
ExceptionsICode.zip
ExceptionsII.pdf
ExceptionsIICode.zip
Q3 (Wed)
P5 Out (Thu)
Week #9
(Oct 23)
Arrays Intro, Eclipse Debugger, Testing ArraysIntro.pdf
ArraysIntroCode.zip
TestingDebugging.pdf
TestingDebuggingCode.zip
Week #10
(Oct 30)
Arrays Cont., Privacy Leaks, Copying Objects Q4 (Mon)
P5 Due (Thu)
Week #11
(Nov 6)
Two-Dimensional Arrays Midterm #2 (Wed)
P6 Out (Wed)
Week #12
(Nov 13)
Wrappers(lab), Stack(lab), Method Overloading (lab), ArrayList Interfaces, Intro Polymorphism, Inheritance, Iterators, MVC, Overriding P6 Due (Fri)
P7 Out (Thu)
Week #13
(Nov 20)
Object Class, Early/Late Binding, Recursion Q5 (Mon)
Thanksgiving
Week #14
(Nov 27)
Recursion, equals method, Uses of Interfaces, Command Line Arguments, jar files P8 Out (Mon)
P7 Due (Tue)
Week #15
(Dec 4)
Sorting/Algorithm Analysis, Miscellaneous, Review P8 Due (Wed)
Week #15
(Dec 11)
Final Exam Review Last Day of Classes (Mon Dec 11)

Final Exam
(Thu Dec 14
4pm - 6pm)

Staff

Coordinator

Name Nelson Padua-Perez
Office AVW 1203
Office Hours Mon, Wed → 4 pm - 5: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
Swati Singhal swati [AT] cs.umd [DOT] edu TAImage
Khanh Nguyen kqn28 [AT] terpmail.umd [DOT] edu TAImage
Sandra Sandeep sandrasandeep01 [AT] gmail [DOT] com TAImage
Angel Wen angel.m.wen [AT] gmail [DOT] com TAImage

Tutors

This class is supported by the new Academic Peer Mentoring Program (AMP). Tutors are former cmsc131 students that will help you with the course. Keep in mind they will not be able to address grading concerns. Tutors will hold tutoring hours in the TA room. Additional information about this program can be found at http://tltc.umd.edu/amp.

Name E-mail Pic Hours
Alec Manabat alecmanabat1 [AT] gmail [DOT] com TAImage Wed 12:15pm - 1:45pm
Benjamin Walton bwalton9 [AT] terpmail.umd [DOT] edu TAImage Wed 3:30pm - 5:00pm
Adam Elaoud aelaoud [AT] terpmail.umd [DOT] edu TAImage Mon 10:30am - 1:30pm

Office Hours

Coordinator

Name Nelson Padua-Perez
Office AVW 1203
Office Hours Mon, Wed → 4 pm - 5: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
Swati Singhal swati [AT] cs.umd [DOT] edu TAImage
Khanh Nguyen kqn28 [AT] terpmail.umd [DOT] edu TAImage
Sandra Sandeep sandrasandeep01 [AT] gmail [DOT] com TAImage
Angel Wen angel.m.wen [AT] gmail [DOT] com TAImage

Tutors

This class is supported by the new Academic Peer Mentoring Program (AMP). Tutors are former cmsc131 students that will help you with the course. Keep in mind they will not be able to address grading concerns. Tutors will hold tutoring hours in the TA room. Additional information about this program can be found at http://tltc.umd.edu/amp.

Name E-mail Pic Hours
Alec Manabat alecmanabat1 [AT] gmail [DOT] com TAImage Wed 12:15pm - 1:45pm
Benjamin Walton bwalton9 [AT] terpmail.umd [DOT] edu TAImage Wed 3:30pm - 5:00pm
Adam Elaoud aelaoud [AT] terpmail.umd [DOT] edu TAImage Mon 10:30am - 1:30pm

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/Column   Work  
CMSC131 Schedule
Week #1
(Aug 28)
Course Intro, Computer Systems, Software Tools, Object-Oriented Teminology, Rules for Java Identifiers, Assignment, Primitive Types, Simple Output Course-Intro.pdf
CompOrgEclipseIntro.pdf
JavaIntro.pdf
JavaVariablesTypes.pdf
JavaVariablesTypesCode.zip
P1 Out (Fri)
Week #2
(Sep 4)
Strings, Operators, Comparison, Input (Scanner), Conditionals, Logical Operators Block Statements, Style, Symbolic Constants StringCompScanner.pdf
StringCompScannerCode.zip
CondBlockStmtStyle.pdf
CondBlockStmtStyleCode.zip
P1 Due (Thu)
Week #3
(Sep 11)
Loops (while/do while), Input (JOptionPane), Loops (for), Nesting of Loops, Assignment Operators LoopsWhileDoWhile.pdf
LoopsWhileDoWhileCode.zip
ForNestedLoops.pdf
ForNestedLoopsCode.zip
Q1 (Wed)
P2 Out (Mon)
Week #4
(Sep 18)
Precedence Rules, Short-circuiting, Static Methods, Intro to Design, Intro to Classes PrecAssocStaticMethods.pdf
PrecAssocStaticMethodsCode.zip
ClassesIntroI.pdf
ClassesIntroICode.zip
Design.pdf
FlagMakerLecture.java
Q2 (Wed)
P2 Due (Thu)
P3 Out (Thu)
Week #5
(Sep 25)
Memory Organization (stack/heap), equals method, Class/Method Declaration, Parameter Passing, Static vs. Non-Static methods, Constructors ClassesIntroII.pdf
ClassesIntroIII.pdf
ClassesIntroIIICode.zip
ClassesIntroIV.pdf
ClassesIntroIVCode.zip
Week #6
(Oct 2)
Access Specifiers, Get/Set/equals/toString methods, Current Object (this) ClassesIntroV.pdf
ClassesIntroVCode.zip
ClassesIntroVI.pdf
ClassesIntroVICode.zip
P3 Due (Mon)
Midterm #1 (Wed)
P4 Out (Thu)
Week #7
(Oct 9)
Call Stack, Memory Maps, Copy Constructor, Visibility, Encapsulation MemMapsPassingValues.pdf
MemMapsPassingValuesCode.zip
CopyConstructorsThisRef.pdf
CopyConstructorsThisRefCode.zip
MathBreakContinue.pdf
MathBreakContinueCode.zip
Mid-Term Grades (Thu, Oct 12)
P4 Due (Fri)
Week #8
(Oct 16)
Switch statement, Round-off Errors, Java Packages/libraries, Exception Handling, Mutability, StringBuffer SwitchLibraries.pdf
SwitchLibrariesCode.zip
ExceptionsI.pdf
ExceptionsICode.zip
ExceptionsII.pdf
ExceptionsIICode.zip
Q3 (Wed)
P5 Out (Thu)
Week #9
(Oct 23)
Arrays Intro, Eclipse Debugger, Testing ArraysIntro.pdf
ArraysIntroCode.zip
TestingDebugging.pdf
TestingDebuggingCode.zip
Week #10
(Oct 30)
Arrays Cont., Privacy Leaks, Copying Objects Q4 (Mon)
P5 Due (Thu)
Week #11
(Nov 6)
Two-Dimensional Arrays Midterm #2 (Wed)
P6 Out (Wed)
Week #12
(Nov 13)
Wrappers(lab), Stack(lab), Method Overloading (lab), ArrayList Interfaces, Intro Polymorphism, Inheritance, Iterators, MVC, Overriding P6 Due (Fri)
P7 Out (Thu)
Week #13
(Nov 20)
Object Class, Early/Late Binding, Recursion Q5 (Mon)
Thanksgiving
Week #14
(Nov 27)
Recursion, equals method, Uses of Interfaces, Command Line Arguments, jar files P8 Out (Mon)
P7 Due (Tue)
Week #15
(Dec 4)
Sorting/Algorithm Analysis, Miscellaneous, Review P8 Due (Wed)
Week #15
(Dec 11)
Final Exam Review Last Day of Classes (Mon Dec 11)

Final Exam
(Thu Dec 14
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   
Project #3 (Flags of the World)Public TestsTue, Oct 31
Project #4 (Name Class)Public TestsTue, Oct 31

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 #1Thu Sep 14
Quiz #1Thu Sep 28
Quiz #2Thu Oct 12
Project #3aThu Oct 5
Project #2Wed Oct 11
Midterm #1Thu Oct 19
Project #4aTue Oct 17
Project #3Wed Oct 25

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 (except pop quizzes) 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 13
Worksheet #2Wed Sep 20
Worksheet #3Wed Oct 18

Exercises

Exercises

The planned dates when 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.

Exams

Exams

This page provides information regarding course exams.

ExamDate
Midterm IWed Oct 4

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.

Lecture Videos

Lecture Videos

Note: In Panopto you can reduce the time you spend watching a video with some of the speed options.

Introduction

The goal of the course is to convey the fundamental concepts that enable programs to execute on real hardware. Those concepts include how the operating system virtualizes the hardware to provide basic services and abstractions to enable a user program to effectively use the available hardware resources. The course also addresses how different programming constructs and idioms work.

The basic abstraction of a program running as one or more threads of control in a single flat address space (a Unix process) is the key to the course. Emphasizing that abstraction as the underlying model for understanding how a program works, from both the user program and hardware perspective (with the OS in between), run as a theme through all topics in the course. Examples include C pointers (to data and functions), function calls and runtime stack management, dynamic memory management in the heap, and the fork/exec system calls.

Coordinator

Nelson Padua-Perez

@2017 University of Maryland College Park, MD 20742