Computer Science (9618)
"While studying Cambridge IGCSE and Cambridge International A Levels, students broaden their horizons through a global perspective and develop a lasting passion for learning "
We are in the mid of updating this page. Subscribe to us as you will be informed when it is done.
Part 1: Theory fundamentals
Chapter 1 Information representation
Chapter 2 Communication and networking technologies
Chapter 3 Hardware
Chapter 4 Logic gates and logic circuits
Chapter 5 Processor fundamentals
Chapter 6 Assembly language programming
Chapter 7 Monitoring and control systems
Chapter 8 System software
Chapter 9 Security, privacy and data integrity
Chapter 10 Ethics and ownership
Chapter 11 Databases
Part 2: Fundamental problem-solving and programming skills
Chapter 12 Algorithm design and problem-solving
Chapter 13 Data types and structures
Chapter 14 Programming and data representation
Chapter 15 Software development
Part 3: Advanced theory
Chapter 16 Data representation
Chapter 17 Communication and Internet technologies
Chapter 18 Hardware and virtual machines
Chapter 19 Logic circuits and Boolean algebra
Chapter 20 System software
Chapter 21 Security
Chapter 22 Artificial Intelligence (AI)
Part 4: Further problem-solving and programming skills
Chapter 23 Algorithms
Chapter 24 Recursion
Chapter 25 Programming paradigms
Chapter 26 File processing and exception handling
Chapter 27 Object-oriented programming (OOP)
Chapter 28 Low-level programming
Chapter 29 Declarative programming
502962-2021-2023-syllabus.pdf
Chapter 1 Information representation
1.01 Number Systems
1.03 Internal Coding of Numbers
Chapter 2 Communication and networking technologies
2.02 Network topologies
Chapter 19 Logic circuits and Boolean algebra
Python Notes
A Python enum example. The explanation is in the video below.
Sample CSV code
import csv
file = open("subscription_data.csv")
csvreader=csv.reader(file)
for rows in csvreader:
if rows[1] > '6000':
print(rows)
file.close()
Sample Linear Search Code
def LinearSearch (array, n, k):
for j in range (0, n):
if (array[j] == k):
return j
return -1
array =[-1, 1, 3, 5, 7, 9]
k = 7
n = len (array)
result = LinearSearch(array, n, k)
if (result == -1):
print ("Element not found")
else:
print ("Element found at index: ", result)
Need a little more help:
Cambridge_International_AS_and_A_Level_Computer_Science_Coursebook.pdfInformation and Communication Technology (Second Edition) By Graham Brown and David Watson.pdf