Header

CSC121 - Computer Science I

Syllabus, Fall 2011

Four (4) Credit Hours
Room: HR 308 (Labs in HR 314)
Time: 9:00 - 9:50 a.m. (M, W, F)
Lab Time: 3:00 - 5:30 p.m. (M)
Office Hours: As shown below and by appointment.

Fall 2011 Schedule

Text: C++ Programming: Program Design Including Data Structures, 5th ed.; Malik; Thomson Course Technology; 2011

Prerequisite: High-School Algebra or equivalent.

COURSE OBJECTIVES

This course is the first in a two-semester sequence designed to introduce the student to computer science and computer programming. A student successfully completing this course will be able to:

ASSIGNMENT OF GRADES

Grades will be based on the following activities:

1. Three comprehensive exams worth 100 points each. Each exam covers material from the beginning of the semester up to the most recent material covered. The first two exams will be given during regular class time and the third exam will be given during the normal final exam period.

2. Fourteen laboratory assignments worth 25 points each. Lab assignments are normally due at the end of the lab period. Lab assignments turned in late will receive no credit unless I determine that there were extenuating circumstances. The two lowest lab grades will be dropped.

GRADING SCALE

Letter grades are assigned on the basis of the number of points earned compared to the number of points possible:

Grade Points
     A 558-600
     A- 540-557
     B+ 522-539
     B 498-521
     B- 480-497
     C+ 462-479
     C 438-461
     C- 420-437
     D 360-419
     F 000-359

ATTENDANCE POLICY

In CSC 121, a student who is absent from regular classes sixteen or more times and who is passing the course will receive a grade of "N" (no credit). If such a student is failing the course then the student will receive a grade of "F". A student is absent if (s)he is not present when roll is taken. Note that under this policy there is no such thing as a "tardy". Make-up tests will be given only if the student arranges it AHEAD of time or if the absence is officially "excused".

ACADEMIC INTEGRITY

The work submitted by a student is expected to be the product of the student alone. Cheating, in any form, will result in a grade of zero for the work involved. Students who give assistance to other students will suffer the same penalty. Multiple occurrences will be dealt with under the policies established by the college.

TENTATIVE COURSE SCHEDULE

Month Day Activity or Material Covered
     
Aug 22 Ch. 1: Overview of Programming
  24 Ch. 1: Overview of Programming
  26 Ch. 2: Basic Elements of C++ (Hmwk 1)
     
  29 Ch. 2: Basic Elements of C++; Input and Output (Lab 1)
  31 Ch. 2: Basic Elements of C++; Form and Style (Hmwk 2)
Sep 2 Ch. 3: Input/Output; A Closer Look at Input (Hmwk 3)
     
  5 Labor Day Holiday
  7 Ch. 3: Input/Output; A Closer Look at Output (Hmwk 4)
  9 Ch. 3: Input/Output; File I/O (Hmwk 5)
     
  12 Ch. 4: Selection; Boolean Expressions & Operators (Lab 2)
  14 Ch. 4: Selection; if and if...else Statements (Hmwk 6)
  16 Ch. 4: Selection; Nested if...else Statements (Hmwk 7)
     
  19 Ch. 5: Repetition; while Loop (Lab 3)
  21 Ch. 5: Repetition; while Loop (Hmwk 8)
  23 Ch. 5: Repetition; for Loop (Hmwk 9)
     
  26 Ch. 5: Repetition; do...while Loop (Lab 4)
  28 Ch. 6: User-Defined Value-Returning Functions (Hmwk 10)
  30 Ch. 6: User-Defined Value-Returning Functions
     
Oct 3 Test 1 (Chapters 1-5) (Lab 5)
  5 Ch. 7: User-Defined Void Functions (Hmwk 11)
  7 Ch. 7: User-Defined Void Functions (Hmwk 12)
     
  10 Ch. 8: The string Type (Lab 6)
  12 Ch. 9: One-Dimensional Arrays (Hmwk 13)
  14 Ch. 9: One-Dimensional Arrays (Hmwk 14)
     
  17 Ch. 9: Parallel Arrays (Lab 7)
  19 Ch. 9: An Array of Structures (Hmwk 15)
  21 Fall Break
     
  24 Ch. 9 & 10: An Array in a Structure (Lab 8)
  26 Ch. 9: Searching a One-Dimensional Array (Hmwk 16)
  28 Ch. 9: Sorting a One-Dimensional Array (Hmwk 17)
     
  30 Ch. 9: Two-Dimensional Arrays (Lab 9)
Nov 2 Ch. 9: Two-Dimensional Arrays (Hmwk 18)
  4 Ch. 11: Classes and Data Abstraction (Hmwk 19)
     
  7 Test 2 (Chapters 1-9) (Lab 10)
  9 Ch. 11: Classes and Data Abstraction (Hmwk 20)
  11 Ch. 11: Classes and Data Abstraction (Hmwk 21)
     
  14 Ch. 11: Classes and Data Abstraction (Lab 11)
  16 Ch. 11: Classes and Data Abstraction (Hmwk 22)
  18 Ch. 11: Classes and Data Abstraction (Hmwk 23)
     
  21 Ch. 12: Inheritance and Composition (Lab 12)
  23 Thanksgiving Break
  25 Thanksgiving Break
     
  28 Simulation (Lab 13)
  30 Ch. 13: Pointers (Hmwk 24)
Dec 2 Ch. 13: Pointers (Hmwk 25)
     
  5 Ch. 13: Pointers (Lab 14)
  7 Ch. 13: Pointers (Hmwk 26)
  9 Ch. 13: Pointers (Hmwk 27)
     
  14 Test 3 (Chapters 1-13) at 8:00 A.M.