You are on page 1of 8
(@ An agreement / set of rules / standard for how computers should communicate / how data is sent/received/transmitted on a network © Example of what could be agreed in the protocol (e.9. speed / error checking / etc.) (b) | @ 1 mark for protocol, 1 mark for description * FTP /file transfer protocol * Uses a client-server model // sends from client to server // sends from server to client (b) | Gi) T mark for protocol, 1 mark for description eg * HTTPS / hyper text transfer protocol secure * Encrypts the connection/data // Uses SSL/secure socket layer () 1 mark for IMAP, 1 mark for SMTP. IMAP * Retrieves/accesses/downloads (a copy of an) e-mail * Allows synchronisation/management of account ‘SMTP: © Sends/forwards/transmits e-mail Pure binary 11.1 so mantissa 0.1110 3 Point moved 2 places so exponent 010 01110010 2 1 2 Includes w / w not defined 2 Ends be but only one lower allowed not valid... 2 ...needs minimum of 2 digits First Come First Served Round Robin Shortest Job First [3] Shortest Remaining Time Multilevel Feedback Queues To make the most efficient use of the processor/resources * Be fair to all users/applications BI * Provide a reasonable response time «Prevent processes from failing to run/Process starvation/Deadlock Parts of a program divided into equal size pieces Uses physical divisions Parts of a program divided into unequal sizes Uses logical divisions Both ways of partitioning/splitting up memory Use virtual memory/backing store to swap parts of programs «Allow programs larger than memory to [21 run/insufficient memory « Allows programs to be stored in memory non- contiguously _ * 1.75 Converted to binary 1.11 Move decimal point 0.111 . [2] [2] Exponent is 004 Correct answer 0111001 «Exponent 111 =000 + (ii) * 0110 move decimal point 011 * Convert to decimal/ fraction 0.375/ ‘/s Lexical & syntax analysis Lexical analysis only Syntax analysis only Both Neither This is part of compilation v May discover errors ¥ Removes redundant code such as comments. v Translates into source code v ‘The symbol table is used v Optimises code v |__| Threetron 3 * Created during lexical analysis, * Used for reserved words/keywords + Each token is a string of binary igi. +... offixed length. w + Todefine terms unambiguously in a computer language. (ii) 1223: * _ Series of digits, apply recursive rule for value value 447: + + sum D+2 + + not defined EF: © not defined A+B + + not defined (ii | | | * Correct notation throughout © | ‘+ Recursive definition with digit * Recursive definition with letter. T digit > Marks for * Diagram defines value to be a single digit ‘* Diagram defines value to be multiple digits j@ Two from: + Interrupt/Signal sent to processor * Request for processing time * Allows important tasks to be processedito take precedence ®) Two from: * Power (failure) * Peripheral/I/O interrupt © Clock interrupt © Software interrupt. © Two from: * To decide between interrupt & current task * To choose which interrupt to process if 2 (or more) occur together * Toensure most urgent task is performed first * Toensure most efficient use of processor. @[@_| Two from: * Away of partitioning memory * Segments are not fixed size * Segments are logical divisions... * which hold complete sections of programs. (i) | Toallow programs to run when there is insufficient memory available. (iil) | Three from: © Use of backing store as if it were main memory/for temporary storage * Uses pagesffixed size units * Pages are moved from memory to backing store... *_...to make space (in memory) for the pages needed. (iv) Two from: © Disk threshing/high rate of disk access * More time spent transferring pages than processing Computer may ‘hang’. (2 |@ [+ Convertfrom source code\high level codellow level code. * __...to object code\intermediate\executable\machine. (ii) | Two from (max 2): Type: «Compiler * Interpreter . Assembler. Difference: (compiler & interpreter) * Compiler translates whole program as a unit (to intermediate language) * Compiler gives list of errors at end of compilation * Interpreter reports errors as they are found * Interpreter translates & runs 1 statement at a time. (compiler or interpreter, & assembler) * Compiler/interpreter uses high-level source code . Assembler uses low-level source code. . Assembler gives list of errors at end. (b) Code generation: © Occurs after syntax analysis/is last phase of compilation . Produces machine code program/executable code/intermediate code... * _...which is equivalent to the source program Variables/constants are given addresses * Relative addresses are calculated. Optimisation: * Makes code as efficient as possible * Increases processing speed . Number of instructions is reduced Programmer can choose between speed & size. (a) © (Binary) tree ‘Answer pq+rs* Alternative answer is pqrs*-+ Marks for: «Starts with pq © Includes rs* = Complete answer. () = Stack ‘Answer 13 Marks for: © (w-x)"y#z (or equivalent with values) + Demonstration/explanation 13, ©) @ | are © abt *__abrc* OR cab+* atb’c * bet * abc’+ OR bo*at (i) | One from: © Avoid ambiguity * No need for brackets. mark per bullet ‘= Four laptopsicomputers, a server and printer present and clearly identifiable (positions do not matter) ‘+ Switch as a device clearly identifiable. all devices directly connected to the switch and only the switch (FT from MP2) eg. 7 mark per bullet to max To connect the devices together Receives data/packets/traffic Direct/send datalpackets/traffic only to its destination Creates/generates a list of devices connected to it as it receives. signals Uses MAC addresses of devices connected to it ‘1 mark per bullet to max 2 Wireless transmission is slower than cabled ‘* More devices/users could be connected e.g. mobile phones // increase in traffic . reducing bandwidth available for each user // insufficient bandwidth for users/demand ‘© Wireless can be limited by interference ‘+ ...such as walls that disrupt the signal // from other wireless networks/users T mark per factor eg. Bandwidth available Number of users (using the network at the same time) (Number of) data collisions Interference /! by example e.g. walls Distance data has to travel // signal strength Amount of data being transferred Applications being used Server/CPU performance Using a hub instead of a switch Tmark per bullet to max 2 «= Alayer can be removed/changed etc. _...without affecting any other layers * Each layer has its own purpose // separates the purposes /! self- contained -so it does not need to consider what the other layers do ..80 il. can be programming individually Individual protocols are each smaller/simpler to manage Different layers can interface with different hardware 1 mark for each protocol. Task Protocol ‘Sending an email ‘SMTP // Simple Mail Transfer Protocol from one mail server to another Transmitting a file FTP // File Transfer Protocol from a client to a server HTTP // Hypertext Transfer Protocol HTTPS // Hypertext Transfer Protocol Secure Viewing a website using a web browser Downloading an email | IMAP // Internet Message Access to your computer Protocol POP(3) /! Post Office Protocol

You might also like