| Sat, Jan 17 |
- Class website is made available
|
Please look over the Course Home and Lesson Plan
to get familiar with the class
|
| Meeting 1: Sat, Jan 17 |
- Syllabus Overview
- Course Introduction
- CISP 300 Website tour
- How to be successful in this course
- Using the ARC computing environment
- Begin Chapter 1
- Hardware
- How Computers Store Data
- How a Program Works
- Types of Software
- The Calcomatic 1000
|
Activities and Exercises are due by midnight on the
date due unless it is stated otherwise. All reading assignments must be
completed prior to the indicated class meeting.
- Read Chapter 1
- Introduction to Computers and Programming
|
| Fri, Jan 23 |
|
|
| Meeting 2: Sat, Jan 24 |
- Chapter 1 Continued
- wrap up Calcomatic 1000
- Review what will be on quiz
- Begin Chapter 2
- Designing a Program
- Output, Input, and Variables
- Variable Assignment and Calculations
- Variable Declarations and Data Types
- Named Constants
- Hand Tracing a Program
- Documenting a Program
|
- Log on to the D2L website
- Read Chapter 2
- Input, Processing, and Output
|
| Fri, Jan 30 |
|
- Due: Activity 1
- Chapter 1 Review questions
- Due: Activity 2
- Chapter 2 Review questions
- Due: Exercise 1
- Syllabus review quiz, Survey, Ch1 pg 27 (pg 26 in 3rd Edition): 1-4
|
| Meeting 3: Sat, Jan 31 |
|
Sunday, February 1 is last day to drop this class
to qualify for enrollment fee refund.
Sunday, February 1 is last day to drop this
class without notation on record.
- Quiz 1
- on Chapter 1
|
| Fri, Feb 6 |
|
- Due: Exercise 2.
- Ch2 pg 72 (77): 3, 4, 8, 9
|
| Meeting 4: Sat, Feb 7 |
- Begin Chapter 3
- Introduction to Modules
- Defining and Calling a Module
- Local Variables
- Passing Arguments to Modules
- Global Variables and Global Constants
- Module Pre- and Post-Conditions
|
- Read Chapter 3
- Modules
|
| Fri, Feb 13 |
|
- Due: Activity 3.
- Chapter 3 Review questions
- Due: Exercise 3
- Ch3 pg 113 (117): 3, 5, 6, 9
|
| Meeting 5: Sat, Feb 14 |
- Begin Chapter 4
- Introduction to Decision Structures
- Dual Alternative Decision Structures
- Comparing Strings
- Nested Decision Structures
- The Case Structure
- Logical Operators
- Boolean Variables
|
- Quiz 2
- on Chapter 2
- Quiz 3
- on Chapter 3
- Read Chapter 4
- Decision Structures and Boolean Logic
|
| Fri, Feb 20 |
|
- Due: Activity 4.
- Chapter 4 Review questions
|
| Meeting 6: Sat, Feb 21 |
- Chapter 4 Continued
- Begin Chapter 5
- Introduction to Repetition Structures
- Condition-Controlled Loops: While, Do-While,
and Do-Until
- Count-Controlled Loops and the For Statement
- Calculating a Running Total
- Sentinels
- Nested Loops
|
- Read Chapter 5
- Repetition Structures
|
| Fri, Feb 27 |
|
- Due: Exercise 4.
- Ch4 pg 159 (166): 2, 5, 7, 9
- Due: Activity 5.
- Chapter 5 Review questions
|
| Meeting 7: Sat, Feb 28 |
|
- Quiz 4
- on Chapter 4
|
| Fri, Mar 6 |
|
- Due: Exercise 5
- Ch5 pg 214 (222): 1, 4, 7, 9
|
| Meeting 8: Sat, Mar 7 |
- Begin Chapter 6
- Introduction to Functions: Generating Random Numbers
- Writing Your Own Functions
- More Library Functions
|
- Quiz 5
- on Chapter 5
- Read Chapter 6
- Functions
|
| Fri, Mar 13 |
|
- Due: Activity 6
- Chapter 6 Review questions
|
| Meeting 9: Sat, Mar 14 |
|
|
| Fri, Mar 20 |
|
- Due: Exercise 6
- Ch6 pg 253 (262): 1, 4, 7, 8
|
| Meeting 10: Sat, Mar 21 |
- Begin Chapter 7
- Garbage In, Garbage Out
- The Input Validation Loop
- Defensive Programming
|
- Quiz 6
- on Chapter 6
- Read Chapter 7
- Input Validation
|
| Fri, Mar 27 |
|
- Due: Activity 7
- Chapter 7 Review questions
- Due: Exercise 7
- Ch7 pg 268 (279): 1-4
|
| Meeting 11: Sat, Mar 28 |
- Begin Chapter 8
- Array Basics
- Sequentially Searching an Array
- Processing the Contents of an Array
- Parallel Arrays
- Two-Dimensional Arrays
- Arrays of Three or More Dimensions
|
- Quiz 7
- on Chapter 7
- Read Chapter 8
- Arrays
|
| Monday, March 30 through Sunday, April 5 |
Spring Recess |
| Fri, Apr 10 |
|
- Due: Activity 8
- Chapter 8 Review questions
|
| Meeting 12: Sat, Apr 11 |
- Chapter 8, continued
- Begin Chapter 9
- The Bubble Sort Algorithm
- The Selection Sort Algorithm
- The Insertion Sort Algorithm
- The Binary Search Algorithm
|
- Read Chapter 9:
- Sorting and Searching Arrays
|
| Fri, Apr 17 |
|
Sunday, April 19 is last day to drop this
class with a "W" grade.
- Due: Exercise 8.
- Ch8 pg 320 (333): 1, 4, 7, 8, + problem TBA
|
| Meeting 13: Sat, Apr 18 |
|
- Quiz 8
- on Chapter 8
|
| Fri, Apr 24 |
|
- Due: Activity 9.
- Chapter 9 Review questions
- Due: Exercise 9
- Ch9 pg 358 (373): 1, 3, 5, 7
|
| Meeting 14: Sat, Apr 25 |
- Begin Chapter 10
- Introduction to File Input and Output
- Using Loops to Process Files
- Using Files and Arrays
- Processing Records
- Control Break Logic
|
- Quiz 9
- on Chapter 9
- Read Chapter 10
- Files
|
| Fri, May 1 |
|
- Due: Activity 10
- Chapter 10 Review questions
- Due: Exercise 10
- Ch10 pg 410 (426): 1, 3, 6, 8
|
| Meeting 15: Sat, May 2 |
- Records and user-defined data types
- Records containing only standard data types
- Records containing arrays
- Arrays of records
- Records and Files
- Tracing and debugging programs
- Final exam preview and practice
|
- Quiz 10
- on Chapter 10
- Read Notes
- on Records
|
| Fri, May 8 |
|
- Due: Exercise 11
- See Assignments page for details
|
| Meeting 16: Sat, May 9 |
|
- Due: group Activity 11
- Final Review questions, due at end of class
- Quiz 11
- on Records
|
| Fri, May 15 |
|
|
| Final Exam: Sat, May 16 |
- Final Exam, 9:00am-11:50am
|
|
