Difference between revisions of "IB Computer Science 2"

From WLCS
Line 1: Line 1:
 +
== Monday (1/14/13) ==
 +
* 2nd Quarter Exam - Wednesday (1/16/13)
 +
** Binary
 +
*** Conversion to and from decimal
 +
*** Minimum and maximum values
 +
*** Number of bits necessary to represent a set number of symbols
 +
** Hexadecimal
 +
*** Conversion to and from binary
 +
** Binary addition
 +
** Negative binary
 +
*** Sign magnitude
 +
*** 2's complement
 +
*** Binary addition with 2's complement
 +
* Work on Dossier code
 +
 
== Thursday (1/10/13) ==
 
== Thursday (1/10/13) ==
 
* Dossier - Criterion B3: Modular Organization due today
 
* Dossier - Criterion B3: Modular Organization due today

Revision as of 11:44, 14 January 2013

Monday (1/14/13)

  • 2nd Quarter Exam - Wednesday (1/16/13)
    • Binary
      • Conversion to and from decimal
      • Minimum and maximum values
      • Number of bits necessary to represent a set number of symbols
    • Hexadecimal
      • Conversion to and from binary
    • Binary addition
    • Negative binary
      • Sign magnitude
      • 2's complement
      • Binary addition with 2's complement
  • Work on Dossier code

Thursday (1/10/13)

Tuesday (1/8/13)

Agenda:

Friday (1/4/13)

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)
    1. Tree view/hierarchical view all your classes and their interconnections
    2. Descriptions of each class
    3. Names of all attributes and methods
    4. Short descriptions of what each method does
  • CODE CODE CODE at home
  • Number Systems Review
    • Binary
    • Binary addition
    • Hexadecimal

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)
  • 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)
  • 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
  • Binary Addition
  • 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
  • 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?
    1. Selection Sort
    2. Binary Search
    3. Bubble Sort
    4. Linear Search
    5. Quick Sort?

Agenda:

  • Turn in Dossier Criterion B1: Data Structures
  • Introduction to Binary
  • Binary Games - Play individually or as a class?
  • 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:

  1. Define the word algorithm
  2. What qualities constitute a good algorithm versus a bad algorithm?

Agenda:

Monday (12/3/12)

Agenda:

Archives

Retrieved from "https://www.paulbui.net/wiki/index.php?title=IB_Computer_Science_2&oldid=9772"