|
|
| Line 1: |
Line 1: |
| − | == Friday - Tuesday (1/4/13 - 1/8/13) == | + | == [[IBCS2 - Archives]] == |
| − | '''Warmup:'''
| |
| − | * Add the following binary numbers 110101 + 111
| |
| − | * Add the following hexadecimal numbers 30 + 2F
| |
| − | ** Hint: Convert to binary before adding
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * Turn in Criterion B2: Algorithms
| |
| − | * Dossier - Criterion B3: Modular Organization due Thursday (1/10/13)
| |
| − | ** [[Media:CriterionB3_modularOrganization.doc]]
| |
| − | ** Look at older examples of modular organization
| |
| − | *# Tree view/hierarchical view all your classes and their interconnections
| |
| − | *# Descriptions of each class
| |
| − | *# Names of all attributes and methods
| |
| − | *# Short descriptions of what each method does
| |
| − | * CODE CODE CODE at home
| |
| − | * Number Systems Review
| |
| − | ** Binary
| |
| − | ** Binary addition
| |
| − | ** Hexadecimal
| |
| − | * Negative Binary
| |
| − | ** Sign Magnitude - [[Media:NegBinarySignMag.ppt]]
| |
| − | ** 2's Complement - [[Media:NegBinary2sComp.ppt]]
| |
| − | | |
| − | == Monday - Monday (12/24/12 - 12/31/12) ==
| |
| − | * Winter Break
| |
| − | | |
| − | == Friday (12/21/12) ==
| |
| − | * DOSSIER DOSSIER DOSSIER!
| |
| − | * Dossier - Criterion B2: Algorithms due Friday (1/4/13)
| |
| − | ** [[Media:CriterionB2_algorithms.doc]]
| |
| − | * Dossier sections completed so far:
| |
| − | ** A1: Problem Analysis
| |
| − | ** A2: Criteria for Success
| |
| − | ** A3: Prototype Solution
| |
| − | ** B1: Data Structures
| |
| − | * Use winter break to actually code your dossier!!
| |
| − | ** We are currently behind in the dossier
| |
| − | ** Complete dossier and documentation is due at the end of February
| |
| − | | |
| − | == Wednesday (12/19/12) ==
| |
| − | '''Agenda:'''
| |
| − | * Hexadecimal & Binary Addition quiz ... surprise!
| |
| − | * Dossier - Criterion B2: Algorithms due Wednesday (1/2/13)
| |
| − | ** [[Media:CriterionB2_algorithms.doc]]
| |
| − | * Missing dossier sections
| |
| − | * Dossier sections completed so far:
| |
| − | ** A1: Problem Analysis
| |
| − | ** A2: Criteria for Success
| |
| − | ** A3: Prototype Solution
| |
| − | ** B1: Data Structures
| |
| − | * Use winter break to actually code your dossier!!
| |
| − | ** We are currently behind in the dossier
| |
| − | ** Complete dossier and documentation is due at the end of February
| |
| − | | |
| − | == Monday (12/17/12) ==
| |
| − | '''Agenda:'''
| |
| − | * Hexadecimal
| |
| − | ** [[Media:Hexadecimal.ppt]]
| |
| − | * Binary Addition
| |
| − | ** [[Media:BinaryAddition.ppt]]
| |
| − | * Dossier Progress
| |
| − | ** You will demo / present completion of the following components in your dossier:
| |
| − | *** Basic container class (e.g. Contact)
| |
| − | *** Node class (e.g. ContactLLNode or ContactBTNode)
| |
| − | *** Partial completion of your major data structure (e.g. ContactLL or ContactBT)
| |
| − | | |
| − | == Thursday (12/13/12) ==
| |
| − | '''Agenda:'''
| |
| − | * Binary Quiz today
| |
| − | * Analog vs. Digital
| |
| − | ** [[Media:AnalogDigital.ppt]]
| |
| − | * Analog Signal Woes (interesting, but not on IB exam)
| |
| − | ** [[Media:AnalogProblems.ppt]]
| |
| − | ** What is noise?
| |
| − | ** Radio signals
| |
| − | ** TV signals (video signals)
| |
| − | ** Audio signals (through audio cables)
| |
| − | ** Signal-to-Noise Ratio
| |
| − | * Why is digital better than analog?
| |
| − | * Dossier Progress Check on Monday (12/17/11)
| |
| − | ** You will demo / present completion of the following components in your dossier:
| |
| − | *** Basic container class (e.g. Contact)
| |
| − | *** Node class (e.g. ContactLLNode or ContactBTNode)
| |
| − | *** Partial completion of your major data structure (e.g. ContactLL or ContactBT)
| |
| − | | |
| − | == Tuesday (12/11/12) ==
| |
| − | '''Warmup:'''
| |
| − | * What are the Big-O evaluations for the following?
| |
| − | *# Selection Sort
| |
| − | *# Binary Search
| |
| − | *# Bubble Sort
| |
| − | *# Linear Search
| |
| − | *# Quick Sort?
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * Turn in Dossier Criterion B1: Data Structures
| |
| − | * Introduction to Binary
| |
| − | ** [[Media:Binary.ppt]]
| |
| − | ** [[Media:Binary2.ppt]]
| |
| − | * Binary Games - Play individually or as a class?
| |
| − | ** [http://britton.disted.camosun.bc.ca/binary.swf Binary Game #1]
| |
| − | ** [http://forums.cisco.com/CertCom/game/binary_game_page.htm Binary Game #2]
| |
| − | * Binary Quiz on Thursday (12/13/11)
| |
| − | * Dossier Progress Check on Monday (12/17/11)
| |
| − | ** You will demo / present completion of the following components in your dossier:
| |
| − | *** Basic container class (e.g. Contact)
| |
| − | *** Node class (e.g. ContactLLNode or ContactBTNode)
| |
| − | *** Partial completion of your major data structure (e.g. ContactLL or ContactBT)
| |
| − | | |
| − | '''Homework:'''
| |
| − | * Binary Quiz on Thursday (12/13/11)
| |
| − | * Dossier Progress Check on Monday (12/17/11)
| |
| − | | |
| − | == Friday (12/7/12) ==
| |
| − | '''Agenda:'''
| |
| − | * Work on your Dossier
| |
| − | ** Highly recommend planning out the classes that you intend to use
| |
| − | * Dossier Criterion B1: Data Structures - [[Media:CriterionB1_dataStructures.doc]]
| |
| − | ** Due Tuesday (12/11/12)
| |
| − | ** This section describes ALL the data structures that you plan to us
| |
| − | *** Container classes (e.g. Contact)
| |
| − | *** Data structures (e.g. array, linked list, binary tree)
| |
| − | *** File format structures (e.g. how your data files will be organized)
| |
| − | | |
| − | == Wednesday (12/5/12) ==
| |
| − | '''Warmup:'''
| |
| − | # Define the word '''algorithm'''
| |
| − | # What qualities constitute a '''good''' algorithm versus a '''bad''' algorithm?
| |
| − | | |
| − | '''Agenda:'''
| |
| − | * Algorithm Evaluation - Big O!
| |
| − | ** [[Media:AlgorithmEvaluation.ppt]]
| |
| − | ** Algorithm Evaluation of Stack methods
| |
| − | ** Algorithm Evaluation of Queue methods
| |
| − | ** Algorithm Evaluation of Linked List methods
| |
| − | ** Algorithm Evaluation of Binary Tree methods
| |
| − | ** [[Big O Practice Problems]]
| |
| − | | |
| − | == Monday (12/3/12) ==
| |
| − | '''Agenda:'''
| |
| − | * [http://contest.idtus.com/registration.php IDT Programming Contest Registration]
| |
| − | * [http://www.washlee.net/cs2code/AddressBookGUI.zip AddressBookGUI Code Walk-through]
| |
| − | ** Read through the code yourself
| |
| − | * Work on your Dossier
| |
| − | ** Highly recommend planning out the classes that you intend to use
| |
| − | * Dossier Criterion B1: Data Structures - [[Media:CriterionB1_dataStructures.doc]]
| |
| − | ** Due Tuesday (12/11/12)
| |
| − | ** This section describes ALL the data structures that you plan to us
| |
| − | *** Container classes (e.g. Contact)
| |
| − | *** Data structures (e.g. array, linked list, binary tree)
| |
| − | *** File format structures (e.g. how your data files will be organized)
| |
| − | | |
| − | == Archives == | |
| − | * [[IBCS2 - 1213 - November]]
| |
| − | * [[IBCS2 - 1213 - October]]
| |
| − | * [[IBCS2 - 1213 - September]]
| |
