| Planned Completion Date |
SL |
HL |
Dossier |
| Aug 26 |
1.1 System Life Cycle
Page 6 class activity, complete as an individual. No report or presentation. Complete exercise 1.1.
|
4.1 Number Systems and Representations
Complete Exercise 4.1, 4.2, 4.3 (1-2), 4.4, 4.12, 4.13(1-4), write a program that demonstrates what happens when an integer becomes to large (overflow) or a number becomes to close to zero (underflow).
(www.learner.org/resource...did=34230%pid=304#
2s complement http://www.artima.com)
|
Submit a description of the problem you want to solve. List the mastery factors and how you will address them. |
| Sep 1 |
1.2 System Analysis
Class activity: identify 2 additional examples in each category. |
4.2 Boolean Logic
(online resource)
www.pontybrenin.freeserve.co.uk/logic
Complete Exercises 4.14, 4.16, 4.17, 4.18 (not 1!),
|
Criterion A1: Analysing the problem. On top should be your Achievement Level and justification. |
| Sep 8 |
1.3 System Design
Exercises 1.2 (for #2 list 3 situations, for #4 draw 2 data flow diagrams, skip #4) Skip 1.3 Exercise 1.4, 1.5 |
5.1 Terminology
Complete Exercises 5.1 (not 1), 5.2, 5.3, |
A2: Criteria for Success
Resubmit list of mastery factors. |
| Sep 15 |
1.4 Social Significance and Implications of Computer Sys
Page 27 Class Activity #1, 2(speculate, ask me). Summaryize 1.4.3 (100 words) and 1.5 The Software Life Cycle(100 words) |
7.1 File Organization |
|
| Sep 22 |
Read (no exercises):
1.6 Software Design
1.7 Documentation |
5.4 Objects in Problem Solutions |
A3: Prototype solution. Include the following sections:
1) Initial Design 2) Prototype 3) Discussion with User (may be integrated comments next to prototype) 4) Revised Goals |
| Sep 29 |
2.1 Program Construction in Java
Exercises 2.20(a,b,c), 2.21, complete trace on page 127
|
5.2 and 5.3 Static+Dynamic Data Structures
Read all of 5.2. Complete 5.7 (1-4), 5.8 (1-4), 5.10(includes a program) and 5.13
|
|
| Oct 7 |
|
|
Submit revised A1, A2, A3 with the old version attached. Should be ready to submit to IB. |
| Oct 14 |
3.1 Language Translators
Ex 3.1 (not 9), 3.2 |
5.5 Recursion
Ex 5.19 #1-2 |
B1: Data Structures. Sample data, sketches/illustrations, discussion of the way data objects will change during program execution. Consider: any classes you will use, any arrays you will use, any data that will be stored in memory and data that will be stored on disk. |
| Oct 21 |
3.2 Computer Architecture
Exercises 3.3, 3.4 (not 12), 3.5, 3.6 (4 input devices for #1, not #15), 3.7 (4 output devices for #1)
|
5.6 Algorithm Evaluation
Big-O: www.skylit.com/jmethods.html
Exercises 5.20 (1-4)
|
|
| Oct 28 |
3.3 Computer Systems
Exercises 3.8(1+2), Exercises 3.9 (not 2), Exercises 3.10, 3.11 |
6.1 CPU Configuration
Exercises 6.1
6.2 Disk Storage: Exercises 6.2
6.3 Operating Systems (Exercises 6.3, 6.4)
|
|
| Nov 11 |
3.4 Networked Computer Systems
Exercises 3.12 (not 6), 3.13 (both!, 1-14 only on the 1st) |
6.4 Further Network Fundamentals
Exercises 6.5
|
B2: Detailed Design. I suggest listing the most important algorithms you will use. Show a draft of the code used to execute them. Show the signature in bold. Use comments to state the pre and post condition. |
| Nov 18 |
3.5 Data Representation
Exercises 3.15, 3.16, 3.17, 3.18, 3.19, 3.20, 3.21, 3.22, 3.23
3.6 Errors Exer 3.24
3.7 Utility Exer 3.25
|
I know the SL assignment is long, but it is mostly easy, there is no HL component and no Dossier component this week. |
|
| Nov 23 |
|
6.5 Computer/Peripheral/Communication (Exercises 6.6) |
B3: Modular organization
Present in a way similar to either p112 or p113 of the Support Material. |
| Nov 25 |
|
|
|
| Dec 1 |
|
DeMorgans Laws and Karnaugh Maps
Precalc pg 25 #1-8, 17, pg 32 #1-4
Exercises 4.22
|
Revise B1-B3 (start with B1+B2) |
| |
|
|
|
| Jan 19 |
|
List and describe and how you will meet criterions C1-C3. Make a plan for completing your programming by Feb 23rd. List what functions of the program will be complete by what dates. Plan on just 1 class per week for programming. (You need to do the majority of the programming at home.) Start a blog. For each week, make an entry evaluating your own progress. Include I/O to demonstrate what is complete. If you can't test it - it doesn't work. Put everything on your blog and email me the link.
Page 1-4 of binary numbers revew from ib-computing.
|
|
| Jan 26 |
|
Program, program, program (including at home) Meet your programming objectives for the week. Post the results on your blog and included evidence. Give yourself a grade (A-F) for meeting your own objective. Print your blog entry and turn in. |
|
| Feb 2 |
|
Include a list (again) of the mastery factors you will demonstrate. Explain how. Indicate which ones you have already demonstrated and which ones remain. |
|
| Feb 9 |
|
|
|
| Feb 16 |
|
|
|
| Feb 23 |
|
PROGRAM DUE |
|
| Mar 2 |
|
WWW |
|
| Mar 9 |
|
Usability (1 page)
Handling Errors (1-2 pages)
Annotated Hard Copy (Variable)
(-4 pts if program is still not completed) (-2 pts for each section not turned in) |
|
| Mar 16 |
|
Evaulation of Solutions (2 pages)
User Documentation (6 pages)
Documentation of Master Aspects (2 pages) |
dossier.htm |
| Mar 23 |
|
Complete (Revised) Dossier Due to me |
Dossier.htm
|
| Mar 30 |
|
Complete Dossier Due from me to Hurley |
|
| Apr 6 |
|
|
|
| Apr 13 |
|
|
|
| May 4 |
|
Exams May 2nd and May 3rd |
|
| May 11 |
|
|
|
| May 18 |
|
Poster about Dossier project |
|
| May 25 |
|
|
|
Java API 