Spreadsheet: 84199d1284191287-combine-hyperlink-with-lookup-time-table-2010-2011
Sheet: Checklist

 | 12 | 13
 | HL | SLD | SLF | HL
1.1 SYSTEMS LIFE CYCLE | done |  | done
1.1.1 MAJOR STAGES | done |  | done
1.1.2 DATA COLLECTION IN THE ANALYSIS PHASE | done |  | done
1.1.3 DATA COLLECTION TECHNIQUES | done |  | done
1.1.4 THE REQUIREMENTS SPECIFICATION | done |  | done
1.1.5 FEASIBILITY REPORT | done |  | done
1.1.6 ALTERNATIVE SOLUTIONS | done |  | done
1.1.7 SYSTEM TESTING | done |  | done
1.1.8 METHODS OF IMPLEMENTING NEW SYSTEMS | done |  | done
1.1.9 MAINTENANCE | done |  | done
1.2 SYSTEMS ANALYSIS | done |  | done
1.2.1 IMPORTANCE OF FORMULATING A PROBLEM PRECISELY | done |  | done
1.2.2 ASPECTS THAT MUST BE CONSIDERED | done |  | done
1.2.3 OUTCOMES OF INVESTIGATION | done |  | done
1.2.4 PROBLEMS THAT CAN BE SOLVED USING COMPUTER SYSTEMS | done |  | done
1.2.5 BASIC CONTROL CONSTRUCTS | done |  | done
1.2.6 MODULAR DECOMPOSITION | done |  | done
1.3 SYSTEM DESIGN | done |  | done
1.3.1 PARTS OF A SYSTEM | done |  | done
1.3.2 DATA IN A COMPUTER SYSTEM | done |  | done
1.3.3 DATA CAPTURE AND PRESENTATION | done |  | done
1.3.4 DESIGN OF APPROPRIATE DATA STRUCTURES | done |  | done
1.3.5 HARDWARE COMPONENTS | done |  | done
1.3.6 USER INTERFACES | done |  | done
1.3.7 SYSTEMS FLOWCHARTS | done |  | done
1.3.8 CONSTRUCTING SYSTEMS FLOWCHARTS | done |  | done
1.4 SOCIAL SIGNIFICANCE AND IMPLICATIONS OF COMPUTER SYSTEMS | done |  | done
1.4.1 SOCIAL AND ECONOMIC IMPLICATIONS OF INSTALLATION OF NEW SYSTEMS | done |  | done
1.4.2 SOCIAL SIGNIFICANCE AND IMPLICATIONS OF THE WIDESPREAD USE OF COMPUTERS | done |  | done
1.4.3 CURRENT TRENDS AND THEIR CONSEQUENCES | done |  | done
1.5 THE SOFTWARE LIFE CYCLE | done |  | done
1.5.1 OUTLINE THE MAJOR STAGES IN THE SOFTWARE LIFE CYCLE | done |  | done
1.5.2 CYCLICAL NATURE | done |  | done
1.6 SOFTWARE DESIGN | done |  | done
1.6.1 DATA REQUIREMENTS | done |  | done
1.6.2 MODULAR DESIGN | done |  | done
1.6.3 PROTOTYPING | done |  | done
1.6.4 PROTOTYPING APPHOACH TO SYSTEMS DESIGN AND DEVELOPMENT | done |  | done
1.6.5 ADVANTAGES OF PROTOTYPING | done |  | done
1.6.6 EFFICIENCY OF SOLUTIONS | done |  | done
1.7 DOCUMENTATION | done |  | done
1.7.1 DOCUMENTATION OF THE CYCLE | done |  | done
1.7.2 SYSTEM DOCUMENTATION | done |  | done
1.7.3 USER DOCUMENTATION | done |  | done
2.1 PROGRAM CONSTRUCTION IN JAVA | done | done | done | done
2.1.1-3 DATA TYPES, DATA STRUCTURES AND CONSTRUCTS IN JAVA | done | done | done | done
VARIABLES AND TYPES | done | done | done | done
[NAME] AND APPLICATION OF JETS PRIMITIVES | done | done | done | done
ASSIGNMENT | done | done | done | done
BEYOND PRIMITIVES | done | done | done | done
INPUT/OUTPUT | done | done | done | done
ARITHMETIC OPERATORS | done | done | done | done
PRECEDENCE | done | done | done | done
MATHEMATICAL FUNCTIONS | done | done | done | done
CASTING | done | done | done | done
PROGRAM [NAME] | done | done | done | done
SEQUENCE | done | done | done | done
CONSTRUCTING A MODULAR PROGRAM | done | done | done | done
SCOPE OF IDENTIFIERS | done | done | done | done
PARAMETERS | done | done | done | done
METHOD SIGNATURES | done | done | done | done
SELECTION | done | done | done | done
NESTING | done | done | done | done
MULTIPLE SELECTIONS | done | done | done | done
REPETITION | done | done | done | done
Tracing loops | done | done | done | done
CLASSES, USER-DEFINED METHODS AND OBJECTS | done | done | done | done
CLASSES AND EXCEPTIONS | done | done | done | done
STATIC METHODS | done | done | done | done
PRIMITIVES VERSUS OBJECT REFERENCES | done | done | done | done
ARRAYS OR LISTS OF VALUES | done | done | done | done
RECORDS AND CLASSES | done | done | done | done
DATA FILES | done | done | done | done
CHARACTER-BASED FILESTREAMS | done | done | done | done
HIGHER LEVEL FILE HANDLING | done | done | done | done
2.14 TRACING ALGORITHMS IN JAVA | done | done | done | done
2.15 EVALUATE ALGORITHMS IN JAVA | done | done | done | done
COMMON PITFALLS IN USING STRING INSTANCES AND METHODS | done | done | done | done
CONCATENATION | done | done | done | done
SUBSTRINGS | done | done | done | done
EXAMPLE OF STRING MANIPULATION | done | done | done | done
OTHER METHODS OF THE STRING CLASS | done | done | done | done
2.16 CONSTRUCT ALGORITHMS IN JAVA | done | done | done | done
2.1.7 EXPLAIN THE NEED FOR SEARCHING AND SORTING | done | done | done | done
2.18 APPLY SPECIFIED SEARCHING AND SORTING ALGORITHMS | done | done | done | done
SEQUENTIAL (LINEAR) SEARCH | done | done | done | done
[NAME] | done | done | done | done
[NAME] | done | done | done | done
SORTING | done | done | done | done
BUBBLE SORT | done | done | done | done
SELECTION SORT | done | done | done | done
COMPARE THE EFFICIENCY OF SEARCHING AND SORTING ALGORITHMS | done | done | done | done
2.1.10 DISCUSS THE EFFICIENCY OF SEARCHING AND SORTING ALGORITHMS | done | done | done | done
FURTHER EXAMPLE ALGORITHMS AND ACTIVITIES | done | done | done | done
2.1.11 PROGRAMMING ERRORS | done | done | done | done
3.1 Language translators | done | done | done | done
3.1.1 Define Syntax and Semantics | done | done | done | done
3.1.2 Describe the function of high-level language translators | done | done | done | done
3.1.3 Software Development Tools | done | done | done | done
Topic 3.2 Computer Architecture | done | done | done | done
What is Computer Architecture? | done | done | done | done
3.2.1. The CPU | done | done | done | done
Control Unit | done | done | done | done
Arithmetic Logic Unit (ALU) | done | done | done | done
Accumulator | done | done | done | done
Program [NAME] (PC) | done | done | done | done
The Current Instruction Register (CIR) | done | done | done | done
The Memory Data Register (MDR) | done | done | done | done
The Memory Address Register (MAR) | done | done | done | done
CPU Block Diagram | done | done | done | done
3.2.2. What is a bit and what is a byte?? | done | done | done | done
Some other terms | done | done | done | done
Some differences | done | done | done | done
3.2.3 The terms word, register and address and their use in the storage of data and instructions | done | done | done | done
3.2.4 Machine Instruction Cycle | done | done | done | done
3.2.5 [NAME] | done | done | done | done
Cache memory | done | done | done | done
Virtual memory | done | done | done | done
3.2.6 Secondary memory, sequential and direct access | done | done | done | done
3.2.7 Microprocessors | done | done | done | done
3.2.6 Input devices | done | done | done | done
3.2.8 Output Devices | done | done | done | done
3.2.9 Recent Developments in Computer System Architecture | done | done | done | done
3.3 Computer Systems |  | done | done
3.3.1 Define Operating Systems |  | done | done
3.3.2 Operating System Functions |  | done | done
Peripheral Communication |  | done | done
Coordinating concurrent processing |  | done | done
Memory Management |  | done | done
Resource Monitoring |  | done | done
Accounting and Security |  | done | done
Program and Data Management |  | done | done
3.3.3 Characteristics of Computer Systems and a comparison of these characteristics and applications of different kinds of computers |  | done | done
Personal Computer (PC S) and Portable Computers |  | done | done
Mainframes |  | done | done
Super Computers |  | done | done
Number of Users: Multi-User and Single-User Computer Systems |  | done | done
3.3.4 Comparison and different applications of computer systems |  | done | done
Personal and Portable Computers |  | done | done
Mainframe |  | done | done
Super Computer |  | done | done
3.3.5 Computer System Operation Modes |  | done | done
3.3.6 Applications of different modes of operation |  | done | done
3.3.7 Relationship between master file and transaction file |  | done | done
3.3.8 Reliability of systems |  | done | done
Backup strategies |  | done | done
3.4 NETWORKED COMPUTER SYSTEMS | done | done | done | done
3.4.1 DEFINITION OF THE TERMS LAN, WAN, CLIENT AND SERVER | done | done | done | done
LOCAL AREA [NAME] (LAN) | done | done | done | done
WIDER AREA [NAME] (WAN) | done | done | done | done
3.4.2 DIFFERENT NETWORK TOPOLOGIES | done | done | done | done
3.4.3 HARDWARE REQUIRED IN NETWORKING | done | done | done | done
3.4.4 PACKETS, PROTOCOLS, INTEGRITY AND SECURITY OF DATA | done | done | done | done
PROTOCOLS | done | done | done | done
3.4.5 SOFTWARE INVOLVED IN NETWORKING | done | done | done | done
3.4.6 DATA INTEGRITY IN TRANSMISSION | done | done | done | done
PARITY CHECKING | done | done | done | done
CHECK SUMS (BLOCK CHARACTER CHECKS) | done | done | done | done
3.4.7 DATA SECURITY | done | done | done | done
3.4.8 THE NEED FOR SPEED IN DATA TRANSMISSION | done | done | done | done
TRANSMITTING GRAPHICAL DATA | done | done | done | done
Compression of Bitmaps (JPEG) | done | done | done | done
A three digit colour code | done | done | done | done
VECTOR GRAPHICS | done | done | done | done
3.4.9 DISCUSS APPLICATIONS AND IMPLICATIONS OF NETWORKING FOR ORGANISATION | done | done | done | done
Improved internal communications: | done | done | done | done
External communications | done | done | done | done
Distributed Processing | done | done | done | done
BENEFITS OF NETWORKING FOR USERS | done | done | done | done
3.4.10 WEB BROWSERS AND SEARCH ENGINES | done | done | done | done
Functions of a web browser. | done | done | done | done
FUNCTIONS OF A SEARCH ENGINE | done | done | done | done
3.5 DATA REPRESENTATION |  | done | done | done
APPLICATION OF THIS RELATIONSHIP |  | done | done | done
Pixel Colour Intensity |  | done | done | done
3.5.2 NEED FOR STANDARD FORMATS FOR DOCUMENTS AND GRAPHICS |  | done | done | done
Answers |  | done | done | done
ASCII |  | done | done | done
3.5.3 EXPRESS NUMBERS IN DECIMAL, [NAME] AND HEXADECIMAL |  | done | done | done
THE BINARY NUMBER SYSTEM |  | done | done | done
3.5.4 CONVERSION OF NUMBERS IN DECIMAL, [NAME] AND HEXADECIMAL |  | done | done | done
CONVERTING BETWEEN BASES |  | done | done | done
CONVERTING BETWEEN BINARY AND HEXADECIMAL NUMBERS |  | done | done | done
CONVERTING BINARY TO DECIMAL |  | done | done | done
3.5.5 REPRESENTING INTEGERS |  | done | done | done
Negative numbers |  | done | done | done
3.5.6 DEFINE ANALOG AND DIGITAL DATA |  | done | done | done
3.5.7 CONVERSION FROM DIGITAL TO ANALOG |  | done | done | done
3.5.8 APPLICATIONS OF CONVERSION |  | done | done | done
3.6 ERRORS |  | done | done
3.6.1 HOW DATA ERRORS OCCUR. |  | done | done
3.6.2 PREVENTING AND DETECTING ERRORS |  | done | done
Checking for errors |  | done | done
Verification |  | done | done
Validation |  | done | done
Check digits |  | done | done
Hardware errors |  | done | done
Software related errors |  | done | done
3.6.3 RECOVERY FROM ERRORS |  | done | done
Re-input |  | done | done
Re-transmission |  | done | done
Backing up |  | done | done
3.7 UTILITY SOFTWARE |  | done | done
3.7.1 AND 3.7.2 FUNCTIONS AND NEED FOR THE ABOVE UTILITY SOFTWARE. |  | done | done
FILE MANAGERS |  | done | done
DEFRAGMENTATION |  | done | done
DATA COMPRESSORS |  | done | done
VIRUS CHECKERS |  | done | done
4.1 NUMBER SYSTEMS AND REPRESENTATIONS |  |  |  | done
INTRODUCTION |  |  |  | done
4.1.1-3 CALCULATE IN BINARY, DECIMAL AND HEXADECIMAL |  |  |  | done
ADDITION OF HEX VALUES |  |  |  | done
RULES OF HEX ADDITION |  |  |  | done
REPRESENTING INTEGERS |  |  |  | done
REPRESENTING NEGATIVE NUMBERS |  |  |  | done
Why THE 2's COMPLEMENT ALGORITHM WORKS |  |  |  | done
REPRESENTING REAL NUMBERS |  |  |  | done
FLOATING POINT REPRESENTATION OF REAL NUMBERS |  |  |  | done
How is the binary format stored? |  |  |  | done
What have we actually stored? |  |  |  | done
What about negative real numbers or small fractional numbers? |  |  |  | done
How to represent small fractions. |  |  |  | done
Largest Positive magnitude number |  |  |  | done
Largest negative magnitude number |  |  |  | done
Smallest magnitude positive number |  |  |  | done
Smallest magnitude negative number |  |  |  | done
How to interpret bit patterns |  |  |  | done
4.1.4 ADVANTAGES OF INTEGER AND FLOATING-POINT REPRESENTATIONS |  |  |  | done
4.1.5-6 TRUNCATION, UNDERFLOW AND OVERFLOW ERRORS |  |  |  | done
4.2 BOOLEAN LOGIC |  |  |  | done
4.2.1 BOOLEAN OPERATORS |  |  |  | done
The AND Gate |  |  |  | done
The OR Gate |  |  |  | done
The NOT Gate |  |  |  | done
Drawing a truth table for a circuit. |  |  |  | done
Further logic circuits |  |  |  | done
4.2.2 CONSTRUCTING BOOLEAN EXPRESSIONS |  |  |  | done
4.2.3 DERIVING TRUTH TABLES FROM BOOLEAN EXPRESSIONS |  |  |  | done
4.2.4 SIMPLIFYING BOOLEAN EXPRESSIONS |  |  |  | done
The laws of boolean algebra. |  |  |  | done
[NAME] Laws |  |  |  | done
Equivalence circuits |  |  |  | done
Karnaugh maps |  |  |  | done
4.2.5 CONSTRUCTING LOGIC CIRCUITS FROM BOOLEAN EXPRESSIONS |  |  |  | done
The HALF adder |  |  |  | done
The FULL ADDER |  |  |  | done
MINIMISATION PROOFS |  |  |  | done
CARRY CIRCUIT MINIMISATION |  |  |  | done
[NAME] MINIMISATION |  |  |  | done
4.2.6 CONSTRUCTING BOOLEAN EXPRESSIONS FROM LOGIC CIRCUITS |  |  |  | done
4.2.7 EXPLAIN THE FUNCTION OF SPECIFIC CIRCUITS |  |  |  | done
5.1 TERMINOLOGY | done |  |  | done
5.1.1 DEFINITIONS | done |  |  | done
Identifier | done |  |  | done
Operand | done |  |  | done
Operator (unary and binary): | done |  |  | done
Unary Operator | done |  |  | done
Binary Operator | done |  |  | done
Actual parameter (Argument) | done |  |  | done
Formal Parameter | done |  |  | done
Parameter Passing Example | done |  |  | done
Infix notation | done |  |  | done
Postfix notation | done |  |  | done
Prefix notation | done |  |  | done
5.1.2 DEFINITION OF A STACK, [NAME] AND BINARY TREE. | done |  |  | done
STACK DATA STRUCTURE | done |  |  | done
[NAME] STRUCTURE | done |  |  | done
OPERATIONS ON STACKS AND QUEUES | done |  |  | done
DEFINITION OF A BINARY TREE | done |  |  | done
5.1.3 USES OF STACKS | done |  |  | done
5.1.4 USES OF QUEUES | done |  |  | done
5.1.5 DISCUSS THE FEATURES AND APPROPRIATE USAGE OF BINARY TREES. | done |  |  | done
5.2 STATIC DATA STRUCTURES | done |  |  | done
5.2.1 - 5.2.2 QUICK SORT | done |  |  | done
TRACE OF THE QUICK SORT ALGORITHM | done |  |  | done
5.2.3 CONSTRUCTING HASH TABLES | done |  |  | done
Generating hash codes | done |  |  | done
5.2.4-5.2.5 STACKS | done |  |  | done
PUSH algorithm | done |  |  | done
POP algorithm | done |  |  | done
5.2.6-5.2.7 QUEUES | done |  |  | done
5.3 DYNAMIC DATA STRUCTURES | done |  |  | done
5.3.1 DEFINITION OF AN OBJECT REFERENCE | done |  |  | done
5.3.2 ALGORITHMS THAT USE REFERENCE MECHANISMS | done |  |  | done
5.3.3-6 LINKED LISTS: SINGULAR, DOUBLE AND CIRCULAR | done |  |  | done
Operations on Linked Lists | done |  |  | done
5.3.6 OTHER STYLES OF LINKED LISTS | done |  |  | done
5.3.7-8 DYNAMIC STACK | done |  |  | done
5.3.9·10 DYNAMIC QUEUE | done |  |  | done
5 .3.11-14 BINARY TREES | done |  |  | done
TRAVERSING A TREE | done |  |  | done
USING TREES TO EVALUATE ARITHMETIC EXPRESSIONS | done |  |  | done
DELETE OPERATION | done |  |  | done
LOGICAL AND PHYSICAL REPRESENTATIONS OF DYNAMIC DATA STRUCTURES | done |  |  | done
5.4 OBJECTS IN PROBLEM SOLUTIONS | done |  |  | done
5.4.1 FEATURES OF AN OBJECT | done |  |  | done
5.4.2 ENCAPSULATION | done |  |  | done
5.4.3 BASIC FEATURES AND ADVANTAGES OF INFORMATION AND DATA HIDING | done |  |  | done
5.4.4 POLYMORPHISM | done |  |  | done
5.4.5 INHERITANCE | done |  |  | done
5.4.6 ALGORITHMS WITH OBJECTS | done |  |  | done
ADVANTAGES AND DISADVANTAGES OF OBJECTS | done |  |  | done
5.5 RECURSION | done |  |  | done
5.5.1 DEFINITION OF RECURSION | done |  |  | done
5.5.2 ADVANTAGES AND DISADVANTAGES OF RECURSION | done |  |  | done
5.5.3-5 USING RECURSION | done |  |  | done
EXAMPLE 1: FIBONACCI NUMBERS | done |  |  | done
EXAMPLE 2: ACKERMAN'S FUNCTION | done |  |  | done
EXAMPLE 3: RAISING TO A POWER I.E. XN | done |  |  | done
EXAMPLE 4: USING RECURSION TO COUNT THE NUMBER OF VALUES IN A LINKED LIST. | done |  |  | done
5.6 ALGORITHM EVALUATION | done |  |  | done
5.6.1-2 EFFICIENCY OF ALGORITHMS | done |  |  | done
The Big O notation | done |  |  | done
Efficiency comparison of various ways to calculate Fibonacci numbers | done |  |  | done
Summary of complexities | done |  |  | done
Summary of common O complexities | done |  |  | done
5.6.3 -4 ORGANISING AND EVALUATING DATA STRUCTURES AND ALGORITHMS TO SUIT PROBLEMS | done |  |  | done
6.1 CPU CONFIGURATION | done |  |  | done
6.1.1/2FUNCTIONS OF THE ACCUMULATOR, INSTRUCTION REGISTER AND PROGRAM COUNTER | done |  |  | done
6.1.3 FUNCTION OF THE INTERRUPT REGISTER | done |  |  | done
6.1.4 ROLE OF A BUS TO LINK THE PROCESSOR UNIT, RAM, ROM AND CACHE | done |  |  | done
What is a BUS? | done |  |  | done
Data Bus | done |  |  | done
Memory Bus | done |  |  | done
The role of CACHE | done |  |  | done
6.2 DISK STORAGE |  |  |  | done
6.2.1 ROLE OF BLOCKINC, SECTORS, CYLINDERS AND HEADS IN STORAGE |  |  |  | done
Blocking |  |  |  | done
Sectors, Tracks and Cylinders |  |  |  | done
Read/write Heads |  |  |  | done
6.2.2 DISK ACCESS TIME |  |  |  | done
6.3 OPERATING SYSTEMS AND UTILITIES | done
6.3.1 DEFINITION OF THE TERM OPERATINC SYSTEM | done
Single User | done
Multi-user | done
Mutiprocessing | done
Multitasking | done
Multithreading | done
6.3.2 FUNCTIONS OF AN OPERATINC SYSTEM | done
Utility software | done
6.3.3 OUTLINE THE FUNCTIONS OF LINKER, LOADER AND [NAME] MANAGER. | done
Linkers | done
Loaders | done
Library Managers | done
6.4 FURTHER NETWORK FUNDAMENTALS |  |  |  | done
6.4.1 THE ROLE OF COMPUTERS IN DIFFERENT NETWORKS |  |  |  | done
Network Server computers |  |  |  | done
Client computers |  |  |  | done
Providers' computers |  |  |  | done
Gateway computers |  |  |  | done
6.4.2 PRINCIPLES OF NETWORKING |  |  |  | done
Remote connection |  |  |  | done
Direct connection with a network |  |  |  | done
MODE OF TRANSMISSION |  |  |  | done
[NAME] |  |  |  | done
FEATURES OF COMMUNICATIONS IN NETWORKS |  |  |  | done
6.4.3 PACKET SWITCHING |  |  |  | done
Definition of data packet |  |  |  | done
Definition of Packet Switching |  |  |  | done
ROLE OF NODES IN TRAFFIC MANAGEMENT |  |  |  | done
ROUTING OF PACKETS OVER DIFFERENT PATHS |  |  |  | done
PACKET ERRORS |  |  |  | done
6.4.4 PACKET SWITCHING PROTOCOL |  |  |  | done
[NAME] |  |  |  | done
ROLE OF PROTOCOLS IN PACKET SWITCHED NETWORKS |  |  |  | done
6.4.5 NETWORK SECURITY AND HOW IT IS ACHIEVED |  |  |  | done
NETWORK LOGIN ACCESS CONTROL |  |  |  | done
CONTROL OF ACCESS VIA PERMISSIONS (LAYERED ACCESS) |  |  |  | done
ROLE OF A FIREWALL |  |  |  | done
DATA ENCRYPTION |  |  |  | done
6.5 COMPUTER/ PERIPHERAL/ COMMUNICATION | done |  |  | done
6.5.1 DEFINE PORT AND HANDSHAKING | done |  |  | done
Port | done |  |  | done
Handshaking | done |  |  | done
6.5.2 DEFINE DIRECT MEMORY ACCESS (DMA) AND BUFFER | done |  |  | done
Buffers | done |  |  | done
6.5.3 DEFINE INTERRUPT AND POLLING | done |  |  | done
Interrupt | done |  |  | done
How does the interrupt mechanism work? | done |  |  | done
Polling | done |  |  | done
Summary of interrupt operation: | done |  |  | done
6.5.4 EXPLAIN HOW PERIPHERAL DEVICES ARE CONTROLLED WITH REFERENCE TO PRINTER, MODEM AND DISK DRIVE | done |  |  | done
Printers | done |  |  | done
Modem | done |  |  | done
Disk drive | done |  |  | done
6.5.5 COMPARE THE FEATURES OF DMA, INTERRUPT SYSTEMS AND POLLING SYSTEMS | done |  |  | done
6.5.6 COMPARE THE FEATURES OF SERIAL AND PARALLEL INTERFACES | done |  |  | done
Serial interface features | done |  |  | done
Parallel interface features | done |  |  | done
7.1 FILE ORGANISATON |  |  |  | done
7.1.1 DEFINITION OF THE TERM KEY FIELD |  |  |  | done
7.1.2-3 SEQUENTIAL FILE ORGANISATION |  |  |  | done
7.1.4 PARTIALLY-INDEXED SEQUENTIAL FILE ORGANISATION |  |  |  | done
7.1.5 FULLY INDEXED FILE |  |  |  | done
7.1.6 DIRECT FILE ORGANISATION |  |  |  | done
Standard File Direct Access Algorithm |  |  |  | done
7.1.7 FIXED AND VARIABLE LENGTH RECORDS |  |  |  | done
7.1.8 THE USE OF HASHING TO FACILITATE FILE ACCESS |  |  |  | done
7.1.9 COMPARISON OF THE SPEED OF ACCESS AND STORAGE REQUIREMENTS FOR THE VARIOUS FILE TYPES |  |  |  | done
Storage requirements |  |  |  | done
Speed comparision |  |  |  | done
7.1.10 LOCICAL AND PHYSICAL ORCANIZATION OF DATA |  |  |  | done
7.1.11 EXTERNAL SORTS |  |  |  | done
7.1.12 EXAMPLES OF DIRECT ACCESS FILE HANDLING |  |  |  | done
Case Study |  |  |  | done
Dossier
PAST PAPERS SL
May 2000 Paper 1
May 2000 Paper 2
November 2000 Paper 2
May 2001 Paper 1
May 2001 Paper 2
November 2001 Paper 2
May 2002 Paper 1
May 2002 Paper 2
November 2002 Paper 2
November 2003 Paper 2
May 2004 Paper 1
May 2004 Paper 2
May 2005 Paper 1 | done
May 2006 Paper 1
Specimen 2006 Paper 1
Specimen 2006 Paper 2
May 2007 Paper 1 | done
May 2007 Paper 2
November 2007 Paper 1 | done
November 2007 Paper 2
May 2009 Paper 1 | done
May 2009 Paper 2
Specimen Paper 1
Specimen Paper 2
Mock 2009 Paper 1
Mock 2008 Paper 1
Mock 2008 Paper 2
PAST PAPERS HL
May 2001 Paper 1
May 2001 Paper 2
May 2002 Paper 1
May 2002 Paper 2
November 2004 Paper 1
November 2004 Paper 2
May 2005 Paper 1
May 2005 Paper 2
November 2005 Paper 1
November 2005 Paper 2
May 2006 Paper 1
May 2006 Paper 2
November 2006 Paper 1
November 2006 Paper 2
Specimen 2006 Paper 1
Specimen 2006 Paper 2
May 2007 Paper 1
May 2007 Paper 2
November 2007 Paper 1
November 2007 Paper 2
May 2008 Paper 1 |  |  |  | done
May 2008 Paper 2
November 2008 Paper 1 |  |  |  | done
November 2008 Paper 2
May 2009 Paper 1 |  |  |  | done
May 2009 Paper 2
Specimen Paper 1
Specimen Paper 2