Computer Science > MARK SCHEMES > 2020_OCR_COMPUTER_SCIENCE_2_PRO_MS.pdf (1) (All)

2020_OCR_COMPUTER_SCIENCE_2_PRO_MS.pdf (1)

Document Content and Description Below

on 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 n [Show More]

Last updated: 3 years ago

Preview 1 out of 23 pages

Buy Now

Instant download

We Accept: