2012

media type="custom" key="10424680"IB Comp Sci 2012
Mr Mulkey's IB Computer Science Blog

** Last Year SL Overview Old Mulkey IBcomp site R Jones' Site D Butera's HL Site **

** IA Dossier Notes .. Fundamentals Notes **


 * Review 2009 Paper 2 - 17 Apr 2012 **


 * Review Suggestions - 31 Mar-15 Apr 2012 **

1. READ YOUR TEXTBOOK, especially chap 3, chap 5 and chap 6 2. Use the review CD and do past-exam questions. Practice writing answers on paper (Max on the computer). Check answers in [Marks] folder. 3. Watch videos, for example at http://www.extremetech.com 4. Practice vocabulary on your review CD 5. Practice with ALGORITHMS (below) 6. Watch animated sorting demos at: http://www.solidware.com/sort/ 7. Read ANYTHING on the review CD (for example on the right side) or anything about computers on the web, for example at http://www.howstuffworks.com


 * Practice Algorithms with a Partner - 30 Mar 2012 **

[|Reviewing Algorithms (programming)] Practice writing algorithms on paper. Some hints: - start each algorithm on a new page - write on every second line, leaving space for corrections


 * JETS - 28 Mar 2012 **

SL+HL = [|StringBuffer] and JETS (app 2)


 * HL Paper 1 - 20-22 Mar 2012 **

HL students - Finish HL Paper 1 May 2011

SL students - do the algorithm questions on page 10 of the [|SL Summary] Write the answers on paper first. Then try running the program in Java to check your answers.


 * HL Paper 1 - 20-22 Mar 2012 **

Turn in homework (childrens' hospital). Make appointments for IA presentation interviews [|**SL Students -** Discuss these notes about Ubiquitous computing] Work together to write brief answers for as many questions as possible


 * HL Students -** Continue discussing HL Paper 1 May 2011

Structure of the CPU CPU Emulator


 * Continue 2011 SL Paper 1 - 19 Mar 2012 **

Continuing 2011 SL Paper 1

Homework : Write solutions to problem 11 about the childrens'[ hospital.


 * Interesting Videos - 16 Mar 2012 **


 * Homework - watch these 2 videos:**

Video about Binary accuracy disasters []

Japan's #1 Super Computer - K [|http://www.fujitsu.com/global/about/tech/k/movies/index.html#movie01]


 * Starting Review - 13 Mar 2012 **

Review CD (local copy at FIS) - v:\\Mulkey Dave\!ibreview2012\index.html Old ITGS Notes


 * Dossier Printing and Submission - 12 Mar 2012 **

Your dossier is due today. Get it printed and turn it in. It's probably best to use the 272-Color printer.


 * [HL] Traversals and Binary Search Trees - 22-24 Feb 2012 **

[|Traversals and Binary Search Trees]

[|Sample Binary Tree Program]


 * [HL] Trees - 20 Feb 2012 **

[|Trees Introduction]


 * Looking Ahead - 16 Feb 2012 **

. . . . . . . . . HL students - lectures about HL topics, especially **Trees**
 * 16-17 Feb** - Continue working on Dossier Documentation: [|Finishing the Documentation]
 * 20-24 Feb** - SL students - continue working on dossier in class
 * 25 Feb - 4 Mar -** Vacation
 * 5-9 Mar** - Work on dossiers for HL and SL
 * 12 Mar - Dossier due** - turn in printed pages
 * 19-23 Mar -** Individual appointments for an interview about the dossier - 25 min each
 * 19-30 Mar -** Further instruction for HL, review for SL
 * 1-15 Apr** - Vacation
 * 16-20 Apr** - Final week of HL instruction and SL review
 * 23-27 Apr** - Senior Study Week - class attendance is voluntary
 * May** - IB Exams


 * Documentation - 13 Feb 2012 **

Begin working on adding comments to your program, as described in [|Finishing the Documentation] Especially important is adding **pre-conditions** and **post-conditions** at the beginning of each method. This is required to achieve full credit in Criterion C1.


 * Turn in Your Program - 10 Feb 2012 **

You need to turn in your program today and let the teacher make comments about any necessary improvements.

Looking ahead to: [|Finishing the Documentation]

Before printing the program, you need to add **COMMENTS.** You might as well start doing this today. Follow the recommendations in the document above.


 * Get Your Program Finished - 7 Feb 2012 **

Be sure to get help from the teacher if you are stuck.
 * Reminder -** your program is due on Friday 10 Feb.


 * Writing Programs for Dossier Project - 9 Jan 2012 **

Plan on writing your programs in class this month. Be sure to ask questions during class so that you can work productively at home as well as during class.


 * Review for Mock Exams - 1 Dec 2011 **

IB Glossary (vocab)

Vocabulary Practice(should work now - download, unzip and start the JAR file)


 * Review for Mock Exams - 29 Nov 2011 **

SL Paper 2 from Mock 2008 (replace Case Study questions with these) Answers for P2 Mock 2008

HL Paper 2 from Mock 2010 (May 2010 + extra problem 3)

[|Mobile Phone Case Study]


 * Review for Mock Exams - 23-28 Nov 2011 **

Mock 2010 HL Paper 1

Mock 2010 SL Paper 1


 * OOP - Abstract Data Types for Dossier - 17 Nov 2011 **

Nov 2009 HL Paper 1 (home.fis.edu/instruction)

Nov 2009 SL Paper 1 (home.fis.edu/instruction)

Nov 2009 HL Paper 2 (home.fis.edu/instruction)

Nov 2009 SL Paper 2 (home.fis.edu/instruction)


 * Data-Structures for Stage B - 14-15 Nov 2011 **

Start writing section B1 Data Structures. Discuss your **data-structure** ideas individually with the teacher.


 * Stage B Design - 11 Nov 2011 **


 * Stage B Design is due on Monday 28 Nov.**

Continue writing stage B. Put effort into data structures, including sample data. Get help as needed.

As time permits, read Stage B in the Sample SL Project. Note that your section B2 Algorithms does NOT need as much detail as in the sample. The sample was written for a previous syllabus. You need to list the names of algorithms, with parameters and return values, but pseudocode or Java is not required. It WOULD be useful to include pre-conditions and post-conditions in most cases.

You need to make an appointment to spend at least 30 minutes with Mr Mulkey next week, during lunch or a free period.
 * Extended Essay Students**


 * Last Discussion of Algorithms - 2 Nov 2011 **
 * TEST ALERT - plan on a TEST on Monday 7 Nov**
 * about algorithm efficiency/complexity.**
 * Practice:** @http://ibcomp.fis.edu/sorting/PracSorts.html

Make sure you understand these notes: [] which is similar to this page: @http://math.hws.edu/javanotes/c8/s5.html

Kings : @http://dl.dropbox.com/u/239179/ibcomp/arrays/Kings.java
 * Today : Game Algorithms and Artificial Intelligence**


 * Various Algorithms - 1 Nov 2011 **
 * TEST ALERT - plan on a TEST on Monday 7 Nov**
 * about algorithm efficiency.**

Review various algorithms in the [|IBO list of algorithms] and discuss - their efficiency - appropriate data-structures

We can also discuss the **Knapsack Problem (packing boxes)** which is an extremely important algorithm problem in Computer Science.


 * Hashing - 31 Oct 2011 **
 * TEST - plan on a TEST on Monday 7 Nov**
 * about algorithm efficiency.**

Read the notes about HASHING on page 16 of Zonker

Then try out this sample HASHING program : @http://dl.dropbox.com/u/239179/ibcomp/files/HashSorter.java You'll need this data file: @http://dl.dropbox.com/u/239179/ibcomp/files/wordmess.txt

Then read about the Traveling Salesman problem: @http://dl.dropbox.com/u/239179/ibcomp/ibnotes/5-Big-O-efficiency.htm

and try out this applet : http://valis.cs.uiuc.edu/~sariel/research/CG/applets/tsp/TspAlg.html


 * Sorting and Other Algorithm Efficiencies - 27 Oct 2011 **

Bucket Sort : []

Compare and contrast a Bucket sort vs a Dictionary search.

Nov 09 HL P1 #19

[|Nov 06 HL P1 #9]

How does a QuickSort work? - [|http://www.cs.auckland.ac.nz/~jmor159/PLDS210/qsort.html] - []

State the Big-O efficiency of each of the following algorithms:

- sequential search (linear search)

- binary search

- bubble sort

- quicksort

Some other animations:

Towers of Hanoi


 * Merge Sort - 26 Oct 2011 **

[]
 * Merge Sort**
 * Video :** []
 * Explanation :**
 * Animation :** @http://math.hws.edu/TMCM/java/xSortLab/

[]
 * Homework reading about Algorithm Efficiency :**


 * Inserting into Large Lists - 25 Oct 2011 **

WordInserter - []


 * Sorting Large Lists - 21 Oct 2011 **

Continuing with Zonker - [] []


 * Zonker's Data Files Continued - 20 Oct 2011 **

How does an **index** work? How can you use this in your IA dossier?


 * Using Data Files - 19 Oct 2011 **

It does not need to be complete - maybe about half complete. There should be several entries in each column. The teacher will review your design and make suggestions for improvement.
 * Due Friday 21 Oct :** **Turn in your Design Overview**


 * Using Data Files :** []


 * Starting Design Stage B - 13-17 Oct 2011 **

**Starting Stage B of the IA Dossier Project**

** Circular Queue - 30 Sep 2011 **

Notes about Queues Circular Queue

**Homework : finish the Circular Queue program for the counseling office.**


 * After the break, we will continue with Stage B of the Internal Assessment project**

**Extended Essay students should do some work on their essays during the break -** **reading or preliminary writing.**

** Encapsulating Data Structures - 29 Sep 2011 **

Here is the code for inserting a teacher at the beginning of the queue: code count = count + 1; for(int p = count; p > 1; p = p-1) {              waiting[p] = waiting[p-1]; }           waiting[1] = new Teacher(name) code
 * Today :** Better queues for the Counselor

[HL] **Homework :** Change the counselor Queue program (above) to use a STACK instead of a Queue.

** Solution to Inserting Alphabetically - 28 Sep 2011 **

Solution to Inserting Alphabetically

Data Structures (Theory - read this as time permits)

Counselor Prototype(written with EasyApp for DrJava)

You need to copy each record ahead one position, and then decrease COUNT by 1.
 * Homework : write code to REMOVE the first name from the array**
 * when the [Next] button is clicked.**


 * Data Structures - 26 Sep 2011 **

Presentation about Linked-lists and Stacks and Queues

Data Structures - Read at home before Wednesday

Data RECORD Classes (reference reading for later)


 * Turn in IA Stage - 23 Sep 2011 **


 * EXTRA** : Gamers Solve Retrovirus Problem

@http://www.sciencedaily.com/releases/2008/05/080508122520.htm

@http://www.sciencedaily.com/releases/2011/09/110918144955.htm


 * Finish IA Stage 1 - 20-22 Sep 2011 **

Bring your IA Project to class to work on.


 * EXTRA** - Read this : Gamers Solve Retrovirus Enzyme Problem


 * Linked-lists - 19 Sep 2011 **


 * Linked-List Notes**

Savitch 14 (printed notes)


 * Linked-lists for Playlist - 16 Sep 2011 **


 * Playlist notes (HL only)**

HL students must now learn about **Abstract Data Types -** section 5 of the syllabus. SL students may use class time to work on the IA Dossier or work for other classes.


 * IA Deadline - Stage A is due on Friday 23 Sep, printed on paper**

sometime next week - probably at lunch.
 * Extended Essay Students** - you must organize a meeting with Mr Mulkey


 * Test - 14 Sep 2011 **


 * More about Networks, Bitwise Operations - 12-13 Sep 2011 **


 * [|Browsers and Search Engines]**


 * [|Network Applications]**


 * [|Binary in Networks]**


 * Bitwise Logical Operations**

**Graphics Filters with Bitwise Pixel Manipulations**

**Steganography Encryption**


 * Data Moving in the Internet - Fri 9 Sep 2011 **

How does data move around in the Internet? ** [|Follow Data] **

**We will have a TEST on Wed 14 Sep** - it will cover the Case Study and what we learn about Hardware and Networks this week and next. That will be sections 3.2, 3.3, 3.4, 3.7 for all students, PLUS 6.1-6.2 for HL students.
 * Hardware and System Fundamentals - Tue 6 Sep 2011 **

** Today: **[|Hardware Basics]


 * The Dossier (Project) Analysis - Mon 29 - Wed 30 Aug 2011 **

**Here is an interesting video connected to the Case Study.**

[]


 * The Dossier (Project) Analysis - Mon 29 - Wed 30 Aug 2011 **

**Class meets today in Room 289 (Mr Shoebottom's room)**

Continue working on the Stage A Analysis for your IA project.

If you haven't seen it already, [|viewing this PowerPoint Presentation about Stage A]will be useful.

Work on your project Analysis. We will continue this all next week. Students may also use this time to work on their Extended Essay. This is a chance to get lots of individual help from the teacher on both the project and the EE.
 * The Dossier (Project) Analysis - Fri 26 Aug 2011 **

The Dossier (Project) Analysis - Thu 25 Aug 2011
The following notes will guide you through the Internal Assessment project: Guidance Notes

Read these notes that connect user stories and goals to a prototype.

Discussing Hardware and Systems - Mon 22 Aug 2011
Scientific American Video about Ubiquitous Computing

Keep asking questions and discussing the Case Study.

Did anyone add interesting links to this wiki page ?

YES! Konstantin added a link to a very interesting TED video - well worth watching.

Mobile Phone Case Study - Fri 19 Aug 2011
Discuss the case study, especially vocabulary. Students may add their own notes and links to this wiki page.


 * == Mobile Phone Case Study - 17 Aug 2011 ==

Each year we have a new Case Study document for IB Computer Science. This discusses an up-to-date computer science topic in depth. Paper 2 of the IB examination contains questions about the Case Study. This year the Case Study is about **mobile phones**.

We will be studying sections 3 and 6 of the syllabus - these cover fundamentals of hardware and operating systems. We will include cell phones as examples where interesting hardware components and OS features are used. > Use a pen (or highlighter) to mark significant words and ideas on your paper. Plan on asking questions in class next time. || [|http://www.cityofsound.com/blog/2007] [|/01/convergent_thou.html] ||
 * **Today - read the case study** : [|Mobile Phone Case Study]

SL -[| SL Summary] -

HL -

[|Section 5 Notes]

[|RPN Calculator]