day June 20XX Morning/Afternoon GCSE (9 1) Computer Science J276/02 Computational thinking, algorithms and programming SAMPLE MARK SCHEME Duration:

Similar documents
GCSE (9 1) Computer Science J276/02 Computational thinking, algorithms and programming Sample Question Paper. Specimen

OCR J276 GCSE Computer Science

OCR J276 GCSE Computer Science

Switching to AQA from OCR

OCR J276 GCSE Computer Science

Switching to AQA from Edexcel

GCSE Computer Science Component 02

HASTINGS HIGH SCHOOL

GCSE Computer Science for OCR Overview Scheme of Work

Mark Schemes. Guidance on formatting. Version 1: Last updated : 23/03/2016

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level. Published

Mark Scheme. Additional Sample Assessment Materials. Pearson BTEC Level 3 - Computing. Unit 1: Principles of Computer Science

Outline. Parts 1 to 3 introduce and sketch out the ideas of OOP. Part 5 deals with these ideas in closer detail.

RM Assessor guide to completing the standardisation process (Marker guide)

You will need to use your RM Assessor username and password that you have been provided with by the OCR Deployment team.

Year 10 OCR GCSE Computer Science (9-1)

GCSE Computer Science Booster Pack

Software Development Techniques. 26 November Marking Scheme

Thursday 17 May 2012 Afternoon

Creating International Wire Transfer Payments Reference Guide

GCSE AND CAMBRIDGE NATIONALS FINAL EXAMINATION TIMETABLE NOVEMBER 2018

Pearson Edexcel Award

Developing Algorithms

Autumn 1 Autumn 2 Spring 1 Spring 2 Summer 1 Summer 2. networks. environmental concerns. Knowledge and skills covered: Knowledge and skills covered:

OCR GCSE (9-1) Computer Science J276 Accompanying Instructional Document

OCR J276 (9-1) GCSE Computer Science

Introduction to Python

Centre Name Centre Number Candidate Name Candidate Number

OCR J276 GCSE Computer Science

Scheme of work Cambridge International AS & A Level Computing (9691)

COMPUTER SCIENCE UNIT 1: Understanding Computer Science

Using C++, design an Abstract Data Type class named MyGrades. The class must have the following private members :

Split up Syllabus (Session )

Programming Assignment - 1

Please complete this form with your details. Learner to complete: If you are working, write the following information:

Edexcel GCSE in Computer Science Microsoft IT Academy Mapping

Pearson Edexcel Award

INTRODUCTORY SPSS. Dr Feroz Mahomed Swalaha x2689

Centre Name Centre Number Candidate Name Candidate Number

GCE. Computing. Mark Scheme for January Advanced Subsidiary GCE Unit F452: Programming Techniques and Logical Methods

MARK SCHEME for the May/June 2011 question paper for the guidance of teachers 9691 COMPUTING. 9691/22 Paper 2 (Written Paper), maximum raw mark 75

UNIT 1 USING LOGIC. UPGRADE 8 Write a detailed report on how logic gates would be used to add up two nibbles using examples and explanations

GCSE Computer Science

DESIGN AND TECHNOLOGY

This is CS50. Harvard University Fall Quiz 0 Answer Key

MARK SCHEME for the October/November 2015 series 9691 COMPUTING. 9691/23 Paper 2 (Written Paper), maximum raw mark 75

AQA GCSE Computer Science PLC

IENG484 Quality Engineering Lab 1 RESEARCH ASSISTANT SHADI BOLOUKIFAR

Data Types and Variables in C language

How to bulk upload users

Cambridge Assessment International Education Cambridge International General Certificate of Secondary Education. Published

Sardar Patel University S Y BSc. Computer Science CS-201 Introduction to Programming Language Effective from July-2002

Outline. Review of Last Week II. Review of Last Week. Computer Memory. Review Variables and Memory. February 7, Data Types

Computer Components. Software{ User Programs. Operating System. Hardware

Chapter 3, Selection. Liang, Introduction to Programming with C++, Second Edition, (c) 2010 Pearson Education, Inc. All rights reserved.

Mobile Computing Professor Pushpendra Singh Indraprastha Institute of Information Technology Delhi Java Basics Lecture 02

Cambridge International Examinations Cambridge International Advanced Subsidiary and Advanced Level. Published

Centre Name Centre Number Candidate Name Candidate Number

9691 COMPUTING. 9691/23 Paper 2 (Written Paper), maximum raw mark 75

GCE Mathematics (MEI) Mark Scheme for June Unit 4752: Concepts for Advanced Mathematics. Advanced Subsidiary GCE PMT

Creating Domestic Wire Transfer Payments Reference Guide

There are two ways to use the python interpreter: interactive mode and script mode. (a) open a terminal shell (terminal emulator in Applications Menu)

CSC Software I: Utilities and Internals. Programming in Python

General Certificate of Secondary Education June Mathematics (Linear) B 4365 Paper 1 Foundation Tier. Final. Mark Scheme

Lecture C1 Data Representation. Computing and Art : Nature, Power, and Limits CC 3.12: Fall 2007

ECE2049: Embedded Computing in Engineering Design C Term Spring Lecture #3: Of Integers and Endians (pt. 2)

P&D GIS Map How-To-Guide Thomas Fire / January 9, 2018 Debris Flow

Note : Your program must contain the following 6 functions :

Variables Data types Variable I/O. C introduction. Variables. Variables 1 / 14

Cambridge Assessment International Education Cambridge Ordinary Level. Published

Computing 1: Computer Systems

9691 COMPUTING. 9691/22 Paper 2 (Written Paper), maximum raw mark 75

Relational & Logical Operators, if and switch Statements

3 The Building Blocks: Data Types, Literals, and Variables

HIGHER SECONDARY COMPUTER SCIENCE

Binary. Hexadecimal BINARY CODED DECIMAL

Input File Syntax The parser expects the input file to be divided into objects. Each object must start with the declaration:

GCSE Subject Level Conditions and Requirements for Computer Science May 2015

General Instructions. You can use QtSpim simulator to work on these assignments.

Introduction to Functional Programming. Slides by Koen Claessen and Emil Axelsson

Word processing software

Cambridge Assessment International Education Cambridge International Advanced Subsidiary and Advanced Level. Published

Setting Marking Preferences

TABLE OF CONTENTS 2 CHAPTER 1 3 CHAPTER 2 4 CHAPTER 3 5 CHAPTER 4. Algorithm Design & Problem Solving. Data Representation.

Floating-point lab deadline moved until Wednesday Today: characters, strings, scanf Characters, strings, scanf questions clicker questions

Cambridge Assessment International Education Cambridge Ordinary Level. Published

RTL Reference 1. JVM. 2. Lexical Conventions

MARK SCHEME for the October/November 2013 series 9691 COMPUTING. 9691/23 Paper 2 (Written Paper), maximum raw mark 75

8/16/12. Computer Organization. Architecture. Computer Organization. Computer Basics

Preview from Notesale.co.uk Page 6 of 52

Introduction to C Final Review Chapters 1-6 & 13

Course Report Computing Science Advanced Higher

Mathematics Paper 2 (Calculator)

Level 6 Relational Database Unit 3 Relational Database Development Environment National Council for Vocational Awards C30147 RELATIONAL DATABASE

BCS THE CHARTERED INSTITUTE FOR IT. BCS HIGHER EDUCATION QUALIFICATIONS BCS Level 4 Certificate in IT SOFTWARE DEVELOPMENT

Why Study Assembly Language?

CS 105 Lab As a review of what we did last week a. What are two ways in which the Python shell is useful to us?

CPT1. Unit 1 Computer Systems, Programming and Networking Concepts. General Certificate of Education January 2004 Advanced Subsidiary Examination

Cambridge Assessment International Education Cambridge International Advanced Subsidiary and Advanced Level. Published

Programming Language. Control Structures: Selection (switch) Eng. Anis Nazer First Semester

Transcription:

day June 0XX Morning/Afternoon GCSE (9 1) Computer Science J76/0 Computational thinking, algorithms and programming SAMPLE MARK SCHEME MAXIMUM MARK 80 DRAFT Duration: 1 hour 30 minutes This document consists of 1 pages R1009/17

PREPARATION FOR MARKING MARKING INSTRUCTIONS SCORIS 1. Make sure that you have accessed and completed the relevant training packages for on screen marking: scoris assessor Online Training; OCR Essential Guide to Marking.. Make sure that you have read and understood the mark scheme and the question paper for this unit. These are posted on the RM Cambridge Assessment Support Portal http://www.rm.com/support/ca 3. Log in to scoris and mark the required number of practice responses ( scripts ) and the required number of standardisation responses. AO1 AO1 1a AO1 1b AO AO 1a AO 1b AO3 AO3 1 AO3 a AO3 b AO3 c YOU MUST MARK 10 PRACTICE AND 10 STANDARDISATION RESPONSES BEFORE YOU CAN BE APPROVED TO MARK LIVE SCRIPTS. Assessment Objective Demonstrate knowledge and understanding of the key concepts and principles of computer science. Demonstrate knowledge of the key concepts and principles of computer science. Demonstrate understanding of the key concepts and principles of computer science. Apply knowledge and understanding of key concepts and principles of computer science. Apply knowledge of key concepts and principles of computer science. Apply understanding of key concepts and principles of computer science. Analyse problems in computational terms: to make reasoned judgements to design, program, evaluate and refine solutions. To make reasoned judgements (this strand is a single element). Design solutions. Program solutions. Evaluate and refine solutions.

1 a The height of the wave is measured/sampled (at 1 mark for each bullet, to a maximum of. regular/set intervals) Turned into/stored as binary b The quality will improve... 1 mark for each bullet.... because the sound wave is more accurate to the original (1 mark for identification of the effect, one mark for an explanation) The file size will increase...... because there are more samples to store c Lossy means the decompressed file is not identical to the original... (AO 1a)...the difference is unlikely to be noticed by humans Lossy will decrease the file size...... so it can be sent via e-mail a bit, nibble, byte, MB, GB, PB 1 b 10111111 1 c Working; (3 * 16) + 1 OR 00111110 6 d Taking a number as input Using HEX subroutine correctly (AO3 b) Calculating Digit 1 Calculating Digit 1 mark for each bullet. (1 mark for identification of the effect, one mark for an explanation) 1 mark for correct answer, 1 for valid method of working 1 mark for each bullet. INPUT decimal digit1 = decimal DIV 16 IF digit1>=10 THEN digit1=hex(digit1) digit = decimal (digit1*16) IF digit>=10 THEN digit=hex(digit) e i 0000 0000 ii overflow 1 There are no marks associated with data types or conversions of data types. in the answer column. 1 mark per nibble 3

3 a 00110010 1 b The number is divided by 1 mark per bullet to a maximum of. Loss of accuracy... (AO 1b)... the bits on the right are removed c A B P 1 mark for each correct answer in table. TRUE TRUE a RebEl 1 (AO 1b) b i UitFr 1 (AO 1b) ii 6 Taking firstname, surname and gender as input (AO3 b) Checking IF gender is male/female (using appropriate selection) For male...generating last 3 letters of surname using appropriate string manipulation...generating first of letters of firstname and adding to previous For female... correctly calculating as before Correct concatenation and output input firstname, surname, gender if gender = Male then username = RIGHT(surname, 3) + LEFT(firstname,) else username = LEFT (firstname,3) + LEFT(surname,) end if print (username) (allow any case) (allow any case) 1 mark for each correct bullet to a maximum of 6. in the answer column

5 a To convert it to binary/machine code 1 Maximum 1 mark The processor can only understand machine code (AO1 1a) b Compiler translates all the code in one go whereas an interpreter translates one line at a time Compiler creates an executable whereas an interpreter does not/ executes one line at a time Compiler reports all errors at the end whereas an interpreter stops when it finds an error 6 a Allows multiple items of data to be stored.. under one identifier/name Can store a table structure Reduces need for multiple variables b i Integer 1 (AO 1b) b ii It is a whole number/ no decimals/ to the nearest minute. 1 (AO 1b) c i print (hoursplayed[0,]) 1 (AO 1b) ii 0 1 (AO 1b) iii 80 1 (AO 1b) iv Adding all correct elements 3 Outputting correctly (AO3 b) Using a loop e.g. total = 0 for x = 0 to 1 mark to be awarded for the correct identification and one for a valid description up to a maximum of marks. No more than marks for answers relating only to interpreters and no more than marks for answers only relating to compilers. 1 mark for each bullet to a maximum of. Any data type that stores a whole number only 1 mark per bullet to a maximum of 3. in the answer column 5

total = total + hoursplayed[0,x] next x print (total) d Appropriate declaration of a function that takes day number as parameter and returns day e.g. Use of selection (if/switch) Appropriate comparison Correct identification of each day Case default function returnday(dayno As String) As String switch dayno case 0: returnday = Monday case 1: returnday = Tuesday case : returnday = Wednesday case 3: returnday = Thursday case : returnday = Friday case default: returnday = Invalid endswitch endfunction 5 (AO3 b) 1 mark per bullet to a maximum of 5. in the answer column. 6 e Loop 0 to 9 Loop 0 to Accessing hoursplayed[x,y] Addition of hoursplayed[x,y] to total Calculating average correctly outside of loops 6 (AO3 b) Accept any type of average calculation (mean, median, mode). in the answer column. 6

Outputting the results 7 a e.g. total = 0 for x = 0 to 9 for y = 0 to Total = total + hoursplayed[x,y] next y next x average = total / (30*5) print (average) crime bait fright victory nymph loose bait crime fright victory nymph loose bait crime fright nymph victory loose bait crime fright nymph loose victory bait crime fright loose nymph victory b Comparing zebra to orange Greater, so split and take right side Further comparison (1 or depending on choices made) Correct identification of zebra using methodology above e.g. compare zebra to orange (AO 1b) (AO 1b) 1 mark for each row from row 5. Allow multiple swaps in one stage, where it is clear that a bubble sort has been applied. 1 mark per bullet (multiple ways through, marks awarded for appropriate comparison and creation of sub groups). greater, split right compare to wind 7

greater, split right compare to zebra 8 a Comments/annotation To explain the key functions/sections E.g. any relevant example, such as line checks the input is valid Indentation To show where constructs/sections start and finish E.g. indenting within IF statement Using constants so numbers can be updated easily E.g. π b radius area c i 3.1 1 30 c ii The number does not need to be changed while the program is running The number can be updated once and it updates throughout d Error diagnostics (any example) Run-time environment Editor (any feature such as auto-correct, auto-indent) Translator Version control Break point Stepping 6 (AO 1b) 1 (AO 1a) 1 (AO1 1a) (AO1 1a) 1 mark for identification of an example from the programme. 1 mark for explanation of how it aids maintainability. 1 mark for contextualisation. Maximum of 3 marks per method. Maximum of 1 mark Maximum of 1 mark 1 mark per bullet to a maximum of marks. Only 1 example per bullet, e.g. auto-correct and autoindent would only gain 1 mark. 8