|
|
| (250 intermediate revisions by the same user not shown) |
| Line 1: |
Line 1: |
| − | == Wednesday - Thursday (1/14/09 - 1/15/09) ==
| + | #REDIRECT [[IB Computer Science 2]] |
| − | '''Warmup:'''
| |
| − | * What is the binary equivalent of the following decimal number? 255
| |
| − | * What is the decimal equivalent of the following binary number? 01011101
| |
| − | * What is the hexadecimal equivalent to the above number?
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * Binary Review
| |
| − | * Analog vs. Digital
| |
| − | * Errors
| |
| − | | |
| − | == Monday - Tuesday (1/12/09 - 1/13/09) ==
| |
| − | '''Agenda:'''
| |
| − | * 2nd Quarter Exam
| |
| − | | |
| − | == Friday (1/9/09) ==
| |
| − | '''Agenda:'''
| |
| − | * Review for exam
| |
| − | | |
| − | == Thursday (1/8/09) ==
| |
| − | '''Agenda:'''
| |
| − | * Hexadecimal
| |
| − | ** [[Media:Hexadecimal.ppt]]
| |
| − | | |
| − | == 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
| |
| − | ** [[Media:Binary.ppt]]
| |
| − | ** [[Media:Binary2.ppt]]
| |
| − | * 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
| |
| − | | |
| − | == Tuesday (1/6/09) ==
| |
| − | '''Agenda:'''
| |
| − | * Turn in late Dossier: Data Structures
| |
| − | * Introduction to Algorithm Evaluation
| |
| − | ** [[Media: AlgorithmEvaluation.ppt]]
| |
| − | ** [[Big O Practice Problems]]
| |
| − | | |
| − | == 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
| |
| − | ** [[Media: AlgorithmEvaluation.ppt]]
| |
| − | | |
| − | == Archives ==
| |
| − | * [[IBCS2 - December]]
| |
| − | * [[IBCS2 - November]]
| |
| − | * [[IBCS2 - October]]
| |
| − | * [[IBCS2 - September]]
| |
