Basics

Class time: 9:30-10:30 am T-Th, Room B213 Main Street Section 4 Lab times: 10:10-12:05 am W-F, Room 1D11 Swearingen Section 5 Lab times: 12:20-2:15 pm W-F, Room 1D11 Swearingen Section 6 Lab times: 2:30-4:25 pm W-F, Room 1D11 Swearingen Office hours: 8:30-9:30am T-Th This URL My home page Teaching assistants: Jordan Cardwell (cardwelm), Bin Ni (nib), Stephanie Zierke (zierke), all in domain cse.sc.edu) Section 4: Zierke (lead) and Ni Section 5: Cardwell (lead) and Zierke Section 6: Ni (lead) and Cardwell

Caveat This page will be changing throughout the semester.

Rules for this course You are expected to read this website carefully. You are expected to know who I am, how to get in touch with me by email, and how to find my office in person. (See the first point above.) You are expected to turn in assignments on time to the dropbox. When you turn things in to the dropbox, you should check that in fact the material has been stored as it should be. If for some reason the dropbox is not functioning, you should immediately send me an email with your assignment attached. Late assignments will be penalized. (See the first two points above.) You are expected to read your email as indicated below. You are expected to attend class. Attendance will be taken, and it will affect your grade. See below for details. NEW: The seating chart is now online.

Outline, Prerequisites, and Expectations

This course has a prerequisite of placement into MATH 141 or a grade of C or better in MATH 115.

You are responsible for checking this website on a regular basis. "Regular" means at least a couple of times each week.

You should read the material before coming to class. If we have covered all of a particular section or chapter, you should take the initiative on your own to read the next section or chapter.

Academic Support, Supplemental Instruction, and ACE

Some of you may find this course difficult. Some of you may also be enrolled in Math 141 or 142 and find that course to be difficult. If so, you are encouraged to to consult the academic support offices, including the offices that help with tutoring, supplemental instruction in CSCE 145 and MATH 141/142, and the Academic Centers for Excellence.

Also, if in fact you find this material easy, you should consider becoming a tutor or offering to work for the Academic Support people. My understanding is that they are always looking for good people in these courses. They will actually pay you money. And as anyone who has ever taught will say, you never really learn a subject until you have to teach it to someone else.

Official Syllabus

Here is the official syllabus for this course.

Email

There is a CSE department email alias for CSCE 145, namely CSCE145-004, CSCE146-005, CSCE145-006, in the domain lists.cse.sc.edu. This alias sends email to the CSE departmental login userid@cse.sc.edu that you get with this course. A mass mailing to the entire class will be done through these mail aliases. Actually, any of you can send mail to this alias.

The mail alias of the previous paragraph sends mail to the CSE departmental login that you get with this course. You are responsible for reading mail sent to this account and the engr.sc.edu account of the college's mail server.

Texts, References, and Links to Useful Information

The text for this course is Byron Weber Becker, Java: Learning to Program with Robots, Thomson Course Technology, 2007.

• The author's website for this text is here.
• Some of you may know Visual Basic already. You might be interested in Cooper's book The Visual Basic Programmer's Guide to Java.
• Some of you may know C++ already. You can find some tutorials about Java for C++ programmers by googling. Two such references are here and here.
• The college page about computing support.
• The Eclipse website.
• A page on how to install Java.
• A page on how to install Eclipse.
• A page on how to install the textbook software.
• A page on how to create a project and java class in Eclipse
• A page on How to download "becker.jar" or "becker.zip" to use the "Robots"
• A page on how to import "becker.jar" into your current Eclipse project
• A page on how to connect remotely to the college computer network.

Tests and Assignments

The mid-term exam will be on 21 February 2008. This will allow us to get back the exams during the lab sessions the next day. The last day to drop the class with a "W" grade is the following Monday 25 February.

The second mid-term exam is scheduled for 25 March 2008. The content will be up through chapter 7 together with some material from chapter 8.

Lab assignments will be short programs to be written in class. They must be turned in at the end of the lab time and will not be accepted if turned in later.

Homework assignments are longer programs to be written outside of class. They will be turned in electronically to the departmental drop box, and they must be done individually as your own work.

The exams will be closed book exams.

The final exam will be cumulative.

The homework assignments can be found here.

The lab assignments can be found here.

The final exam is scheduled for Wednesday 30 April 2008 at 2:00pm.

Grading Scheme

Lab Assignments	20%
Lab Tests (2)	10%
Homework Assignments	25%
Tests (2)	30%
Final	15%

Attendance and Grades

It has been found, and should come as no surprise to anyone, that attendance at class correlates positively with your GPA. I will draw up a seating chart. You will be required to sit in assigned seats. A TA will come in at every class to take attendance based on the seating chart. For every three (3) unexcused absences, your grade will be lowered by one full letter. The judgement as to accepting the excuse is mine. Illness, family emergencies, and such are excusable. Returning home late from spring break to avoid the traffic jam north from Daytona Beach is not an excusable absence.

Version Control

Everything we will use in this course either comes with the textbook or is free and available on the web for download. However, things are are available for download tend to change versions on a regular basis.

We do not believe there will be functionally different versions of software available during this semester, but if you download tools for your home computer it is possible that you will be downloading a different version from that which is used in the 1D15 computer lab.

For the most part, the things that will different from one version of Eclipse to another or from one version of Java to another are not things you will notice in this class.

Java versions are labelled (and no, this makes no sense) 1.3, 1.4, 5.0, and then 6.0. The key to Java is that you have at least version 5.0 or higher. As of the day before classes started, the most recent version is Update 2 to Java 6. You will notice that the Java libraries in the labs are labelled 6.0.

Similarly, we are currently running Eclipse version 3.1 in the labs. The most recent version is 3.3, available as of 25 June 2007. We take a risk-averse approach to computer labs, in that we are unlikely to install the most recent version until it's been used and tested (by someone else). I personally am running Eclipse 3.2 on my three computers (home linux, office desktop, and laptop). You will see different versions, but I cannot imagine that you'll notice any difference from one version to the next on the kind of things you'll be using in this class.

Schedule

The schedule of class topics (subject to change and adjustment) can be found here.

Deadlines

Assignments will have due dates. Unless otherwise specified, the usual deadline will be that assignments are to be sent to the drop box by midnight of the day the assignment is due, and the drop box will be closed as of midnight. Late assignments will not be accepted without prior arrangement to accommodate truly extraordinary circumstances.

No makeup quizzes will be given.

Notes and Slides

(Caveat: any lecture notes I prepare may well change during the lecture process, and if you print them too early or too often you may use up your print quota.

• Temperature conversion version 1. Temperature conversion version 2. Basic syntax things.
• Jargon terms you need to know.
• This is the first of the primality testing programs that illustrates loops with numerical programs.
• This is the second of the primality testing programs with a cleaner exit from the loop.
• This is the first of the Newton method square root programs that illustrates loops with numerical programs and the concept of "old" and "new" values that get updated inside a loop.
• This is the second of the Newton method square root programs that checks the input values so as to try to bulletproof the code against bad input.
• This is the main and the supporting class of a third and more mature version of the Newton method square root program.
• These are the main and the supporting classes for doing the Harvester program with a loop instead of hard coding, together with a supporting class for putting dots in a rectangle. You can ignore the details of this last class, because we won't get to "for" loops until a later chapter.
• This is the program that tracks the trajectory of a projectile. Once again, this has all the code in the main method for simplicity.
• This is the fourth and final version of a Newton's Method program for finding roots of functions. This has a main class, a Newton class that does the work, and a separate class of static functions.
• These are the notes on the general version of Newton's Method.
• This is the first version of the main class and the class that does the work of a loan amortization program. This program simply runs the amortization loop without regard to whether one is actually paying off the loan in the desired number of payments.
• This is the second version of the main class and the class that does the work of a loan amortization program. This version actually runs a method to compute a loan payment amount. Admittedly, the method to do this computation is somewhat mindless, in that it is iterative and does not use the math of exponential functions. But it does work and it illustrates iterative approximation. Both these programs could be improved to reduce the duplicate code and do better testing of input values.
• RandomWalker1 main. RandomWalker1 class.
• RandomWalker2 main. RandomWalker2 class.
• These are the notes on issues surrounding arithmetic on computers and in Java.
• These are the notes on formatting of output.
• TestArithmetic Main. TestArithmetic test code.
• TestArithmetic2 Main. TestArithmetic2 test code.
• TestArithmetic3 Main. TestArithmetic3 test code.
• These are the notes on issues surrounding numerical integration.
• Main. Main 2. Main 3. ComputeIntegral code. MyFunction code.
• Some notes on files.
• Main 1. Main 2. Sub2.
• Main 3. Sub 3. Utilities.
• A summary of Chapter 6 and 7 topics.
• A sample exam for midterm 2.
• ArrayList example 1: Main1. data file (same data for all these examples). file open/close utilities (same utilities for all these examples).
• ArrayList example 2: Main2. CandidateList2 class.
• ArrayList example 3: Main3. CandidateList3 class. Candidate class. (the same file is used in example 4) Fields class. (the same file is used in example 4)
• ArrayList example 4: Main4. CandidateList4 class.
• Candidates done as an Array instead of an ArrayList: Main. CandidatesArray class.
• PhoneBook done as a TreeMap example: Main. PhoneBook class. PhoneRecord class. Field definitions.
• Notes on data organization.

Academic Honesty

Assignments and examination work are expected to be the sole effort of the student submitting the work. Students are expected to follow the University of South Carolina Honor Code and should expect that every instance of a suspected violation will be reported. Students found responsible for violations of the Code will be subject to academic penalities under the Code in addition to whatever disciplinary sanctions are applied.

There seems to be a widespread misunderstanding of the concept of "your own work." In addition to the USC Code, some good sources of text for what is or is not acceptable behavior are the academic honesty policy statement from Harvey Mudd College, the policy statement from Professor Steven Huss-Lederman at Beloit College, and the text of part of the collaboration policy statement from MIT. You can expect your programming assignments to be checked against those turned in by other members of the class as well as code that I can find on the web. I expect the correlations between your work and that of others to be minimal.

I can also offer an operational definition of what you can do and of how you can distinguish "learning from a group discussion" and "turning in someone else's work." If, after having participated in a group activity, you can walk away, put the books down, have lunch, and then come back afterwards to re-create from your own head the material and techniques you discussed as a group, then you can legitimately say that you have learned from the group but the work you turn in is your own.

On the Proper Use of Computing Resources

Students are expected to be aware of the university policy on use of computing resources, including the Student Guidelines for Responsible Computing, as well as the college and departmental policies on proper use of computing resources. Every instance of a suspected violation will be reported. Students should be aware that neither the instructor nor the department are responsible for making alternative arrangements should improper use leading to revocation of access to departmental or college resources make it impossible for you to complete the programming assignments on time.

On the Nature of Academic Work

Students might also find relevant an essay from a professor at Georgia Tech.