Embedded Files
Contact: +6017-761 9288
*I am trying to re-order these notes to match the Cambridge syllabus. It may differ from your textbook
Table of Content
Table of Content
Join our Facebook group.
Compliments
Compliments
"Y***** praised a lot about you in just one class"
Paper 1 Theory Fundamentals
1 hour 30 minutes
75 marks
Paper 1 will assess sections 1 to 8 of the syllabus content.
Written paper.
Externally assessed. Candidates answer all questions.
50% of the AS Level
25% of the A Level
Paper 2 Fundamental Problem-solving and Programming Skills
2 hours
75 marks
Paper 2 will assess sections 9 to 12 of the syllabus content.
Candidates will need to write answers in pseudocode.
Written paper.
Externally assessed. Candidates answer all questions.
50% of the AS Level
25% of the A Level
Sample of Insert for Paper 2: https://www.cambridgeinternational.org/Images/503442-2021-specimen-paper-2-insert.pdf
Paper 3 Advanced Theory
1 hour 30 minutes
75 marks
Paper 3 will assess sections 13 to 20 of the syllabus content.
Written paper.
Externally assessed. Candidates answer all questions.
25% of the A Level
Paper 4 Practical
2 hours 30 minutes
75 marks
Paper 4 will assess sections 19 to 20 of the syllabus content, except for low-level and declarative programming.
Candidates will submit complete program code and evidence of testing.
Candidates will be required to use either Java (console mode), Visual Basic* (console mode) or Python (console mode) programming languages.
Externally assessed. Candidates answer all questions on a computer without internet or email facility.
25% of the A Level
Chapter 1 Information representation
Chapter 1 Information representation
Bit Shift
Resoultion is often use to refer to quality of an image.
A high resolution picture is very sharp while a low resolution image is blur and fuzzy.
Image resolution refers to the number of pixels that make up an image.
Display resolution / Screen resolution is number of horizontal and vertical pixels that make up a screen display.
Amplitude is the height of the wave.
Frequency is the number of cycle of the sound wave.
Chapter 2 Communication and networking technologies
Chapter 2 Communication and networking technologies
~ Networking
~ Networking
Network topologies are the ways computers are connected (via physical media)
Bus Topology
Star Topology
Chapter 3 Hardware
Chapter 3 Hardware
Weakness of SSD
Laser Printer
Thermal bubble
Piezoelectric
How Microphone works?
How Speaker works?
Anti-lock Braking System (ABS)
~ Logic Gates & Logic Circuits
~ Logic Gates & Logic Circuits
NOR Gate
Chapter 4 Processor fundamentals
Chapter 4 Processor fundamentals
Question:
Expand each of the terms PC, CU and ALU. Also provide a brief description of their use.
Sample Answer:
PC: Program Counter, contains the memory address of the next instruction to be executed.
CU: Control Unit, control and coordinate hardware
ALU: Arithmetic Logic Unit, Perform calculation and logical operation
The Program Counter holds the address of the next instruction to be loaded.
This address is sent to the Memory Address Register.
The Memory Data Register holds the data fetched from this address.
This data is sent to the Current Instruction Register and the Control Unit decodes the instruction’s opcode.
The Program Counter is incremented.
Chapter 6 Security, privacy and data integrity
Chapter 6 Security, privacy and data integrity
There are a number of different types of validation check:
presence check
format check
length check
range check
limit check
type check
existence check
Iris is in the front of the eye. Retina is at the back of the eye
Chapter 7: Ethics and ownership
Chapter 7: Ethics and ownership
Chapter 8: Databases
Chapter 8: Databases
Database normalisation is used to construct a relational database that has integrity and in which data redundancy is reduced.
Breaking up Many-To-Many relationship
Creating Group of Data: All group functions have treated the table as one large group of information. At times, you need to divide the table of information into smaller groups. You can do this by using the GROUP BY clause.
Group By clause: You can use the GROUP BY clause to divide the rows in a table into groups. You can then use the group functions to return summary information for each group. When using the GROUP BY clause, make sure that all columns in the SELECT list that are not in the group functions are included in the GROUP BY clause.
Players Table
For each town, find the number of players:
SELECT TOWN, COUNT(*)
FROM PLAYERS
GROUP BY TOWN
The result is:
TOWN COUNT(*)
--------- --------
Stratford 7
Midhurst 1
Inglewood 2
Plymouth 1
Douglas 1
Eltham 2
Chapter 9: Algorithm Design and Problem-solving
Chapter 9: Algorithm Design and Problem-solving
FOR loop
-Pseudocode
-Pseudocode
Procedure is a set of programming statements grouped together under a single name that can be called to perform a task at any point in a program.
Function is a set of programming statements grouped together under a single name that can be called to perform a task at any point in a program. In contrast to a procedure, a function will return a value back to the main program.
Parameters are the variables that store the values of the arguments passed to a procedure or function. Some but not all procedures and functions will have parameters
Chapter 10: Data types and structures
Chapter 10: Data types and structures
SIZE = 10
def Enqueue(NewData : str):
global EndPointer
if StartPointer == EndPointer and q[StartPointer] is not None:
print("Queue is full")
else:
q[EndPointer] = NewData
EndPointer += 1
if EndPointer == SIZE:
EndPointer = 0
print(f"{NewData} was added to the Queue")
def Dequeue():
global q, StartPointer
if StartPointer == EndPointer and q[StartPointer] is None:
print("Queue is empty")
else:
Removed = q[StartPointer]
q[StartPointer] = None
StartPointer = StartPointer + 1
if StartPointer == SIZE:
StartPointer = 0
print(f"{Removed}left the Queue")
if __name__=="__main__":
q = [None for i in range (SIZE)]
StartPointer = 0
EndPointer = 0
Countries = '''Malaysia
Indonesida
China
Philipine
USA
UK
Lao
Thailand
Cambodia
Sinagpore'''.split("\n")
for Col in Countries:
Enqueue(Col)
for i in range(10):
Dequeue()
Abstract data type (ADT) – a collection of data and a set of operations on that data.
Chapter 11 Programming
Chapter 11 Programming
~ Structured Programming
~ Structured Programming
A Procedure does NOT return any value
A Function ALWAYS return a value
Chapter 12 Software Development
Chapter 12 Software Development
Chapter 13 Data Representation
Chapter 13 Data Representation
A data type that refers to any other data type in its type definition is a composite data type.
Enumerated data type – a data type defined by a given list of all possible values that has an implied order. Enumerate in English means to name things separately, one by one.
Set – a given list of unordered elements that can use set theory operations
Chapter 14 Communication and Internet Technologies
Chapter 14 Communication and Internet Technologies
Manual Circuit Switching
TCP/IP Protocol Suite
Application (Layer)
Transport (Layer)
Internet (Network Layer)
(Data) Link (Layer)
Chapter 15: Hardware and Virtual Machines
Chapter 15: Hardware and Virtual Machines
Half adder
Chapter 18: Artificial Intelligence (AI)
Chapter 18: Artificial Intelligence (AI)
Chapter 19 Computational thinking and Problem Solving
Chapter 19 Computational thinking and Problem Solving
~ Linear Search
~ Linear Search
A linear search algorithm looks at each item in a data set (a list or array) in turn and compares it against a specified desired value.
If the item matches, information about that value is returned, such as the value itself, its position in the list, or a message.
If it does not match, the algorithm moves on to the next item in the data set and continues comparing.
If the algorithm reaches the end of the data set without finding the desired value, it returns an indication that the item has not been found.
~ Binary Search
~ Binary Search
def binary_search(arr, x):
low = 0
high = len(arr) - 1
while low <= high:
mid = (high + low) // 2
if arr[mid] < x:
low = mid + 1
elif arr[mid] > x:
high = mid - 1
else:
return mid
return -1
arr = [2, 3, 4, 10, 40]
x = 3
result = binary_search(arr, x)
if result != -1:
print("Found at index", result)
else:
print("Not found")
Python
Python
It is alway best to use the same platform that you will be using for your exam
Debugger in Python IDLE
PyCharm Tutorial
Array / List
ORD Function
Print Quotes in Python
enum
PyCharm File Processing Directory / Folder
True division and Floor division
Use the strip() function to remove "/n" (new line)
Initialise Link List
Initialise Link List
Chapter 20 Further Programming
Chapter 20 Further Programming
Local Variable
Variables defined in subprograms are local in scope.
They only exist inside the subprogram they are created in.
They only exist for the time that the subprogram is executing.
They are created when the subprogram is entered.
They are destroyed when the subprogram finishes.
Subprogram parameters are always local in scope
Global Variable
Variables defined at the level of the main program are global in scope.
They exist throughout the whole program.
They are accessible from any code, anywhere in the whole program, even from inside subprograms.
Extention (NOT in your syllabus)
LDD A ; Load the value of A into the accumulator
SUB B ; Subtract the value of B from the accumulator
JPC ELSE ; Jump to ELSE if Carry flag is set (A <= B)
Textbook
Textbook
cambridge-international-as-and-a-levels-computer-science-9781510457591_compress.pdfCambridge_International_AS_and_A_Level_Computer_Science_Coursebook.pdf#igcse #computerscience #aslevel #alevel #cambridge
Page updated
Google Sites
Report abuse