0% found this document useful (0 votes)

14 views28 pages

h446-02-june-2017-qp-ocr-a-level-computer-science

This document is an examination paper for the A Level Computer Science H446/02 Algorithms and Programming, administered by Oxford Cambridge and RSA on June 22, 2017. It includes various sections with questions related to algorithms, data structures, programming concepts, and practical coding tasks, requiring students to demonstrate their understanding of computer science principles. The paper consists of 28 pages and is designed to assess students' knowledge and skills in algorithms, programming, and data structures.

Uploaded by

lolzerag

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)

14 views28 pages

h446-02-june-2017-qp-ocr-a-level-computer-science

Uploaded by

lolzerag

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/ 28

Oxford Cambridge and RSA

A Level Computer Science

H446/02 Algorithms and Programming

Thursday 22 June 2017 – Morning

Time allowed: 2 hours 30 minutes
* 6 8 2 7 7 0 5 8 5 3 *

Do not use:
• A calculator

* H 4 4 6 0 2 *

First name

Last name

Centre Candidate
number number

INSTRUCTIONS
• Use black ink.
• Complete the boxes above with your name, centre number and candidate number.
• Answer all the questions.
• Write your answer to each question in the space provided. Additional paper may be
used if required but you must clearly show your candidate number, centre number and
question number(s).
• Do not write in the barcodes.

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

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

DC (SC/SW) 155854/7 R Turn over
2
Answer all the questions.

Section A

1 A programmer needs to sort an array of numeric data using an insertion sort.

(a) (i) The following, incomplete, algorithm performs an insertion sort.

Complete the algorithm.

procedure sortit(dataArray, lastIndex)

for x = 1 to lastIndex
currentData = dataArray[……………………]
position = x
while (position > 0 AND dataArray[position-1] > currentData)
dataArray[position] = dataArray[………………………]
position = position - 1
endwhile

dataArray[position] = …………………………
next x
endprocedure
[3]

6 1 15 12 5 6 9

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

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

(b) (i) Using Big-O notation state the best case complexity of insertion sort.

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

(ii) Explain what your answer to part (b)(i) means.

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

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

© OCR 2017 Turn over

4
(c*) The number of data items in the array is continually increasing.

Insertion sort has a worst case time complexity of O(n2) and space complexity of O(1).

An alternative sorting algorithm that could be used is bubble sort which also has a worst case
time complexity of O(n2) and space complexity of O(1).

Briefly outline how the bubble sort algorithm works. Discuss the relationship between the
complexities and the two sorting algorithms and justify which of the two algorithms is best
suited to sorting the array. [9]

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

© OCR 2017 Turn over

6
BLANK PAGE

PLEASE DO NOT WRITE ON THIS PAGE

© OCR 2017
7
2 A programmer is developing an ordering system for a fast food restaurant. When a member of
staff inputs an order, it is added to a linked list for completion by the chefs.

(a) Explain why a linked list is being used for the ordering system.

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

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

(b) Each element in a linked list has:

• a pointer, nodeNo, which gives the number of that node

• the order number, orderNo
• a pointer, next, that points to the next node in the list

Fig. 2.1 shows the current contents of the linked list, orders.

nodeNo orderNo next

0 154 1
1 157 2
2 155 3
3 156 ∅

Fig. 2.1

∅ represents a null pointer.

(i) Order 158 has been made, and needs adding to the end of the linked list.

Add the order, 158, to the linked list as shown in Fig. 2.1. Show the contents of the linked
list in the following table.

nodeNo orderNo next

[2]

© OCR 2017 Turn over

8
(ii) Order 159 has been made. This order has a high priority and needs to be the second
order in the linked list.
Add the order, 159, to the original linked list as shown in Fig. 2.1. Show the contents of
the linked list in the following table.

nodeNo orderNo next

[3]

(c) The linked list is implemented using a 2D array, theOrders:

• Row 0 stores orderNo

• Row 1 stores next

The data now stored in theOrders is shown in Fig. 2.2.

184 186 185 187

1 2 3

Fig. 2.2

theOrders[1,0] would return 1

The following algorithm is written:

procedure x()
finished = false
count = 0
while NOT(finished)
if theOrders[1,count] == null then
finished = true
else
output = theOrders[0,count]
print(output)
count = theOrders[1,count]
endif
endwhile
output = theOrders[0,count]
print(output)

endprocedure

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

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

(ii) Complete the trace table for procedure x, for the data shown in Fig. 2.2.

finished count output

[3]

(iii) Describe the purpose of procedure x.

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

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

© OCR 2017 Turn over

10
(iv) A new order, 190, is to be added to theOrders. It needs to be the third element in the
list.
The current contents of the array are repeated here for reference:

184 186 185 187

1 2 3

Describe how the new order, 190, can be added to the array, so the linked list is read in
the correct order, without rearranging the array elements.

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

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

(d) The user needs to be able to search for, and find, a specific order number.

State an appropriate search algorithm that could be used, and justify your choice against an
alternative Search algorithm.

Appropriate Search Algorithm ....................................................................................................

Justification ................................................................................................................................

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

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

Identify three features of an IDE that the programmer would use when writing the code and
describe how the features benefit the programmer.

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

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

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

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

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

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

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

(f*) The programmer is considering using concurrent programming.

Discuss how concurrent programming can be applied to the food ordering system and the
benefits and limitations of doing so. [9]

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

© OCR 2017 Turn over

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

© OCR 2017
13
3 An encryption routine reads a line of text from a file, reverses the order of the characters in the
string and subtracts 10 from the ASCII value of each letter, then saves the new string into the
same file.

The program is split into sub-procedures. Three sub-procedures are described as follows:

• Read string from file

• Push each character of the string onto a stack
• Read and encrypt each character message

(a) (i) Identify one further sub-procedure that could be used in the program.

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

(ii) Describe two advantages of splitting the problem into sub-procedures.

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

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

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

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

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

(b) A function, readMessage:

• takes the file name as a parameter

• reads and returns the line of text

Complete the pseudocode algorithm for readMessage:

function …………………………………………………………(fileName)

messageFile = openRead(…………………………………………………………)

message = messageFile.readLine()

messageFile. …………………………………………………………

return …………………………………………………………

endfunction
[4]

© OCR 2017 Turn over

14
(c) A function, push, can be used to add a character to a stack. For example:

theStack.push("H")

places the character H onto the stack, theStack.

A procedure, pushToStack, takes a string as a parameter and pushes each character of the
message onto the stack, messageStack.

Complete the procedure below.

Add comments to explain how your code works.

procedure pushToStack(message)

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

endprocedure
[5]

(d) Describe the steps that the program would have to take in order to encrypt the characters
stored in the stack, and save them in a single variable.

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

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

PLEASE DO NOT WRITE ON THIS PAGE

© OCR 2017 Turn over

16
4 A data structure is shown below in Fig. 4.1.

A
B C

D X E F

H
G J

K I
N
L
M

Fig. 4.1

(a) Identify the data structure shown in Fig. 4.1.

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

(b) The programmer is considering using a depth-first (post-order) traversal, or a breadth-first

traversal to find the path between node A and node X.

(i) Explain the difference between a depth-first (post-order) and breadth-first traversal.

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

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

© OCR 2017
17
(ii) Show how a depth-first (post-order) traversal would find the path between node A and
node X for the structure shown in Fig. 4.1.

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

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

(iii) Explain how you used backtracking in your answer to part (b)(ii).

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

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

© OCR 2017 Turn over

18
5 A recursive function, calculate, is shown below:

01 function calculate(num1, num2)

02 if num1 == num2 then
03 return num1
04 elseif num1 < num2 then
05 return calculate(num1, (num2-num1))
06 else
07 return calculate(num2, (num1-num2))
08 endif
09 endfunction

(a) Identify the lines where recursion is used.

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

(b) Trace the algorithm, showing the steps and result when the following line is run:

print(calculate(4,10))

[5]

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

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

20
Section B

Answer all questions.

6 A software developer is creating a Virtual Pet game.

The user can choose the type of animal they would like as their pet, give it a name and then they are
responsible for caring for that animal. The user will need to feed, play with, and educate their pet.

The aim is to keep the animal alive and happy, for example if the animal is not fed over a set
period of time then the pet will die.

• The game tells the user how hungry or bored the animal is as a percentage (%) and
the animal’s intelligence is ranked as a number between 0 and 150 (inclusive).
• Hunger and boredom increase by 1% with every tick of a timer.
• When the feed option is selected, hunger is reduced to 0.
• When the play option is selected, bored is reduced to 0.
• When the read option is selected, the intelligence is increased by 0.6% of its current
value.

An example of the game is shown:

What type of pet would you like? Fox or Elephant?

Fox
What would you like to name your Fox?
Joanne
Joanne’s stats are
Hunger: 56%
Bored: 85%
Intelligence: 20
What would you like to do with your pet? Play, Read or Feed?

Fig. 1.1

(a) Identify three inputs that the user will have to enter to start, and/or play the game.

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

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

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

(i) Describe the process of decomposition.

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

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

(ii) The developer has produced the following structure diagram for the game:

Virtual Pet

Start game Play game

Choose Pet Feed Read Timer

Reduce
Hunger to 0

Complete the structure diagram for the Virtual Pet game by filling in the empty boxes.
[6]

22
(c) The developer needs to write procedures for the options play and read. Each of the options
changes its corresponding value, and outputs the results to the screen.

(i) Write a procedure, using pseudocode, to reset bored and output the new value in an
appropriate message.

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

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

(ii) Write a procedure, using pseudocode, to increase intelligence by 0.6% and output
the new intelligence in an appropriate message.

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

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

© OCR 2017
23
(d) The developer is extending the game to allow users to have multiple pets of different types.
The developer has written a class, Pet.

The attributes and methods in the class are described in the table:

Identifier Attribute/Method Description

petName Attribute Stores the pet’s name

bored Attribute Stores the % bored

hunger Attribute Stores the % hunger

intelligence Attribute Stores the intelligence

type Attribute Stores the type of animal

new Method Creates a new instance of pet

feed Method Reduces hunger to 0 and outputs hunger

play Method Reduces bored to 0 and outputs bored

read Method Increases intelligence by a set value

outputGreeting Method Outputs a message to the user

Part of the class declaration is given:

class Pet
private petName
private bored
private hunger
private intelligence
private type
…
…

24
(i) After a user enters the pet name, and chooses a type, the constructor method of Pet is
called to create a new instance. The method needs to set petName, as well as hunger,
bored and intelligence to starting values of 0.

Write, using pseudocode, the constructor method for this class.

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

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

(ii) Write a line of code that creates a new instance of Pet for a Tiger called “Springy”.

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

public procedure outputGreeting()

print("Hello, I'm " + petName + ", I'm a " + type)
endprocedure

A class is needed for Tiger. The class needs to:

• inherit the methods and attributes from pet

• in the constructor, set type to Tiger, intelligence to 10, hunger to 50 and
bored to 10
• extend the method outputGreeting, by outputting an additional line that
says “I like to eat meat and roar”

Write, using pseudocode, the class Tiger.

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

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

26
(e*) The developer made use of abstraction when creating the Virtual Pet game.

Discuss the need for and purpose of abstraction and how abstraction will be used in the
development of the game. [9]

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

© OCR 2017
27
(f) The developer is storing the user’s pets in a 1-dimensional array. At each timer interval, the
array is searched, using a linear search, to check if any pets’ hunger or bored values are
greater than 90%. If they are, an alert is displayed to the user.

(i) State the complexity of searching the pets in Big-O notation.

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

(ii) A given computer takes 4 milliseconds (ms) to search an array of 20 pets. Calculate an
estimate of how long the computer will take to search an array of 100 pets.

Show your working.

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

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

END OF QUESTION PAPER

PLEASE DO NOT WRITE ON THIS PAGE

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 Copyright Team, First Floor, 9 Hills Road, Cambridge CB2 1GE.
OCR is part of the Cambridge Assessment Group; Cambridge Assessment is the brand name of University of Cambridge Local Examinations Syndicate (UCLES), which is itself a
department of the University of Cambridge.

June 2017 QP - Paper 2 OCR Computer Science A-Level
No ratings yet
June 2017 QP - Paper 2 OCR Computer Science A-Level
28 pages
CIT237 PROGRAMMING AND ALGORITHMS SUMMARY
No ratings yet
CIT237 PROGRAMMING AND ALGORITHMS SUMMARY
38 pages
Answer June2017
No ratings yet
Answer June2017
28 pages
Merge Insertion Bubble Linear and Binary Search
No ratings yet
Merge Insertion Bubble Linear and Binary Search
73 pages
Dsa Notes Iit Madras
No ratings yet
Dsa Notes Iit Madras
887 pages
OCS33704761-question-paper-computational-thinking-algorithms-and-programming
No ratings yet
OCS33704761-question-paper-computational-thinking-algorithms-and-programming
20 pages
New File
No ratings yet
New File
52 pages
Insertion Sort: While Some Elements Unsorted
No ratings yet
Insertion Sort: While Some Elements Unsorted
22 pages
8-1-algorithms-W9H5RMt4VVs8nn6J
No ratings yet
8-1-algorithms-W9H5RMt4VVs8nn6J
19 pages
Unit I (Design and Analysis of Algorithm)
No ratings yet
Unit I (Design and Analysis of Algorithm)
181 pages
Computational Thinking Algorithms and Programming
No ratings yet
Computational Thinking Algorithms and Programming
42 pages
704148-question-paper-algorithms-and-problem-solving
No ratings yet
704148-question-paper-algorithms-and-problem-solving
16 pages
AOA Mod 1-2 Qb 5 Mks
No ratings yet
AOA Mod 1-2 Qb 5 Mks
11 pages
2024 Computer QP & MS
No ratings yet
2024 Computer QP & MS
83 pages
Duration: Not Set: © Ocr 2023. You May Photocopy This Page. 1 of 35 Created in Exambuilder
No ratings yet
Duration: Not Set: © Ocr 2023. You May Photocopy This Page. 1 of 35 Created in Exambuilder
35 pages
399196-2.1-algorithms-end-of-unit-quiz-lesson-element
No ratings yet
399196-2.1-algorithms-end-of-unit-quiz-lesson-element
14 pages
2019 Answers
No ratings yet
2019 Answers
24 pages
CS All Chapter Imp q & A
No ratings yet
CS All Chapter Imp q & A
42 pages
Algo 1
No ratings yet
Algo 1
16 pages
Jan 2011 2 Computer Science Ocr Paper
No ratings yet
Jan 2011 2 Computer Science Ocr Paper
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
2.1 Revision Presentation
No ratings yet
2.1 Revision Presentation
27 pages
Eduqas A Computer Science Sams From 2015
No ratings yet
Eduqas A Computer Science Sams From 2015
48 pages
2.3.1 Algorithms - Seaching
No ratings yet
2.3.1 Algorithms - Seaching
20 pages
UNIT 2 Searching and Sorting
No ratings yet
UNIT 2 Searching and Sorting
35 pages
2.3.1 Algorithms - Sorting
No ratings yet
2.3.1 Algorithms - Sorting
8 pages
Home-Work - 1: Submitted To: - Submitted By
No ratings yet
Home-Work - 1: Submitted To: - Submitted By
6 pages
Slides9 8
No ratings yet
Slides9 8
55 pages
Getting Started: Sun-Yuan Hsieh
No ratings yet
Getting Started: Sun-Yuan Hsieh
30 pages
6-2
No ratings yet
6-2
22 pages
June 2023 QP - Paper 2 OCR Computer Science a-level
No ratings yet
June 2023 QP - Paper 2 OCR Computer Science a-level
32 pages
June 2016 QP - Paper 2 OCR Computer Science AS-level (1)
No ratings yet
June 2016 QP - Paper 2 OCR Computer Science AS-level (1)
16 pages
22 Algorithms MCQs v2
No ratings yet
22 Algorithms MCQs v2
17 pages
Data Structures Algorithms in Dart
80% (5)
Data Structures Algorithms in Dart
425 pages
Design Analysis Algorithm
100% (2)
Design Analysis Algorithm
36 pages
Data Structure and Algorithms I - Mid - Summer 2023
No ratings yet
Data Structure and Algorithms I - Mid - Summer 2023
2 pages
DeepMind - Faster Sorting Algorithms Discovered Using Deep Reinforcement Learning
No ratings yet
DeepMind - Faster Sorting Algorithms Discovered Using Deep Reinforcement Learning
17 pages
BCSE202L-CAT-1-F1-2022
No ratings yet
BCSE202L-CAT-1-F1-2022
5 pages
10b Sorting
No ratings yet
10b Sorting
29 pages
Overview of Algorithm Analysis: Ms. Andleeb Yousaf Khan Spring 2020
No ratings yet
Overview of Algorithm Analysis: Ms. Andleeb Yousaf Khan Spring 2020
24 pages
Algorithm Design and Analysis
No ratings yet
Algorithm Design and Analysis
8 pages
Computer Science: Topic 2.1 - Algorithms
No ratings yet
Computer Science: Topic 2.1 - Algorithms
16 pages
Solution
No ratings yet
Solution
7 pages
Computational Thinking Algorithms and Programming
No ratings yet
Computational Thinking Algorithms and Programming
18 pages
Ds Lab Manual
No ratings yet
Ds Lab Manual
32 pages
CSE 5311 Homework 1 Solution: Problem 2.2-1
0% (1)
CSE 5311 Homework 1 Solution: Problem 2.2-1
8 pages
June 2023 QP - Paper 2 OCR Computer Science GCSE
No ratings yet
June 2023 QP - Paper 2 OCR Computer Science GCSE
20 pages
Ash Gaind - GCSE Level Key Terminology Computer Science
No ratings yet
Ash Gaind - GCSE Level Key Terminology Computer Science
16 pages
2.1 Algorithms End of Unit Quiz Lesson Element
No ratings yet
2.1 Algorithms End of Unit Quiz Lesson Element
14 pages
Algorithms Worksheet
No ratings yet
Algorithms Worksheet
12 pages
a) Define the following_terms_ (4 marks)...
No ratings yet
a) Define the following_terms_ (4 marks)...
12 pages
Overview of Query Evaluation: R&G Chapter 12
No ratings yet
Overview of Query Evaluation: R&G Chapter 12
30 pages
Sheet2 - Classes and Lists - S2018 - Solution
No ratings yet
Sheet2 - Classes and Lists - S2018 - Solution
3 pages
Corrected Filtered June2023 Paper2 OCR
No ratings yet
Corrected Filtered June2023 Paper2 OCR
6 pages
Dsa Lab Task 11
No ratings yet
Dsa Lab Task 11
10 pages
Workshop 3 Sorting
No ratings yet
Workshop 3 Sorting
11 pages
Computational Thinking Algorithms and Programming
No ratings yet
Computational Thinking Algorithms and Programming
42 pages
CT1-Answer key Set A DAA.docx
No ratings yet
CT1-Answer key Set A DAA.docx
7 pages
Computational Thinking Algorithms and Programming
No ratings yet
Computational Thinking Algorithms and Programming
43 pages
Exp No 1 Array Operation 221070068
No ratings yet
Exp No 1 Array Operation 221070068
9 pages
QP
No ratings yet
QP
20 pages
Python - Unit - IV - QB With Key
No ratings yet
Python - Unit - IV - QB With Key
17 pages
CS Theory 2024 Summer QP
No ratings yet
CS Theory 2024 Summer QP
22 pages
PDF Fundamentals Of Python: Data Structures 2nd Edition Kenneth A. Lambert download
100% (5)
PDF Fundamentals Of Python: Data Structures 2nd Edition Kenneth A. Lambert download
66 pages
endsem
No ratings yet
endsem
12 pages
Bidirectional Bubble Sort Approach To Improving The Performance of Introsort in The Worst Case For Large Input Size
No ratings yet
Bidirectional Bubble Sort Approach To Improving The Performance of Introsort in The Worst Case For Large Input Size
8 pages
PSP
No ratings yet
PSP
6 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
BCSE202L-CAT-1-B2-2017
No ratings yet
BCSE202L-CAT-1-B2-2017
6 pages
DAA SET a CT 1 Answer Key
No ratings yet
DAA SET a CT 1 Answer Key
7 pages
Analysis and Design of Algorithm Final
No ratings yet
Analysis and Design of Algorithm Final
10 pages
Algorithm-Complexity Reviewer
No ratings yet
Algorithm-Complexity Reviewer
6 pages
Computer Science Unit 2 Past Paper
No ratings yet
Computer Science Unit 2 Past Paper
16 pages
A5-R5 July2023
No ratings yet
A5-R5 July2023
8 pages
Answers AlgoSamplePaper
No ratings yet
Answers AlgoSamplePaper
9 pages
Guide To Searching and Sorting Algorithms in Ocr Exam Reference Language
No ratings yet
Guide To Searching and Sorting Algorithms in Ocr Exam Reference Language
8 pages
Question Paper Practice 2023 (J27702)
No ratings yet
Question Paper Practice 2023 (J27702)
24 pages
Kishlay Raj Resume Modified
No ratings yet
Kishlay Raj Resume Modified
1 page
Half p2 Cs Gcse
No ratings yet
Half p2 Cs Gcse
10 pages
Merge Sort
No ratings yet
Merge Sort
8 pages
Practice J277 02 Sep 2020 QPX
No ratings yet
Practice J277 02 Sep 2020 QPX
20 pages
DSA Excell Sheet
No ratings yet
DSA Excell Sheet
7 pages
Quiz 005
No ratings yet
Quiz 005
3 pages
DAA-important Questions For External Exam
No ratings yet
DAA-important Questions For External Exam
3 pages
Merge Sort Algorithm
No ratings yet
Merge Sort Algorithm
5 pages
BCA203CO Data Structure Algorithm
No ratings yet
BCA203CO Data Structure Algorithm
4 pages
Data Structures and Algorithms MCQ'S
100% (2)
Data Structures and Algorithms MCQ'S
15 pages
Let's Get Coding
From Everand
Let's Get Coding
Philip Searle
No ratings yet
AutoCAD® Pocket Reference
From Everand
AutoCAD® Pocket Reference
Cheryl R. Shrock
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

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.