Difference between revisions of "IB Computer Science II"
From WLCS
| Line 1: | Line 1: | ||
| − | == | + | == Friday (1/9/09) == |
| + | '''Agenda:''' | ||
| + | * Review for exam | ||
| + | |||
| + | == Thursday (1/8/09) == | ||
| + | '''Agenda:''' | ||
| + | * Hexadecimal | ||
| + | ** [[Media:Hexadecimal.ppt]] | ||
| + | |||
| + | == Wednesday (1/7/09) == | ||
'''Warmup:''' | '''Warmup:''' | ||
* Convert the following decimals numbers to 8-bit binary: 2, 8, 18 | * Convert the following decimals numbers to 8-bit binary: 2, 8, 18 | ||
| Line 6: | Line 15: | ||
'''Agenda:''' | '''Agenda:''' | ||
* Binary Review | * Binary Review | ||
| + | ** [[Media:Binary.ppt]] | ||
| + | ** [[Media:Binary2.ppt]] | ||
* Field trip to NSF? | * Field trip to NSF? | ||
* 2nd Quarter Exam Review | * 2nd Quarter Exam Review | ||
Revision as of 11:42, 9 January 2009
Contents
Friday (1/9/09)
Agenda:
- Review for exam
Thursday (1/8/09)
Agenda:
- Hexadecimal
Wednesday (1/7/09)
Warmup:
- Convert the following decimals numbers to 8-bit binary: 2, 8, 18
- Convert the above decimals numbers to hexadecimal
Agenda:
- Binary Review
- Field trip to NSF?
- 2nd Quarter Exam Review
- Linked Lists
- Adding, removing, etc. (including all before-after scenarios)
- Linear search
- Binary Trees
- Inserting (including all before-after scenarios)
- Binary search
- Software Development
- Linked Lists
Tuesday (1/6/09)
Agenda:
- Turn in late Dossier: Data Structures
- Introduction to Algorithm Evaluation
Monday (1/5/09)
Warmup:
- Describe in three words what you did over winter break
- Draw the binary tree that results after inserting the following numbers: 2, 6, 3, 4, 5, 1, 8, 9
- Describe the process of searching the binary tree for the number 5
- Describe the process of searching the binary tree for the number 7
- Draw the binary tree that results after inserting the following words: "When in the Course of human events it becomes necessary for one people..."
Agenda:
- Demo missing BTAddressBook
- Dossier - Data Structures
- Peer review of Data Structures section
- Introduction to Algorithm Evaluation
