The document is a practice paper for the GCE Computer Science exam, specifically focusing on computer systems, with a duration of 2 hours and 30 minutes and a maximum mark of 140. It includes a mark scheme detailing questions and answers related to various computer science concepts such as paging, segmentation, interrupts, and transaction processing. The document consists of 30 pages and provides guidance on marking and scoring for each question.
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)
19 views
Practice Paper 1 - Set 2 MS
The document is a practice paper for the GCE Computer Science exam, specifically focusing on computer systems, with a duration of 2 hours and 30 minutes and a maximum mark of 140. It includes a mark scheme detailing questions and answers related to various computer science concepts such as paging, segmentation, interrupts, and transaction processing. The document consists of 30 pages and provides guidance on marking and scoring for each question.
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/ 17
Practice Paper 2
GCE Computer Science
H446/01 Computer Systems Duration: 2 hours 30 minutes MAXIMUM MARK 140 Final This document consists of 30 pages H446/01 H446/01 Mark Scheme Practice Paper 2 Question Answer Marks Guidance 1 a i Paging is fixed size / physical divisions (1) 2 Segmentation is dividing memory logically (i.e. will (AO1.1) be variable size). (1) ii Uses virtual memory (1) which is an allocated area 4 of a hard drive/secondary storage device.(1) Pages (AO1.2) that aren’t needed are moved to VM (1) and moved back to physical memory when required (1) b i A signal to the processor indicating a device/process 1 needs attention (1) (AO1.1) ii Any five from: 5 (AO1.2) If the interrupt is of a lower/equal priority to the current process then the current process continues (1) If it is of a higher priority the CPU finishes its current Fetch-Decode-Execute cycle (1). The contents of the CPU’s registers are copied to a stack (1) in memory (1). The location of the appropriate interrupt service routine is loaded into the program counter (1) When the ISR is complete, the previous contents are popped from the stack and loaded back into the registers (1). 2 a Any two from: 2 (AO1.2) GPS…(1) …To determine the user’s geographical location (1) Compass/magnetometer (1)… …To determine direction in which use is facing. Accelerometer…(1) …to recognise user’s movement. (1) Touchscreen…. (1) …. To select options/play the 12 H446/01 Mark Scheme Practice Paper 2 game (1) b When an attribute is made private (so it can’t be 3 directly accessed or changed from outside the class) (AO 1.2) (1) Public methods are used to read / amend the attribute’s value (1) The attribute name’s value can only be amended through the method changeName. (1) c When a class has the attributes and methods of its 3 parent class. (1) It may also have methods and (AO 1.2) attributes of its own (1) TreasureChest inherits from the class Treasure (1) d Methods: (constructor/new), changeName, 2 Do not penalise for not including constructor. pickLock (1) (AO 1.2) Only give method mark if both other methods are listed Attributes: value, weight, name, locked (1) Only give attributes mark if all four attributes are listed. 3 a i & immediate addressing 1 (AO2.2) ii # indirect addressing 1 (AO2.2) b A program that translates assembly code (1) into 2 machine code/object code (1) (AO1.1) c Pipelining would allow one instruction to be fetched 3 Accept any valid example from the given code. as the previous one is being decoded and (2 AO2.2, the one before that is being executed.(1) 1 AO3.2) For example OUT could be fetched (1) . As there are no jump/branch instructions it pipelines well (as there is no need to flush the pipeline). (1) 4 a 09:40 1 13 H446/01 Mark Scheme Practice Paper 2 (AO1.2) b Correctly named function that takes in time as a 3 Returned value needn’t be correct for first mark parameter and returns a value. (1) Example solution: Minutes element is correct (1) (AO 3.2) function timeValue(givenTime) Hours element is correct (1) intTime=int(givenTime.substring(3,2)) intTime=intTime+int(givenTime.substring(0,2))*100 return intTime endfunction c Correct stop array extracted/referenced in code (1) 5 Marks 1-2 can be awarded even if the program doesn’t exhibit Sensible attempt to iterate through the array (1) behaviour needed for marks 3-5 Program returns time of next bus (1) Marks 1-4 can be awarded even if mark 5 can’t be awarded as Program returns No Buses when no more buses left. (A03.2) program would in reality crash. (1) Program runs without an index out of bounds error count = 0 (You may assume short circuit evaluation i.e. if the timesLeft = true array is in the second part of an and condition it timesList = times[stopName] won’t be checked if the first half evaluates to false.) while timesLeft == true and (1) timeValue(timesList[count]) < currentTime count = count + 1 if count == timesList.length then timesLeft = false endif endwhile if timesLeft == true then return timesList[count] else return "No Buses" endif 5 a Branch name depends on Sort Code (i.e. there is a 1 transitive relationship). (AO2.1) b Create another table for Branches which should 3 14 H446/01 Mark Scheme Practice Paper 2 include sort-code and branch name. (1) Make sort code the primary key of the BRANCH (AO3.1) table/ Add a primary key to BRANCH. (1) Remove Branch name from Customers, leave sortcode as primary key/ Remove sort-code and branch name from customers and add the primary key values from BRANCS as the foreign key (1) ALTERNATIVE ANSWER (ER-DIAGRAM) Two tables CUSTOMER and BRANCH (or similar names) (1) Link from CUSTOMER to BRANCHES is Many (1) to One (1) c Mark Band 3–High Level (7-9 marks) 2 Answers may include, but are not limited to, some of the points The candidate demonstrates a thorough (AO1.1) below. knowledge and understanding of transaction 2 processing. The material is generally (AO1.2) AO1: Knowledge and Understanding accurate and detailed. 2 Transactions should be: (AO2.1) Atomic; They should either succeed or fail but never partially The candidate is able to apply their 3 succeed. knowledge and understanding directly and ( AO3.3) Consistent: The transaction should only change the database consistently to the context provided. according to the rules of the database. Evidence/examples will be explicitly relevant Isolated: Each transaction shouldn’t affect/overwrite other to the explanation. transactions concurrently being processed. Durable: Once a transaction has been started it is remains no matter The candidate provides a thorough what happens. discussion which is well balanced. Evaluative Records should be locked when in use. If one transaction is comments are consistently relevant and well- amending a record, no other transaction should be able to until the considered. first transaction is complete. Transactions should maintain referential integrity. Changes to data There is a well-developed line of reasoning in one table must take into account data in linked tables. which is clear and logically structured. The Data should have redundancy – if part of a database is lost it should information presented is relevant and be recoverable from elsewhere. 15 H446/01 Mark Scheme Practice Paper 2 substantiated. Data entered must be accurate in the first place. Security measures need to be in place to prevent malicious Mark Band 2-Mid Level (4-6 marks) tampering of data. The candidate demonstrates reasonable Data entered should be validated (automatically checked it is knowledge and understanding of transaction sensible) and verified (checked that the data entered matches the processing; the material is generally accurate original). but at times underdeveloped. AO2.1: Application The candidate is able to apply their Ensuring the accuracy of transactions will be partly down to the knowledge and understanding directly to the DBMS and partly down to the code accessing the DBMS. context provided although one or two Referential Integrity is often enforced by the database management opportunities are missed. system. Evidence/examples are for the most part Redundancy can be provided in a number of ways. This could be a implicitly relevant to the explanation. RAID setup or mirroring servers. Bank may use validation and verification when data is input. The candidate provides a sound discussion, Security procedures may include firewall, enforcement of sensible the majority of which is focused. Evaluative passwords and enforced user access rights. comments are for the most part appropriate, Validation may include range checks, list checks, presence checks although one or two opportunities for etc. development are missed. Verification may include double entry and proof reading, There is a line of reasoning presented with some structure. The information presented is AO3.3: Evaluation in the most part relevant and supported by It is essential the bank follows the precautions discussed. some evidence. Verification and validation help ensure the data is initial data is sound (garbage in = garbage out) Mark Band 1-Low Level (1-3 marks) If they make mistakes with their financial data they may lose money The candidate demonstrates a basic or overcharge customers and lose business/find themselves in legal knowledge of transaction processing; the trouble. material is basic and contains some Without redundancy data could be lost. inaccuracies. The candidate makes a limited Without careful transaction processing, one transaction could attempt to apply acquired knowledge and accidentally overwrite another or half complete leading to inaccurate understanding to the context provided. data. Under the Data Protection Act they have an obligation to keep The candidate provides a limited discussion personal data accurate. which is narrow in focus. Judgments if made 16 H446/01 Mark Scheme Practice Paper 2 are weak and unsubstantiated. Verification and Validation. The information is basic and communicated in an unstructured way. The information is supported by limited evidence and the relationship to the evidence may not be clear. 0 marks No attempt to answer the question or response is not worthy of credit. 6 a 2 One byte correct (1) all three bytes correct.(1) (AO 1.2) b 2 Allow FT if (a) is incorrect but bottom row must match XOR with top (AO 1.2) row and key. One byte correct (1) all three bytes correct.(1) c Symmetric (1) …. as the same key is used to 2 Allow FT for asymmetric if (b) indicates asymmetric encryption decrypt it as encrypt it (1) (1 - used AO1.2, 1 - AO 2.2) d Any four from: 4 Symmetric encryption would require both parties to (AO 1.2) have copy of the key (1) this couldn’t be transmitted over the internet or an eavesdropper monitoring the message may see it (1) Asymmetric gets round this requirement as there are two different keys (1) One key encrypts the data (1) which can be publically distributed (1) and a different key to decrypt it (1) which is kept private (1) 17 H446/01 Mark Scheme Practice Paper 2 7 a 2 Allow one mark if added in wrong order. (AO 2.2) Doberman in correct position (1) Dalmatian in correct position (1) (Allow FT if first mark is incorrect) b Pug > Harrier (go right) (1) 3 Pug < Rottweiler (go left) (1) (AO 2.2) Found Pug (1) c Spaniel > Harriet (go right) (1) 3 Spaniel> Rottweiler (go right) (1)Spaniel < Whippet, (AO 2.2) no child node so Spaniel is not in tree (1) 18 H446/01 Mark Scheme Practice Paper 2 d Calls getLeftNode() when name is less than the 6 Points 4 and 5 can be awarded even if 1-3 aren’t. value of the current node (1) (5 AO and calls getRightNode() when name is less 3.2, 1 AO notThere = false than the value of the current node. (1) 1.2) Declares a breed to be in the tree if and only if it while breedNode.getName() != name and notThere == false exists.(1) if name < breedNode.getName() then if breedNode.getLeftNode() != null then Declares a breed not to be in the tree if and only if it breedNode = getLeftNode() doesn’t exist (1) else Presents output strings in correct format (1) notThere = true Sensible use of variable names and correctly endif indented (1) else // must be greater if breedNode.getRightNode() != null then breedNode = getRightNode() else notThere = true endif endif endwhile if notThere == true then print(name+ " is not in the tree.") else print(name+" is in the tree") endif 8 a Code enclosed within #warning{…} (1) 3 #warning{ color: red; (1) (AO 3.1) color: red; font-family: monospace; (1) font-family: monospace; } Also accept hex color and RGB color notations. Don’t penalise for missing semicolons. Accept a named suitable font like Courier New. b Creates a textbox (1) 2 To hold the username/which is referred to as (AO 2.2) 19 H446/01 Mark Scheme Practice Paper 2 username (1) c Mark Band 3–High Level (7-9 marks) 2 The candidate demonstrates a thorough knowledge (AO1.1) and understanding of client and server side 2 Answers may include, but are not limited to, some of the points processing. The material is generally accurate and (AO1.2) below. detailed. 2 (AO2.1) AO1: Knowledge and Understanding The candidate is able to apply their knowledge and 3 Server side processing takes place on the webserver. Data is sent understanding directly and consistently to the ( AO3.3) from the browser to the server, the server processes it and sends context provided. Evidence/examples will be the output back to the browser. explicitly relevant to the explanation. Client side processing takes place in the web browser. The candidate provides a thorough discussion which AO2.1: Application is well balanced. Evaluative comments are Client side processing doesn’t require data to be sent back and forth consistently relevant and well-considered. meaning code is much more responsive. Code is visible which means it can be copied. The browser may not There is a well-developed line of reasoning which is run the code either because it doesn’t have the capability or clear and logically structured. The information because the user has intentionally disabled client side code. presented is relevant and substantiated. Server side processing takes away the reliance of the browser having the correct interpreter. It hides the code from the user, Mark Band 2-Mid Level (4-6 marks) protecting copyright and avoiding it being amended/circumvented. The candidate demonstrates reasonable knowledge Server side processing puts extra load on the server. This is at the and understanding of client and server side cost of the company hosting the website. processing; the material is generally accurate but at times underdeveloped. AO3.3: Evaluation Client side processing is best used when it’s not critical code that The candidate is able to apply their knowledge and runs. If it is critical then it should be carried out on the server. Client understanding directly to the context provided side processing is also best where a quick response is needed – an although one or two opportunities are missed. example being games. Evidence/examples are for the most part implicitly Server side processing is best used where it is integral that relevant to the explanation. processing is carried out. It is often used for generating content. It can be used to access data including secure data. For this reason The candidate provides a sound discussion, the any data passed to it has to be checked carefully. majority of which is focused. Evaluative comments With some things like validation good practice is to do both: First on are for the most part appropriate, although one or the client for a quick response if there is an issue, then on the server 20 H446/01 Mark Scheme Practice Paper 2 two opportunities for in case the client side processing has been circumvented. development are missed. There is a line of reasoning presented with some structure. The information presented is in the most part relevant and supported by some evidence. Mark Band 1-Low Level (1-3 marks) The candidate demonstrates a basic knowledge of client and server side processing; the material is basic and contains some inaccuracies. The candidate makes a limited attempt to apply acquired knowledge and understanding to the context provided. The candidate provides a limited discussion which is narrow in focus. Judgments if made are weak and unsubstantiated. The information is basic and communicated in an unstructured way. The information is supported by limited evidence and the relationship to the evidence may not be clear. 0 marks No attempt to answer the question or response is not worthy of credit. 21 H446/01 Mark Scheme Practice Paper 2 d Any five from: 5 Takes the username and password from the form (3 AO2.2, (1) 2 AO3.3) Uses the username to create an SQL statement (1) to get the passwordHash belonging to the given username (1) Runs the SQL Statement(1) hashes the given password and compares it to the retrieved hash (1) If they match it generates a success webpage, otherwise it records the user’s IP address. (1) e i Any two from: 2 A numerical address made of 4 numbers each (AO2.1) between 0 and 255 / 32 hexadecimal digits (1) That uniquely identifies a device on a network. (1) It is a logical identifier (i.e. can change on a physical device) (1) 22 H446/01 Mark Scheme Practice Paper 2 ii IP address can help identify a user… (1) 2 …so company can potentially track users attempting (AO 2.2) to gain unauthorised access (1) f i SELECT passwordHash FROM users WHERE 1 name = 'admin' (AO 1.2) ii 0e5a511 1 (AO 1.2) g i SELECT passwordHash FROM users WHERE 1 name = 'DenverJ34'; DROP TABLE users; (AO 1.2) --' ii Gets passwordHash for username DenverJ34 (1) 2 then deletes the table called users. (1) (AO 3.3) iii Computer Misuse Act 1 (AO 1.1) 9 a (¬A ∧¬D) ∨(A ∧B ∧C) ∨(¬B ∧¬C ∧¬D) 4 One mark for each bracketed section. (AO 1.2) One mark for them being joined with ORs b i A 1 (AO 1.1) ii ¬(A∨ B) 1 (AO 1.1) iii A∨B 1 (AO 1.1) 23 H446/01 Mark Scheme Practice Paper 2 10 a 2 (AO 1.2) One AND one NOT gate used (1) In correct configuration (1) b To store the state of a bit 1 (AO1.1) c 3 (AO2.2.) One mark for each two correct clock cycles. 11 a i 10101011 1 (AO1.2) ii 171 1 (AO 1.2) b i 11110111 1 (AO 1.2) 24 H446/01 Mark Scheme Practice Paper 2 ii 10001001 1 (AO 1.2) c i Not Normalised 1 (AO 1.2) ii (Mantissa) Starts with 00 (normalised numbers start 1 01 or 10) (AO 1.2) d Exponent of first number is 3 (1) 5 Accept any sensible method (eg converting one number to have Making it 0100.1100 (1) (AO 1.2) same exponent as other and subtracting) with correct answer for full Exponent of second number is 2 (1) marks. Making it 010.01010 (1) Subtract numbers (1) Normalised is 01001110 0010 (1) 12 Mark Band 3–High Level (9-12 marks) 2 Answers may include, but are not limited to, some of the points The candidate demonstrates a thorough knowledge (AO1.1) below. and understanding of methods of utilising large 2 AO1: Knowledge and Understanding amounts of computing power. The material is (AO1.2 ) Processors have increasingly large clock speeds and can be generally accurate and detailed. 3 (AO2.1) overclocked. 5 (AO3.3) Processors can have multiple cores. The candidate is able to apply their knowledge and Super computers can have multiple processors (and GPUs). understanding directly and consistently to the GPUs can be applied to problems other than graphics processing. context provided. Evidence/examples will be Problems can be distributed across a number of computers working explicitly relevant to the explanation. together. The candidate is able to weigh up both sides of the AO2.1: Application argument which results in a supported and realistic Having multiple cores can speed up smaller problems but this will judgment as to which approaches to provide not be enough for larger problems. increasingly larger amounts of computing power are Supercomputers are prohibitively exceptionally expensive to buy 25 H446/01 Mark Scheme Practice Paper 2 best. and run for all but large organisations. GPUs are becoming a cost efficient way of tackling problems. There is a well-developed line of reasoning which is GPUs tend to have large number of cores so can run on highly clear and logically structured. The information paralleliseable problems... …but only where the same instruction is presented is relevant and substantiated. being applied to multiple pieces of data (SIMD) Mark Band 2-Mid Level (5-8 marks) The candidate demonstrates reasonable knowledge AO3.3: Evaluation and understanding of methods of utilising large Increased clock speed is limited to smaller problems. Even doubling amounts of computing power; the material is the clock speed would only halve the time taken. generally accurate but at times underdeveloped. Parallel processing isn’t suited to all problems. Most problems are only partially parallelisable. Writing algorithms for parallel processing The candidate is able to apply their knowledge and is more challenging than understanding directly to the context provided GPUs suited to a subset of science/ engineering problems where although one or two opportunities are missed. the same calculation is repeated on multiple data sets. Evidence/examples are for the most part implicitly relevant to the explanation. The candidate makes a reasonable attempt to come to a conclusion showing some recognition of which approaches to provide increasingly larger amounts of computing power are best. There is a line of reasoning presented with some structure. The information presented is in the most part relevant and supported by some evidence. Mark Band 1-Low Level (1-4 marks) The candidate demonstrates a basic knowledge of methods of utilising large amounts of computing power; the material is basic and contains some inaccuracies. The candidate makes a limited attempt to apply acquired knowledge and understanding to the context provided. The candidate provides nothing more than an 26 H446/01 Mark Scheme Practice Paper 2 unsupported assertion. The information is basic and communicated in an unstructured way. The information is supported by limited evidence and the relationship to the evidence may not be clear. 0 marks No attempt to answer the question or response is not worthy of credit. 27
(Ebook) Modern System Administration: Building and Maintaining Reliable Systems (Early Release) by Jennifer Davis ISBN 9781492055211, 1492055212 - The full ebook set is available with all chapters for download