Syllabus

CS 207 (Section 01) Computer Science II Spring 1997

Class Lecture Meeting Times: MWF 10:10-11:05 am (in CSB 127).

Instructor:

Dr. Tim Newman Office Hours:   MW 3:30-5:00pm
email: tnewman@cs.uah.edu Tu, R   11:00am-12:00 noon
Office: CSB 112 F   11:10am-12:00 noon
Phone: 890-6619 Or Phone for Appointment

Course Objectives:

 

• To learn advanced programming concepts of a block-structured, high-level language (specifically, ANSI C).
• To build proficiency in good program design, documentation, coding, debugging, and testing.
• To enhance problem solving and algorithm development skills through a disciplined and structured approach.

Texts:

Data Structures, Algorithms, and Software Principles in C by Thomas A. Standish, Addison-Wesley: New York, 1995 (ISBN 0-201-59118-9).

Laboratory Manual for CS 207, Third (Fourth) Edition, Aug. 1996, by M. E. Weisskopf, UAH Computer Science (available at UAH Bookstore).

Supplemental Texts:

You may wish to refer to a C manual at times, such as Kernighan and Ritchie's The C Programming Language, Second Edition.

Grading:

The final grade will be composed of the following weights. The instructor reserves the right to make changes to this system, including the addition of unannounced quizzes.

Activity Total Points

Mid-term Exams (2) 160 pts. total

Final Exam 100 pts.

Programming Assignments (5) 145 pts. total

Lab Assignments 50 pts. total

Quizzes, Homeworks, and Participation 45 pts. total

Grand Total 500 pts.

The grading scale will be:

Above 90% for a 4.0;            Above 80% for a 3.0;

Above 70% for a 2.0;            Above 65% for a 1.0;

0-65% for a 0.0

The University now encourages the awarding of ``plus'' and ``minus'' letter grades. We will use this system. Note that a plus or minus grade doesn't effect GPA (e.g., a B+ is counted in GPA the same as a B or B-).

Exams:

There will be two mid-term examinations, each worth 80 points. These exams are scheduled for Wednesday, Feb. 12 and Friday, Mar. 14. The 100 point comprehensive final is Monday, April 28, from 8:00 to 10:30 am. Tests will cover lectures, assigned readings, lab assignments, homework, and programming assignments. Documented crisis or one week's prior notice required for consideration of exam make-up.

Programming Assignments:

There will be 5 programming assignments in this course. All assignments are to be INDIVIDUAL work. For help, direct questions to the CS Building PC Lab assistant and then to the instructor. All programs need to compile and run using the Visual C/C++ compiler in the CSB PC lab. Please do not use C++ constructs.

Notes on Programming Assignments:

  

• After saving your program on your own disk at the end of every lab visit, erase any files you've left on the lab's hard disk. Files left on the lab hard disks may endanger your grade in this class and your lab privileges!
• Hand in a disk with ONLY the program source file on it unless otherwise instructed.
• Also hand in a printout of your program.
• Place both disk and printout in a sturdy enclosable folder so that your disk does not get misplaced. You are responsible for submitting your disk and printout in a secure folder that nothing will fall out of. Please, no 3-ring binders.
• I recommend that you buy three or more disks for use this term. Use one for programming assignments and lab work, one to turn in programming assignments, and one as a back-up disk. It's a good idea to back up your work often.
• All programs are expected to contain a reasonable amount of documentation.
• No due date extensions can be granted. Programs are due at the start of the class period. Late programs will receive a 10% penalty if they are up to one day late plus an additional 15% penalty for each additional late day. Please do not delay completing the assignments. The lab will be busy this term.

Lab Assignments:

The lab manual is designed to illustrate concepts introduced in class. As such, it is important that the labs be completed according to the course schedule. To ensure that lab work is finished on time, no late labs will be accepted. Lab work is due at 4:30 pm on the date due. There are a total of 10 lab assignments. It is a wise strategy to complete the labs as soon as feasible. Keeping up on the lab work is an important factor in student success in this course. The course is 4 credit hours due to the laboratory component, so you will want to budget ample time (on average, several hours) to allow completion of the laboratory exercises.

Homeworks:

A few homeworks will be assigned throughout the term. Homeworks are due before class begins on the due date. Short quizzes may be given at any time covering the lecture and reading material. This is to motivate you to keep up on the reading.

Turn-in Policy:

Turn in all work to the instructor, preferably during class. Alternately, you may turn in work to one of the department secretaries during their working hours (be sure to ask the secretary that the assignment be given to Professor Newman). Do not turn any work in to a lab TA!

Absence Policy:

Class attendance and participation is important to your performance in the course and makes up a portion of the grade. The instructor should be notified in advance of absence. Also note the exam absence policy mentioned earlier.

If you need Help!

I have scheduled a liberal amount of office hours and I want to help you learn the material and to succeed in the course. Please seek my assistance if you have any questions or concerns. The lab assistants are also ready to help you with any difficulties you have on the assignments.

Academic Honesty:

The University policy on academic honesty, discussed in the code of Student Conduct, is strict. The instructor's academic honesty policy is very strict; instances of academic dishonesty will be penalized, ordinarily by failure of the course (in addition to any University penalties). Unless otherwise stated, all work is to be individual work. Violations of the individual work policy will be regarded as instances of academic dishonesty.

Spring 1997 CS 207(01) Schedule

Date Topic Reading Assignment Special Comments

Wed. 1/8 Introduction and Review Ch. 1

Fri. 1/10 Intro. and Preparation Ch. 1

Mon. 1/13 Preparation Ch. 1

Wed. 1/15 Prep. and Linked Data Ch.s 1 and 2 Lab 2 due

Fri. 1/17 Linked Data Ch. 2

Mon. 1/20 NO CLASS

Wed. 1/22 Linked Data Ch. 2 Lab 3 due

Fri. 1/24 Linked Data Ch. 2

Mon. 1/27 Linked Data & Recursion Ch.s 2 and 3 Lab 4 due

Wed. 1/29 Recursion Ch. 3 Program 1 due

Fri. 1/31 Recursion Ch. 3

Mon. 2/3 Modularity & Abstraction Ch. 4 Lab 5 due

Wed. 2/5 Mod. & Abs. Ch. 4

Fri. 2/7 Mod. & Abs. Ch. 4

Mon. 2/10 Stacks and Queues Ch. 7 Lab 6 due

Wed. 2/12 TEST 1 Ch. 1-4,7.1 TEST 1

Fri. 2/14 Stacks and Queues Ch. 7

Mon. 2/17 Stacks and Queues Ch. 7 Program 2 due

Wed. 2/19 Stacks and Queues Ch. 7

Fri. 2/21 Stacks and Queues Ch. 7 Lab 9 due

Mon. 2/24 Sfw. Engineering Ch. 5

Wed. 2/26 Sfw. Engineering Ch. 5

Fri. 2/28 Sfw. Engg. and Alg. Analysis Ch.s 5 and 6 Lab 7 due

Mon. 3/3 Alg. Analysis Ch. 6 Program 3 due

Wed. 3/5 Lists Ch. 8

Fri. 3/7 Lists Ch. 8

Mon. 3/10 Lists Ch. 8

Wed. 3/12 Lists Ch. 8 Lab 10 due

Fri. 3/14 TEST 2 Ch. 5-8 TEST 2

Mon. 3/17 Lists and Strings Ch. 8

Wed. 3/19 Trees Ch. 9

Fri. 3/21 Trees and Searching Ch. 9 Lab 1 due

Mon. 3/24 Trees and Searching Ch. 9

Wed. 3/26 Trees Ch. 9 Program 4 due

Fri. 3/28 Trees Ch. 9 Lab 8 due

3/31-4/4 NO CLASS

Mon. 4/7 Hashing Ch. 11

Wed. 4/9 Hashing Ch. 11

Fri. 4/11 Hashing and Sorting Ch.s 11 and 13

Mon. 4/14 Sorting Ch. 13

Wed. 4/16 Sorting Ch. 13

Fri. 4/18 Sorting Ch. 13 Program 5 due

Mon. 4/21 Sorting and Review Ch. 13 LAST CLASS

Mon. 4/28 FINAL Ch. 1-9, 11, 13 FINAL 8-10:30 am

 
• About this document ...