Fundamentals of Computer Science in C

Syllabus


Updated: October 26, 1998

Week of

Topic

Reading Assignment

Sept. 7

Introduction/Overview of Course:

  • Introduction
  • "Hello, World!" Program
 

Sept. 14

Introduction to C Programming:

  • Basic Input/Output
  • Basic Data Types
  • Basic Arithmetic
  • Operator Precedence

Chapter 2

Sept. 21

Structured Program Development:

  • If/Else Selection Structure
  • While Repetition Structure
  • Assignment Operators
  • Structured Programming

Chapter 3

September 28

Program Control:

  • For Repetition Structure
  • Switch Multiple Selection Structure
  • Do/While Repetition Structure

Chapter 4

Oct. 5

Logical Operators

  • Logical Operators

Chapter 4 (Cont.)

Oct. 12

Functions:

  • Function Definitions
  • Function Prototypes
  • Storage Classes

Chapter 5

Oct. 19

Functions (cont.):

  • Call by Value v. Call by Reference
  • Random Numbers
  • Introduction to Recursion

Chapter 5 (Cont.)

Oct. 26

Review and Midterm:

  • The Midterm will be held on Wednesday, October 28.
 

Nov. 2

Arrays:

  • What’s an Array? What are they used for?
  • Declaring Arrays
  • Passing Arrays to Functions
  • Encryption

Chapter 6 (except for Section 6.8)

Nov. 9

Arrays (cont.)
  • Sorting: Bubble Sort
  • Multi-dimensional Arrays
 

Nov. 16

Pointers:

  • What’s a Pointer?
  • How are Pointers and Arrays related?
  • Pointer Operators

Chapter 7: Sections: 7.1 – 7.4, 7.6, 7.8

Nov. 23

Pointers (cont.):

  • Pointer Practice
  • Bubble Sort
 

Nov. 30

Structures:

  • Structure Definitions
  • Accessing Members of Structures

Chapter 10: Sections 10.1 – 10.5

Dec 7

File Input/Output:

  • Files and Streams
  • Reading/Writing Data
  • Random Access Files

Chapter 11

December 14

Introduction to Java

  • Introduction to Object Oriented Languages
  • Java and the World Wide Web

Handout

Final The final will be held on Wednesday, 12/16 8:00-9:50am