COMP 1900 CS 1: Introduction to Computer Science Fall 2015

Bill Baggett, PhD

Contact Information:
Office: Dunn Hall 390

Department Office: Dunn Hall 375

Office Phone: 901.678.3044

Department Phone: 901.678.5465

Email: wbaggett@memphis.edu
The best way to get in touch with me is through email I will try to respond within 24 hours.

Office Hours:
F

9:00 am 12:00 pm

Dunn Hall 390

Lecture Meeting Times/Locations:

MW

5:30 pm-6:55 pm

DH 129

Lab Meeting Times/Locations:

You must sign up for the lab accompanying this course. There are 6 total sections. All labs meet in Dunn Hall 230.

Catalog Description:
COMP 1900 CS 1: Introduction to Computer Science (4) Overview of computer science as a field; problem-solving strategies
with emphasis in fundamental programming skills, primitive data types, control structures, arrays, strings, I/O, basic recursion,
documentation, testing and debugging techniques; introduction to object-oriented concepts. Three lecture hours, two laboratory hours
per week. PREREQUISITE or COREQUISITE: MATH 1910 or MATH 1421 (or MATH 1830 for COMP minors)

Course Website:
Everything (lecture notes, assignments, code written in class, grades, etc.) will be posted to the eCourseware system at
https://elearn.memphis.edu.

Required Text:
Ralph Bravaco and Shai Simonson, Java Programming: From the Ground Up, McGraw-Hill, 2010. ISBN-13: 978-0073523354

Evaluation:
9 Lab Assignments
2 Projects
4 Quizzes
2 Exams
Final Exam (Comprehensive)

225 pts.
200 pts.
100 pts.
300 pts.
225 pts.

(25 pts. each)

(100 pts. each)
(25 pts. each)
(150 pts. each)

Final grade: add up your point total and divide by 1000. Note that the highest possible percentage grade is 105% since the points add
up to 1050.

Grading Scale: Letter grades will be determined as follows:

A+: 96% and above; A: 90-95%
B+: 87-89%; B: 81-86%; B-: 79-80%
C+: 77-78%; C: 71-76%; C-: 69-70%
D+: 67-68%; D: 60-66%
F: Below 60%

Assignments:
Labs meet in Dunn Hall 230. Please attend the lab section for which you registered. Do not swap lab sections from week to week.
Lab assignments will usually consist of two parts: an in-lab assignment and a post-lab ("lab homework"). The in-lab part will be
handed out during lab hours and should be worked on during those hours. You should turn in this part to your lab TA before leaving
lab for the day. The post-lab will be handed out at the end of lab hours. You should complete this part on your own and turn it in to
your lab TA by the beginning of the following weeks lab session even if the lab does not meet that week.
In addition to the lab assignments, there will be two larger programming projects throughout the semester. As you have plenty of
time to work on each one, it is MANDATORY that your project submissions successfully compile and run. A project submission that
does not compile/run will receive zero credit.

Attendance:
It is crucial that you attend class (both lecture and lab) regularly, especially if this is your first experience with computer
programming. The class will keep building on itself and moves at a fairly brisk pace, so you need to get a good handle on each
concept soon after we discuss it.

Email:
Please check your University of Memphis email account at least once a day, as that is my primary means of communicating with you
outside of class.

Late/Makeup Policy:
All assignments are expected to be completed and turned in on schedule. Due dates will be clearly indicated for each assignment.
Late assignments are NOT accepted except in extreme circumstances. Likewise, makeup quizzes and exams will be given only under
extreme circumstances. If you feel that your circumstances warrant a late work submission or a makeup quiz/exam, get in touch with
me as soon as possible. Be prepared to show some kind of documented proof of your situation.

Plagiarism/Cheating Policy:
An essential part of learning how to program is getting plenty of practice with it yourself. As such, all assignments for this class
(unless specifically indicated otherwise) are expected to be individual efforts. If I determine that you have copied something directly
from a book, the Internet, or some other source, you will receive a failing grade on the assignment and (at my discretion) a failing
grade in the course. If I determine that you have copied another students assignment, this will happen to both you and the person
from whom you copied. The incident may also be forwarded to the Office of Student Conduct for further disciplinary action. Please
dont put me in this situation.

Getting Help:
Although I expect your work for this class to be done individually, I encourage you to seek help if you get stuck:

Come talk to me! Im very willing to sit down and try to provide hints without giving away the solution.
Contact your lab TA.
The Computer Science Learning Center (Dunn Hall 208) will be open throughout the semester. Hours will be posted on the
door. The hours for fall should also be posted online soon. You can go to memphis.edu and search for Computer Science
Learning Center. Or you can go to memphis.edu/cs/ and click on Student Resources and then click on Computer Science
Learning Center. The lab will be staffed by computer science graduate students whom you can ask for help.

Student Disabilities:
If you have a disability that may require assistance or accommodations, or if you have any questions related to any accommodation for
testing, note taking, reading, etc., please speak with me as soon as possible. You must contact the Student Disability Services Office
(678-2880) to officially request such accommodations / services.

Tentative Course Schedule:

Date
8/24
8/26
8/31
9/2
9/7
9/9
9/14
9/16
9/21
9/23
9/28
9/30
10/5
10/7
10/12
10/14
10/19
10/21
10/26
10/28
11/2
11/4
11/9
11/11
11/16
11/18
11/23
11/25
11/30
12/2

Lecture Material
Course intro / binary numbers
First Java program
Expressions and data types
Variables, assignment, and program input
Labor Day No Class
Conditionals (if, if-else)
Conditionals (if-else if, switch)
Problem Day
Loops (while, do-while)
Loops (for)
Loops (nested)
Problem Day / Review for exam
EXAM ONE
Predefined methods
Fall Break - No Class
Writing your own methods
Method overloading / Problem Day
Arrays: basic syntax and usage
2-D arrays
Problem Day
Introduction to recursion
Recursion, continued
Problem Day / Review for exam
EXAM TWO
Objects and classes
Writing your own classes
Objects and classes, continued
Thanksgiving Holiday No Class
Writing your own classes, continued
Problem Day / Review for final

Text
Ch. 1
Ch. 2.1-2.2
Ch. 2.3-2.4
Ch. 3

Projects

Quizzes

Ch. 4.1-4.3.2
Ch. 4.3.3-4.5
Quiz 1 (9/16)
Ch. 5.1-5.4
Ch. 5.5
Ch. 5.6-5.8

Lab 1: Binary numbers,

Basic Java Programs
Lab 2: Expressions and
Data Types
Lab 3: Variables and
Conditionals
NO LAB

Proj. 1
Quiz 2 (9/28)

Lab 4: Loops
NO LAB

6.1-6.2
Lab 5: Methods
6.3
6.4
7.1-7.6
7.9

Lab 6: Arrays
Quiz 3 (10/21)
Proj. 2

8.1-8.3
8.4-8.7

Lab 7: 2D Arrays
Quiz 4 (11/2)

Lab 8: Recursion
NO LAB

9.1-9.4
10.1-10.4
9.5-9.9

Lab 9: OOP Concepts

10.5-10.10

NO LAB

FINAL EXAM: Wednesday, December 9th, 5:30 - 7:30p

(same classroom as lecture)
Tentative Quiz and Exam Topics:

Labs
NO LAB

Quiz 1: Binary numbers, expressions, data types, variables, program input

Quiz 2: Conditionals, basic while and do-while loops
Exam 1: Chapters 1-5
Quiz 3: Methods
Quiz 4: Arrays
Exam 2: Chapters 6-8
Final Exam: Cumulative

NO LAB