A Level Computer Science Revision Pack
i i i i i i
02 – Algorithms and Programming
i i i i
Thei marki schemei fori eachi paperi followsi thei questions
Includedi (ini orderi ofi appearance)
2019
2018
2017
Howi toi revisei Computeri Science
Practicei questionsi fromi pasti papersi arei onei ofi thei besti methodsi ofi revisingi topicsi fromi thei
course.i Thisi approach,i accompaniedi byi creatingi notesi andi readingi thei coursei textbooki asi ai
sourcei fori information,i hasi proveni successfuli fori manyi ofi ouri previousi students.
Howi toi revisei ai particulari topic
thisi isi generici andi byi noi meansi ai onei sizei fitsi alli approach
1. Oni ai singlei sheeti ofi A4,i writei downi everythingi youi currentlyi knowi abouti thei topic.i
Doi thisi priori toi readingi thei coursei textbooki ori seekingi helpi fromi previousi notes.
2. Nowi consulti coursei textbooki fori thei topici andi addi toi thisi sheet,i anythingi youi didi noti
knowi thati isi necessaryi –i oncei complete,i highlighti thesei pointsi –i thesei arei thei areasi
youi needi toi learn.
3. Locatei questionsi basedi aroundi thisi topici ini thei pasti paperi packi andi attempti toi
answeri them.
4. Confirmi withi thei marki schemei asi toi youri successi ini answeringi thei question.
Thei endi goali ofi thisi approachi wouldi bei thati youi arei comfortablyi ablei toi producei ai piecei ofi
A4i fori eachi topici ofi thei coursei andi theni applyi thisi informationi toi thei pasti paperi questions.
Obtainingi feedbacki fori answers
Thei studentsi whoi succeedi thei besti ini computeri sciencei arei thosei whoi seeki constanti feedbacki
fromi teachers,i noti justi ini thei scopei ofi ai lesson.i Anyi worki youi producei outi ofi lessoni suchi asi
pasti paperi questioni answersi ori programmingi challenges,i youi shouldi wanti toi seeki feedbacki
for.i Thisi cani bei achievedi by:
1. Takingi worki toi ai teacheri duringi schooli time.
2. Emailingi ai teacheri youri answers,i questionsi etc.
Mri Ravenscrofti –i
Mri Ebrahimi –i
Asi youri teachersi wei wanti toi givei youi feedback!
, Study Skills and Support
i i i
Exami board:i OCR
Coursei length:i 2i years
Howi isi iti assessed?i 2i writteni examsi oni 01i –i Computeri Systemsi andi 02i –i Algorithmsi
andi Programmingi (eachi worthi 40%)i andi ai programmingi projecti worthi 20%.
Modulesi covered:
01 –i Processors,i Inputi –i Outputi andi Storage,i Systemsi software,i softwarei development,i
compression,i databases,i networks,i webi technologies,i datai types,i datai structures,i
Booleani algebra,i moralsi andi ethics.
02 –i Thinkingi abstractly;i ahead;i procedurally;i logically;i concurrently,i programingi
techniques,i computationali methods,i algorithms.
Familiarityi withi assessmenti objectivesi Embedi andi commiti knowledgei andi
independenti Study
isi necessaryi ini exami answersi toi understandingi toi longi termi memoryi
Purposei ofi
ensurei applicationi andi evaluation fori examinationi recall
Developi awarenessi andi appreciationi
Developi understandingi ofi
fori thei usei ofi computeri sciencei ini
programmingi beyondi thei curriculumi
thei wideri world;i whichi cani bei
toi enablei successi ini thei
includedi ini extendedi answers
programmingi project
Resource Link Usefuli For… Requirements
Coursei N/A Independenti revisioni &i Coursei
Textbook study textbooki fromi
thei schooli
library.
YouTube YouTube Knowledgei N/A
booster,i secondi
voice
Pasti N/A Exami stylei questioni Pasti paperi packi
Paperi practice,i fromi classi teacher
Packs independenti study
Departmentali Alli storedi withini thei Microsofti Teamsi Accessingi Schooli emaili andi
resources Teami fori thei group. departmentali passwordi login.
materialsi andi lessons
Mri Fraser www.mrfraser.org Accessingi mrfraser.orgi
resourcesi andi logini accounti
worki sheets (freei toi create)
Craigi ni Dave craigndave.org Resourcesi fori topicsi –i Accessi isi freei fori
brokeni downi byi spec mosti contenti –i
schooli hasi ai paidi
account
AQAi Searchi ‘AQAi Ai Leveli Computeri Sciencei Differenti phrasingi ofi N/A
Pasti Pasti Papers’i oni Google. exami stylei questions.
Papers
Classi Teachers
, Oxfordi Cambridgei andi RSA
Tuesday 11 June 2019 – Morning
i i i i i
A Level Computer Science
i i i
H446/02 i Algorithms and programming
i i
Timei allowed:i 2i hoursi 30i minutes
Youi mayi use:
i
*7678005047*
• ai ruleri (cm/mm)
• ani HBi pencil
Doi noti use:
• ai calculator
* H 4 4 6 0 2 *
Pleasei writei clearlyi ini blacki ink.i Doi noti writei ini thei
barcodes.
Centrei number Candidatei number
Firsti name(s)
Lasti i
name
INSTRUCTIONS
• Usei blacki ink.
• Answeri alli thei questions.
• Writei youri answeri toi eachi questioni ini thei spacei provided.i Additionali paperi mayi
bei usedi ifi requiredi buti youi musti clearlyi showi youri candidatei number,i centrei
numberi andi questioni number(s).
INFORMATION
• Thei totali marki fori thisi paperi isi 140.
• Thei marksi fori eachi questioni arei showni ini bracketsi [i ].
• Qualityi ofi extendedi responsesi willi bei assessedi ini questionsi markedi withi
ani asteriski (*).
• Thisi documenti consistsi ofi 24i pages.
©i OCRi 2019i OCRi isi ani exempti
[601/4911/5]i DCi (JC/TP)i Charity Turni over
173313/4
, 2
Sectioni A
1 Thei temperaturesi ofi ani oceani arei inputi intoi ai computeri system.i Theyi arei recorded,i andi
willi bei accessed,i ini thei orderi ini whichi theyi arrive.i Thei datai fori onei weeki isi shown:
5,i 5.5,i 5,i 6,i 7,i 6.5,i 6
(a) Thei datai isi toi bei storedi ini ai datai structure.i Thei programmeri storesi thei datai ini ai
queue.
Explaini whyi ai queuei isi usedi insteadi ofi ai stack.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
. .......................................................................................................................................... [2]
(b) Thei datai isi processed.i Afteri processing,i thei valuei fori thei firsti dayi isi storedi asi 0.i Thei
valuei fori eachi followingi dayi isi storedi asi ani increase,i ori decrease,i fromi thei firsti day.
Fori example:i ifi thei firsti dayi wasi 7,i thei secondi wasi 6i andi thei thirdi wasi 9,i afteri
processingi iti wouldi bei storedi asi 0,i –1,i 2.
(i) Thei queuei usesi dequeue()itoi returni thei firsti elementi ofi thei queue.
dequeue()iisi ai function.
Explaini whyi dequeue()iisi ai function,i noti ai procedure.
...........................................................................................................................................
. .................................................................................................................................. [1]
(ii) Completei thei algorithmi toi processi thei datai ini thei queuei andi storei thei resultsi ini ani
arrayi calledi processedData.
processedData[0]i =i 0i
firstDayi =i ………………………………………i
fori counti =i 1i toi 6
processedData[………………………………]i =i dequeue()i –i …………………………………
nexti count
[3]
©i OCRi
2019
i i i i i i
02 – Algorithms and Programming
i i i i
Thei marki schemei fori eachi paperi followsi thei questions
Includedi (ini orderi ofi appearance)
2019
2018
2017
Howi toi revisei Computeri Science
Practicei questionsi fromi pasti papersi arei onei ofi thei besti methodsi ofi revisingi topicsi fromi thei
course.i Thisi approach,i accompaniedi byi creatingi notesi andi readingi thei coursei textbooki asi ai
sourcei fori information,i hasi proveni successfuli fori manyi ofi ouri previousi students.
Howi toi revisei ai particulari topic
thisi isi generici andi byi noi meansi ai onei sizei fitsi alli approach
1. Oni ai singlei sheeti ofi A4,i writei downi everythingi youi currentlyi knowi abouti thei topic.i
Doi thisi priori toi readingi thei coursei textbooki ori seekingi helpi fromi previousi notes.
2. Nowi consulti coursei textbooki fori thei topici andi addi toi thisi sheet,i anythingi youi didi noti
knowi thati isi necessaryi –i oncei complete,i highlighti thesei pointsi –i thesei arei thei areasi
youi needi toi learn.
3. Locatei questionsi basedi aroundi thisi topici ini thei pasti paperi packi andi attempti toi
answeri them.
4. Confirmi withi thei marki schemei asi toi youri successi ini answeringi thei question.
Thei endi goali ofi thisi approachi wouldi bei thati youi arei comfortablyi ablei toi producei ai piecei ofi
A4i fori eachi topici ofi thei coursei andi theni applyi thisi informationi toi thei pasti paperi questions.
Obtainingi feedbacki fori answers
Thei studentsi whoi succeedi thei besti ini computeri sciencei arei thosei whoi seeki constanti feedbacki
fromi teachers,i noti justi ini thei scopei ofi ai lesson.i Anyi worki youi producei outi ofi lessoni suchi asi
pasti paperi questioni answersi ori programmingi challenges,i youi shouldi wanti toi seeki feedbacki
for.i Thisi cani bei achievedi by:
1. Takingi worki toi ai teacheri duringi schooli time.
2. Emailingi ai teacheri youri answers,i questionsi etc.
Mri Ravenscrofti –i
Mri Ebrahimi –i
Asi youri teachersi wei wanti toi givei youi feedback!
, Study Skills and Support
i i i
Exami board:i OCR
Coursei length:i 2i years
Howi isi iti assessed?i 2i writteni examsi oni 01i –i Computeri Systemsi andi 02i –i Algorithmsi
andi Programmingi (eachi worthi 40%)i andi ai programmingi projecti worthi 20%.
Modulesi covered:
01 –i Processors,i Inputi –i Outputi andi Storage,i Systemsi software,i softwarei development,i
compression,i databases,i networks,i webi technologies,i datai types,i datai structures,i
Booleani algebra,i moralsi andi ethics.
02 –i Thinkingi abstractly;i ahead;i procedurally;i logically;i concurrently,i programingi
techniques,i computationali methods,i algorithms.
Familiarityi withi assessmenti objectivesi Embedi andi commiti knowledgei andi
independenti Study
isi necessaryi ini exami answersi toi understandingi toi longi termi memoryi
Purposei ofi
ensurei applicationi andi evaluation fori examinationi recall
Developi awarenessi andi appreciationi
Developi understandingi ofi
fori thei usei ofi computeri sciencei ini
programmingi beyondi thei curriculumi
thei wideri world;i whichi cani bei
toi enablei successi ini thei
includedi ini extendedi answers
programmingi project
Resource Link Usefuli For… Requirements
Coursei N/A Independenti revisioni &i Coursei
Textbook study textbooki fromi
thei schooli
library.
YouTube YouTube Knowledgei N/A
booster,i secondi
voice
Pasti N/A Exami stylei questioni Pasti paperi packi
Paperi practice,i fromi classi teacher
Packs independenti study
Departmentali Alli storedi withini thei Microsofti Teamsi Accessingi Schooli emaili andi
resources Teami fori thei group. departmentali passwordi login.
materialsi andi lessons
Mri Fraser www.mrfraser.org Accessingi mrfraser.orgi
resourcesi andi logini accounti
worki sheets (freei toi create)
Craigi ni Dave craigndave.org Resourcesi fori topicsi –i Accessi isi freei fori
brokeni downi byi spec mosti contenti –i
schooli hasi ai paidi
account
AQAi Searchi ‘AQAi Ai Leveli Computeri Sciencei Differenti phrasingi ofi N/A
Pasti Pasti Papers’i oni Google. exami stylei questions.
Papers
Classi Teachers
, Oxfordi Cambridgei andi RSA
Tuesday 11 June 2019 – Morning
i i i i i
A Level Computer Science
i i i
H446/02 i Algorithms and programming
i i
Timei allowed:i 2i hoursi 30i minutes
Youi mayi use:
i
*7678005047*
• ai ruleri (cm/mm)
• ani HBi pencil
Doi noti use:
• ai calculator
* H 4 4 6 0 2 *
Pleasei writei clearlyi ini blacki ink.i Doi noti writei ini thei
barcodes.
Centrei number Candidatei number
Firsti name(s)
Lasti i
name
INSTRUCTIONS
• Usei blacki ink.
• Answeri alli thei questions.
• Writei youri answeri toi eachi questioni ini thei spacei provided.i Additionali paperi mayi
bei usedi ifi requiredi buti youi musti clearlyi showi youri candidatei number,i centrei
numberi andi questioni number(s).
INFORMATION
• Thei totali marki fori thisi paperi isi 140.
• Thei marksi fori eachi questioni arei showni ini bracketsi [i ].
• Qualityi ofi extendedi responsesi willi bei assessedi ini questionsi markedi withi
ani asteriski (*).
• Thisi documenti consistsi ofi 24i pages.
©i OCRi 2019i OCRi isi ani exempti
[601/4911/5]i DCi (JC/TP)i Charity Turni over
173313/4
, 2
Sectioni A
1 Thei temperaturesi ofi ani oceani arei inputi intoi ai computeri system.i Theyi arei recorded,i andi
willi bei accessed,i ini thei orderi ini whichi theyi arrive.i Thei datai fori onei weeki isi shown:
5,i 5.5,i 5,i 6,i 7,i 6.5,i 6
(a) Thei datai isi toi bei storedi ini ai datai structure.i Thei programmeri storesi thei datai ini ai
queue.
Explaini whyi ai queuei isi usedi insteadi ofi ai stack.
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
. .......................................................................................................................................... [2]
(b) Thei datai isi processed.i Afteri processing,i thei valuei fori thei firsti dayi isi storedi asi 0.i Thei
valuei fori eachi followingi dayi isi storedi asi ani increase,i ori decrease,i fromi thei firsti day.
Fori example:i ifi thei firsti dayi wasi 7,i thei secondi wasi 6i andi thei thirdi wasi 9,i afteri
processingi iti wouldi bei storedi asi 0,i –1,i 2.
(i) Thei queuei usesi dequeue()itoi returni thei firsti elementi ofi thei queue.
dequeue()iisi ai function.
Explaini whyi dequeue()iisi ai function,i noti ai procedure.
...........................................................................................................................................
. .................................................................................................................................. [1]
(ii) Completei thei algorithmi toi processi thei datai ini thei queuei andi storei thei resultsi ini ani
arrayi calledi processedData.
processedData[0]i =i 0i
firstDayi =i ………………………………………i
fori counti =i 1i toi 6
processedData[………………………………]i =i dequeue()i –i …………………………………
nexti count
[3]
©i OCRi
2019
