CSC121A - Syllabus - Spring 2005

Nadeem Abdul Hamid - Berry College

Topic and Lecture Notes Reading Assignments
Fri Jan 7: Introduction [PDF (lec01)]
Mon Jan 10: Introduction continued
Wed Jan 12: OO Review, Scope, and Inheritance [PDF (lec02)] Dale 7.1-7.6 Lab 1/Hw 1 due
Fri Jan 14: Inheritance and Polymorphism [PDF (lec03)]
Mon Jan 17: No class
Wed Jan 19: Inheritance and Polymorphism cont. (lec03)
Fri Jan 21: Interfaces (lec03)
Mon Jan 24: GUI components [PDF (lec04)] Dale 8.1-8.2
Wed Jan 26: Components and event handling Dale 8.3 and 8.8
Fri Jan 28: Event Handling Dale 8.4-8.7
Mon Jan 31: Exceptions; more control structures and operators [PDF (lec05)] Dale Ch. 9
Wed Feb 2: Applets [PDF (lec 06)] Dale Ch. 14 Lab 4/Hw 4 due
Fri Feb 4: Recursion [PDF (lec 07)] Dale Ch. 13
Mon Feb 7: Recursion Dale Ch. 13
Wed Feb 9: Java wrapup Project stage 2 due
Fri Feb 11: *** EXAM 1 ***
 
Mon Feb 14: Intro to C [PDF (lec 08)] KP Ch. 1
Wed Feb 16: Intro to C (cont.) KP Ch. 1 Lab 6/Hw 6 due
Fri Feb 18: Lexical elements, operators [PDF (lec 09)] KP Ch. 2.1 - 2.11
 
Mon Feb 21: Lexical elements, operators KP Ch. 2
Wed Feb 23: Flow of control [PDF (lec 10)] KP Ch. 3 Lab 7/Hw 7 due
Fri Feb 25: Flow of control KP Ch. 3
 
Mon Feb 28: C Functions [PDF (lec 11)] KP Ch. 4.1-4.9 Java Project Due
Wed Mar 2: Structured Programming KP Ch. 4.10-4.16 Lab 8/Hw 8 due
Fri Mar 4: Character Processing [PDF (lec 12)] KP Ch. 5
 
Mon Mar 7: Data Types KP Ch. 6
Wed Mar 9: Review Lab 9/Hw 9 due
Fri Mar 11: *** EXAM 2 ***
 
Mon Mar 21: Go over exam
Wed Mar 23: Data Types [PDF (lec 13)] KP Ch. 6-7
Fri Mar 25: Simpletron machine
 
Mon Mar 28: Simpletron machine
Wed Mar 30: Pointers and Functions [PDF (lec 14)] KP Ch. 8 Lab 11/Hw 11 due
Fri Apr 1: Arrays
bubblesort.c
KP Ch. 9
 
Mon Apr 4: Structures and ADTs KP Ch. 12
Wed Apr 6: Chainword program KP 14.8 Lab 12/Hw 12 due
Fri Apr 8: String processing, structures KP Ch. 10
 
Mon Apr 11: Finish chainword program
  • chainword.h
  • chainword.1.c
  • holmesfrag.txt (Some text of the Memoirs of Sherlock Holmes, taken from Project Gutenberg. The program will run pretty slow -- several minutes -- in order to build the table and generate text from this selection. In lab we will investigate a modification to the simple linked list data structure that will, hopefully, help it run much faster. In the meantime, be patient.)

 



Last modified: Mon Apr 11 12:19:36 EDT 2005