Mr. Minich's Classwork Calendar
November 2002
Click "Reload" to ensure this page is updated.

Monday

Tuesday

Wednesday

Thursday

Friday

28    End of 1st Q

BASIC -

Work on Ch3Proj2

C++  -

Possible "make-it-or-break-it" quiz

Continue Ch. 7 Lecture (switch examples)

Data Structures -

Part 2 of Ch. 3 Test

29

BASIC -

Finish Ch3Proj2

C++  -

Review Ch. 7 wksht #1

Continue Ch. 7 Lecture (nested if's & switch's)

Data Structures -

Ch. 3 Test Post-Mortem

30

BASIC -

Begin Ch. 4 Lecture (If & If/Else statements, relational operators)

C++  -

Do Ch. 7 worksheet #3 (if logic)

Review answers to Ch. 7 wrksht #3

Data Structures -

Continue Ch. 4 Lecture

31

BASIC -

Continue Ch. 4 Lecture (If/ElseIf statements, And, Or, Not)

C++  -

Discuss if statement equivalencies, DeMorgan's law & other Boolean identities

Ch. 7 classwork

Data Structures -

Continue Ch. 4 Lecture

Begin Ch. 4 wksht #1

Nov 1

BASIC -

Continue Ch. 4 Lecture (If/ElseIf statements, And, Or, Not)

C++  -

Finish discussing DeMorgan's law & other Boolean identities

Data Structures -

Write a program checks for palindromes using apstacks

4

BASIC -

Continue Ch. 4 Lecture (nested If statements)

C++  -

Classwork - DeMorgan's law & other Boolean identities

Data Structures -

Ch. 4 Lecture - prefix, postfix, infix expressions & using stacks to interpret them

5

BASIC -

Review Ch. 4 worksheet #1

Review nested If's

Discuss a few examples of compound Boolean expressions being equivalent (DeMorgan's)

C++  -

Homework review

Introduce AP homework (finding ordered pairs to Bool. expressions)

Data Structures -

Classwork - do Prefix/Postfix worksheet #1

6

BASIC -

Study the Boolean truth chart

Boolean order of operations

Classwork - evaluate Boolean expressions to True or False

C++  -

Introduce Ch7Proj1

As a class, pseudocode Ch7Proj1

Data Structures -

Probable quiz on prefix & postfix

Trace code for parsing infix expressions into postfix & evaluating postfix expression

7

BASIC -

Possible quiz

Using Mod to test divisibility, "primeness", etc.

C++  -

Work on Ch7Proj1

Data Structures -

Homework review (p. 253)

8

BASIC -

HW review

Finish discussing use of Mod to test divisibility, primeness, etc.

C++  -

Probable quiz on Boolean algebra

Review for Ch. 7 Test

Data Structures -

Ch. 4 lecture (authors queue, apqueue)

11

BASIC -

The KeyPress event of a textbox and the KeyAscii parameter

ASCII chart

Using Select Case statements

C++  -

Begin Ch. 8 Lecture

Data Structures -

Continue Ch. 4 lecture (authors queue, apqueue, q as vector, circular q, q as linked list, priority q)

12

BASIC -

Create Ch4Demo1 which uses the KeyPress event of a textbox and its KeyAscii parameter

C++  -

Ch. 7 Test

Data Structures -

Discuss the car wash simulation in Ch. 4

Introduce Ch4Proj1 - check source file for mismatched (, {, [,

 

13

BASIC -

Add a Form_KeyPress as well as a Form_KeyDown even to Ch4Demo1

Set Visible properties of a textbox to True & False

C++  -

Work on Ch7Proj1

Data Structures -

Review activation records & the use of stacks by the compiler

Work on Ch4Proj1

14

BASIC -

Introduction to shape objects, animation & collision detection (using Select Case statements in Form_KeyDown event)

C++  -

Work on Ch7Proj1

Data Structures

Work on Ch4Proj1

15

BASIC -

Introduce Ch4Proj1

Work on Ch4Proj1

C++  -

Begin Ch. 8 lecture

Finish Ch7Proj1

Data Structures -

Finish Ch4Proj1

Begin homework

18

BASIC -

Work on Ch4Proj1

C++  -

Continue Ch. 8 lecture (syntax of while loops)

Data Structures -

Do Ch. 4 worksheet #2 as graded classwork (stacks and queues)

Runtime grades for Ch4Proj1

(if time) Begin homework

19

BASIC -

HW check

Work on Ch4Proj1

C++  -

Continue Ch. 8 lecture (syntax of do while loops)

Data Structures -

Do Ch. 4 worksheet #3 as classwork

Homework review

20

BASIC -

Work on Ch4Proj1

Lecture on Time and Timer functions

C++  -

Ch7Proj1 runtime grades

Continue Ch. 8 lecture (syntax of for loops)

Data Structures -

Quiz on reciting & explaining apstack member functions

Discuss apstack implementations as much as necessary. Note that apstack is implemented as a vector.

21

BASIC -

Work on Ch4Proj1

Review for Ch. 4 Test

C++  -

Review homework from Tue night

Continue Ch. 8 lecture (syntax of for loops)

Data Structures -

Discuss apqueue implementations as much as necessary. Note that apqueue is implemented as a vector-based circular queue (actually a ring buffer).

Discuss implementing apstack with linked lists rather than vectors

Review for Ch. 4 Test

Do Ch. 4 Worksheet #4

22

BASIC -

Finish Ch4Proj1

C++  -

Review Ch. 8 worksheet #1

quiz on indeterminate loops

Data Structures -

Ch. 4 Test (see practice test also)

25

BASIC -

guest lecturer

C++  -

guest lecturer

Data Structures -

guest lecturer

26

BASIC -

Ch. 4 Test

C++  -

Ch 8 lecture & demo's (break, continue, flags, sentinels, nested loops)

Ch. 8 classwork - selected exercises from Ch. 8 worksheets #5, #6, & #2

Data Structures -

Part 2 of Ch. 4 Test

27

BASIC -

Create Ch4Demo2 that uses the Time and Timer functions

Hacking contest

C++  -

Do Ch. 8 wksheet #7 with one person typing it into the compiler

Introduce Ch. 8 worksheet #3 and related algorithms

(if time) Generating random values in C++

Data Structures -

Introduce Ch. 5 recursion (tail recursion)

28

No School
(Thanksgiving)

29

No School