CSc 1253 – Spring 2008

Computer Science I with C++

Section31 TTH 3:00 – 4:30 PM  0228 TUREAUD HALL

Instructor: Coretta Douglas, Office: 295 Coates

MON TUES WED THUR FRI
AM By Appointment 9:00 – 11:00 10:00 – 11:30 9:00 – 11:00 By Appointment
PM By Appointment 1:30 – 4:00 By Appointment

Email (preferred contact): douglas@csc.lsu.edu (email received must be identifiable by name or subject)

Phone (during office hours only) - DO NOT leave voice messages: 578 – 4359

Prerequisites: Credit or registration in MATH 1550 or credit in MATH 1431

Reference: Foundations of C++, Custom Edition, from Walter Savitch (Pearson/Custom Addison Wesley)

Grading:

Point System	Grading Scale
Test 1 100 pts Test 2 100 pts Final Exam 100 pts Assignments (6) 100 pts Class Participation 25 (6% of grade) 425 total	90 to 100% A 80 to 89% B 70 to 79% C 60 to 69% D <= 59% F

Grading scale may be adjusted if student demonstrates remarkable improvement on the final.

Exams:

Test 1 – IN CLASS, (February 14, THURSDAY) tentative

Test 2 – IN CLASS, (April 3, THURSDAY) tentative

Final - IN CLASS (May 9 Friday, 12:30 – 2:30 )

Acceptance of Programs and/or Assignments: (Exceptional cases handled on an individual basis.)

· Student is responsible for checking email FREQUENTLY.

· NO make-up tests; early tests given with valid excuse. Missed test – 80% of next test for missing grade.

· NO extra credit, except where noted on assignments #5 and #6.

· NO access to calculators, phones, ipods, etc. during the tests/exams.

· ALL problems concerning grades MUST be resolved within 3 class days following the return of graded work.

· Assignments:
- Assignments are electronically submitted to our CSC1253c byte account
into the assignment grader’s subdirectory. Assignments must compile using g++ on the byte machine.

- NO teamwork. All work is by the individual student.

- Late assignments accepted with 5-point deduction penalty due next day NOON.

- Severe points deducted for compile time errors or run-time errors, use of global variables,
use of break or continue in a repetition.
- DO NOT use programming syntax or features not yet introduced in the class.
- Correct results (output) are not the only criteria for good grades.

- Hardware problems are not acceptable excuses for late programs. LSU network is recommended.

- Solutions are not supplied.
- Up to 10 max points of deficient points earnable on assignments 5 and 6.

· Class participation consists of pop tests, small class group projects, etc. 2-3 points each.

· Contact Kathy Edgeworth (cskathy@bit.csc.lsu.edu) if you have a complaint and would like to remain anonymous.

Good Advice:

Attend class; ask questions, read the text before class, read over notes after class,

Begin assignments immediately; write programs out by hand before typing into the computer,

Get the phone number of a classmate -

Student has the responsibility of getting assignments, missed notes, date changes, etc.

More Good Advice: To become a TigerTRAK Member go to the Career Services Web site at http://www.lsu.edu/career, to
"Students," to "TigerTRAK." After completing a user profile, you will have access to jobs online which include
internships, cooperative education, summer, volunteer, part time, and full time job opportunities.
Job related experience will make you more competitive upon graduation.
Tentative Lecture Schedule Spring 2008:

Class Date	Lecture	Due	Assignment Handout	TEST
Jan 15 WK 1	Introduction to Computers Hardware and Software Types of Hardware & Software The Software Development Method What is an Algorithm? Seq & Sel. Statements
Jan 22 WK 2	Continue Software Development Method C++ History (optional) Chapter 1 Begin Syntax: variable declarations, arithmetic expressions,		A1 (Tuesday) 10 pts (Interactive, Using UNIX, Implement seq. selection, repetition, Arith. expressions, I/O, accumulator)
Jan 29 WK 3	Chapter 1 Chapter 2 Selection structure Repetition structures Counter-control (while & do-while)	A1 Jan 31 Thursday	A2 (Thursday) 15 pts (interactive, counter-controlled repetition, finding largest)
FEB 4,5,6	MARDI GRAS BEAK
Feb 7 WK 4 (Thursday)	Chapter 2 Review counter control Sentinel control Finding largest and smallest Nested repetition
Feb 12 WK 5	Chapter 3 Function Basics Predefined functions, Scope and duration, Modular design (Structure Charts), Actual parameters and formal parameters, (skip recursion)	A2 Feb 14, Thursday	A3 (Tuesday) 15 pts (Interactive, nested rep., sentinel control, average, using math library function)	Test 1 Feb 14, THUR
Feb 19 WK 6	Review Modular Design Chapter 12 Text Files Formatting Input/output, Ifstream and ofstream objects Compound conditionals Chapter 5 Arrays
Feb 26 WK 7	Chapter 5 Arrays continued Selection Sort	A3 Feb 28 Tuesday	A4 (Tuesday) 20 pts (Files using ifstream and ofstream, modular program design, report formatted output, 1-D array)
Mar 4 WK 8	Chapter 5 contd Linear search (unordered & ordered) Switch statement from Chapter 1 pp. 61-66 Use of ‘for’ construct for repetition pp.76- 80
Mar 11 WK 9	Chapter 4 pass by reference	A4 Thursday	A5 (Thursday) 20 pts (parallel arrays, call by reference, linear search, switch statement, 2-D arrays, nested repetition, menu driven program, enumeration types)
Mar 18	SPRING BREAK
Mar 25 WK 10	Frequency arrays Binary Search Chapter 9 Strings
April 1 WK 11	Review	A5 April 3 Thursday		Test 2 APR 3 Thurs
April 8 WK 12	Selection sort Array of indexes Chapter 6 Structures /Classes	A5 Rev. April 11 Friday	A6 (Thurs) 20 pts (Selection sort, arrays of structures, classes, strings,)
April 15 WK 13	Chapter 6 Structures / Classes contd Unions Enumerated types pp. 66-67
April 22 WK 14	Call by address Runtime stacks pointers to pointers	A6 Apr 24 Thursday
April 29 WK 15	More on C++ Classes Encapsulation, Inheritance, Polymorphism Constructors, overloading,	A6 Rev. May 2 Friday	A6 (Tues)- Graded and returned
May 9 WK 16	FINAL EXAM May 9, Friday 12:30 – 2:30			Final Exam Friday 12:30 – 2:30