|
25
Applied Computers-
Introduction to Project
4
Begin Project
4
C++ -
Work on Ch12Proj2
Data Structures -
Continue working on binarytreedriver.cpp
BASIC -
Work on Ch7Proj1
(maze program)
|
26
Applied Computers-
Continue Project
4
C++ -
Work on Ch12Proj2
Data Structures -
Discuss removing a node from
a BST
BASIC -
Possible quiz on the form Line method & collision detxn
Work on Ch7Proj1
(maze program)
|
27
Applied Computers-
Continue Project
4
C++ -
Explain new required way to use apstrings
in a program (using the Project/Add To Project/Files menu command)
Work on Ch12Proj2
Data Structures -
Finish discussing removing
a node from a BST
Discuss the remove function
in binarytreedriver.cpp
BASIC -
Work on Ch7Proj1
(maze program)
|
28
Applied Computers-
Continue Project
4
C++ -
Work on Ch12Proj2
Data Structures -
Fix the remove function in
binarytreedriver.cpp
BASIC -
Work on Ch7Proj1
(maze program)
|
Mar 1
Applied Computers-
Continue Project
4
C++ -
Possible quiz on Ch. 12 topics
Lecture on misc. Ch. 12 topics including
initializer list & copy constructors
Data Structures -
Fix the remove function in
binarytreedriver.cpp
BASIC -
Work on Ch7Proj1
(maze program)
|
|
4
Applied Computers-
Continue Project
4
C++ -
Finish lecture on misc. Ch.
12 topics including copy constructors
Data Structures -
Pretty print your binarytreedriver.cpp
(submit one copy to me and keep one copy in your notes)
BASIC -
Work on Ch7Proj1
(maze program)
|
5
Applied Computers-
Continue Project
4
C++ -
Runtime grades for Ch11Proj1
& Ch12Proj2
Data Structures -
Ch 6 quiz (find & remove)
Execute binarytreedriver for
a runtime grade
Pretty print your binarytreedriver.cpp
(submit one copy to me and keep one copy in your notes)
if you have time - make internalPathLength
work w/ the interpretation of a single-node tree having an internal
path length of zero
Make treeDepth work w/ interpretation
that a single-node tree has a depth of zero
BASIC -
Finish Ch7Proj1
(maze program)
|
6
Applied Computers-
Finish Project
4
C++ -
Review Ch.
12 wrksheet #1
Begin Ch
13 lecture (apstring.h)
Data Structures -
Review & submit homework
Any different algorithms for find or remove?
BASIC -
Review homework (Ch. 7
wksheet #1)
(if time) Begin homework (Ch.
7 wksheet #3)
|
7
Applied Computers-
Begin Project
5
C++ -
Continue Ch. 13 demos
building a program that uses member fxns of apstring
Data Structures -
Classwork - Do an actual AP exam free-response
question involving B-trees (Ch. 6 Worksheet #10)
BASIC -
Review homework - Ch.
7 worksheet #2
Quiz
|
8
Applied Computers-
Continue Project
5
C++ -
Ch. 12 Quiz #1
Continue Ch. 13 demos
building a program that uses member fxns of apstring
Data Structures -
Quiz - Fill in missing code in insert,
remove, or find BST functions
Submit both Ch. 6 wrksht #10
BASIC -
Submit homework - Ch.
7 wksheet #3
Do Ch. 7 wksheet #4
as classwork
Review Ch. 7 wksheet #4
|
|
11
Applied Computers-
Continue Project
5
C++ -
Ch. 12 Test
Data Structures -
Quiz - Do Ch. 6 worksheet #11
(if time) Test Ch. 6 Worksheet #10 distance
function
BASIC -
Ch. 7 Test
|
12
Applied Computers-
Continue Project
5
C++ -
Continue Ch
13 lecture - apstring.h
Data Structures -
Discuss Ch 6 Sxns 4-6
BASIC -
Begin Ch.
8 lecture & demos
(multiple forms, Hide & Show methods, splash screen)
|
13
Applied Computers-
Continue Project
5
C++ -
Continue Ch
13 lecture - apstring.cpp
Data Structures -
Begin Ch. 7 lecture (advanced sorting)
Schedule recursion presentations
BASIC -
Continue Ch.
8 lecture & demos
(vbModal, vbModeless, standard code module, Sub Main)
|
14
Applied Computers-
Continue Project
5
C++ -
Work on Ch. 13 vocab
& Ch. 13 Section questions out of textbook.
Data Structures -
Read Ch. 7 Section #1 & #2
Be prepared for a quiz tomorrow on these
two sections
BASIC -
Add a simple maze to each form of Ch8Demo1 program.
Automatically hide the current form and show the next form as
the user completes each maze. Unload the whole project when the
user completes the maze in level 5.
|
15
Applied Computers-
Continue Project
5
C++ -
Finish Ch. 13 vocab
& Ch. 13 Section questions out of textbook.
Data Structures -
Quiz on Ch.
7 Sxns 1 & 2
Review Shell & Quick Sort algorithms
BASIC -
Finish 5-level maze
Runtime grades for Ch7Proj1
|
|
18 End of 3rd Quarter
Applied Computers-
Continue Project
5
C++ -
Finish runtime grades
Data Structures -
Review Shell & Quick Sort algorithms
BASIC -
Ch7Proj1 runtime grades
|
19
Applied Computers-
Continue Project
5
C++ -
Continue Ch
13 lecture - apstring.cpp
Data Structures -
Search the Web to find 2 or 3 animations
& explanations for the following sorts:
Submit the exact URL addresses by the end
of the class
BASIC -
(Per 2 Assembly)
Ch7Proj1 runtime grades
|
20
Applied Computers-
Finish Project
5
C++ -
Continue Ch
13 lecture - apstring.cpp
Data Structures -
Recursion Presentations by Ian, Matt, Julian,
& Kishan
BASIC -
Continue Ch.
8 lecture & demos
(MDI parent & child forms)
|
21
Applied Computers-
Begin Project
6
C++ -
Quiz on apstring class
(if time) Begin Ch.
13 wksht #1 homework asst
Data Structures -
Only 2 students in class - Review Shell,
Quick, Heap, & Merge sort algorithms
BASIC -
Continue Ch.
8 lecture & demos
(vbModal, Form_Activate)
|
22
Applied Computers-
Continue Project
6
C++ -
Continue Ch
13 lecture - apstring.cpp
(if time) Classwork - add member fxns Right
& Left to apstring class, modeled on VB's Right & Left
string fxns
Data Structures -
Recursion Presentations by Kishan, Julian,
John, Amy, Mike, Keri, & Jason
(if time) Possible quiz - Fill in missing
code in insert, remove, or find BST functions
BASIC -
Easter egg hunt
Continue Ch.
8 lecture & demos
(standard code module, Pause general procedure, timer objects,
control arrays, etc.)
(if time) Demonstration of how the With statement
and variables named Top, Left, Bottom, & Right could have
been used in Ch7Proj1
|