COURSE OUTLINE and HOMEWORK ASSIGNMENTS - subject to minor changes :


L-1 Mon Jan 8 9.1,2,3,4 Arrays, examples, relationship with pointers -- 2,3,4,5
L-2 Wed Jan 10 9.5,6,7,8 Bubble sort; multi-dimensional arrays -- 7,9,11
L-3 Fri Jan 12 9.9,10,11,12 Memory allocation, style, errors
  Mon Jan 15   Martin Luther King Day - no classes
L-4 Wed Jan 17 10.1,2,3 Sentinel; Initialization; and an example
L-5 Fri Jan 19 10.4 Using pointers to process a string -- 1
L-6 Mon Jan 22 10.5 Problem solving: counting words -- 2,3,4
L-7 Wed Jan 24 10.6 Passing arguments to main() -- 5
L-8 Fri Jan 26 10.7 String handling functions in the standard library -- 7,8,10,11
Project one due by 1PM, Monday January 29
L-9 Mon Jan 29 10.8,9,10 Style, common errors, and system considerations
L-10 Wed Jan 31 11.1 Recursive problem solving -- 1,3
L-11 Fri Feb 2 11.1 design of recursive algorithms -- 2,4
L-12 Mon Feb 5 11.2 An example: drawing patterns on the screen
L-13 Wed Feb 7 11.3 String handling using recursion -- 5,6,7
L-14 Fri Feb 9 11.3 Iterative versus recursive versions of programs -- 9
L-15 Mon Feb 12 11.4 The divide-and-conquer methodology -- 10
L-16 Wed Feb 14 11.4 more on divide-and-conquer -- 12
L-17 Fri Feb 16 11.5 Style: Iteration versus Recursion
Project two due by 1PM, Monday February 19
L-18 Mon Feb 19 11.6,7 Common errors and system considerations
L-19 Wed Feb 21   Review for Exam I

L-20 Fri Feb 23   Exam I on Chapters 10 and 11  

L-21 Mon Feb 26 12.1,2 Declaring structures; accessing a member -- 1,2,3
L-22 Wed Feb 28 12.3,4 Operator precedence; Structures, functions, and assignment -- 4
L-23 Fri Mar 2 12.5,6 Problem solving: student records; Initialization of structures -- 6,7,9
L-24 Mon Mar 5 12.7,8 Use of typedef; Self-referential structures -- 10,11
L-25 Wed Mar 7 12.9 Linear linked lists -- 12
L-26 Fri Mar 9 12.10 List operations -- 13
Project three due by 1PM, Monday March 19
L-27 Mon Mar 19 12.11,12 Counting and lookup; Insertion and Deletion -- 14
L-28 Wed Mar 21 12.13,14,15 Style, common errors, and system considerations -- 15,17
L-29 Fri Mar 23 13.1 The output function printf() -- 1
L-30 Mon Mar 26 13.2 The input function scanf() -- 4
L-31 Wed Mar 28 13.3,4 The functions sprintf(), sscanf(), fprintf(), fscanf() -- 5,6
L-32 Fri Mar 30 13.5 Accessing files -- 8,9
L-33 Mon Apr 2 13.6 An example: double-spacing a file
L-34 Wed Apr 4 13.7 Using temporary files and graceful functions -- 10,11
L-35 Fri Apr 6 13.8 Accessing a file randomly -- 15,16
Project four due by 1PM, Monday April 9
L-36 Mon Apr 9 13.9,10,11 Style, common errors, and system considerations
L-37 Wed Apr 11   Review for Exam II

L-38 Fri Apr 13   Exam II on Chapters 12 and 13  

L-39 Mon Apr 16 14.1,2 Executing system commands; Environment variables
L-40 Wed Apr 18 14.3,8 The C compiler; The use of make
L-41 Fri Apr 20 14.4,5 Creating a library; Using the profiler
L-42 Mon Apr 23   Review for Final Exam
L-43 Wed Apr 25   Review for Final Exam
Project five due by 1PM, Friday April 27
L-44 Fri Apr 27   Review for Final Exam

Monday April 30, 1:00-3:00 : Final exam -- room to be announced.