Maximum 5 marks in total for question part Maximum 3 marks for algorithm Description (max 3) - set variable called HighestScore to zero and variable called BestName to dummy value - loop 30 times to check each student's total score in turn - check student's score against HighestScore - if student's score > HighestScore then - replace value in HighestScore by student's score and store student's name in BestName - output BestName and HighestScore outside the loop Sample algorithm (max 3): HighestScore 0 BestName "xxxx" (1 mark) FOR Count 1 TO 30 IF StudentTotalScore[Count] > HighestScore (1 mark) THEN HighestScore StudentTotalScore[Count] BestName StudentName[Count] (1 mark) ENDIF NEXT Count (1 mark) PRINT BestName, HighestScore (1 mark) If algorithm or program code only, then maximum 3 marks [5] (ii) comment on which student(s)' name will be output e.g. The first student with the highest score will be output [1] 4 UCLES 2019 0478/02/SM/20 Section B 2 (a) 1 mark for value of c and message 51020: value of c: 5 message: PIN OK (1 mark) 5120: value of c: 4 message: error in PIN entered (1 mark) [2] (b) length check [1] 3 Engine Count Number Size Average OUTPUT 0 0 0 11.8 1.18 1 112 21.0 3.8 2 22 1.0 4.8 3 1.3 6.1 4 1.0 7.1 5 2.5 9.6 3 6 2.0 111.6 4 7 11.3 12.9 8 1.8 14.7 5 9 1.3 16.0 10 -1 1.6 1.6, 5 (1 mark) (1 mark) (1 mark) (1 mark) (1 mark) (1 mark) [6] 4 1 mark for each error identified + suggested correction line 5: this should read IF x > h THEN h = x line 7: PRINT h should come after the end of the repeat loop line 8: this should read UNTIL c = 20 or UNTIL c >= 20 or UNTIL c > 19 [3] 5 UCLES 2019 0478/02/SM/20 [Turn over 5 (a) 5 [1] (b) Field: At Risk Age in Years Type Map Position Table: TREES TREES TREES TREES Sort: Show: 9 9 Criteria: True >100 or: One mark per correct column. [4] 6 (a) marking points: the way to find and print the largest value a 1 mark the way to find and print the largest value b 1 mark the way to find and print the largest value c 1 mark sample algorithm: INPUT a, b, c IF a > b AND a > c THEN PRINT a (1 mark) ELSE IF b > c THEN PRINT b (1 mark) ELSE PRINT c (1 mark) [3] Explain how to describe the structure of a collection of data using entities, attributes and relationships. [6 marks] (b) How would you identify particular instances of data in order to record the information in a database? Illustrate your answer by considering both a relational database maintained using SQL-92 and an ODMG database. [6 marks] (c) A high street bank has just announced a merger with a nationwide building society. You are employed as a consultant to advise on the integration of their client databases. Both institutions use relational databases. Write brief notes to alert the database administrators to the difficulties that they may encounter. [8 marks] Digital Communication I Information is to be conveyed from A to B using automatic repeat request (ARQ), forward error correction (FEC), and lossless compression. (a) Explain the terms ARQ, FEC and lossless compression. [5 marks] (b) If we consider each of these functions to be operating at different protocol layers, what would be the most sensible ordering of the layers, and why? [5 marks] (c) Suppose: The underlying bit channel has a capacity of B, a delay and error rate 0. The compression ratio is C < 1. Assume a processor has two symmetric gatherings that contain both utilitarian units and an issue support. In this processor, headings ought to be controlled to a particular pack before they are implanted in an issue pad. What should the two major targets of a good directing system be? (a) (I) Define the possibility of least pre-fixed point fix(f) of a steady endofunction f on an area and express Tarski's appropriate point theory for it. [ (ii) State Scott's appropriate point acknowledgment rule. [ ) program to process the worth of a given situation in Pascal's Triangle (See picture).