0% found this document useful (0 votes)

59 views32 pages

June 2023 QP - Paper 2 OCR Computer Science A-Level

Uploaded by

israk.ala2007

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

59 views32 pages

June 2023 QP - Paper 2 OCR Computer Science A-Level

Uploaded by

israk.ala2007

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 32

PMT

Oxford Cambridge and RSA

Monday 19 June 2023 – Morning

A Level Computer Science
H446/02 Algorithms and programming
Time allowed: 2 hours 30 minutes

You can use:

* 9 1 0 5 6 6 9 5 3 8 *

• a ruler (cm/mm)
• an HB pencil
Do not use:
• a calculator

* H 4 4 6 0 2 *

Please write clearly in black ink. Do not write in the barcodes.

Centre number Candidate number

First name(s)

Last name

INSTRUCTIONS
• Use black ink. You can use an HB pencil, but only for graphs and diagrams.
• Write your answer to each question in the space provided. If you need extra space use
the lined pages at the end of this booklet. The question numbers must be clearly shown.
• Answer all the questions.

INFORMATION
• The total mark for this paper is 140.
• The marks for each question are shown in brackets [ ].
• Quality of extended response will be assessed in questions marked with an
asterisk (*).
• This document has 32 pages.

ADVICE
• Read each question carefully before you start your answer.

© OCR 2023 [601/4911/5] OCR is an exempt Charity

DC (ST/SW) 312345/4 Turn over
PMT

2
BLANK PAGE

PLEASE DO NOT WRITE ON THIS PAGE

3
Section A

1 A tree is one example of a data structure.

(a) (i) Give two characteristics of a tree data structure.

1 ........................................................................................................................................

...........................................................................................................................................

2 ........................................................................................................................................

...........................................................................................................................................
[2]

(ii) The following data is entered into a binary search tree.

22 13 5 36 55 14 8
Draw the binary search tree when the given data is entered in the order given.

[4]

© OCR 2023 Turn over

PMT

4
(iii) Describe how a leaf node is deleted from a binary search tree.

...........................................................................................................................................

...................................................................................................................................... [2]

(iv) Describe how a binary search tree can be searched for a value.

...........................................................................................................................................

...................................................................................................................................... [4]

5
(v) Identify the order that the nodes will be visited in a depth-first (post-order) traversal of
this binary search tree.

H
C P
A F L T
...................................................................................................................................... [4]

(vi) Explain how backtracking is used in depth-first (post-order) traversals.

...........................................................................................................................................

...................................................................................................................................... [2]

© OCR 2023 Turn over

PMT

6
(b) A graph is another type of data structure.

An example graph is shown in Fig. 1.

2 C
A

G
5 8
10
4

B
D
12 1

8 F
E

Fig. 1

7
Show how Dijkstra’s algorithm can be used on the graph shown in Fig. 1 to find the shortest
path from start node A to end node G.

You must state the nodes on the final path and the distance of this path. Show your working.

You may use the table below to give your answer.

...................................................................................................................................................

Node Distance travelled Previous node

Final path: ..............................................................................

Distance: ................................................................................
[6]

© OCR 2023 Turn over

PMT

8
2* A company needs a new computer program that will create schedules for delivery drivers. It will
need to identify a possible order that the drivers can deliver items and possible routes they could
take.

Discuss how programmers could make use of problem recognition and problem decomposition
when designing this system.

You should include the following in your answer:

• a description of both problem recognition and decomposition
• how each method can be used when designing the solution
• the benefits of using each method when designing the solution.
[9]

..........................................................................................................................................................

© OCR 2023 Turn over

PMT

10
3 A program stores data in a linked list.

The current contents of the linked list are shown in Fig. 3, along with the linked list pointers.

location data pointer

headPointer 1 0 "blue" 6
freeListPointer 4 1 "red" 0
2 "green" 8
3 "orange" NULL
4 5
5 7
6 "grey" 2
7 9
8 "purple" 3
9 NULL

Fig. 3

(a) State the purpose of headPointer and freeListPointer in the linked list shown in
Fig. 3.

headPointer ..........................................................................................................................

...................................................................................................................................................

freeListPointer ................................................................................................................

...................................................................................................................................................
[2]

(b) State the meaning of the pointers with the value NULL in the linked list shown in Fig. 3.

...................................................................................................................................................

.............................................................................................................................................. [1]

Give the output from the procedure.

...................................................................................................................................................

.............................................................................................................................................. [2]

11
(d) A new item needs to be added to the linked list.

Describe how a new item is added to a linked list.

...................................................................................................................................................

.............................................................................................................................................. [4]

(e) The function findNode will search the linked list and return either the position of the node
that contains the data item, or -1 if the data item is not found.

The data held in a node at location x can be accessed with linkedList[x].data. The
pointer of the node at location x can be accessed with linkedList[x].pointer.

For example, using the linked list shown in Fig. 3:

linkedList[2].data returns green.
linkedList[2].pointer returns 8.

Complete the function, using pseudocode or program code.

function findNode(toFind, headPointer, linkedList)

currentNode = ………………………………
while(currentNode != ………………………………)
if linkedList[currentNode]. ……………………………… == toFind then
return currentNode
else
currentNode = linkedList[………………………………].pointer
endif
endwhile
return ………………………………
endfunction
[5]

© OCR 2023 Turn over

PMT

12
4 A programmer has designed a program that includes a reusable program component.

(a) The reusable program component is a function called isInteger(). This will take a string
as an argument and then check that each digit is between 0 and 9. For example if 103 is
input, it will check that the digits 1, 0 and 3 are each between 0 and 9.

The asc() function returns the ASCII value of each digit. For example asc("1") returns
49.

The ASCII value for 0 is 48. The ASCII value for 9 is 57.

01 function isInteger(number)
02 result = true
03 for count = 0 to number.length-1
04 asciiValue = asc(number.substring(count, 1))
05 if not(asciiValue >= 48 and asciiValue <= 57) then
06 result = false
07 endif
08 next count
09 return result
10 endfunction

(i) Identify one identifier used in the function isInteger().

...................................................................................................................................... [1]

(ii) Give the line number where the branching (selection) construct starts in the function
isInteger().

...................................................................................................................................... [1]

(iii) Give the line number where the iteration construct starts in the function isInteger().

...................................................................................................................................... [1]

13
(b) Describe the purpose of the following lines in the function isInteger().

Line 03 ......................................................................................................................................

...................................................................................................................................................

Line 04 ......................................................................................................................................

...................................................................................................................................................

Line 09 ......................................................................................................................................

...................................................................................................................................................
[3]

1 ................................................................................................................................................

...................................................................................................................................................

2 ................................................................................................................................................

...................................................................................................................................................
[2]

© OCR 2023 Turn over

PMT

14
5 A recursive pseudocode function, recursiveAlgorithm(), is shown.

01 function recursiveAlgorithm(value)
02 if value <= 0 then
03 return 1
04 elseif value MOD 2 = 0 then
05 return value + recursiveAlgorithm(value – 3)
06 else
07 return value + recursiveAlgorithm(value – 1)
08 endif
09 endfunction

(a) Describe the key features of a recursive algorithm.

You may refer to the function, recursiveAlgorithm() in your answer.

...................................................................................................................................................

.............................................................................................................................................. [3]

15
(b) Trace the recursive function, recursiveAlgorithm(), and give the final return value
when called with recursiveAlgorithm(10). You may choose to use the table below to
give your answer.

...................................................................................................................................................

Function call value return

Final return value .................................................. [5]

© OCR 2023 Turn over

PMT

16
6 Octal is a base 8 number system.

To convert a denary number to base 8:

• the denary value is divided by 8 and the remainder is stored
• the integer value after division is divided by 8 repeatedly until 0 is reached
• the remainders are then displayed in reverse order.

Example 1:
Denary 38
38 / 8 = 4 remainder 6 6
4 / 8 = 0 remainder 4 4
Octal = 46

Example 2:
Denary 57
57 / 8 = 7 remainder 1 1
7 / 8 = 0 remainder 7 7
Octal = 71

Write an algorithm to:

• take a denary value as input from the user
• convert the number to octal
• output the octal value.

You do not need to validate the input from the user.

Write your algorithm using pseudocode or program code.

..........................................................................................................................................................

..................................................................................................................................................... [6]

17
BLANK PAGE

PLEASE DO NOT WRITE ON THIS PAGE

© OCR 2023 Turn over

PMT

18
7* (a) A program designer needs to decide on an algorithm to use from a choice of three. The table
shows the worst-case Big O complexities for each algorithm.

Algorithm Time Complexity Space Complexity

1 Linear Exponential
2 Exponential Constant
3 Logarithmic Logarithmic

The program will be used to analyse data that can range from 2 items to 2 billion items.

Compare the use of all three algorithms and suggest which the programmer should use.

You should include the following in your answer:

• the meaning of constant, logarithmic, linear and exponential complexity
• how well each algorithm scales as the amount of data increases
• which algorithm is the most suitable for the given task.
[9]

...................................................................................................................................................

© OCR 2023 Turn over

PMT

20
(b) The program designer is investigating the use of concurrent processing.

(i) Describe what is meant by the term ‘concurrent processing’.

...........................................................................................................................................

..................................................................................................................................... [2]

(ii) Give two benefits of using concurrent processing.

1 ........................................................................................................................................

...........................................................................................................................................

2 ........................................................................................................................................

...........................................................................................................................................
[2]

21
(c) The programmer needs to use a merge sort in one part of the problem to sort items in
ascending order.

(i) Describe how a merge sort works.

...........................................................................................................................................

...................................................................................................................................... [5]

(ii) Give one benefit and one drawback of the programmer using a merge sort instead of a
bubble sort.

Benefit ...............................................................................................................................

...........................................................................................................................................

Drawback ..........................................................................................................................

...........................................................................................................................................
[2]

© OCR 2023 Turn over

PMT

22
(d) The programmer uses an Integrated Development Environment (IDE).

Complete the table by identifying and describing three IDE features that can help the
programmer to develop, or debug a program.

IDE feature Description

[6]

23
8 A program is being designed that will allow a user to log into an account on a website using a
username and password.

(a) Identify two possible inputs and one output this program will need.

Input 1 .......................................................................................................................................

...................................................................................................................................................

Input 2 .......................................................................................................................................

...................................................................................................................................................

Output .......................................................................................................................................

...................................................................................................................................................
[3]

(b) Identify two possible sub-procedures that could be used in this program.

1 ................................................................................................................................................

...................................................................................................................................................

2 ................................................................................................................................................

...................................................................................................................................................
[2]

PMT

24
BLANK PAGE

PLEASE DO NOT WRITE ON THIS PAGE

25
Section B

9 A text-based computer game allows a user to dig for treasure on an island. The island is
designed as a grid with 10 rows and 20 columns to store the treasure. Each square is given an
x and y coordinate. Some of the squares in the grid store the name of a treasure object. Each
treasure object has a value, e.g. 100 and a level, e.g. "Bronze."

(a) The computer game makes use of abstraction.

(i) Describe what is meant by the term abstraction and give an example of how abstraction
can be used in the treasure game.

Description: .......................................................................................................................

...........................................................................................................................................

Example: ...........................................................................................................................

...........................................................................................................................................
[3]

(ii) Give three benefits of using abstraction when writing a program.

1 ........................................................................................................................................

...........................................................................................................................................

2 ........................................................................................................................................

...........................................................................................................................................

3 ........................................................................................................................................

...........................................................................................................................................
[3]

PMT

26
(b) The treasure game is being programmed using an object-oriented paradigm.

A class, Treasure, is used to store the treasure objects.

The design for the Treasure class, its attributes and methods is shown here.

class: Treasure
attributes:
private value : integer
private level : string
methods:
new()
function getValue()
function getLevel()

(i) The constructor method takes a value as an integer, e.g. 100, and a level, e.g. "bronze",
as parameters and assigns these to the attributes.

Write pseudocode or program code to declare the class Treasure.

You should define the attributes and constructor method in your answer.

You do not need to write the get methods.

...........................................................................................................................................

...................................................................................................................................... [5]
© OCR 2023
PMT

27
(ii) The get method getLevel() will return the appropriate attribute.

Write the method getLevel() using either pseudocode or program code.

...........................................................................................................................................

...................................................................................................................................... [2]

(iii) Describe the object-oriented programming technique being used in part 9(b)(ii).

...........................................................................................................................................

...................................................................................................................................... [2]

PMT

28
(c) A class, Board, is used to store the 10 row (x coordinate) by 20 column (y coordinate) grid.

The design for the Board class, its attributes and methods is shown here.

class: Board
attributes:
private grid : Array of Treasure
methods:
new()
function getGridItem(x, y)
function setGridItem(x, y, treasureToInsert)

The constructor initialises each space in the grid to a treasure object with value as -1 and
level as an empty string.

Complete the following pseudocode for the constructor method.

public procedure new()

for row = ............................. to 9
for column = 0 to .............................
............................. [row, column] = new Treasure(.............................,"")
next .............................
next row
endprocedure

[5]

29
(d) A procedure, guessGrid():
• takes a Board object as a parameter
• accepts the row (x) and column (y) coordinates from the user
• outputs "No treasure" if there is no treasure found at the coordinate (level is an empty
string)
• if there is treasure at that coordinate, it outputs the level and the value of the treasure in
an appropriate message.

Write the procedure guessGrid() using either pseudocode or program code.

...................................................................................................................................................

.............................................................................................................................................. [7]

(e) Describe two benefits of using an object-oriented paradigm rather than a procedural
paradigm.

1 ................................................................................................................................................

...................................................................................................................................................

2 ................................................................................................................................................

...................................................................................................................................................

...................................................................................................................................................
[4]
© OCR 2023 Turn over
PMT

30
(f)* The main program initialises a new instance of Board. The programmer is considering
declaring this as a global variable or as a local variable and then passing this into the
subroutines that control the game.

Compare the use of variables and parameters in this game.

You should include the following in your answer:

• what is meant by a local variable and global variable
• how local and global variables can be used in this program
• the use of passing parameters by value and by reference.
[9]

...................................................................................................................................................

...................................................................................................................................................
© OCR 2023
PMT

...................................................................................................................................................

END OF QUESTION PAPER

32
ADDITIONAL ANSWER SPACE

If additional space is required, you should use the following lined page(s). The question number(s)
must be clearly shown in the margin(s).

..................................................................................................................................................................

Oxford Cambridge and RSA

Copyright Information
OCR is committed to seeking permission to reproduce all third-party content that it uses in its assessment materials. OCR has attempted to identify and contact all copyright holders
whose work is used in this paper. To avoid the issue of disclosure of answer-related information to candidates, all copyright acknowledgements are reproduced in the OCR Copyright
Acknowledgements Booklet. This is produced for each series of examinations and is freely available to download from our public website (www.ocr.org.uk) after the live examination series.
If OCR has unwittingly failed to correctly acknowledge or clear any third-party content in this assessment material, OCR will be happy to correct its mistake at the earliest possible
opportunity.
For queries or further information please contact The OCR Copyright Team, The Triangle Building, Shaftesbury Road, Cambridge CB2 8EA.
OCR is part of Cambridge University Press & Assessment, which is itself a department of the University of Cambridge.

DS Utech Final May2022
No ratings yet
DS Utech Final May2022
7 pages
Algorithms 2020
No ratings yet
Algorithms 2020
32 pages
Practice Paper Set 2 Algorithms Programming
No ratings yet
Practice Paper Set 2 Algorithms Programming
28 pages
November 2020 QP - Paper 2 OCR Computer Science A-Level
No ratings yet
November 2020 QP - Paper 2 OCR Computer Science A-Level
32 pages
Corrected Filtered June2023 Paper2 OCR
No ratings yet
Corrected Filtered June2023 Paper2 OCR
6 pages
A5-R5.1 English
No ratings yet
A5-R5.1 English
8 pages
SE Comp IV Endsem PYQPapers
No ratings yet
SE Comp IV Endsem PYQPapers
31 pages
A5-R5 July2023
No ratings yet
A5-R5 July2023
8 pages
HCSCR3052T
No ratings yet
HCSCR3052T
3 pages
June 2016 QP - Paper 2 OCR Computer Science AS-level
No ratings yet
June 2016 QP - Paper 2 OCR Computer Science AS-level
16 pages
Data Structures and Algorithms Sem 2 Re-Exam 2021-2022 BJy1kpr96T
No ratings yet
Data Structures and Algorithms Sem 2 Re-Exam 2021-2022 BJy1kpr96T
4 pages
Instructions For Candidates:: A5-R5: Data Structure Through Object Oriented Programming Language
No ratings yet
Instructions For Candidates:: A5-R5: Data Structure Through Object Oriented Programming Language
8 pages
IT2 Answer Key
No ratings yet
IT2 Answer Key
4 pages
Data Structure 2023F
No ratings yet
Data Structure 2023F
3 pages
CS2233 Data Structure Assignment (2) - 1
No ratings yet
CS2233 Data Structure Assignment (2) - 1
6 pages
CUITM205 - March 2023 - June 2023 Supp SUPP
No ratings yet
CUITM205 - March 2023 - June 2023 Supp SUPP
5 pages
Tuesday 21 May 2024 - Afternoon: GCSE (9-1) Computer Science
No ratings yet
Tuesday 21 May 2024 - Afternoon: GCSE (9-1) Computer Science
20 pages
June 2019 QP - Paper 2 OCR Computer Science A-Level
No ratings yet
June 2019 QP - Paper 2 OCR Computer Science A-Level
24 pages
2023 Dsa Exam2
No ratings yet
2023 Dsa Exam2
12 pages
20.3 Y1S2 PU 08sep2021 Algorithms and Datastruct
No ratings yet
20.3 Y1S2 PU 08sep2021 Algorithms and Datastruct
4 pages
AMCS41 Data Structures 3
No ratings yet
AMCS41 Data Structures 3
2 pages
Idsa ETA 2021s2 QC
No ratings yet
Idsa ETA 2021s2 QC
6 pages
2022 Dsa Exam2
No ratings yet
2022 Dsa Exam2
10 pages
Data Structures and Algorithms Sem-II Re-Exam Year 2021-22 ThInJ3JV0x
No ratings yet
Data Structures and Algorithms Sem-II Re-Exam Year 2021-22 ThInJ3JV0x
4 pages
November 2021 QP - Paper 2 OCR Computer Science A-Level
No ratings yet
November 2021 QP - Paper 2 OCR Computer Science A-Level
28 pages
Cse-Nd-2021-Cs 8391-Data Structures-20630293-40388 (CS8391)
No ratings yet
Cse-Nd-2021-Cs 8391-Data Structures-20630293-40388 (CS8391)
3 pages
Screenshot 2024-09-14 at 12.14.47 AM
No ratings yet
Screenshot 2024-09-14 at 12.14.47 AM
14 pages
Robotics and Automation s7 & s8
No ratings yet
Robotics and Automation s7 & s8
282 pages
Dsa Old Question Collection
No ratings yet
Dsa Old Question Collection
31 pages
Dsa Pyq
No ratings yet
Dsa Pyq
15 pages
CS2005
No ratings yet
CS2005
2 pages
19.2 Algo
No ratings yet
19.2 Algo
7 pages
R05 Set No. 2
No ratings yet
R05 Set No. 2
8 pages
Data Structure and Algorithms (2&16) 1
No ratings yet
Data Structure and Algorithms (2&16) 1
6 pages
Data Structure Prvious Paper
No ratings yet
Data Structure Prvious Paper
4 pages
SE1052-Data Structures and Algorithms
No ratings yet
SE1052-Data Structures and Algorithms
7 pages
AV121 Practice Questions
No ratings yet
AV121 Practice Questions
8 pages
CSE220 Final Fall-23 Set-A
No ratings yet
CSE220 Final Fall-23 Set-A
4 pages
Data Structures Question Bank
No ratings yet
Data Structures Question Bank
5 pages
Question For CS102 End Sem Exam July 2021
No ratings yet
Question For CS102 End Sem Exam July 2021
2 pages
DSA Nov - Dec - 2024-1
No ratings yet
DSA Nov - Dec - 2024-1
3 pages
DS-Final-2023-QA 2
No ratings yet
DS-Final-2023-QA 2
13 pages
DSD Au QP
No ratings yet
DSD Au QP
3 pages
DSA Assignment 3A
No ratings yet
DSA Assignment 3A
4 pages
Question Bank
No ratings yet
Question Bank
5 pages
COL106 Minor Prep - Ayush Gupta
No ratings yet
COL106 Minor Prep - Ayush Gupta
69 pages
Data Structure Previous Year Paper - B.C.A Study
No ratings yet
Data Structure Previous Year Paper - B.C.A Study
4 pages
CS3353 Assignment 5 Fall 2024
No ratings yet
CS3353 Assignment 5 Fall 2024
5 pages
TL102 0 2023 Cos2611
No ratings yet
TL102 0 2023 Cos2611
10 pages
Nov Dec 2022
No ratings yet
Nov Dec 2022
3 pages
Final Dsa To Students RBRBFF
No ratings yet
Final Dsa To Students RBRBFF
4 pages
PDF Refer
No ratings yet
PDF Refer
2 pages
CS2005 Merged
No ratings yet
CS2005 Merged
15 pages
Dsa Final Paper
No ratings yet
Dsa Final Paper
4 pages
Data Structures: Instructions To Candidate
No ratings yet
Data Structures: Instructions To Candidate
2 pages
22TP201 1
No ratings yet
22TP201 1
2 pages
20CS3402
No ratings yet
20CS3402
4 pages
AutoCAD® Pocket Reference
From Everand
AutoCAD® Pocket Reference
Cheryl R. Shrock
No ratings yet
A To Z of Internet: Everything You Wanted to Know
From Everand
A To Z of Internet: Everything You Wanted to Know
Bittu Kumar
No ratings yet
Exam AZ-800: Administering Windows Server Hybrid Core Infrastructure Preparation
From Everand
Exam AZ-800: Administering Windows Server Hybrid Core Infrastructure Preparation
Georgio Daccache
No ratings yet
Transportation Problem LCM
No ratings yet
Transportation Problem LCM
15 pages
Insertion Sort Bubble Sort Selection Sort
No ratings yet
Insertion Sort Bubble Sort Selection Sort
31 pages
Abhinav Aabhinav - Be19@thapar - Edu: Quiz II - UCS415
No ratings yet
Abhinav Aabhinav - Be19@thapar - Edu: Quiz II - UCS415
8 pages
07 BinarySearchTree
No ratings yet
07 BinarySearchTree
25 pages
Assigment Problem
No ratings yet
Assigment Problem
30 pages
EC3492-DSP-AT-I QP Set-2
No ratings yet
EC3492-DSP-AT-I QP Set-2
2 pages
Graphs
No ratings yet
Graphs
136 pages
Lab 2 DSA
No ratings yet
Lab 2 DSA
2 pages
Stack-Array Implementation: CS6202-Pragramming and Data Structures
No ratings yet
Stack-Array Implementation: CS6202-Pragramming and Data Structures
41 pages
Codetantra DS UNIT-1
No ratings yet
Codetantra DS UNIT-1
6 pages
Solving The Rubik S Cube With
No ratings yet
Solving The Rubik S Cube With
8 pages
Algorithm U3 Answer Key
No ratings yet
Algorithm U3 Answer Key
26 pages
Python Recursion
No ratings yet
Python Recursion
11 pages
Rauf Khann C M M File
No ratings yet
Rauf Khann C M M File
12 pages
Tutorial 2
No ratings yet
Tutorial 2
2 pages
Lec 18 Deadlock Detection and Recovery
No ratings yet
Lec 18 Deadlock Detection and Recovery
14 pages
Conclusions
No ratings yet
Conclusions
7 pages
L10 - Strobogrammatic Number
No ratings yet
L10 - Strobogrammatic Number
15 pages
Dspresentation1 170515194125
No ratings yet
Dspresentation1 170515194125
89 pages
Hierarchical Clustering in Data Mining
No ratings yet
Hierarchical Clustering in Data Mining
4 pages
MODULE CC 104 Data Structures and Algorithms
No ratings yet
MODULE CC 104 Data Structures and Algorithms
9 pages
Branch and Bound 15 Puzzle Problem
No ratings yet
Branch and Bound 15 Puzzle Problem
39 pages
Focs 2014-15
No ratings yet
Focs 2014-15
4 pages
Chapter 4 Computational Complexity PDF
No ratings yet
Chapter 4 Computational Complexity PDF
3 pages
Cat 2 Attempted
No ratings yet
Cat 2 Attempted
9 pages
MSCCS Slips CS554MJP DAA
No ratings yet
MSCCS Slips CS554MJP DAA
20 pages
Python Programs
No ratings yet
Python Programs
36 pages
Dsa Lab Manual Bcsl305
No ratings yet
Dsa Lab Manual Bcsl305
96 pages
Answer All Questions
No ratings yet
Answer All Questions
2 pages
01 CSC335 Chapter8 (Queues)
No ratings yet
01 CSC335 Chapter8 (Queues)
17 pages

June 2023 QP - Paper 2 OCR Computer Science A-Level

Uploaded by

June 2023 QP - Paper 2 OCR Computer Science A-Level

Uploaded by

PMT

Oxford Cambridge and RSA

Monday 19 June 2023 – Morning

You can use:

Please write clearly in black ink. Do not write in the barcodes.

Centre number Candidate number

© OCR 2023 [601/4911/5] OCR is an exempt Charity

PLEASE DO NOT WRITE ON THIS PAGE

1 A tree is one example of a data structure.

(a) (i) Give two characteristics of a tree data structure.

(ii) The following data is entered into a binary search tree.

© OCR 2023 Turn over

(vi) Explain how backtracking is used in depth-first (post-order) traversals.

© OCR 2023 Turn over

An example graph is shown in Fig. 1.

You may use the table below to give your answer.

Node Distance travelled Previous node

Final path: ..............................................................................

© OCR 2023 Turn over

You should include the following in your answer:

© OCR 2023 Turn over

location data pointer

Give the output from the procedure.

Describe how a new item is added to a linked list.

For example, using the linked list shown in Fig. 3:

Complete the function, using pseudocode or program code.

function findNode(toFind, headPointer, linkedList)

© OCR 2023 Turn over

(i) Identify one identifier used in the function isInteger().

© OCR 2023 Turn over

(a) Describe the key features of a recursive algorithm.

You may refer to the function, recursiveAlgorithm() in your answer.

Function call value return

Final return value .................................................. [5]

© OCR 2023 Turn over

To convert a denary number to base 8:

Write an algorithm to:

You do not need to validate the input from the user.

Write your algorithm using pseudocode or program code.

PLEASE DO NOT WRITE ON THIS PAGE

© OCR 2023 Turn over

Algorithm Time Complexity Space Complexity

You should include the following in your answer:

© OCR 2023 Turn over

(i) Describe what is meant by the term ‘concurrent processing’.

(ii) Give two benefits of using concurrent processing.

(i) Describe how a merge sort works.

© OCR 2023 Turn over

IDE feature Description

© OCR 2023 Turn over

PLEASE DO NOT WRITE ON THIS PAGE

(a) The computer game makes use of abstraction.

(ii) Give three benefits of using abstraction when writing a program.

© OCR 2023 Turn over

A class, Treasure, is used to store the treasure objects.

Write pseudocode or program code to declare the class Treasure.

You do not need to write the get methods.

Write the method getLevel() using either pseudocode or program code.

© OCR 2023 Turn over

Complete the following pseudocode for the constructor method.

public procedure new()

Write the procedure guessGrid() using either pseudocode or program code.

Compare the use of variables and parameters in this game.

You should include the following in your answer:

END OF QUESTION PAPER

Oxford Cambridge and RSA

You might also like