Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
510 views
36 pages
CS Questionpaper Paper01 June2024
nothing
Uploaded by
Mohammad Ahmed Irfan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Download
Save
Save CS Questionpaper Paper01 June2024 For Later
Share
0%
0% found this document useful, undefined
0%
, undefined
Print
Embed
Report
0 ratings
0% found this document useful (0 votes)
510 views
36 pages
CS Questionpaper Paper01 June2024
nothing
Uploaded by
Mohammad Ahmed Irfan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here
.
Available Formats
Download as PDF or read online on Scribd
Carousel Previous
Carousel Next
Download
Save
Save CS Questionpaper Paper01 June2024 For Later
Share
0%
0% found this document useful, undefined
0%
, undefined
Print
Embed
Report
Download
Save CS Questionpaper Paper01 June2024 For Later
You are on page 1
/ 36
Search
Fullscreen
Please check the examination details below before entering your candidate information Centre Number Candidate Number CITTTICLL1) Pearson Edexcel International GCSE (9-1) (Thursday 23 May 2024 ‘Afternoon (Time: 2 hours) Pape ce 4CPO/01 Computer Science PAPER 1: Principles of Computer Science You must have: Total Marks Pseudocode command set (enclosed) Instructions © Use black ink or ball-point pen in the boxes at the top of this page with your name, centre number and candidate number. © Answer all questions. © Answer the questions in the spaces provided ~ there may be more space than you need. Information @ The total mark for this paper is 80. © The marks for each question are shown in brackets = use this as a guide as to how much time to spend on each question. © You are not allowed to use a calculator. Advice © Read each question carefully before you start to answer it © Try to answer every question © Check your answers if you have time at the end. © Marks will not be awarded for using product or trade names in answers without further explanation. Turn over pyszaca | MMINOVNONNI POINTS @1 ‘Answer ALL questions. Write your answers in the space provided. Some questions must be answered with a cross in a box. If you change your mind about an answer, put a line through the box % and then mark your new answer with a cross X. There are different ways to connect computers in a network. (a) Give two differences between a WAN and a LAN. (b) Give one security risk of connecting computers in a network. Wau SIHLNIALIUM LON OG Wau SIHLNI LUM LON OG‘DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA (0) Figure 1 shows a network topology. Figure 1 (i) State the name of this network topology. ‘State one drawback of using this network topology. (iii) A fault tolerant network delivers a reliable service. Explain one reason why this topology is fault tolerant. a) a) (2)(d) Identify which layer of the 4-layer TCP/IP model is responsible for transferring packets across a network. (1) GA Application layer © B Transport layer OC Network layer GD Data link layer (@) Here is the address for a web page. https://www,pearson.com/computing/specification.htm| (i) State the protocol being used. a) Give the name of the document being retrieved. a) (Total for Question 1 = 10 marks) Wau SIHLNIALIUM LON OG 9 8 z2 $ g = 2 m = 3 BS a > R &BLANK PAGE Wa¥V SIHLNIZLINM.LON OG W3UV SIHLNI LUM LON OG VauV SIHLNI ALUM LON OG2 Computer systems use hardware and software, (2) Two types of software are application software and system software. (i) State the purpose of application software. a) (ii) One function of an operating system is to provide a user interface. State three other functions of an operating system. (3) Wau SIHLNIALIUM LON OG 9 3 z2 $ g = 2 m = 3 BS a > R 5(b) Computers use different types of storage. (i). Explain one reason why computers need both RAM and ROM. (2) DO NOT WRITE IN THIS AREA (ii) Describe how data is read from a magnetic hard drive. (3) (c) Computers perform the fetch-decode-execute cycle. Complete the table by writing the numbers 1 to 4 in the sequence number column to put each stage in the correct order. ‘DO NOT WRITE IN THIS AREA Stage Sequence number The instruction is placed onto the data bus The Arithmetic and Logic Unit (ALU) performs a calculation The address of the next instruction is placed onto the address buy, The instruction is decoded by the control unit (4) DO NOT WRITE IN THIS AREA(d) Identify which one of these buses is unidirectional. a a a a A. Address bus B_ Control bus System bus D Data bus (Total for Question 2 = 14 marks) Wau SIHLNIALIUM LON OG Wau SIHLNI LUM LON OGBLANK PAGE Wa¥V SIHLNIZLINM.LON OG W3UV SIHLNI LUM LON OG VauV SIHLNI ALUM LON OG3 Computers use binary to represent and store data. (2) Two images are stored. + Image 1 has a colour depth of 8 bits. + Image 2 has a colour depth of 16 bits. (i) State the number of colours that can be represented in Image 1. (ii) Image 2 is 1920 pixels wide by 1080 pixels high. Construct an expression to show the file size of the image in mebibytes. You do not need to do the calculation. One pixel in Image 1 is represented by the unsigned binary integer 1100 1010 Identify the denary equivalent. OA 54 O Bi Dc 22 O Dp -4 a) (3) 0) Wau SIHLNIALIUM LON OG 9 8 2 $ g = 2 m = 3 BS a > R &‘DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA (b) A register holds the value 1100 0001 as an 8-bit binary value in two's complement. (). Convert the two's complement binary integer 1100 0001 to denary. (2) \ ) (id) Give the result of applying an arithmetic shift left by one to the binary pattern 1100 0001 a (ii) The value 1111 1111 is added to the value 1100 0001 stored in the register. An error occurs. Explain this error. (2)() The ASCII code for the character 1 is 011 0001 (i) Give the ASCII code for the character 5 ) (ii) Give two benefits of using ASCII to encode characters. (2) (Total for Question 3 = 13 marks) Wau SIHLNIALIUM LON OG 9 3 z2 $ g = 2 m = 3 BS a > R 5BLANK PAGE Wa¥V SIHLNIZLINM.LON OG W3UV SIHLNI LUM LON OG VauV SIHLNI ALUM LON OG4 Peter and Marie are employees at a research facility. (a) Peter is creating a predator-prey population simulation of rabbits and foxes. He creates rules to simulate the movement and feeding patterns for each animal over time. One benefit of the predator-prey simulation is that it real life animal populations. simpler than monitoring Explain one other benefit of using this simulation. (b) Identify the computational model in which several computer systems work together to achieve a goal. CA Sequential model OB Parallel model Cl € Multiagent model © D Input-process-output model (©) Employees at the research fa the network. ty use a biometric identifier to login to Describe one other security measure that could be used to ensure that an employee is who they claim to be. (2) ) (2) Wau SIHLNIALIUM LON OG 9 8 z2 $ g = 2 m = 3 BS a > R &‘DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA (d) Marie is a researcher in nanotechnology. (i) State what is meant by the term nanotechnology. ) (ii) Give one application of nanotechnology. (1) (e) Marie has a mobile phone. The address of the device is: 2024:0eb8:3c4d:001 5:0000:0000:1a2f:1a2b Describe the relationship between the structure of this address and the total number of bits required to store it. (3)(f) The research facil y is considering introducing cameras and facial recognition software to monitor the work and movement of people on and around its site. Discuss the privacy issues that need to be considered when deciding whether or not to install this new system. (6) n 4 = 16 marks) Wau SIHLNIALIUM LON OG 9 3 Zz S$ 3 = = m 2 a = a > a 5BLANK PAGE Wa¥V SIHLNIZLINM.LON OG W3UV SIHLNI LUM LON OG VauV SIHLNI ALUM LON OG5 Ateam is developing a computer game. (a) Complete the table by adding a tick (V7) to show the characteristics of program language translators. You may select more than one translator per characteristi Characteris (3) Translator Assembler | Interpreter Compiler Does not have to be present in memory to execute the translated code. Translates high level language source code, Executes high level code until either the program has finished, or a syntax error is encountered. Translates low level language source code into machine code. (b) Luca is testing the computer game. The computer that he is using is an older model with a processor that runs at a low clock speed. Explain one drawback of testing the game using this computer. (2) Wau SIHLNIALIUM LON OG 9 8 z2 $ g = 2 m = 3 BS a > R 5‘DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA (©) Anna uses utility software. Complete the table by adding the type of utility software she should use to solve each issue. Issue Utility software Her word processor cannot read all of afile because it is corrupt. She has a JPEG image and needs to send it to a publisher who can only read PNG image files. There has been a flood and files on aserver have been damaged, but Anna needs to access her data, Her hard drive is running very slowly when she tries to access a file (4)(d) Tarik is writing an instruction manual for the computer game. He decides to use software to compress the instruction manual before emailing it toa proofreader for checking. State and justify the most appropriate compression method. (3) Method Justification (@) Members of the team developing the game are either coders or designers. Coders (C) write the application code. Designers (D) design the graphics for the game and write instruction manuals. Team members have one role only. Construct a logic statement, using AND, OR and NOT with the letters C and D, to show the conditions for being a member of the team. (3) (Total for Question 5 = 15 marks) Wau SIHLNIALIUM LON OG 9 8 z2 $ g = 2 m = 3 BS a > R 5BLANK PAGE Wa¥V SIHLNIZLINM.LON OG W3UV SIHLNI LUM LON OG VauV SIHLNI ALUM LON OG6 Pseudocode and flowcharts are used to create algorithms. (2) The number of minutes a train is early or late are recorded each day for a week. + Avalue of 0is recorded if the train is on time, + Anegative value is recorded if the train is early. + Apositive value is recorded if the train is late. The algorithm in Figure 2 has been created to calculate and output the total number of trains that were early, on time or late. oT 02 [SET arrival 10 (-2, 1, 5, 0, -3, 4 1] 03 04__|SBT early TO 0 05 | SET late TO 0 06 [SET index TO 0 7 08__| WHILE NOT (index > DENGTH(arrival)) DO 03 10 TF arrival{index] >= 0 THEN it SET late TO arrival [index] 12 ELSE 13 If arrival {index] <0 THEN 14 SET early TO early + 1 15 END IF, 16 END IF 17 18 SET index TO index + 1 19 20__[ END WATLE 21 22 | SEND “Trains early: early TO DISPLAY 23 [SEND “Trains on time: ™ (late + early) TO DISPLAY 24 SEND "Trains * & late TO DISPLAY 25 Figure 2 Identify the type of iteration construct used in Figure 2. CA Post-conditioned loop SB Count controlled loop Ol € Array loop a D Pre-conditioned loop ) Wau SIHLNIALIUM LON OG 9 8 z2 $ g = 2 m = 3 BS a > R 5‘DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA (b) There are four errors in the pseudocode in Figure 2. Write the correct code for lines 08, 10, 11 and 23 i) Line 08 (ii) Line 10 (iii) Line 11 {iv) Line 23 (0) Give one reason for the variable i ndex being incremented in line 18. a) a) a) a) )(d) In the game FizzBuzz a user enters a number. These conditions apply: + ifthe number is divisible by 3 the program displays Fizz + ifthe number is divisible by 5 the program displays Buzz + ifthe number is divisible by both 3 and 5 the program displays FizzBuzz + ifthe number is not divisible by either 3 oF 5, the program displays the number entered Hint: If one number is d ible by another number there is no remainder. These are the components needed for the flowchart. Is number divisible by 32 Isnumber divisible by 5? Display number Display Buzz Display FizzBuzz Draw the flowchart for the algorithm used in the game in the box on the next page. Use each component once. Do not add any additional components. Use as many arrows and yes/no labels as you need. (6) Wau SIHLNIALIUM LON OG 9 8 2 $ g = 2 m 2 3 BS > R &‘DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA Draw your flowchart here. (Total for Question 6 = 12 marks) TOTAL FOR PAPER = 80 MARKSDO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA 2 = < z s aBLANK PAGE Wa¥V SIHLNIZLINM.LON OG W3UV SIHLNI LUM LON OG VauV SIHLNI ALUM LON OGDO NOT WRITE IN THIS AREA DO NOT WRITE IN THIS AREA 2 = < z s aPearson Edexcel International GCSE (9-1) Thursday 23 May 2024 Computer Science Component 1 Pseudocode command set Resource * Booklet n this Booklet with the question paper. Turn over 275736A JOON A WANA TH @Pseudocode command set Questions in the written examination that involve code will use this pseudocode for clarity and consistency. However, students may answer questions using any valid method, Data types INTEGER REAL BOOLEAN CHARACTER Type coercion Type coercion is automatic if indicated by context. For example 3 + 8.25 = 11.25 (integer + real = real) Mixed mode arithmetic is coerced like this: INTEGER REAL INTEGER INTEGER REAL REAL REAL REAL Coercion can be made explicit. For example, RECEIVE age FROM (INTEGER) KEYBOARD assumes that the input from the keyboard is interpreted as an INTEGER, not a STRING. Constants ‘The value of constants can only ever be set once. They are identified by the keyword CONST. Two examples of using a constant are shown CONST REAL PI SET PITO 3.14159 SET circumference TO radius * Pl * 2 Data structures ARRAY STRING Indices start at zero (0) for all data structures. All data structures have an append operator, indicated by & Using & with a STRING and a non-STRING will coerce to STRING. For example, SEND ‘Fred’ & age TO DISPLAY, will display a single STRING of Fred18:Identifi rs. Identifiers are sequences of letters, digits and; starting with a letter, for example: MyValue, myValue, My Value, Counter2 Functions LENGTHO For data structures consisting of an array or string, RANDOM(n) This generates a random number from 0 to n. Comments Comments are indicated by the # symbol, followed by any text. A comment can be on a line by itself or at the end of a line. Devices Use of KEYBOARD and DISPLAY are suitable for input and output. Additional devices may be required, but their function will be obvious from the context. For example, CARD_READER and MOTOR are two such devices. Notes In the following pseudocode, the < > indicates where expressions or values need to be supplied. The < > symbols are not part of the pseudocode.Variables and arrays Syntax SET Variable TO
SET Variable TO
SET Arraylindex] TO
SET Array TO [
, ..} SET Array [Rowlndex, Columnindex] TO
Selection Syntax IF
THEN
END IF IF
THEN
ELSE
END IF Explanation of syntax Assigns a value to a variable. ‘Computes the value of an expression and assigns to a variable. Assigns a value to an element of a one-dimensional array. Initialises a one-dimensional array with a set of values. Assigns a value to an element of a two dimensional array. Explanation of syntax If
is true then ‘command is executed. If
is true then first
is executed, otherwise second
is executed, Example SET Counter TO 0 SET MyString TO ‘Hello world” SET Sum TO Score + 10 SET Size to LENGTH(Word) SET ArrayClass{1] TO‘Ann’ SET ArrayMarks(3]TO 56 SET ArrayValues TO [1, 2, 3, 4, 5) SET ArrayClassMarks(2,4] TO 92 Example IF Answer = 10 THEN SET Score TO Score +1 END IF IF Answer ='correct’ THEN ‘SEND ‘Well done’TO DISPLAY ELSE SEND ‘Try again’ TO DISPLAY END IFRepetition Syntax WHILE
DO
END WHILE REPEAT
UNTIL
REPEAT
TIMES
END REPEAT FOR
FROM
To
DO
END FOR FOR
FROM
To
STEP
DO
END FOR FOR EACH
FROM
DO
END FOREACH Explanation of syntax Pre-conditioned loop. Executes
whilst
is true. Post-conditioned loop. Executes
until
is true. The loop must execute at least once. Count controlled loop. The number of times
is executed is determined by the expression. Count controlled loop. Executes
a fixed number of times. Count controlled loop using astep. Count controlled loop. Executes for each element of an array, Example WHILE Flag = 0 DO ‘SEND ‘All well’ TO DISPLAY END WHILE REPEAT SETGoTOGo+1 UNTIL Go = 10 REPEAT 100-Number TIMES ‘SEND “*’TO DISPLAY END REPEAT FOR Index FROM 1 TO 10 DO SEND ArrayNumbers[index] TO DISPLAY END FOR FOR Index FROM 1 TO 500 STEP 25 DO SEND Index TO DISPLAY END FOR, SET WordsArray TO ['The, ‘Sky; ‘is,‘grey'] SET Sentence to” FOR EACH Word FROM WordsUArray DO SET Sentence TO Sentence & Word &'" END FOREACHInput/output ‘Syntax SEND
TO DISPLAY RECEIVE
FROM (type)
File han Syntax READ
WRITE
Subprograms Syntax PROCEDURE
(
, ...) BEGIN PROCEDURE
END PROCEDURE FUNCTION
(
, ...) BEGIN FUNCTION
RETURN
END FUNCTION
(
, ...) Explanation of syntax Sends output to the screen. Reads input of specified type. Explanation of syntax Reads in a record from a
and assigns to a
Each READ statement reads a record from the file. Writes a record to a file. Each WRITE statement writes a record to the file, Explanation of syntax Defines a procedure. Defines a function. Calls a procedure ora function Example SEND 'Have a good day’TO DISPLAY RECEIVE Name FROM (STRING) KEYBOARD RECEIVE LengthOfJourney FROM (INTEGER) CARD_READER RECEIVE YesNo FROM. (CHARACTER) CARD_READER Example READ MyFile.doc Record WRITE MyFile.doc Answer1, Answer2, ‘xyz 01" Example PROCEDURE CalculateAverage (Markt, Mark2, Mark3) BEGIN PROCEDURE SET Avg to (Mark1 + Mark2 + Mark3)/3 END PROCEDURE FUNCTION AddMarks (Mark1, Mark2, Mark3) BEGIN FUNCTION SET Total to (Mark! + Mark2 + Mark3)/3 RETURN Total END FUNCTION Add (FirstMark, SecondMark)Arithmetic operators symbol Description + Add - Subtract / Divide * Multiply a Exponent MOD Modulo Dv Integer division Relational operators Symbol Description = equal to ° not equal to > greater than > greater than or equal to < less than <= less than or equal to Logical operators Symbol Description AND Returns true if both conditions are true. oR Returns true if any of the conditions are true. Reverses the outcome of the NoT expression; true becomes false, false becomes true.Sereno BLANK PAGE
You might also like
Paper 1 2023
PDF
100% (1)
Paper 1 2023
32 pages
CompSci U1 P2 2024
PDF
No ratings yet
CompSci U1 P2 2024
16 pages
Edexcel GCSE Paper 1 - Principles of Computer Science
PDF
No ratings yet
Edexcel GCSE Paper 1 - Principles of Computer Science
15 pages
Edexcel Computer Science IGCSE Revision Paper
PDF
100% (1)
Edexcel Computer Science IGCSE Revision Paper
15 pages
RI QP Computer Science Grade 8 Cambridge TT2 20022024 VF
PDF
No ratings yet
RI QP Computer Science Grade 8 Cambridge TT2 20022024 VF
8 pages
lcp11 01 Que 20221011
PDF
No ratings yet
lcp11 01 Que 20221011
24 pages
Computer Science 12 Ques Papers
PDF
No ratings yet
Computer Science 12 Ques Papers
176 pages
Paper 2 Computer Science QS
PDF
No ratings yet
Paper 2 Computer Science QS
50 pages
Computer Science Summer Pack 11C 2025
PDF
No ratings yet
Computer Science Summer Pack 11C 2025
68 pages
2425 EOY Final Exam Revision
PDF
No ratings yet
2425 EOY Final Exam Revision
45 pages
4cp0 01 Que 20230527
PDF
No ratings yet
4cp0 01 Que 20230527
35 pages
Self Learning Activities
PDF
No ratings yet
Self Learning Activities
101 pages
GCSE L1 L2 Computer Science 2020 Sample Assessment Materials For Paper 1
PDF
No ratings yet
GCSE L1 L2 Computer Science 2020 Sample Assessment Materials For Paper 1
32 pages
Friday 19 May 2023 - Afternoon: © OCR 2023 (601/8355/X) DC (ST) 331160
PDF
No ratings yet
Friday 19 May 2023 - Afternoon: © OCR 2023 (601/8355/X) DC (ST) 331160
28 pages
Y9 Computing Assignment
PDF
No ratings yet
Y9 Computing Assignment
38 pages
4CP0 01 Que 20210429
PDF
No ratings yet
4CP0 01 Que 20210429
28 pages
Msmslsls
PDF
No ratings yet
Msmslsls
28 pages
0478 - 11 Computer Science - Question Paper June 2018
PDF
No ratings yet
0478 - 11 Computer Science - Question Paper June 2018
12 pages
2023 CSC Examination
PDF
No ratings yet
2023 CSC Examination
44 pages
WJEC GCSE Computer Science Paper 1 June 2022 QP
PDF
No ratings yet
WJEC GCSE Computer Science Paper 1 June 2022 QP
27 pages
4CP0 - Computer Science Igcse Edxecel Paper 1 2023
PDF
No ratings yet
4CP0 - Computer Science Igcse Edxecel Paper 1 2023
18 pages
Friday, 19 May 2023 - Afternoon Unit 1: Understanding Computer Science
PDF
No ratings yet
Friday, 19 May 2023 - Afternoon Unit 1: Understanding Computer Science
23 pages
Past Paper
PDF
No ratings yet
Past Paper
24 pages
BVSS 2019 P1
PDF
No ratings yet
BVSS 2019 P1
16 pages
Ig - Compscience - TRP - Mockexam - Paper 1
PDF
No ratings yet
Ig - Compscience - TRP - Mockexam - Paper 1
16 pages
Computer Science Paper 1 HL
PDF
No ratings yet
Computer Science Paper 1 HL
7 pages
Unit j276 01 Computer Systems Sample Assessment Materials
PDF
No ratings yet
Unit j276 01 Computer Systems Sample Assessment Materials
28 pages
Mock Simulation Year11
PDF
No ratings yet
Mock Simulation Year11
16 pages
4cp0-01-June-2021 EDEXCEL IGCSE COMPUTER SCIENCE - Paper1
PDF
No ratings yet
4cp0-01-June-2021 EDEXCEL IGCSE COMPUTER SCIENCE - Paper1
28 pages
April Holiday
PDF
No ratings yet
April Holiday
16 pages
Computer Science GR 9 T1 Exam Nov 2023
PDF
No ratings yet
Computer Science GR 9 T1 Exam Nov 2023
14 pages
CS Year 10 Theory June 2022
PDF
No ratings yet
CS Year 10 Theory June 2022
14 pages
June 2020 (v2) QP - Paper 1 CAIE Computer Science GCSE
PDF
No ratings yet
June 2020 (v2) QP - Paper 1 CAIE Computer Science GCSE
12 pages
Computer Science: Pearson Edexcel GCSE
PDF
No ratings yet
Computer Science: Pearson Edexcel GCSE
20 pages
CompSci U1 P2 2019
PDF
No ratings yet
CompSci U1 P2 2019
26 pages
2023 Specimen Paper 1a
PDF
No ratings yet
2023 Specimen Paper 1a
12 pages
Cambridge IGCSE: Computer Science 0478/13
PDF
No ratings yet
Cambridge IGCSE: Computer Science 0478/13
12 pages
Paper 1 Question Paper 2022
PDF
No ratings yet
Paper 1 Question Paper 2022
28 pages
Cambridge IGCSE: Computer Science 0478/13
PDF
No ratings yet
Cambridge IGCSE: Computer Science 0478/13
12 pages
451-1 Crescendo 1 2025
PDF
No ratings yet
451-1 Crescendo 1 2025
11 pages
P1 Exam2 QP
PDF
No ratings yet
P1 Exam2 QP
14 pages
4CP0 01 Que 20210429
PDF
No ratings yet
4CP0 01 Que 20210429
28 pages
7.1 Computing MS Semester 1 24-25
PDF
No ratings yet
7.1 Computing MS Semester 1 24-25
9 pages
Cambridge International General Certificate of Secondary Education
PDF
No ratings yet
Cambridge International General Certificate of Secondary Education
12 pages
June 2018 (v1) QP - Paper 1 CAIE Computer Science GCSE
PDF
No ratings yet
June 2018 (v1) QP - Paper 1 CAIE Computer Science GCSE
12 pages
Cambridge International General Certificate of Secondary Education
PDF
No ratings yet
Cambridge International General Certificate of Secondary Education
12 pages
Untitled Document
PDF
No ratings yet
Untitled Document
7 pages
Images675874 2023 Specimen Paper 1b PDF
PDF
No ratings yet
Images675874 2023 Specimen Paper 1b PDF
12 pages
Cambridge IGCSE: Computer Science 0478/12
PDF
No ratings yet
Cambridge IGCSE: Computer Science 0478/12
11 pages
Cambridge IGCSE: Computer Science 0478/12
PDF
No ratings yet
Cambridge IGCSE: Computer Science 0478/12
12 pages
2210 s18 QP 12
PDF
No ratings yet
2210 s18 QP 12
12 pages
0478 s18 QP 11 PDF
PDF
No ratings yet
0478 s18 QP 11 PDF
11 pages
June 2005 Paper 3
PDF
No ratings yet
June 2005 Paper 3
4 pages
Practice Paper1 AnswerScheme Sec05
PDF
No ratings yet
Practice Paper1 AnswerScheme Sec05
4 pages
GCSE Exam Questions
PDF
No ratings yet
GCSE Exam Questions
5 pages
Component 1 SAM
PDF
No ratings yet
Component 1 SAM
18 pages
Computer Science Paper 1 HL
PDF
No ratings yet
Computer Science Paper 1 HL
7 pages
Computer Science Standard Level Paper 1
PDF
No ratings yet
Computer Science Standard Level Paper 1
6 pages
Unit 3 Physical Chemistry
PDF
No ratings yet
Unit 3 Physical Chemistry
51 pages
Chemistry September 2024 p2 Mark Scheme
PDF
No ratings yet
Chemistry September 2024 p2 Mark Scheme
11 pages
Chemistry September 2024 p2 Question Paper
PDF
No ratings yet
Chemistry September 2024 p2 Question Paper
25 pages
Abdullah Haris 11-D Q01c
PDF
No ratings yet
Abdullah Haris 11-D Q01c
7 pages