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

Monday

Tuesday

Wednesday

Thursday

Friday

 

No School

 

No School

Jan 2

Applied Computers-

Introduce Midterm Exam Project

C++  -

Ch9Proj1 runtime grades

Review for Ch. 9 Test

Data Structures -

Work on Ch4Proj5

Grade Ch4Proj5 runtime

BASIC -

Ch5Proj1 & Ch5Proj2 runtime grades

Begin Ch. 6 lecture and demos

3

Applied Computers-

Continue Midterm Exam Project

C++  -

Ch. 9 Test

Data Structures -

Ch 4 test review - see guide & practice test

Work on Ch4Proj5

Grade Ch4Proj5 runtimes

BASIC -

Continue Ch. 6 lecture and demos

4

Applied Computers-

Continue Midterm Exam Project

C++  -

Begin Midterm review

Data Structures -

Ch 4 Test

Finish Ch4Proj5

BASIC -

Continue Ch. 6 lecture and demos

Begin midterm review

7

Applied Computers-

Finish Midterm Exam Project

C++  -

Midterm review

Data Structures -

Midterm review

BASIC -

Midterm review

8

Exam Day

9

Exam Day

10

Exam Day

C++  -

Midterm exam

Data Structures -

Midterm exam

BASIC -

Midterm exam 9:30-11am

11

Applied Computers-

New students' passwords

Lectures & demo Access Project 1

C++  -

Begin Ch. 10 lecture and demos - struct

Data Structures -

Review selected mult choice questions from midterm

BASIC -

Continue Ch. 6 lecture and demos

Do ch. 6 wksht #1 as classwork

14

Applied Computers-

Begin Access Project 1

Introduce vocab assignment

C++  -

Continue Ch. 10 lecture and demos - nested structs

Data Structures -

Review free response questions from midterm

BASIC -

Review ch. 6 wksht #2

Do ch. 6 wksht #3 as classwork

15

Applied Computers-

Continue Access Project 1

As a class, create an example database with one or more tables - Carefully design each table before creating it.

C++  -

Continue Ch. 10 lecture and demos - enum

Data Structures -

Ch 5 Lecture (recursion) - build power & factorial recursive fxn examples as a class

BASIC -

Continue Ch. 6 lecture on arrays & static & module-level variables

16

Applied Computers-

Continue Access Project 1

As a class, continue compact disc database

C++  -

Continue Ch. 10 lecture and demos - typedef

Data Structures -

Ch 5 Lecture (recursion) - recursion w/ linked lists

BASIC -

Continue Ch. 6 lecture on arrays

17

Applied Computers-

Continue Access Project 1

As a class, continue compact disc database

C++  -

Finish Ch. 10 lecture and demos - passing struct variables

Begin Ch10Proj1.cpp which is due Tue.

Data Structures -

Ch 5 Lecture (recursion) - Towers of Hanoi

BASIC -

Continue Ch. 6 lecture on passing arrays as parameters

18

Applied Computers-

Continue Access Project 1

As a class, finish compact disc database

C++  -

Finish Ch10Proj1.cpp which is due Tue.

Data Structures

Ch 5 Lecture (recursion) - continue Towers of Hanoi

BASIC -

Begin Ch. 6 lecture on general functions

21

No School

22

Applied Computers-

Continue Access Project 1

C++  -

AP students - hand in Ch. 10 wkbk

Ch. 11 Lecture & demos - writing to a sequential access file

Finish & submit Ch10Proj1.cpp

Data Structures -

Introduce Ch5Proj1.cpp assignment

BASIC -

Review homework (Ch. 6 wksht #10)

Classwork - Do Ch. 6 wksht #11

23

Applied Computers-

Continue Access Project 1

C++  -

Ch. 11 Lecture & demos - appending to a file; reading from a file

Data Structures -

Work on Ch5Proj1.cpp

BASIC -

Submit homework - Ch. 6 wksht #12)

Demonstration: "Using a sequential search to find the tallest student in the class"

Do Ch. 6 wksht #13 as classwork - This is called a sequential search algorithm

24

Applied Computers-

Continue Access Project 1

C++  -

Ch. 11 Lecture & demos - inserting data into the middle of a file

Data Structures -

Classwork tracing recursive fxns - Ch 5 wksht #1 due for homework

Work on Ch5Proj1.cpp

BASIC -

Continue Ch. 6 lecture on general functions - formal and actual parameter names not identical

Begin Ch. 6 wksht #14

25

Applied Computers-

Continue Access Project 1

C++  -

Ch. 11 Lecture & demos - using functions with files & passing stream objects

Data Structures -

Classwork tracing recursive fxns - Ch 5 wksht #2 due for homework

Work on Ch5Proj1.cpp

BASIC -

Discuss Ch. 6 Demo #8 - rounding a number with a general function

Continue Ch. 6 lecture on general functions - passing by value (ByVal) vs. passing by reference (ByRef)

28

Applied Computers-

Continue Access Project 1

C++  -

Introduce Ch11Proj1

Data Structures -

Introduce Ch. 6 - B-Trees

Do #1,4,5 on pp. 384+ as classwork

BASIC -

Do Ch. 6 wksht #15 as classwork

Introduce Ch6Proj1

29

Applied Computers-

Continue Access Project 1

Begin Access Project 2

C++  -

Possible quiz on Ch. 11 topics

Develop pseudocode for Ch11Proj1 as a class

Work on Ch11Proj1

Data Structures -

Continue Ch. 6 Lecture - preorder, inorder, & postorder Btree traversals

Do Ex 6.1 #2, 3, 6, 8, 9 on pp. 384+ (finish as homework)

(if time) Work on Ch5Proj1.cpp

BASIC -

Work on Ch6Proj1

30

Applied Computers-

Finish Access Project 1

Continue Access Project 2

C++  -

Work on Ch11Proj1

Data Structures -

Possible quiz - tracing a recursive fxn

Neatly make (i.e. draw) a B-tree worksheet with 4 exercises in which the student must indicate the order in which nodes are processed in preorder, inorder, & postorder traversal for each exercise. Of the 4 exercises, you must include one BST, one heap, one binary expression tree, and a plain B-tree. Provide the answers on attached paper.

Finish this worksheet for homework along with reading Section 6.2.

(if time) Work on Ch5Proj1.cpp

BASIC -

Work on Ch6Proj1

31

Applied Computers-

Continue Access Project 2

C++  -

Work on Ch11Proj1 - now due on Mon.

Data Structures -

Review Ch 5 wkshts 1 & 2

BASIC -

Discuss course selection & taking C++

Work on Ch6Proj1

Feb 1

Applied Computers-

Continue Access Project 2

C++  -

Work on Ch11Proj1 - now due on Mon.

Tentative Ch. 10 & 11 Test on Tue

Volunteers needed for Mr. Minich's WAEF workshops

Data Structures -

Submit B-tree worksheet

Submit Ch5Proj1.cpp

Continue Ch. 6 Lecture - C++ linked implementation of B-tree & helper functions in bintree.h

(if time) Finish Ch. 6 wkshts 1 & 2 (student created worksheets)

BASIC -

Review for the Ch 6 Test on Mon.

Volunteers needed for Mr. Minich's WAEF workshops