|
|
| Line 1: |
Line 1: |
| − | == Friday (1/29/10) ==
| |
| − | * Take out all Dossier materials
| |
| − | * We will go through each section of the checklist
| |
| − | * Turn in all materials with checklist to Mr. Bui
| |
| − | * Using MSWord to create professional-looking documents
| |
| | | | |
| − | == Wednesday (1/27/10) ==
| |
| − | '''Warmup:'''
| |
| − | * Why are digital signals "better" than analog signals?
| |
| − | * How many bits are in a byte?
| |
| − | * How many bytes are in a KB, MB, GB, TB?
| |
| − |
| |
| − | '''Agenda:'''
| |
| − | * NSF Field Trip! - Thursday (2/4/10)
| |
| − | * Errors!
| |
| − | ** [[Media:Errors.ppt]]
| |
| − | * Dossier - Modular Organization due Friday (1/29/10)
| |
| − | ** [[Media:CriterionB3_modularOrganization.doc]]
| |
| − | * BRING ALL YOUR DOSSIER MATERIALS ON FRIDAY
| |
| − | * File Input/Output - reading and writing to files
| |
| − | ** [[Media:RAFWriteDemo.java]]
| |
| − | ** [[Media:RAFReadDemo.java]]
| |
| − | * Add writing to file to your LinkedList class
| |
| − | *# Add a method named saveToFile(String filename)
| |
| − | *# Open the filename for writing using RandomAccessFile
| |
| − | *# writeUTF() the number of nodes or size of your LinkedList
| |
| − | *# Create a loop that traverses the LinkedList and writeUTF() all of the nodes' data
| |
| − | * If you want to add writing to file to a BinaryTree, then you must create recursive saveToFile() and saveToFileSubtree() methods that look like print() and printSubtree()
| |
| − |
| |
| − | == Monday (1/25/10) ==
| |
| − | '''Warmup:'''
| |
| − | * Write down a list of ALL your classes
| |
| − | * Draw a class hierarchy diagram that shows "has-a" relationships
| |
| − |
| |
| − | '''Warmup:'''
| |
| − | * Dossier - Modular Organization due Friday (1/29/10)
| |
| − | ** [[Media:CriterionB3_modularOrganization.doc]]
| |
| − | * BRING ALL YOUR DOSSIER MATERIALS ON FRIDAY
| |
| − | * File Input/Output - reading and writing to files
| |
| − | ** [[Media:RAFWriteDemo.java]]
| |
| − | ** [[Media:RAFReadDemo.java]]
| |
| − | * Add writing to file to your LinkedList class
| |
| − | *# Add a method named saveToFile(String filename)
| |
| − | *# Open the filename for writing using RandomAccessFile
| |
| − | *# writeUTF() the number of nodes or size of your LinkedList
| |
| − | *# Create a loop that traverses the LinkedList and writeUTF() all of the nodes' data
| |
| − | * If you want to add writing to file to a BinaryTree, then you must create recursive saveToFile() and saveToFileSubtree() methods that look like print() and printSubtree()
| |
| − |
| |
| − | == Friday - Thursday (1/15/10 - 1/21/10) ==
| |
| − | * Work on completing Dossier code
| |
| − |
| |
| − | == Wednesday (1/13/10) ==
| |
| − | '''Warmup:'''
| |
| − | * List and describe the three types of test data
| |
| − | * Look online and find out how many symbols are represented in ASCII
| |
| − | ** How many bits does the computer use for ASCII?
| |
| − |
| |
| − | '''Agenda:'''
| |
| − | * Sign magnitude review
| |
| − | * Introduction to 2's complement
| |
| − | ** [[Media:NegBinary2sComp.ppt]]
| |
| − | * Binary addition review
| |
| − | * Binary subtraction
| |
| − | * So what the heck does '''digital''' mean?
| |
| − | ** [[Media:AnalogDigital.ppt]]
| |
| − |
| |
| − | == Monday (1/11/010) ==
| |
| − | * 2nd Quarter Exam
| |
| − |
| |
| − | == Thursday (1/7/10) ==
| |
| − | '''Warmup:'''
| |
| − | * What base is hexadecimal?
| |
| − | * List the symbols used in hexadecimal
| |
| − | * Convert 45 to binary and hexadecimal
| |
| − | * Convert binary 101011101001 to hexadecimal
| |
| − |
| |
| − | '''Agenda:'''
| |
| − | * 2nd Quarter Exam will be next Monday (1/11/10) <- Binary 30!
| |
| − | ** Basic Java programming
| |
| − | ** Stacks
| |
| − | ** Queues
| |
| − | ** Linked Lists
| |
| − | ** Binary Trees
| |
| − | ** Software Development
| |
| − | ** Big-O algorithm evaluation
| |
| − | ** Binary
| |
| − | ** Hexadecimal
| |
| − | ** Binary Addition
| |
| − | ** Sign-Magnitude Negative Binary Numbers (?)
| |
| − | * Turn in late Dossier: Algorithms section & peer review
| |
| − | * Dossier update meetings
| |
| − | * [[Media:BinaryAddition.ppt]]
| |
| − | * [[Media:NegBinarySignMag.ppt]]
| |
| − | * Work on Dossier! Code should be nearing completion at the end of next week
| |
| − |
| |
| − | == Tuesday (1/5/10) ==
| |
| − | '''Warmup:'''
| |
| − | * Convert the following binary numbers to decimal:
| |
| − | ** 0001
| |
| − | ** 0011011
| |
| − | ** 010101
| |
| − | * Convert the following decimal numbers to binary:
| |
| − | ** 3
| |
| − | ** 63
| |
| − | ** 14
| |
| − | * List all the Big O complexities (Hint: O(1) is constant time)
| |
| − |
| |
| − | '''Agenda:'''
| |
| − | * Three-word winter break update
| |
| − | * 2nd Quarter Exam will be next Monday (1/11/10) <- Binary 30!
| |
| − | * Turn in Dossier: Algorithms section & peer review
| |
| − | * Dossier update meetings
| |
| − | * Introduction to Hexadecimal
| |
| − | ** [[Media:Hexadecimal.ppt]]
| |
| − | * Work on dossier!
| |
| − |
| |
| − | == Archives ==
| |
| − | * [[IBCS2 - May]]
| |
| − | * [[IBCS2 - April]]
| |
| − | * [[IBCS2 - March]]
| |
| − | * [[IBCS2 - February]]
| |
| − | * [[IBCS2 - January]]
| |
| − | * [[IBCS2 - December]]
| |
| − | * [[IBCS2 - November]]
| |
| − | * [[IBCS2 - October]]
| |
| − | * [[IBCS2 - September]]
| |
