iLS Computing - Y9 - Sort and Search - Markscheme - Set 2
The document outlines a Year 9 Term 1 Computing test focused on sorting and searching algorithms, consisting of four questions with specific curriculum objectives and acceptable answers. Each question has a designated mark allocation, totaling 13 marks for the test. The test assesses knowledge on computational abstractions, textual language, subprograms, global and local variables, and linear search algorithms.
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 ratings0% found this document useful (0 votes)
17 views1 page
iLS Computing - Y9 - Sort and Search - Markscheme - Set 2
The document outlines a Year 9 Term 1 Computing test focused on sorting and searching algorithms, consisting of four questions with specific curriculum objectives and acceptable answers. Each question has a designated mark allocation, totaling 13 marks for the test. The test assesses knowledge on computational abstractions, textual language, subprograms, global and local variables, and linear search algorithms.
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/ 1
Year 9 Term 1 Computing test
Topic 1: Sort and search
Timings This test is to be completed within one lesson.
Question Curriculum objective Acceptable answer(s) Additional guidance Marks
1 PS9.2A Design computational Give 1 mark for any of the following up to a maximum of 3: 3 abstractions C, E, F 2 PS9.1A Textual language Give 1 mark for any of the following answers up to a 3 maximum of 3: • Line 3: input • Line 4: entry • Line 6: else 3a PD9.2A Subprograms Give 1 mark for any of the following answers up to a Accept any reasonable 2 maximum of 2: variations. • States a variable named r1. • Calls the random function. • Creates a random number between 1 and 6. 3b PD9.2A Global and local Give 1 mark for any of the following answers up to a Accept any reasonable 2 variables maximum of 2: variations. • A local variable can only be called within a subprogram. • A global variable can be called at any point within a whole program. 4 PS9.1B Linear search Give 1 mark for any of the following answers up to a Accept any reasonable 3 algorithms maximum of 3: variations. • Each value in a list is examined. • One value at a time. • It is compared to the value required. • And repeated until the correct value is found. Total for test 13