Mr. Rogers' IB Computer Science - Second Quarter Objectives
|Syllabus||Android Project||1st Quarter||2nd Quarter||3rd Quarter||4th Quarter|
Essential Question: What are the key forms of temporary structure and why are they needed?
Chapter 21: Stacks and Queues
(IV Standard Data Structures, V Standard Algoritms)
1. Implement Stacks.
2. Be aware that the pop and peek methods will throw an exception if a stack is empty.
3. Describe how hardware stacks work in computers.
4. Implement Queues.
Homefun: Read Chapter 21; Exercises 1, 2, 3, 5, 11
Programming Assignments: Lab 21.3, Case Study and Lab 21.6
Test: Chap 21
Essential Question: Is recursion really needed?
Chapter 22: Recursion Revisited
(II Program Implementation)
Homefun: Read Chapter 22; Exercises 1, 2, 3, 4, 9
Programming Assignments: Lab 22.5 The Tower of Hanoi
Test: Chap 22
Essential Question: How can data be stored in a manner that insures that it remains in order?
Chapter 23: Binary Trees
(IV Standard Data Structures, V Standard Algorithms)
· parent--has children
· root--first node, generally shown at the top
· level (starts with 0 at the root)
· binary tree--let child, right child
· preorder--root visited before the right and left subtrees
· post order--root visited after the right and left subtrees
· inorder--root visite between the right and left subtrees
· can easily insert new data (like linked lists)
· elements are always sorted (facilities rapid searching)
Homefun: Read Chapter 18; Exercises 1, 2, 3, 15
Programming Assignments: Lab 23.6 Morse Code, Case Study and Lab 23.7 Java Messenger
Test: Chap 18 Objectives 1-5
SAM Team--Southside High School's STEM and Computer Science extra-curricular club (Mr. Rogers Sponsor)
Check out other web sites created by Mr. R:
Check out Articles by Mr. Rogers: