Spreadsheet: 84199d1284191287-combine-hyperlink-with-lookup-time-table-2010-2011
Sheet: Year 13 HL Lecture Plan

 |  | Topics Covered | Notes | Additional Slides | Book Exercises | General Revision Questions | Quiz | Fill in the blanks | Programs | Applets | Videos
Week 1
Single | 1 | 2.1.1-3 DATA TYPES, DATA STRUCTURES AND CONSTRUCTS IN JAVA | Topic 2.1 Program Construction in Java.docx | Lecture 01 - Introduction.ppt
 |  | VARIABLES AND TYPES |  | Lecture 02 - Variables.ppt |  |  | Variables and the Assignment Statement Quiz.mht | Floating Point 2.mht | Variables and the Assignment Statement.mht
Double
 |  | [NAME] AND APPLICATION OF JETS PRIMITIVES
 |  | ASSIGNMENT |  |  | Exercise 2.1
 |  | BEYOND PRIMITIVES |  |  |  |  | Primitive Data Quiz.mht |  | Primitive Data.mht
 |  | INPUT/OUTPUT |  | Lecture 04 - User Input.ppt | Exercise 2.2 |  |  | Input and Output 2.mht | Input and Output.mht
 |  |  |  |  |  |  |  | File Input Techniques 2.mht | File Input Techniques.mht
 |  |  |  |  |  |  |  | Introduction to Java.mht
 |  |  |  |  |  |  |  | Small [NAME]
Double | 2 | ARITHMETIC OPERATORS | Topic 2.1 Program Construction in Java.docx | Lecture 03 - Arithmetic Expressions |  |  | Expressions and Arithmetic Operators Quiz.mht | Boolean Expressions 2.mht | Boolean Expressions.mht
 |  |  |  |  |  | 2Arithmetic Expressions Worksheet 2.php.pdf
 |  |  |  |  |  |  |  |  | Expressions and Arithmetic Operators.mht
 |  | PRECEDENCE |  |  | Exercise 2.3
 |  | MATHEMATICAL FUNCTIONS
 |  | CASTING
 |  | PROGRAM [NAME]
Half Double | 3 | SEQUENCE | Topic 2.1 Program Construction in Java.docx
 |  | CONSTRUCTING A MODULAR PROGRAM
 |  | SCOPE OF IDENTIFIERS
 |  | PARAMETERS |  |  | Exercise 2.4 |  |  | Method Parameters.mht
 |  | METHOD SIGNATURES
Week 2
Double | 4 | SELECTION | Topic 2.1 Program Construction in Java.docx | Lecture 05 - Conditional Statement and Expressions (Part 1).ppt | Exercise 2.5 |  | The if Statement Quiz.mht |  | The if Statement.mht
 |  |  |  | Lecture 06 - Conditional Statement and Expressions (Part 2).pptx |  |  | The Single Branch if Statement Quiz.mht |  | The Single Branch if Statement.mht
 |  | NESTING |  |  | Exercise 2.6 |  |  | Nesting Loops and Ifs 2.mht | Nesting Loops and Ifs.mht
 |  | MULTIPLE SELECTIONS |  |  | Exercise 2.7
Week 3 |  |  |  | Lecture 07 - While loops.pptx |  |  | Counting Loops Quiz.mht | Loops and the while statement 2.mht | Loops and the while statement.mht | More about the for Statement.mht
 |  |  |  | Lecture 08 - do While loops.pptx |  | If statement.php.pdf | More about the for Statement Quiz.mht |  |  | The Conditional Operator and the switch Statement.mht
 |  |  |  | Lecture 09 - For loops.pptx |  |  | The Conditional Operator and the switch Statement Quiz.mht
Single | 5 | REPETITION | Topic 2.1 Program Construction in Java.docx |  |  |  |  |  |  | The do Statement.mht
 |  |  |  |  |  |  | The for Statement Quiz.mht |  |  | The for Statement.mht
Double |  | Tracing loops |  |  |  | 11Tracing Algorithms.php.pdf
 |  | CLASSES, USER-DEFINED METHODS AND OBJECTS |  | Lecture 10 - Methods.pptx | Exercise 2.8 |  | Object Data Quiz.mht | Class Design Example (checking account).mht | Class Design Example (miles per gallon) 2.mht
 |  |  |  | Lecture 12 - Introduction to Objects.pptx |  |  | Object References Quiz.mht | Class Design Example (miles per gallon).mht
Double | 6 | CLASSES, USER-DEFINED METHODS AND OBJECTS | Topic 2.1 Program Construction in Java.docx | Lecture 13 - Objects (cont...).ppt |  |  | Objects Quiz.mht | Defining your own Classes.mht
 |  | CLASSES AND EXCEPTIONS |  | Lecture 14 - Classes.ppt | Exercise 2.9 |  | Exceptions and Errors Quiz.mht |  | Exceptions and Errors.mht
 |  |  |  | Lecture 15 - Constructors.ppt |  |  | More about Exceptions Quiz.mht |  | More about Exceptions.mht
Half Double | 7 | CLASSES AND EXCEPTIONS | Topic 2.1 Program Construction in Java.docx | Lecture 16 - Playing with Objects.ppt
 |  |  |  | Lecture 17 - Classes and Exceptions.pptx |  | 7Methods Worksheet 2.php.pdf
 |  | STATIC METHODS |  |  |  |  |  | Parameters, Overloading, Local Variables.mht
 |  | PRIMITIVES VERSUS OBJECT REFERENCES
Week 4
Single | 8 | ARRAYS OR LISTS OF VALUES | Topic 2.1 Program Construction in Java.docx | Lecture 11 - Arrays.pptx | Exercise 2.10 |  | Introduction to Arrays Quiz.mht |  | Introduction to Arrays.mht
 |  |  |  |  |  |  | Two-dimensional Arrays Quiz.mht |  | Two-dimensional Arrays.mht
Double |  |  |  |  |  |  | Arrays as Parameters Quiz.mht
 |  |  |  |  |  |  | ArrayLists and Iterators Quiz.mht | Arrays as Parameters 2.mht | Arrays as Parameters.mht
 |  |  |  |  |  |  | [NAME] |  | [NAME]
 |  | RECORDS AND CLASSES |  |  |  |  | If,  Numbers, Loops, [NAME], Arrays Quiz.mht
 |  | DATA FILES
Double | 9 | CHARACTER-BASED FILESTREAMS | Topic 2.1 Program Construction in Java.docx |  |  |  | Input and Output Streams Quiz.mht
 |  |  |  |  | Exercise 2.11
Half Double | 10 | CHARACTER-BASED FILESTREAMS | Topic 2.1 Program Construction in Java.docx |  |  |  | Reading Text Files Quiz.mht |  | Reading Text Files.mht
 |  |  |  |  |  |  | Writing Text Files Quiz.mht |  | Writing Text Files.mht
Week 5
Single | 11 | HIGHER LEVEL FILE HANDLING | Topic 2.1 Program Construction in Java.docx
Double
Double | 12 | 2.14 TRACING ALGORITHMS IN JAVA | Topic 2.1 Program Construction in Java.docx
 |  | 2.15 EVALUATE ALGORITHMS IN JAVA |  |  | Exercise 2.16
 |  | COMMON PITFALLS IN USING STRING INSTANCES AND METHODS
 |  | CONCATENATION
 |  | SUBSTRINGS |  |  |  |  | More about Strings Quiz.mht |  | More about Strings.mht
 |  | EXAMPLE OF STRING MANIPULATION |  |  | Exercise 2.17 |  | Strings and Object References Quiz.mht |  | Strings and Object References.mht
 |  | OTHER METHODS OF THE STRING CLASS |  |  | Exercise 2.18
Half Double | 13 | 2.16 CONSTRUCT ALGORITHMS IN JAVA | Topic 2.1 Program Construction in Java.docx |  | Exercise 2.19
 |  | 2.1.7 EXPLAIN THE NEED FOR SEARCHING AND SORTING
 |  | 2.18 APPLY SPECIFIED SEARCHING AND SORTING ALGORITHMS |  | Lecture 20 - Searching and Sorting.ppt
 |  | SEQUENTIAL (LINEAR) SEARCH |  |  |  |  | Arrays of Objects and Linear Search Quiz.mht |  | Arrays of Objects and Linear Search.mht | Linear Search Applet.mht
Week 6
 |  | [NAME] | Topic 2.1 Program Construction in Java.docx |  |  |  |  |  |  | Binary Search Applet.mht
 |  | [NAME]
Single | 14 | SORTING |  |  |  |  |  |  |  | Sorting Algorithms Applet.mht | Sorting Algorithms Video.mht
 |  | BUBBLE SORT |  |  | Exercise 2.19 (2)
Double |  | SELECTION SORT
Double | 15 | COMPARE THE EFFICIENCY OF SEARCHING AND SORTING ALGORITHMS | Topic 2.1 Program Construction in Java.docx
 |  | 2.1.10 DISCUSS THE EFFICIENCY OF SEARCHING AND SORTING ALGORITHMS |  |  | Exercise 2.20
 |  | FURTHER EXAMPLE ALGORITHMS AND ACTIVITIES
 |  | 2.1.11 PROGRAMMING ERRORS
 |  |  |  |  | Exercise 2.21
Half Double | 16 | Past Papers Java.doc
Week 7
Single | 17
 |  | Exam Questions.docx
Double |  | TEST
Double | 18 | 6.1 CPU CONFIGURATION | Topic 6.1 CPU Configuration.docx
 |  | 6.1.1/2FUNCTIONS OF THE ACCUMULATOR, INSTRUCTION REGISTER AND PROGRAM COUNTER
 |  | 6.1.3 FUNCTION OF THE INTERRUPT REGISTER
 |  | 6.1.4 ROLE OF A BUS TO LINK THE PROCESSOR UNIT, RAM, ROM AND CACHE
 |  | What is a BUS?
 |  | Data Bus
 |  | Memory Bus
 |  | The role of CACHE |  |  | Exercise 6.1
Half Double | 19 | 6.2 DISK STORAGE | Topic 6.2 Disk Storage.docx | May 2008 Paper 1 HL.pdf
 |  | 6.2.1 ROLE OF BLOCKINC, SECTORS, CYLINDERS AND HEADS IN STORAGE
 |  | Blocking
 |  | Sectors, Tracks and Cylinders
 |  | Read/write Heads
 |  | 6.2.2 DISK ACCESS TIME |  |  | Exercise 6.2
Week 8 | 20
Double |  | Test
Half Double | 21 | 6.5 COMPUTER/ PERIPHERAL/ COMMUNICATION | Topic 6.5 Computer Peripheral Communication.docx
 |  | 6.5.1 DEFINE PORT AND HANDSHAKING
 |  | Port
 |  | Handshaking
 |  | 6.5.2 DEFINE DIRECT MEMORY ACCESS (DMA) AND BUFFER
 |  | Buffers
 |  | 6.5.3 DEFINE INTERRUPT AND POLLING
 |  | Interrupt
 |  | How does the interrupt mechanism work?
 |  | Polling
 |  | Summary of interrupt operation:
Week 9 | 22
Single |  | 6.5.4 EXPLAIN HOW PERIPHERAL DEVICES ARE CONTROLLED WITH REFERENCE TO PRINTER, MODEM AND DISK DRIVE | Topic 6.5 Computer Peripheral Communication.docx
 |  | Printers
 |  | Modem
Double |  | Disk drive
 |  | 6.5.5 COMPARE THE FEATURES OF DMA, INTERRUPT SYSTEMS AND POLLING SYSTEMS
 |  | 6.5.6 COMPARE THE FEATURES OF SERIAL AND PARALLEL INTERFACES
 |  | Serial interface features
 |  | Parallel interface features |  |  | Exercise 6.6
Double | 23 | 5.1 TERMINOLOGY | Topic 5.1 Terminology.docx
 |  | 5.1.1 DEFINITIONS
 |  | Identifier
 |  | Operand
 |  | Operator (unary and binary):
 |  | Unary Operator
 |  | Binary Operator
 |  | Actual parameter (Argument)
 |  | Formal Parameter |  |  | Exercise 5.1
 |  | Parameter Passing Example
 |  | Infix notation
 |  | Postfix notation
 |  | Prefix notation
 |  | 5.1.2 DEFINITION OF A STACK, [NAME] AND BINARY TREE.
 |  | STACK DATA STRUCTURE
 |  | [NAME] STRUCTURE
 |  | OPERATIONS ON STACKS AND QUEUES |  |  | Exercise 5.2
 |  | DEFINITION OF A BINARY TREE
Half double | 24 | 5.1.3 USES OF STACKS | Topic 5.1 Terminology.docx
 |  | 5.1.4 USES OF QUEUES |  |  | Exercise 5.3
 |  | 5.1.5 DISCUSS THE FEATURES AND APPROPRIATE USAGE OF BINARY TREES.
Week 10
 | 25 | 5.2 STATIC DATA STRUCTURES | Topic 5.2 Static Data Structure.docx
 |  | 5.2.1 - 5.2.2 QUICK SORT |  |  | Exercise 5.5
Single |  | TRACE OF THE QUICK SORT ALGORITHM
 |  | 5.2.3 CONSTRUCTING HASH TABLES |  |  | Exercise 5.6
Double |  | Generating hash codes
Double | 26 | 5.2.4-5.2.5 STACKS | Topic 5.2 Static Data Structure.docx |  | Exercise 5.7 |  |  |  |  | Stack Applet.mht
 |  |  |  |  |  |  |  |  |  | Stack Applet 2.mht
 |  | PUSH algorithm
 |  | POP algorithm
Half Double | 27 | 5.2.6-5.2.7 QUEUES | Topic 5.2 Static Data Structure.docx |  | Exercise 5.8 |  |  |  |  | Cyclical Queue.mht
 |  |  |  |  |  |  |  |  |  | [NAME]
Week 11
 |  | 5.3 DYNAMIC DATA STRUCTURES | Topic 5.3 Dynamic Data Structures.docx
Single | 28 | 5.3.1 DEFINITION OF AN OBJECT REFERENCE
 |  | 5.3.2 ALGORITHMS THAT USE REFERENCE MECHANISMS
Double |  | 5.3.3-6 LINKED LISTS: SINGULAR, DOUBLE AND CIRCULAR |  |  | Exercise 5.9 |  |  |  |  | Linked List Applet.mht
 |  |  |  |  |  |  |  |  |  | Linked List Applet 2.mht
 |  | Operations on Linked Lists
 |  | 5.3.6 OTHER STYLES OF LINKED LISTS
Double | 29 | 5.3.7-8 DYNAMIC STACK | Topic 5.3 Dynamic Data Structures.docx |  | Exercise 5.10
 |  | 5.3.9·10 DYNAMIC QUEUE
Half Double | 30 | 5 .3.11-14 BINARY TREES | Topic 5.3 Dynamic Data Structures.docx |  | Exercise 5.13 & 5.14
 |  | TRAVERSING A TREE |  |  |  |  |  |  |  | Binary Tree Traversal Applet.mht
 |  | USING TREES TO EVALUATE ARITHMETIC EXPRESSIONS
 |  | DELETE OPERATION
 |  | LOGICAL AND PHYSICAL REPRESENTATIONS OF DYNAMIC DATA STRUCTURES
Week 12
 | 31 | 5.4 OBJECTS IN PROBLEM SOLUTIONS | Topic 5.4 Objects in Problem Solutions.docx
Single |  | 5.4.1 FEATURES OF AN OBJECT
 |  | 5.4.2 ENCAPSULATION |  |  |  |  | Encapsulation and Visibility Modifiers Quiz.mht |  | Encapsulation and Visibility Modifiers.mht
Double |  | 5.4.3 BASIC FEATURES AND ADVANTAGES OF INFORMATION AND DATA HIDING
 |  | 5.4.4 POLYMORPHISM |  |  |  |  | Abstract Classes and Polymorphism Quiz.mht
 |  |  |  |  |  |  | More about Polymorphism Quiz.mht
 |  | 5.4.5 INHERITANCE |  |  | Exercise 5.17 |  | Introduction to Inheritance Quiz.mht
 |  | 5.4.6 ALGORITHMS WITH OBJECTS
 |  | ADVANTAGES AND DISADVANTAGES OF OBJECTS
Double | 32 | 5.5 RECURSION | Topic 5.5 Recursion.docx |  |  |  | Introduction to Recursion Quiz.mht |  | Introduction to Recursion.mht
 |  | 5.5.1 DEFINITION OF RECURSION |  |  | Exercise 5.18 |  | Examples of Recursion Quiz.mht |  | Examples of Recursion.mht
 |  | 5.5.2 ADVANTAGES AND DISADVANTAGES OF RECURSION |  |  |  |  | More Recursion Quiz.mht |  | More Recursion.mht
Half Double | 33 | 5.5 RECURSION | Topic 5.5 Recursion.docx
 |  | 5.5.3-5 USING RECURSION |  |  |  |  | Recursion in Java Quiz.mht |  | Recursion in Java.mht
 |  | EXAMPLE 1: FIBONACCI NUMBERS |  |  |  |  |  |  |  | [NAME]
 |  | EXAMPLE 2: ACKERMAN'S FUNCTION
 |  | EXAMPLE 3: RAISING TO A POWER I.E. XN
 |  | EXAMPLE 4: USING RECURSION TO COUNT THE NUMBER OF VALUES IN A LINKED LIST. |  |  | Exercise 5.19
Week 13
 |  |  | Topic 5.6 Algorithm Evaluation.docx
 | 34 | 5.6 ALGORITHM EVALUATION
Single |  | 5.6.1-2 EFFICIENCY OF ALGORITHMS
 |  | The Big O notation
Double |  | Efficiency comparison of various ways to calculate Fibonacci numbers
Double | 35 | Summary of complexities | Topic 5.6 Algorithm Evaluation.docx
 |  | Summary of common O complexities |  |  | Exercise 5.20
 |  | 5.6.3 -4 ORGANISING AND EVALUATING DATA STRUCTURES AND ALGORITHMS TO SUIT PROBLEMS
Half Double | 36 | REVISION |  |  | Exercise 5.21
Week 14
Single | 37 | Computer science HL paper 1.pdf
 |  | TEST
Double
Double | 38 | Computer science HL paper 1.pdf
Half Double | 39 | TEST CORRECTION
Week 15 | 40
Single |  | November 2008 Paper 1 HL.pdf
Double
Week 16
 |  | 7.1 FILE ORGANISATON
Double | 41 | 7.1.1 DEFINITION OF THE TERM KEY FIELD |  |  | Exercise 7.1
 |  | 7.1.2-3 SEQUENTIAL FILE ORGANISATION |  |  | Exercise 7.2
Double Half | 42 | 7.1.5 FULLY INDEXED FILE |  |  | Exersise 7.3
 |  | 7.1.6 DIRECT FILE ORGANISATION
 |  | Standard File Direct Access Algorithm |  |  | Exercise 7.4
Week 17
 |  | 7.1.7 FIXED AND VARIABLE LENGTH RECORDS
 |  | 7.1.8 THE USE OF HASHING TO FACILITATE FILE ACCESS |  |  | Exercise 7.5
Single | 43 | 7.1.9 COMPARISON OF THE SPEED OF ACCESS AND STORAGE REQUIREMENTS FOR THE VARIOUS FILE TYPES
 |  | Storage requirements
Double |  | Speed comparision
 |  | 7.1.10 LOCICAL AND PHYSICAL ORCANIZATION OF DATA
Double | 44 | 7.1.11 EXTERNAL SORTS
Half Double | 45 | 7.1.12 EXAMPLES OF DIRECT ACCESS FILE HANDLING |  |  | Exercise 7.6 & 7.7
Week 18
Single | 46 | CASE STUDY
Double
Double | 47 | CASE STUDY
Half Double | 48 | CASE STUDY
Week 19
Single | 49 | CASE STUDY
Double
 |  | 3.5 DATA REPRESENTATION |  |  |  | 3.5 Data Representation.doc
Double | 50 | APPLICATION OF THIS RELATIONSHIP |  |  |  | Topic 3.5 Additional HW.php.pdf
 |  | Pixel Colour Intensity |  |  | Exercise 3.15
Week 20
 |  | 3.5.2 NEED FOR STANDARD FORMATS FOR DOCUMENTS AND GRAPHICS |  |  | Exercise 3.16
 | 51 | Answers
Single |  | ASCII |  |  | Exercise 3.17
 |  | 3.5.3 EXPRESS NUMBERS IN DECIMAL, [NAME] AND HEXADECIMAL |  |  |  |  | Binary Numbers Quiz.mht |  |  |  | Binary Numbers  Video.mht
Double |  | THE BINARY NUMBER SYSTEM
 |  | TEST
Double | 52 | 3.5.4 CONVERSION OF NUMBERS IN DECIMAL, [NAME] AND HEXADECIMAL |  |  | Exercise 3.18 & 3.19
 |  | CONVERTING BETWEEN BASES
 |  | CONVERTING BETWEEN BINARY AND HEXADECIMAL NUMBERS
 |  | CONVERTING BINARY TO DECIMAL |  |  | Exercise 3.20
Half Double | 53 | 3.5.5 REPRESENTING INTEGERS
 |  | Negative numbers |  |  | Exercise 3.21
Week 21
 | 54 | 3.5.6 DEFINE ANALOG AND DIGITAL DATA |  |  | Exercise 3.22
Single |  | 3.5.7 CONVERSION FROM DIGITAL TO ANALOG
 |  | 3.5.8 APPLICATIONS OF CONVERSION |  |  | Exercise 3.23
Double
 |  | INTRODUCTION
Half Double | 55 | 4.1.1-3 CALCULATE IN BINARY, DECIMAL AND HEXADECIMAL
 |  | ADDITION OF HEX VALUES
 |  | RULES OF HEX ADDITION |  |  | Exercise 4.1
 |  | REPRESENTING INTEGERS |  |  | Exercise 4.2
 |  | REPRESENTING NEGATIVE NUMBERS
Week 22
 |  | Why THE 2's COMPLEMENT ALGORITHM WORKS |  |  | Exercise 4.3
 | 56 | REPRESENTING REAL NUMBERS
Single |  | FLOATING POINT REPRESENTATION OF REAL NUMBERS |  |  | Exercise 4.4
 |  | How is the binary format stored? |  |  | Exercise 4.5
Double |  | What have we actually stored? |  |  | Exercise 4.6
 |  | What about negative real numbers or small fractional numbers? |  |  | Exercise 4.7 & 4.8 & 4.9
 |  | How to represent small fractions.
Week 23 |  | Largest Positive magnitude number
 |  | Largest negative magnitude number
 | 57 | Smallest magnitude positive number
Single |  | Smallest magnitude negative number
 |  | How to interpret bit patterns |  |  | Exercise 4.10
Double
Double | 58 | 4.1.4 ADVANTAGES OF INTEGER AND FLOATING-POINT REPRESENTATIONS |  |  | Exercise 4.11 & 4.12
 |  | 4.1.5-6 TRUNCATION, UNDERFLOW AND OVERFLOW ERRORS |  |  | Exercise 4.13
Half Double | 59 | PAST PAPER
Week 24
 |  | 4.2 BOOLEAN LOGIC |  |  |  | 4.2 Boolean Logic.doc
 | 60 | 4.2.1 BOOLEAN OPERATORS |  |  |  | Logic Gates Questions 1.mht
Single |  | The AND Gate
 |  | The OR Gate
Double |  | The NOT Gate |  |  |  |  | Boolean Expressions and Short-circuit Operators Quiz.mht
 |  | Drawing a truth table for a circuit. |  |  | Exercise 4.14
 |  | Further logic circuits |  |  | Exercise 4.15 & 4.16
Double | 61 | 4.2.2 CONSTRUCTING BOOLEAN EXPRESSIONS
 |  | 4.2.3 DERIVING TRUTH TABLES FROM BOOLEAN EXPRESSIONS |  |  | Exercise 4.17
Half Double | 62 | 4.2.4 SIMPLIFYING BOOLEAN EXPRESSIONS
 |  | The laws of boolean algebra. |  |  | Exercise 4.18 & 4.19
 |  | [NAME] Laws |  |  | Exercise 4.20 |  |  | Truth Tables and [NAME] Laws.mht
Week 25
 | 63 | Equivalence circuits |  |  | Exercise 4.21
 |  | Karnaugh maps |  |  | Exercise 4.22
Single |  | 4.2.5 CONSTRUCTING LOGIC CIRCUITS FROM BOOLEAN EXPRESSIONS
 |  | The HALF adder
Double |  | The FULL ADDER
Week 26 | 64 | MINIMISATION PROOFS
Double |  | CARRY CIRCUIT MINIMISATION
 |  | [NAME] MINIMISATION
Half Double | 65 | 4.2.6 CONSTRUCTING BOOLEAN EXPRESSIONS FROM LOGIC CIRCUITS
 |  | 4.2.7 EXPLAIN THE FUNCTION OF SPECIFIC CIRCUITS |  |  | Exercise 4.23
Week 27
 | 66 | 3.1 Language translators |  |  |  | 3.1 Language Translators.doc
Single |  | 3.1.1 Define Syntax and Semantics |  |  |  | Topic 3.1.1 - 3.1.2 Additional HW.php.pdf |  |  |  |  | http://www.youtube.com/watch?v=mWhDAh2Ys6s&feature=related
 |  | 3.1.2 Describe the function of high-level language translators |  |  | Exercise 3.1
Double |  | 3.1.3 Software Development Tools |  |  | Exercise 3.2
 |  | Topic 3.2 Computer Architecture |  |  |  | 3.2 Computer Architecture.doc
Double | 67 | What is Computer Architecture? |  |  |  | Topic 3.2.1 - 3.2.5 Additional HW.php.pdf |  |  |  |  | http://www.youtube.com/watch?v=NNbEBARu6LY&fmt=18
 |  | 3.2.1. The CPU |  |  |  | Topic 3.2.5 - 3.2.6 Additional HW.php.pdf |  |  |  |  | http://www.youtube.com/watch?v=9LdtybJbP3U&feature=channel
 |  | Control Unit
 |  | Arithmetic Logic Unit (ALU)
 |  | Accumulator
Half Double | 68 | Program [NAME] (PC)
 |  | The Current Instruction Register (CIR)
 |  | The Memory Data Register (MDR)
 |  | The Memory Address Register (MAR)
 |  | CPU Block Diagram |  |  |  |  | The Processor Quiz.mht
 |  | 3.2.2. What is a bit and what is a byte?? |  |  |  |  | Analog and Binary Signals Quiz.mht
 |  |  |  |  |  |  | Computer Memory Quiz.mht
 |  | Some other terms
 |  | Some differences
Week 27
 | 69 | 3.2.3 The terms word, register and address and their use in the storage of data and instructions
Single |  | 3.2.4 Machine Instruction Cycle
 |  | 3.2.5 [NAME]
Double |  | Cache memory
 |  | Virtual memory
 |  | 3.2.6 Secondary memory, sequential and direct access |  |  | Exercise 3.3 & 3.4 |  |  |  |  |  | http://www.ehow.com/video_4754170_what-definition-disk-drive.html
Double | 70 | 3.2.7 Microprocessors |  |  | Exercise 3.5 |  | Introduction to Computer Systems Quiz.mht
 |  | 3.2.6 Input devices |  |  | Exercise 3.6 |  | http://www.youtube.com/watch?v=Gnl1vuwjHto
 |  | 3.2.8 Output Devices |  |  | Exercise 3.7 |  | http://www.youtube.com/watch?v=CFybx32Mvkw
 |  | 3.2.9 Recent Developments in Computer System Architecture
Half Double | 71 | 3.4 NETWORKED COMPUTER SYSTEMS |  |  |  | 3.4 Network Systems.doc | Networks Quiz.mht |  |  |  | Routing and Deadlock Video.mht
 |  | 3.4.1 DEFINITION OF THE TERMS LAN, WAN, CLIENT AND SERVER |  |  |  | Topic 3.4 Additional HW 2.php.pdf
 |  | LOCAL AREA [NAME] (LAN) |  |  |  | Topic 3.4 Additional HW.php.pdf
 |  | WIDER AREA [NAME] (WAN) |  |  | Exercise 3.12 | Binary and Networks.mht
 |  | 3.4.2 DIFFERENT NETWORK TOPOLOGIES
Week 28 |  | 3.4.3 HARDWARE REQUIRED IN NETWORKING
 |  | 3.4.4 PACKETS, PROTOCOLS, INTEGRITY AND SECURITY OF DATA
 | 72 | PROTOCOLS
Single |  | 3.4.5 SOFTWARE INVOLVED IN NETWORKING
 |  | 3.4.6 DATA INTEGRITY IN TRANSMISSION
Double |  | PARITY CHECKING
 |  | CHECK SUMS (BLOCK CHARACTER CHECKS)
Half Double | 73 | 3.4.7 DATA SECURITY |  |  |  |  |  |  |  |  | Public Key Encryption Video.mht
 |  | 3.4.8 THE NEED FOR SPEED IN DATA TRANSMISSION
 |  | TRANSMITTING GRAPHICAL DATA
 |  | Compression of Bitmaps (JPEG)
 |  | A three digit colour code |  |  | Exercise 3.13
 |  | VECTOR GRAPHICS
Week 29
 | 74 | 3.4.9 DISCUSS APPLICATIONS AND IMPLICATIONS OF NETWORKING FOR ORGANISATION
 |  | Improved internal communications:
Single |  | External communications
 |  | Distributed Processing
Double |  | BENEFITS OF NETWORKING FOR USERS |  |  | Exercise 3.13 (2)
 |  | 3.4.10 WEB BROWSERS AND SEARCH ENGINES
 |  | Functions of a web browser.
 |  | FUNCTIONS OF A SEARCH ENGINE |  |  | Exercise 3.14
 |  | 6.5 COMPUTER/ PERIPHERAL/ COMMUNICATION
Half Double | 75 | 6.5.1 DEFINE PORT AND HANDSHAKING
 |  | Port
 |  | Handshaking
 |  | 6.5.2 DEFINE DIRECT MEMORY ACCESS (DMA) AND BUFFER
 |  | Buffers
Week 30
 |  | 6.5.3 DEFINE INTERRUPT AND POLLING
 | 76 | Interrupt
Single |  | How does the interrupt mechanism work?
 |  | Polling
Double |  | Summary of interrupt operation:
 |  | 6.5.4 EXPLAIN HOW PERIPHERAL DEVICES ARE CONTROLLED WITH REFERENCE TO PRINTER, MODEM AND DISK DRIVE
 |  | Printers
 |  | Modem
 |  | Disk drive
 |  | 6.5.5 COMPARE THE FEATURES OF DMA, INTERRUPT SYSTEMS AND POLLING SYSTEMS
 |  | 6.5.6 COMPARE THE FEATURES OF SERIAL AND PARALLEL INTERFACES
 |  | Serial interface features
 |  | Parallel interface features |  |  | Exercise 6.6
Double | 77 | PAST PAPERS
Half Double | 78 | PAST PAPERS
REVISION NOT DONE IN CLASS
CHAPTER 1
CHAPTER 3.3 COMPUTER SYSTEMS
CHAPTER 3.6
CHAPTER 3.7
CHAPTER 6.3