Geschreven door studenten die geslaagd zijn Direct beschikbaar na je betaling Online lezen of als PDF Verkeerd document? Gratis ruilen 4,6 TrustPilot
logo-home
Tentamen (uitwerkingen)

A-level COMPUTER SCIENCE

Beoordeling
-
Verkocht
-
Pagina's
30
Cijfer
A+
Geüpload op
24-08-2022
Geschreven in
2022/2023

AQA A-LEVEL COMPUTER SCIENCE PAPER 2 MARK SCHEME A-level COMPUTER SCIENCE 7517/2 Paper 2 Mark scheme June Version: 1.0 Final *206a7517/2/MS* Mark schemes are prepared by the Lead Assessment Writer and considered, together with the relevant questions, by a panel of subject teachers. This mark scheme includes any amendments made at the standardisation events which all associates participate in and is the scheme which was used by them in this examination. The standardisation process ensures that the mark scheme covers the students’ responses to questions and that every associate understands and applies it in the same correct way. As preparation for standardisation each associate analyses a number of students’ scripts. Alternative answers not already covered by the mark scheme are discussed and legislated for. If, after the standardisation process, associates encounter unusual answers which have not been raised they are required to refer these to the Lead Examiner. It must be stressed that a mark scheme is a working document, in many cases further developed and expanded on the basis of students’ reactions to a particular paper. Assumptions about future mark schemes on the basis of one year’s document should be avoided; whilst the guiding principles of assessment remain constant, details will change, depending on the content of a particular examination paper. Further copies of this mark scheme are available from Copyright information For confidentiality purposes acknowledgements of third-party material are published in a separate booklet which is available for free download from after the live examination series. Copyright © 2020 AQA and its licensors. All rights reserved. Level of response marking instructions Level of response mark schemes are broken down into levels, each of which has a descriptor. The descriptor for the level shows the average performance for the level. There are marks in each level. Before you apply the mark scheme to a student’s answer read through the answer and annotate it (as instructed) to show the qualities that are being looked for. You can then apply the mark scheme. Step 1 Determine a level Start at the lowest level of the mark scheme and use it as a ladder to see whether the answer meets the descriptor for that level. The descriptor for the level indicates the different qualities that might be seen in the student’s answer for that level. If it meets the lowest level then go to the next one and decide if it meets this level, and so on, until you have a match between the level descriptor and the answer. With practice and familiarity you will find that for better answers you will be able to quickly skip through the lower levels of the mark scheme. When assigning a level you should look at the overall quality of the answer and not look to pick holes in small and specific parts of the answer where the student has not performed quite as well as the rest. If the answer covers different aspects of different levels of the mark scheme you should use a best fit approach for defining the level and then use the variability of the response to help decide the mark within the level, ie if the response is predominantly level 3 with a small amount of level 4 material it would be placed in level 3 but be awarded a mark near the top of the level because of the level 4 content. Step 2 Determine a mark Once you have assigned a level you need to decide on the mark. The descriptors on how to allocate marks can help with this. The exemplar materials used during standardisation will help. There will be an answer in the standardising materials which will correspond with each level of the mark scheme. This answer will have been awarded a mark by the Lead Examiner. You can compare the student’s answer with the example to determine if it is the same standard, better or worse than the example. You can then use this to allocate a mark for the answer based on the Lead Examiner’s mark on the example. You may well need to read back through the answer as you apply the mark scheme to clarify points and assure yourself that the level and the mark are appropriate. Indicative content in the mark scheme is provided as a guide for examiners. It is not intended to be exhaustive and you must credit other valid points. Students do not have to cover all of the points mentioned in the Indicative content to reach the highest level of the mark scheme. An answer which contains nothing of relevance to the question must be awarded no marks. A-level Computer Science Paper 2 June 2020 The following annotation is used in the mark scheme: ; - means a single mark // - means alternative response / - means an alternative word or sub-phrase A. - means acceptable creditworthy answer R. - means reject answer as not creditworthy NE. - means not enough I. - means ignore DPT. - in some questions a specific error made by a candidate, if repeated, could result in the loss of more than one mark. The DPT label indicates that this mistake should only result in a candidate losing one mark on the first occasion that the error is made. Provided that the answer remains understandable, subsequent marks should be awarded as if the error was not being repeated. Examiners are required to assign each of the candidates’ responses to the most appropriate level according to its overall quality, then allocate a single mark within the level. When deciding upon a mark in a level examiners should bear in mind the relative weightings of the assessment objectives. eg In the following questions, the marks available are as follows: Question 4.5 (max 5 marks) AO2 (analyse) – 3 marks AO3 (programming) – 2 marks Question 8.1 (max 2 marks) AO1 (understanding) – 1 mark AO2 (analyse) – 1 mark Question 8.2 (max 2 marks) AO1 (understanding) – 1 mark AO2 (analyse) – 1 mark Question 8.3 (max 6 marks) AO1 (knowledge) – 3 marks AO2 (analyse) – 3 marks 01 1 2 marks for AO2 (apply) Award 2 marks if correct final answer is shown: 1,600,000 (bytes); A. 1600kB or 1.6MB for 1 mark but NE. 1600 or 1.6 without units If final answer in not given then award 2 marks if correct calculation is shown: (60+40) x 16 x 8000 / 8 or 100 x 16 x 8000 / 8 If final answer is not given/incorrect and fully correct working is not shown then award 1 mark for doing any three of: • multiplying by 8000 • multiplying by 100 • multiplying by 16 • dividing by 8. A. Multiplying by 2 as an alternative to multiplying by 16 and dividing by 8 2 01 2 2 marks for AO1 (knowledge) 2 marks: All three points in list below covered OR 1 mark: At least one point from list below covered • (Analogue signal A. sound as BOD) sampled at fixed/regular time intervals R. references to graphs • Amplitude/Voltage of signal/wave (at each sample point) measured • Measurement coded into a fixed number of bits // coded in binary 2 02 1 2 marks for AO1 (understanding) Advantage of floating point (max 1): (In a given number of bits) a floating point system can represent numbers with a greater range than a fixed point system; A. can represent numbers much closer to zero // can represent much smaller numbers A. can represent much larger numbers Advantage of fixed point (max 1): (In a given number of bits) a fixed point system can represent (some) numbers more precisely than a floating point system; A. “accurately” for “precision” as BOD Calculations can be performed more quickly; NE. time efficient; A. simpler evaluation Represents all numbers to a constant (A. fixed, guaranteed) level of precision/accuracy; NE. easier to understand 2 02 2 2 marks for AO2 (apply) Award 2 marks for correct answer: Answer: -0. // -11/128 A. expressed to at least four decimal places eg -0.0859 If answer is incorrect then award 1 method mark for either: • showing correct value of both mantissa and exponent in decimal (Mantissa = -0.6875 // -11/16 Exponent = -3) • showing binary point shifted 3 places to left in binary number • indicating that final answer calculated using answer = mantissa x 2exponent and using at least one of the correct mantissa or exponent in this calculation. 2 02 3 3 marks for AO2 (apply) Award 3 marks for correct answer: Answer If answer is incorrect then award up to 2 method marks for: • correct (unsigned) representation of 1632 in binary: 00; A. leading 0s A. omission of trailing zeros if clear what place value of each column with a 1 in it has • showing the correct value of the exponent in decimal (11) or binary (1011) // showing the binary point being shifted 11 places left; (Note: mark for correct exponent can be awarded if seen in final answer). • showing the correct value of the mantissa in binary (0.). 3 02 4 3 marks for AO2 (apply) If either the highest or lowest value is correct then award 1 mark. Award 3 marks if both are correct: • highest value: 32,256 A. 0. x 215 // 63/64 x 215 • lowest value: -32,768 A. - 215 // -1 x 215 If 3 marks have not been awarded for the two correct values then working marks can be awarded, but a maximum of 2 marks can be awarded for the question overall. Working marks are available as follows: 1 mark for expressing the highest value in binary: • A. leading 0s OR • mantissa 0. AND exponent 01111 1 mark for expressing the lowest value in binary: • A. leading 1s OR • mantissa 1. AND exponent 01111 1 mark for doing the calculation of multiplying a value by the correct exponent in decimal (215 or 32,768), regardless of whether the value is an appropriate one or the result of the calculation is correct 3 02 5 2 marks for AO2 (analysis) There are not enough bits in the mantissa (to represent 28.25 exactly) // 7 bits is not enough to represent 28.25 exactly // the binary representation of 28.25 has more than 7 significant digits // the binary representation of 28.25 has more significant digits than there are bits in the mantissa // binary representation of 28.25 needs 8 bits (in mantissa) / has 8 significant digits // insufficient (bits) of precision available; R. 28.25/some numbers can never be represented exactly in binary It could be rounded to the nearest representable value // it may be truncated // represent as 28 // represent as 28.5; R. an error would be generated 2 03 1 2 marks for AO1 (understanding) Component Name Component Number (1–5) Address Bus 4 Data Bus 5 Main Memory 1 Processor 2 USB I/O Controller 3 1 mark: At least three components correctly numbered 2 marks: All five components correctly numbered 2 03 2 Mark is for AO2 (apply) 4,194,304 (kibibytes); A. 1024 x 1024 x 4 A. 4 x 220 A. 222 1 03 3 2 marks for AO1 (understanding) Avoid/reduce bottleneck of single data/address bus(es) // avoid/reduce delays waiting for memory fetches; A. Instruction and data can be accessed simultaneously; Avoids possibility of data being executed as code (which is one method that can be exploited by hackers) // Being able to use exclusively ROM for instruction memory prevents the program being modified/hacked; A. program cannot be (accidentally) overwritten (by data) Instruction and data memory can have different word lengths; Different technologies can be used to implement instruction and data memory; Different quantities of instruction and data memory means that address lengths can differ between the two // memory address structures can differ; Max 2 NE. So programs/tasks will run faster NE. More efficient NE. Quicker access, without further explanation NE. Instructions and data stored in different memories 2 03 4 2 marks for AO1 (knowledge) Number Register Name  Memory Address Register NE. MAR  Program Counter NE. PC  Current Instruction Register NE. CIR, IR A. Instruction Register 1 mark: Two registers correctly named OR 2 marks: All three registers correctly named If student has used initialisms instead of full register names (or a mixture of both) then award 1 mark if all three registers are given the correct abbreviated name. 2 03 5 2 marks for AO1 (knowledge) Allows the currently executing process/task/program to be suspended; A. “stopped” as BOD R. Suspend/stop the fetch-execute cycle / processor R. “instruction” for “process” So that a device/source that needs the (immediate) attention of the processor can be serviced/dealt with // so that an urgent error condition can be serviced/dealt with; A. Examples of error conditions that would be likely to generate an interrupt NE. To deal with an error, unless stated or clear from example that must be dealt with immediately NE. So that a task of higher priority can be carried out 2 03 6 2 marks for AO1 (understanding) So that the currently running process/task/program can be returned to; NE. So that the content will not be lost/overwritten NE. So that the F-E cycle can continue afterwards As the (code that deals with the) interrupt will change/overwrite/clear register values; NE. The contents of the registers will be lost 2 03 7 Mark is for AO1 (knowledge) Software (is the programs that) execute(s) on the hardware // hardware is the electrical/physical components that allow the software to execute; A. Software controls the operation of the hardware as BOD 1 04 1 Mark is for AO1 (knowledge) D; R. if more than one lozenge shaded 1 04 2 Mark is for AO1 (understanding) B; R. if more than one lozenge shaded 1 04 3 2 marks are for AO1 (understanding) More compact; A. facilitates faster transmission, smaller file size, uses less memory Quicker (A. easier) to parse; Structure understood directly in some languages (eg Javascript); (Native) support for arrays; Easier for humans to read/write/understand; Max 2 2 04 4 Mark is for AO2 (analysis) That the buyer will only view the same property once on a particular day; R. each visit made by only one buyer 1 04 5 3 marks for AO2 (analyse) and 2 marks for AO3 (programming) Mark Scheme AO2 (analyse) – 3 marks: 1 mark for correctly analysing the data model and identifying the tables that data needs to be extracted from (Property, Buyer) and the fields that need to be extracted (PropertyID, Street, Bedrooms, AskingPrice), and including these and no other tables or fields in the query. 1 mark for correctly identifying two conditions relating to how the data in the required tables should be combined to produce the desired results OR 2 marks for identifying all four required conditions. The four conditions are: • BuyerID = 23 • Buyer.DesiredArea = Property.Area • Buyer.MinBedrooms = Property.Bedrooms • Buyer.MaxPrice = Property.AskingPrice Note: The AO2 marks for analysing the data model should be awarded regardless of whether correct SQL syntax is used or not as they are for data modelling, not syntactically correct SQL programming AO3 (programming) – 2 marks: 1 mark for fully correct SQL in two of the three/four clauses (SELECT, FROM, WHERE, ORDER BY) OR 2 marks for fully correct SQL in all three/four clauses (SELECT, FROM, WHERE, ORDER BY) Note: For an SQL clause to be counted as “fully correct”, the syntax of the clause must be correct and the relevant AO2 decisions must also have been taken for the clause, eg the SELECT clause must have the correct fields in it only Example Solutions Example 1 SELECT PropertyID, Street, Bedrooms, AskingPrice FROM Buyer, Property WHERE BuyerID = 23 AND DesiredArea = Area AND MinBedrooms = Bedrooms AND MaxPrice = AskingPrice ORDER BY AskingPrice DESC 5 Example 2 SELECT PropertyID, Street, Bedrooms, AskingPrice FROM Buyer INNER JOIN Property ON DesiredArea = Area WHERE BuyerID = 23 AND MinBedrooms = Bedrooms AND MaxPrice = AskingPrice ORDER BY AskingPrice DESC Example 3 SELECT PropertyID, Street, Bedrooms, AskingPrice FROM Buyer INNER JOIN Property ON DesiredArea = Area AND MinBedrooms = Bedrooms AND MaxPrice = AskingPrice WHERE BuyerID = 23 ORDER BY AskingPrice DESC Example 4 – A Nested Solution SELECT PropertyID, Street, Bedrooms, AskingPrice FROM (SELECT DesiredArea, MinBedrooms, MaxPrice FROM Buyer WHERE BuyerID = 23) AS Requirements INNER JOIN Property WHERE DesiredArea = Area AND MinBedrooms = Bedrooms AND MaxPrice = AskingPrice ORDER BY AskingPrice DESC Refer nested solutions to team leaders for marking Overall Max 4 if solution does not work fully Additional Guidance AO2 marks: Mark(s) can be awarded for the correct logical conditions even if the required tables are not identified as being used by the query AO3 marks: A. table names before fieldnames separated by a full stop. A. use of Alias/AS command eg FROM Buyer AS B then use of B as the table name but note that command AS is not required eg FROM Buyer B. A. INNER JOIN written as one word ie INNERJOIN. A. ORDER BY written as one word ie ORDERBY. A. insertion of spaces into fieldnames. I. unnecessary brackets so long as they would not stop the query working I. quotation marks of any type around the 23 DPT. for unnecessary punctuation – allow one semicolon at the very end of the statement, but not at the end of each clause. DPT. for fieldname before table name. 05 1 Mark is for AO1 (understanding) Reduces the need for expert knowledge when configuring a host; A. No requirement to manually assign IP addresses / other values A. Automatic assignment of IP addresses Reduces the time required to configure hosts; Facilitates efficient use of a limited pool of IP addresses; A. Example of how this is facilitated eg reuse Avoids errors - with a relevant example such as duplicating IP addresses or programming incorrect subnet mask; NE. “avoiding errors” without an example Max 1 1 05 2 2 marks for AO1 (understanding) The computers have private/non-routable IP addresses // 192.168.2.3 is a private/non- routable IP address; NE. The computers can have the same IP addresses as they are on different networks NAT/Network Address Translation will be performed (so that the computers can communicate on the Internet) // as data passes onto Internet, private IP address replaced with public IP address of router/gateway; 2 05 3 4 marks for AO1 (understanding) Block/allow (traffic on) specific ports // block specified protocols; Block/allow (traffic from) specific IP addresses; A. Domain names as BOD NE. Block access to certain websites R. MAC addresses Block/allow certain types of packet; A. Examples eg pings/echo requests NE. Block specific programs connecting to Internet Firewall maintains information about current connections and only allows packets relevant to these connections through; NE. Just the name “stateful inspection” Act as a proxy server // all traffic to Internet must go via firewall // stops computers on the Internet directly accessing devices on the LAN; Identify unusual behaviour from a host // example of unusual behaviour eg sending an unusually large amount of data; Rules are written to specify conditions under which to block/allow; If none of the first three marks scheme points awarded then a mark can be awarded for: Examine the contents of the packet header and allow/block based on rules; NE. Just the name “packet filtering” Max 4 4 05 4 12 marks for AO1 (understanding) Level Description Mark Range 4 A line of reasoning has been followed to produce a coherent, 10–12 relevant, substantiated and logically structured response. The response covers all three areas indicated in the guidance below and in at least two of these areas there is sufficient detail to show that the student has a good level of understanding. To reach the top of this mark range, a good level of understanding must be shown of all three areas. 3 A line of reasoning has been followed to produce a coherent, 7–9 relevant, substantiated and logically structured response which shows a good level of understanding of two areas indicated in the guidance below. 2 A limited attempt has been made to follow a line of reasoning and 4–6 the response has a mostly logical structure. A good level of understanding has been shown of at least one area or a reasonable understanding has been shown of at least two areas. 1 A few relevant points have been made but there is no evidence 1–3 that a line of reasoning has been followed. The points may only relate to one or two of the areas from the guidance. There is insufficient evidence of a good understanding of any of the three areas. Guidance – Indicative Response Determining if on LAN: • AND operation of subnet mask with Computer A’s IP address • AND operation of subnet mask with Computer B’s IP address • result (of each AND operation) is the network/subnet ID • network/subnet IDs compared • as they are different, then packet must be sent via router/gateway/Internet // Computer B is not on the same subnet • if they were the same, then packet can be sent directly to Computer B // Computer B is on the same subnet. If no other points made, then a very basic understanding could be shown by recognising that the subnet mask is used with the IP addresses to determine if the two computers are on the same network/subnet. Good level of understanding = most of the key elements listed above are covered. Routing across Internet: • hierarchical organisation of routers • example of hierarchical organisation of routers eg passed up to a national router, transferred internationally and then passed back down a hierarchy • path to take selected by each router (not determined at start) NE. passed from router to router 12 • route may change as a result of eg congestion, technical problems • (possible) repackaging of packet to use different protocol (eg gateway may change protocol) • route determined using the (Network ID part of the destination) IP address (Note: can infer "IP address" if just "address" is stated, if previously candidate has written about an IP address) • use of router tables / criteria to determine next hop / (step of) path • router decrementing "time to live" of packet • source and destination MAC addresses changed at each router // MAC addresses used for each “hop” • IP address of Computer A will be replaced with IP address of Router A3 // NAT / Network Address Translation will occur at router(s). Good level of understanding = most of the key elements listed above are covered. Checksum: • checksum produced when packet transmitted // by computer A • (hash) value / checksum calculated from packet contents • MOD operation (often) used to limit magnitude of checksum // fit value to specific number of bits • this value / checksum transmitted with packet // appended to packet • computer B recalculates checksum // performs same calculation on data • received and calculate checksum compared • if these match packet contents/data are accurate // if these differ the data has been changed // if these differ there is an error in the data. Good level of understanding = most of the key elements listed above are covered. 06 1 Mark is for AO1 (knowledge) Table C; R. if more than one lozenge shaded 1 06 2 4 marks for AO2 (apply) Marks are awarded for the correct values in the unshaded cells only. 1 mark: Correct values in columns A or C 1 mark: Correct values in columns B or D 1 mark: Correct values in column E 1 mark: Correct values in column Q Max 3 if any incorrect values in table 4 06 3 Mark is for AO2 (analyse) b; A. the middle bar 1 06 4 4 marks for AO2 (apply) Marking guidance for examiners: • award marks for working out until an incorrect step has been made • ignore missing steps from the example solutions, as long as the jumps between steps are logically correct • if, in any one step, a candidate is simplifying different parts of an expression simultaneously award all relevant marks for this multiple stage but don’t award any further marks for working in any parts simplified incorrectly. For example, if the expression P.P.(P+Q) + P.P.1 was changed to P.(P+Q)+P.0, the candidate would get one mark for simplifying the first part to P.(P+Q) and could get further marks for correctly simplifying this part of the expression further but should not be awarded marks for simplifying the incorrectly changed part P.0 (ie to 0). 1 mark for final answer:

Meer zien Lees minder
Instelling
A-level COMPUTER SCIENCE
Vak
A-level COMPUTER SCIENCE










Oeps! We kunnen je document nu niet laden. Probeer het nog eens of neem contact op met support.

Geschreven voor

Instelling
A-level COMPUTER SCIENCE
Vak
A-level COMPUTER SCIENCE

Documentinformatie

Geüpload op
24 augustus 2022
Aantal pagina's
30
Geschreven in
2022/2023
Type
Tentamen (uitwerkingen)
Bevat
Vragen en antwoorden

Onderwerpen

€13,19
Krijg toegang tot het volledige document:

Verkeerd document? Gratis ruilen Binnen 14 dagen na aankoop en voor het downloaden kun je een ander document kiezen. Je kunt het bedrag gewoon opnieuw besteden.
Geschreven door studenten die geslaagd zijn
Direct beschikbaar na je betaling
Online lezen of als PDF

Maak kennis met de verkoper
Seller avatar
simoncube

Maak kennis met de verkoper

Seller avatar
simoncube Teachme2-tutor
Volgen Je moet ingelogd zijn om studenten of vakken te kunnen volgen
Verkocht
4
Lid sinds
3 jaar
Aantal volgers
3
Documenten
236
Laatst verkocht
1 jaar geleden

0,0

0 beoordelingen

5
0
4
0
3
0
2
0
1
0

Populaire documenten

Waarom studenten kiezen voor Stuvia

Gemaakt door medestudenten, geverifieerd door reviews

Kwaliteit die je kunt vertrouwen: geschreven door studenten die slaagden en beoordeeld door anderen die dit document gebruikten.

Niet tevreden? Kies een ander document

Geen zorgen! Je kunt voor hetzelfde geld direct een ander document kiezen dat beter past bij wat je zoekt.

Betaal zoals je wilt, start meteen met leren

Geen abonnement, geen verplichtingen. Betaal zoals je gewend bent via iDeal of creditcard en download je PDF-document meteen.

Student with book image

“Gekocht, gedownload en geslaagd. Zo makkelijk kan het dus zijn.”

Alisha Student

Veelgestelde vragen