Computer Science > MARK SCHEME > OCR - GCE Computer Science H446/02: Algorithms and programming (Advanced GCE Mark Scheme for Novembe (All)

OCR - GCE Computer Science H446/02: Algorithms and programming (Advanced GCE Mark Scheme for November 2020) Exam (elaborations)

Document Content and Description Below

Annotation Meaning Omission mark Benefit of the doubt Subordinate clause / consequential error Incorrect point Expansion of a point Follow through Not answered question No benefit of doubt giv... en Point being made Repeat Correct point Too vague Zero (big) Blank Page – this annotation must be used on all blank pages within an answer booklet (structured or unstructured) and on each page of an additional object where there is no candidate response. H446/02 Mark Scheme November 2020 Level 1 Level 2 Level 3 H446/02 Mark Scheme November 2020 4 Question Answer Marks Guidance 1a 1 mark for definition • Removal of unnecessary detail // Simplification to allow development of a program more easily 1 mark to max 2 for application e.g. • The actual movements are represented by vertices/lines • State of the move is represented by a letter/symbol rather than the actual move position • Tree does not show details about what the moves are 3 AO1.1 (1) AO2.1 (1) AO2.2 (1) Allow other suitable examples that are relevant to the scenario in the question. 1b One node (node A) has more than 2 connections Nodes aren’t ordered (e.g. F is C’s left child) 1 AO2.1 (1) 1c 1 mark for identification • Null pointers 1 AO2.1 (1) 1d 1 mark per bullet • Take A as starting node • Visit B, C and E • Visit D, F, G and H • Visit I and J 4 AO1.2 (2) AO2.2 (2) Allow the reverse ordering from right to left e.g. A; E, C, B; H, G, F, D; J, I 1ei 1 mark per bullet to max 3 • Search the tree to find the location of Node E // by example of search • Replace the content of node E with blank/null/equivalent • Make node A point to the node H • Add node E to the empty node list 3 AO1.2 (3) 1eii 1 mark per bullet to max 3 • Search the tree to find the location of node G // by example of search • Create a new node with value K • Add a pointer from node G to the new node • Make node K point to null/equivalent 3 AO1.2 (3) [Show More]

Last updated: 1 year ago

Preview 1 out of 23 pages

Add to cart

Instant download

We Accept:

We Accept
document-preview

Buy this document to get the full access instantly

Instant Download Access after purchase

Add to cart

Instant download

We Accept:

We Accept

Reviews( 0 )

$15.00

Add to cart

We Accept:

We Accept

Instant download

Can't find what you want? Try our AI powered Search

OR

REQUEST DOCUMENT
167
0

Document information


Connected school, study & course


About the document


Uploaded On

Jun 22, 2021

Number of pages

23

Written in

Seller


seller-icon
Hannington

Member since 3 years

74 Documents Sold


Additional information

This document has been written for:

Uploaded

Jun 22, 2021

Downloads

 0

Views

 167

Document Keyword Tags

Recommended For You

Get more on MARK SCHEME »

$15.00
What is Browsegrades

In Browsegrades, a student can earn by offering help to other student. Students can help other students with materials by upploading their notes and earn money.

We are here to help

We're available through e-mail, Twitter, Facebook, and live chat.
 FAQ
 Questions? Leave a message!

Follow us on
 Twitter

Copyright © Browsegrades · High quality services·