Difference between revisions of "IB Computer Science 2"
From WLCS
Line 1: | Line 1: | ||
− | == Tuesday (1/3/12) == | + | == Tuesday - Thursday (1/3/12 - 1/5/12) == |
'''Warmup:''' | '''Warmup:''' | ||
* Add the following binary numbers 110101 + 111 | * Add the following binary numbers 110101 + 111 |
Revision as of 15:59, 3 January 2012
Contents
- 1 Tuesday - Thursday (1/3/12 - 1/5/12)
- 2 Friday (12/23/11) - Friday (12/30/11)
- 3 Wednesday (12/21/11)
- 4 Monday (12/19/11)
- 5 Thursday (12/15/11)
- 6 Tuesday (12/13/11)
- 7 Friday (12/9/11)
- 8 Monday - Wednesday (12/5/11 - 12/7/11)
- 9 Thursday (12/1/11)
- 10 Tuesday (11/29/11)
- 11 Tuesday (11/22/11)
- 12 Wednesday - Friday (11/16/11 - 11/18/11)
- 13 Monday (11/14/11)
- 14 Wednesday (11/9/11)
- 15 Wednesday - Friday (11/2/11 - 11/4/11)
- 16 Archives
Tuesday - Thursday (1/3/12 - 1/5/12)
Warmup:
- Add the following binary numbers 110101 + 111
- Add the following hexadecimal numbers 30 + 2F
- Hint: Convert to binary before adding
Agenda:
- Letters of Support? - Due Tuesday, January 10th
- Binary Addition Quiz (w/ Hexadecimal)
- Negative Binary
- Sign Magnitude - Media:NegBinarySignMag.ppt
- 2's Complement - Media:NegBinary2sComp.ppt
- Errors?
- Work on Dossier
Friday (12/23/11) - Friday (12/30/11)
- Winter Break
Wednesday (12/21/11)
Warmup:
- Bring up your Dossier progress
- Using a flow chart, illustrate the process of recording a live CD, beginning with the artist singing into the microphone
- Convert the following hexadecimal number to binary: 2B0F
- Convert the following binary number to hexadecimal: 0100111010101000
Agenda:
- Dossier Progress Check during warmup
- Turn in algorithms section
- Binary Addition
- 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?
Winter Break Homework:
- CODE CODE CODE!
- Work on your dossier project
- Goal - completed dossier code by mid-January
Monday (12/19/11)
Agenda:
- Binary Games Practice (individually, then as a class)
- Binary Quiz
- Binary -> Decimal
- Decimal -> Binary
- Data values and representation
- Analog vs. Digital
- Hexadecimal - sounds kinda weird and creepy
Homework:
- Dossier Progress Check on Wednesday (12/21/10)
- Dossier - Criterion B2: Algorithms due Wednesday (12/21/11)
Thursday (12/15/11)
Warmup:
- Complete the Big O Practice Problems
- Turn in your answers (with you name on it!)
Agenda:
- Go over Big O Practice Problems
- Introduction to Binary - Media:Binary.ppt
- Introduction to Binary #2 - Media:Binary2.ppt
- Binary Games - Play individually or as a class?
- Binary Quiz on Monday (12/19/10)
- Dossier Progress Check on Wednesday (12/21/10)
- 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)
- You will demo / present completion of the following components in your dossier:
Homework:
- Binary Quiz on Monday (12/19/10)
- Dossier Progress Check on Wednesday (12/21/10)
- Dossier - Criterion B2: Algorithms due Wednesday (12/21/11)
Tuesday (12/13/11)
Warmup:
- What are the different methods of input and output? (specific types)
- When testing data, what are the 3 types of test data should you use. (specific types)
- Turn in your Data Structures section
Agenda:
- LEGO Competition - to compete, speak with Mr. Avondet
- Meetings after school on Tuesday in Mr. Avodent's room
- Return and go over Binary Quizzes
- Peer edit - Data Structures
- Algorithm Evaluation - Big O!
- Dossier - Criterion B2: Algorithms due Wednesday (12/21/11)
Friday (12/9/11)
Agenda:
- AddressBookGUI Code Walk-through
- Demos! Demos! Demos!
- Work on B1: Data Structures
- Work on coding your Dossier (including the GUI)
Monday - Wednesday (12/5/11 - 12/7/11)
Agenda:
- Dual Enrollment forms?
- Demo your completed AddressBook w/ Menu and Binary Tree
- Demo your completed Celcius Converter Tutorial
- Quadratic Formula GUI
- Create a GUI program that meets the requirements of the Quadratic Formula Assignment
- Don't forget that you'll need to use Math.pow() for exponents in Java
- 3 input boxes, a few labels, a button, and an output textbox would be great!
- B1: Data Structures - Media:CriterionB1_dataStructures.doc
- Due Tuesday, December 13th
Thursday (12/1/11)
Agenda:
- Binary Trees Quiz
- Dual Enrollment forms?
- Demo your completed AddressBook w/ Menu and Binary Tree
- Demo your completed Celcius Converter Tutorial
- Quadratic Formula GUI
- Create a GUI program that meets the requirements of the Quadratic Formula Assignment
- 3 input boxes, a few labels, a button, and an output textbox would be great!
Tuesday (11/29/11)
- Demo completed Binary Tree w/ Strings
- Demo completed AddressBook w/ Menu and Binary Tree
- Extracurricular Opportunities
- IDT Programming Contest
- Tetrahedral Rover Project w/ Catholic University (1-2 students interested in Java, C, and/or Basic programming)
- NVCC Dual Enrollment - ITP 120 - Java Programming I
- Complete the form (if you already have an ID# from last year, then use that one)
- Complete application if you have not done so before
- Exemption from COMPASS test with (AP English 3 or higher OR SAT Reading 550 or higher)
- Java GUIs
- NetBeans IDE
- Hello, world GUI program
- Java GUI assignment
- Complete and demo the Celcius Converter Tutorial
Homework:
- Study Binary Trees. Illustrations and Fill-in-the-blank Code Quiz on Thursday (12/1/11)
Tuesday (11/22/11)
Warmup:
- Insert the following numbers into a binary tree: 45, 23, 12, 87, 54, 52, 12, 0
Agenda:
- Missing Prototype Solutions
- Demo completed Binary Tree w/ Strings
- Demo completed AddressBook w/ Menu and Binary Tree
Wednesday - Friday (11/16/11 - 11/18/11)
Agenda:
- Turn in missing assignments: AddressBookLL & Prototype Solution
- Introduction to Binary Trees
- Binary Tree Assignment - Convert BinaryTree so that it contains Strings instead of int. Be sure to test it to make sure it works
- Binary Tree Assignment due Friday (11/18/11)
- Media:StringBinaryTreeTestMain.java
- AddressBookMain - implement an Edit feature.
- In the Address menu, you will need to ask the user which Contact they want to edit
- Search for the Contact, and then prompt the user which field they want to edit
- Prompt the user for the new information and use the Contact's setter method to change the particular field
- AddressBook Binary Tree - due Tuesday (11/22/11)
- Create 3 new classes called ContactBinaryTreeNode, ContactBinaryTree, and AddressBookBT
- Convert the BinaryTreeNode and BinaryTree such that they use Contacts
- Create a new AddressBookBT that uses a BinaryTree (instead of LinkedList)
- Upon completion, you should have an AddressBook with a menu that uses a binary tree, which allows users to add, remove, search, and edit Contacts
Homework:
- Binary Tree Assignment due Friday (11/18/11)
- AddressBookBT Assignment due Tuesday (11/22/11)
Monday (11/14/11)
Agenda:
- Turn in missing Prototype Solutions
- Demo AddressBookLL Assignment
- Mr. Bui's AddressBookLLTest
- Implementing sorting with LinkedLists
Wednesday (11/9/11)
Agenda:
- IDT Programming Contest will begin on 11/11/11
- Individuals and teams should meet after school on Monday (11/14/11)
- Take out your Dossier A3: Prototype Solution
- Should have a flowchart and corresponding screenshots
- We will be peer-editing and providing "user feedback"
- CS2 Code
- AddressBookLL Assignment due on Monday (11/14/11)
- You MUST work on the above at home. There will not be much lab time to work on these assignments.
Wednesday - Friday (11/2/11 - 11/4/11)
Agenda:
- IDT Programming Contest
- Begins November 11, 2011
- Solutions submitted by December 27, 2011
- 1st place - $1,500
- 2nd place - $750
- 3rd place - $500
- Carney JAMTech - December 3rd
- Demo your completed Media:LinkedList.java
- Test your LinkedList using Media:LinkedListTestMain.java
- Flow Charts
- Prototype Solution due Wednesday (11/9/11)
- Be sure to create a complete "Initial Design" flow chart of program screens
- Each box should have a corresponding prototype window
- Media:CriterionA3_prototypeSolution.doc
- AddressBookLL Assignment
- Create a new Java Project and name it AddressBookLLProject
- Copy over your Contact, AddressBook, and AddressBookMain classes to this new project
- Create a new class named ContactNode
- ContactNode should be just like Node, but instead of having an int num, you should have a Contact contact as the internal attribute
- Also be sure to have the next reference, which should be of type: ContactNode
- Your ContactNode class should have two constructors: ContactNode() and ContactNode(Contact newContact)
- Create a new class named ContactLinkedList
- Copy over your LinkedList code
- Convert the code so that it uses ContactNode and Contact instead of int
- Wherever you need to return an error Contact, return null or -1
- Change AddressBook so that it uses the ContactLinkedList instead of the Contact[]
- Be sure to create a new instance of ContactLinkedList in the AddressBook() constructor
- Most of AddressBook will look MUCH simpler b/c all you need to do is use the ContactLinkedList
- Comment out your sort() method
- Test out everything using AddressBookMain, which should not require any changes except for commenting out the sort option
Homework:
- Media:CriterionA3_prototypeSolution.doc due Wednesday (11/9/11)
- AddressBookLL Assignment due on Monday (11/14/11)
- You MUST work on the above at home. There will not be much lab time to work on these assignments.