space.menu

Home Assignments to Date In Class Assignments Three Assessments: 1. Dossier = 35% Remaining 65% = 2. Paper 1 - Subject Knowledge 3. Paper 2 - CASE STUDY CASE STUDY WIKI 2011 [|Computer History] [|Language Translators] [|Data Errors] [|Software Utilities] [|Computer Memory] [|Hard Drives]
 * 2010-2011**
 * IB HL Student Requirements**
 * TOPICS**
 * Computer System Fundamentals **
 * Computer Architecture **
 * [|CPU & Machine Cycle]
 * [|Program Execution Demo]
 * [|IAS]- FETCH CYCLE of the CPU
 * [|Computer Memory]
 * [|Microprocessor]
 * [|Peripherals]
 * [|Recent Developments]
 * Computer Systems **
 * [|Operating Systems]
 * [|Data Processing Types]
 * [|Reliability]
 * Networked Computer Systems **
 * [|Basics]
 * [|parity bits]
 * [|Software]
 * [|Applications]
 * [|Browsers & Search Engines]
 * Data Representation**
 * [|Number Systems]
 * [|Analog/Digital Data]

[|Binary & Hex Addition] [|Hex Addition] [|Adding Binary Numbers] [|Signed Binary Numbers] [|Bit Overflow] [|Convert Dec to Binary] [|Convert Dec to Hex] [|Convert Hex to Binary] [|Convert Hex to Decimal] [|Decimal to Floating Pt. Conversion] //Number Sys Exercises// [|Decimal-Binary Worksheet] Binary Math Worksheet [|Binary-Hex Worksheet] [|Decimal-Hex Worksheet] [|Two's Complement Practice] Binary Math Review
 * Number Systems**
 * [|Adding Signed Binary Numbers]

Software Development Cycle1 [|Software Development Cycle2]

[|Java Logic Operators] [|Boolean Logic] [|Boolean Logic+] [|Simplifying Exp1] [|Simplifying Exp2] [|Karnaugh Maps] [|--KM Practice1] [|--KM Practice2] [|--KM Practice3] [|Logic Circuits] [|Adders] [|Circuit Examples] [|More Boolean]
 * Logic**

Jan. 2011 Java Data Structures [|Objects and References] [|Polymorphism] [|Recursion-wikipedia] [|Recursion stack] ||  ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||   || [|Recursion Practice] || [|Java Linked List Specs] [|Dynamic Linked Lists] [|Doubly linked list Demo] [|BigO Comparisons] || [|Stack Uses1] [|Stack Uses2] || [|Queue Uses1] [|Queue Uses2] || [|Binary Tree Demo] [|Binary Tree Demo] || [|Infix to Postfix] [|Infix to Postfix - w/parenthesis] [|Reverse Polish Notation (RPN) - See Example] [|Infix to Postfix - Try it!]
 * [|Data structures in Java]
 * [|Recursion]
 * [|Nodes and linked lists]
 * [|ADT Stack]
 * [|ADT Queue]
 * [|Binary Tree]
 * [|Traversing a binary tree]


 * Searching & Sorting**

[|Sorting Algorithms Wiki] || [|Heap] [|HeapSort] ||  || IDEs JavaBeans Eclipse IDE
 * **Sorting Algorithms1**
 * Sorting Algorithms2**

Review Presentation Topics Videos Exams Case Study [|Resources] Topics to Know! Extended Essays Glossary Linux Info Readings PowerPoints

2009-2010 HW Assignments Syllabus Lesson1 Intro to Programming Lesson2 Program Structure Lesson3 Syntax & Errors Lesson4 Control Statements Lesson5 Defining Classes Lesson6 Boolean Expressions Lesson7 User Interfaces Lesson8 Arrays/Sorting Lesson9 File I/O