| SL+other |
HL+other |
Dossier |
Due Date |
1.1 Systems Life Cycle
pg 6 Class Activity (do indvidually)
Ex 1.1
|
6.1 Processor Configuration, 6.2 Manetic disc storage
Exercises 6.1, 6.2
|
Submit a 1 paragraph description of the problem you want to solve. Identify the user.
Grade a section A1 (page 1-6): list the grade i.e. 3/4 and state why it received this grade and what it could have done better |
|
Read Case Study
1.2 Systems analysis (class activity done in class)
1.3a System design
Exercise 1.2(#2 list 3, #3, make 3, #4 make 2 data flow diagrams related to the case study)
Make a class StudentGui.java
|
6.3 Operating systems and utilities
(Exercises 6.3, 6.4) |
Submit A1 |
Sept 4 |
1.3 Systems Designed Continued
Exercises 1.3 (use current case study, use min 5 input devices and 5 output devices)
Make your gui capable of reading all existing students when starting the program. STUDENTGUI.JAVA
|
6.4a Further network fundamentals
Exercises 6.5 |
Grade Tarek's A2 (page 7-8)
|
Sept 10 |
1.3 Systems Designed Continued
Exercise 1.4
Make your GUI capable of adding records.
STUDENTGUI.JAVA
Ihsan's studentgui code
More sample code for Student Gui |
6.4b Further Network Fundamentals continued
6.5 Computer/Perhipheral Communication
1. Describe how packet switching works.
Exercises 6.6 |
Submit A2
(Print dossier checklist and attach to the front of A2 with comments in the appropriate column)
Quiz on Monday: 1.3 and previous syllabus material.
|
Sept 18 |
1.3 System design continued
Exercise 1.5
Create a popup JFrame for editing students click here for a sample screenshot |
4.2 Boolean Logic
1.3 1-11
1.4 1-3
|
Grade Tarek's A3 |
|
1.3a Systems design
Description of System Flowcharts
Construct 3 System Flowcharts: library cataloging system, air traffic control and patient monitoring
Create an array filled with 20 random numbers. Create and implement a menu:
1. Fill array with random #s
2. Bubble Sort Array
3. Selection Sort Array
4. Perform Linear Search on Array
5. Perform Binary Search on Array
(break into 2 weeks)
Search Sort Algorithms from Wikipedia.org
starter code |
4.2 Boolean Logic Continued
Ask me for a web page printout of explanations and work.
|
October 2nd
Submit A3
Quiz next Monday. Handwritten program for any of the search or sort algorithms in this weeks programming assignment. System flowcharts. All previous IB work. |
|
1.4 Social Significance
Summarize the OECDs principles of data collection (pg25-26), state whether you think each is appropriate or not and why.
1.5 Software Life Cycle
Summarize the software life cycle and explain why it is cyclical. |
5.6 Algorithm evaluation
Read the Wikipedia entry for Big O:
http://en.wikipedia.org/wiki/Big_O_notation
and the book section on 5.6.
Explain what Big O Notation is. State and explain the efficiency (Big O) of the linear search, binary search, selection sort and quick sort.
Students need to appreciate that it is an approximation technique to allow gross comparisions between O(n) and O(n^2) for big n.
It is not micro level method ie 3n^3 has the same estimate as 4n^3+n^2+n+100, as n tends to very big the n^3 terms dominate and the others are less significant, hence both have O(n^3) efficiency.
|
Revise Sections A1-A3. Resubmit with graded originals attached. |
|
1.6 Software Design
1. Describe 'Modular Design'. Create a modular design for the StudentGui program we did. (4-6 Modules). Choose 1 of the modules and create a 'stepwise refinement' of that module- create another (4-6 modules that display that module in greater detail.)
2. Describe the advantages of prototyping.
1.7 Documentation
1. Describe the different types of system documentation and what they include.
2. Describe what 'user documention' is and what it includes.
|
|
October 16th
Mastery Factors: Review the 'Mastery Factors' and describe list the ones you will use in your program, along with a 1 sentence description or example of how you will use it.
Change: NO DOSSIER WORK
Quiz on Oct 16th: IB Material from this week as well as previous material. |
|
1. Describe the characteristics of linear and binary searches.(pg 122)
2. 3.5 Data representation. Convert these numbers to binary: 10, 35, 104, 324
Convert these numbers to decimal: 0100100, 11111111, 10101010
Exercises 3.15
|
|
A3 with test data
Review Tarek's B1
Write psuedocode similar to tarek's to implent your menu main screen. Include precondition, postcondition, use english wherever it is clearer. Use user defined methods wherever possible, use a switch menu if doing a text program. |
|
| |
|
Program your psuedocode into Java- demonstrate the shell of your program, with all main branches of the program working.
Submit B1
No quiz Nov 6th. |
Nov 6 |
3.5 Data Representation
Exercises 3.16
Exercises 3.17 |
|
Create a text file containing 3 records of data. Write the psuedocode for starting your program- reading the existing data file. Data should be read into an array or vector.
Quiz Nov 13th |
Nov 13 |
1. Write a menu driven program to 1) convert integers to binary 2) binary to integers 3) integer to 2s complement. All input output must be in 'main'. Use return values to return the conversion.
2. Wiki assignmenT
|
|
|
Nov 19 |
Exercises 3.5.6 Digital and Analog Data
Exercises 3.22, 3.23
|
|
Write Java code to start successfully by reading in and displaying several records from a file. Print a copy of the file, java code and screen shots. |
Nov 27.
Due four minutes 59 seconds into class.Quiz on 27th |
3.6 Errors
Exercises 3.24
3.7 Utility Software
Exercises
3.25
Wiki assignmenT |
|
Write psuedocode to 1) add a record to your file.
2) exit your program correctly, including writing any new records to disc |
Dec 3
Due 4 minutes 59 seconds into class.
Quiz next class: Review IB LANs, WANs, data-transfer speeds, digial to analogu, parity checking, viruses, and sensors. |
| |
|
Late assignments accepted until 3pm Monday. Semester exams will be a mock exam(SL/HL as appropriate) (no programming). |
|
| |
|
1. Program previous psuedocode: your program should be able to add a record to a file, exit correctly and show that the record is still there when the program.
2. Write psuedocode to delete a record and edit a record.
|
Due Jan 14th 4.59 into class.
Quiz on Monday January 20th. Quiz is 1-7 from Nov 2002 mock exam (given to you previously).
|
| |
|
1. List each of the mastery factors you will use and explain how you will use it.
2. Complete wiki assignment.
3. Write psuedocode for at least 2 more sections of your program.
|
Due Jan 22th 4.59 into class. |
| MIC, CPU architecture |
|
1. Complete all psuedocode and submit B2. Staple a copy of your goals to your psuedocode. Next to each goal, write the page number where that goal is implemented in the psuedocode.
2. Submit evidence of at least 1 new major section programmed. |
Due Jan 29 |
| |
|
1. Complete all programming. |
Feb 5 |
| |
|
1. Submit B1-B3 (attach old B1+2 with corrections) Attach Dossier guideline to the front, with your comments included for section B. |
Feb 12 |
| |
|
1. Submit C1
2. Submit C2
3. Submit C3
4. Submit D1
Attach Dossier guideline to the front.
|
Feb 19 |
| |
|
1. Submit D2
2. Submit D3
Attach Dossier Guideline to the front. |
Feb 26 |
| |
|
Submit final Dossier. |
Mar 5 |
1. Make an outline of the case study.
2. Study Paper 2 November 2005. |
|
|
Mar 11
Quiz on this weeks content |
1. Study Paper 2 November 2005
2. Study case study
3. Compare page 18 of the case study and the syllabus. For each topic (1.1-1.7), suggest one question that could be asked on the IB exam. (Submit by midpoint of class Tuesday, Mar 13th) |
|
|
Thursday Mar 15 Quiz on Paper 2 Nov 2005, incl Case Study |
1. Study the MIC cycle in detail at http://www.ib-computing.com/program/core/architecture.html. Make sure you can sketch the CPU, make a diagram of the MIC cycle and understand the flash demo.
2. Grade partners March 11 Quiz
|
|
|
Mar 28(Quiz) |
| |
|
|
Apr 2 |
| |
|
|
Apr 9 |
| |
|
|
May 8 afternoon Paper 1
May 9 morning paper 2 |
Poster showing design cycle. Rubric for poster. Due end of class May 16th. (Wed).
Roll294KP.java (source files on server)
Place your dossier source files on the server under your name.
|
Make a prototype for a game, involving dice, cards or any other static graphics. |
|
Due beg of class May 20th (Mon) |
| |
Game program must be submitted by Thursday May 24th end of class. Game should include 1) good programming style, 2) graphical interface, 3) at least 2 user defined classes 4) at least 2 methods with useful return value |
|
|
| |
|
|
|
| |
|
|
|
| |
|
|
|
| |
|
|
|
| |
Java API 
