CISC181-013-015 -- Fall 06

Introduction To Computer Science

Lecture: MWF 11:15AM - 12:05PM 209 Smith Hall
Lab - Section 13: M 2:30PM - 3:20PM - Willard 009
Lab - Section 14: T 2:30PM - 3:20PM - Willard 009
Lab - Section 15: T 3:35PM - 4:25PM - Willard 009
Prerequisites: CISC105 OR Prior Programming Experience in another high level language (This is IMPORTANT!)
Course Project Number: 2003 What is a project number?

Instructor: Chris Fischer
E-mail: cfischer@cis.udel.edu
Office hours: Before Class and by Appointment
Web: http://www.cis.udel.edu/~cfischer/

Teaching Assistant: Dan Waegel
E-mail: danielw@udel.edu
Office:
Office hours:


Grades


What's new for this semester:
More coding to be done in class (past students have requested this.) More emphasis on coding style and memory management, less emphasis on Operator Overloading. New (and improved) book! Some slides will need updating.
What to expect in this course:
A lot of work. This course has to teach both the basic features of the C++ language, many of which the concepts you may know already, and the advanced features (Pointers, Operator Overloading, Classes, Inheritance, Polymorphism..) in one semester. If you're looking for a course to show up to twice a week with minimal outside work, this is not the class for you. This course moves very quickly and has a lot of outside work (labs, homeworks, 3 programming assignments, 3 tests).

You can also expect that I will provide you a LOT of resources to succeed in this course. I will provide as many outside references and sample code as I can. I will also make myself available for questions as much as possible. If possible, reach me by email, during the week. I will usually get back to you very quickly. However, I do have two rules.

  1. I am not here to debug your programs. That is a part of the assignment. Do not email me your program saying "It doesn't work, what's wrong?". This does not mean I'm not going to help you, I will, but ask specific questions, not "what's wrong with this".
  2. I get very unsympathetic to questions the night before/day of/after the project due date. They should really be done by then.  I also am unsympthetic towards people that email questions but don't come to class.
There rules are here not to make life difficult for you, but to encourage you to think the problems through on your own. If you're really stuck, of course I'm going to help you, but I don't want you to email immediately when you get to a hard problem.

Other important points:
You are strongly encouraged to come to class. While I will put some material up on the web, it will be hard to do well in this course without coming to class. Reading the relevant chapters ahead of time is also a good idea. Last semesters class convinced me to post the Powerpoints ahead of time. I'll do that again, but only if people show up regularly for class.



Course Policies:

Special Rule: Your final grade cannot be more than one letter grade higher than your exam average. This ensures that your final grade reflects your mastery of the basic concepts of the course.

Lab/Project submission: All Labs must be submitted to the TA, either in person on in their mailbox. All Projects must be personally handed to the TA - if you place it in their mailbox, you will receive a zero on it.

Homework Submission: Homeworks should be submitted to me. If the homework involves a programming assignment, it has to be done on a computer, with appropriate test runs.
All papers MUST be stapled. Unstapled papers will lose 10 points.

Coding conventions: I will go over coding conventions in the second or third lecture. Your code should generally follow it, or you will lose points. Code that can't be followed clearly by other people is far less useful (more on this later.)

Lateness: Assignments are due by the end of class on the date they are due. After that, they lose 5%/day, up to a maximum of 7 days late. Labs can be turned into my or the TA's mailbox, with the DATE and TIME of submission clearly marked on it. Any paper that doesn't have the date and time clearly marked on it on the first page (Either circled, if the printout shows a timestamp, or otherwise written) will lose 10 points.

Academic Dishonesty: DO YOUR OWN WORK. You as specifically NOT permitted to discuss solutions to problems with other students or share code.

I haven't been out of school long enough to forget how rampant cheating is. So before you think about sharing solutions, know this much going in.

  1. I am a professional Software Engineer - I stare at code all day long. I've also TA'ed this course 3 times, and this is my 8th time teaching it. So if anyone can spot copied code/cheating, it's probably me.
  2. The tests will have a large amount of the material that comes straight from the homeworks/projects. This will make them fairly easy for students who have completed and understood the projects on their own, and very difficult for those that haven't.
Cheating will be dealt with per University guidelines. I really don't want to waste everyone's time by doing this, but I will. Please do your own work.

Grading Policies: I'm going to grade on the standard curve (>93=A, >90=A-, >87 B+, etc.). This is guaranteed. Depending on class performance or other factors, I might adjust this scale down (to help everyone) I will never adjust it up.
Also, all your grades will be posted online (via a code name) so that you always know exactly where you are throughout the semester. Please check online and make sure all your grades are correct.

Your grade for the semester will be based on:

Tests:   50% of final grade
Projects:   25% of final grade
Labs + Homeworks   25% of final grade

Class participation can positively affect a borderline grade. 


Textbooks


Absolute C++, Savitch, ISBN: 0321330234
Just Enough Unix, 5th Edition, by Anderson,   ISBN: 0072952970

Schedule

You are expected to attend all classes, and to be prepared for each class by reviewing notes from the previous lecture and reading the scheduled reading assignments. You are responsible for all announcements and material presented during classes, whether you are present or not.
This schedule is tentative and subject to change.
Date Topics Resources Readings  What's Due
August 30 Introduction To Course Lecture 1

September 1 C++ Basics Lecture 2 Notes from Dr. Conrad Savitch Chapter 1
September 4 NO CLASS - Labor Day


September 6 Coding Standards


September 8



September 11 Finish coding standards, Numbers, Files
Lecture 3
Savitch Chapter 2, Using Unix 1
Lab 1
September 13 Control Flow



September 15 File Processing
Floating Point examples


September 18
Lecture 4

Lab 2
September 20 Functions
Lecture 5


September 22

Savtich Chapter 3, Using Unix 2

September 25


Lab 3
September 27 More functions, random numbers
Lecture 6

Homework 1
September 29 Review HW1, Start arrays
Random Number exploit


October 2
Review for Exam


Project 1
October 4
Exam 1



October 6
Arrays
Lecture 7
Savitch Chapter 5

October 9
Sorting, Structs, Strings
Lecture 8

Lab 4
October 11




October 13 Pointers
Lecture 9
new.cc

October 16 More Pointers

dynarray.cc
Lab 5
October 18  Linked Lists
Lecture 10
linked.cc

October 20

newlinked.cc

October 23
Lecture 11

Lab 6
October 25  Begin Classes
Lecture 12


October 27



October 30 Review for Exam


Project 2
November 1
Exam 2



November 3
More classes Lecture 13
Savitch Chapter 6

November 6 More classes
Lecture 14


November 8
Constructors
Lecture 15
Savitch Chapter 7

November 10
this, friend functions
Lecture 16
Savitch Chapter 8

November 13
Inheritance
Lecture 17
Savitch Chapter 14
Lab 7
November 15




November 17
Inheritance
Lecture 18


November 20
Virtual Functions
Lecture 19

Lab 8
November 22
Copy constructors



November 24 NO CLASS - Thanksgiving



November 27



November 29

string.cc inherit.cc

December 1
inherit1115.cc


December 4
Abstract Classes
Lecture 20 1204.cc Project 3
December 6
Review for Final


Final Exam, Tues Dec 12 8-10AM, KRB 204


Resources

 Professor Conrad's CISC181 Page
 C++ Reference
 C++ FAQ (Lite version)
 U. of Hawaii's VI tutorial
 VI Lover's homepage
 EMACS tutorial
 STL String Reference
 Pointer Fun With Binky (and other help with Pointers + Linked Lists)
 Sun Ray Reference / Tips ( Thanks to Professor Conrad for this )
 Sorting Algorithms (Look at Bubble and Selection - than look at one that uses better than 0(n^2) - merge or quick sort should be fine.
 Linked List Tutorial