9618_w22_qp_33
A paper of Computer Science, 9618
Questions:
12
Year:
2022
Paper:
3
Variant:
3
Login to start this paper & get access to powerful tools
1
Real numbers are stored in a computer system using floating-point representation with: • 8 bits for the mantissa • 8 bits for the exponent • two’s complement form for both mantissa and exponent. Write the normalised floating-point representation of +202 in this system. Show your working. Mantissa Exponent Working Write the normalised floating-point representation of –202 in this system. Show your working. Mantissa Exponent Working A binary number is stored in the computer system. Mantissa Exponent State why the number is not normalised. Write the normalised floating-point representation of the number. Mantissa Exponent
13. Data Representation  →  13.3. Floating-point numbers, representation and manipulation
Open
3
State what is meant by the term enumerated data type. State what is meant by the term pointer data type. The months of the year are: January, February, March, April, May, June, July, August, September, October, November and December. Write the pseudocode statement to define the data type Quarter1, to hold the names of the first three months of a year. The composite data type Pet is used to store data about the various pets of a group of students. It uses these fields: Field name Data type PetName String AnimalType String PetAge Integer PetGender Char OwnerName String Write the pseudocode statement to set up a variable for one record of the composite data type Pet. Write pseudocode to store the details of the following pet, in the variable you set up in part . PetName AnimalType PetAge PetGender OwnerName Tibbles Cat M Jasmine Smith
10. Data Types and Structures  →  10.1. Data Types and Records
Open
4
Draw one line to connect each stage of compilation to its most appropriate description. Stage of compilation Description Lexical analysis Syntax analysis Code generation Optimisation minimising a program’s execution time and memory requirement converting an intermediate representation of source code into an executable form converting a sequence of characters into a sequence of tokens directly executing instructions written in a scripting language using parsing algorithms to interpret the meaning of a sequence of tokens
16. System Software  →  16.2. Translation Software
5. System Software  →  5.2. Language Translators
Open
7
Complete the Karnaugh map (K-map) for the Boolean expression. Z = ¯A. B. ¯C. ¯D + ¯A. B. ¯C. D + A. B. ¯C. ¯D + A. B. ¯C. D + A. ¯B. ¯C. ¯D + A. ¯B. ¯C. D AB CD Draw looparound appropriate groupin the K-map to produce an optimal sum-of-products. Write the Boolean expression from your answer to part as a simplified sum-of-products. Use Boolean algebra to give your answer in its simplest form. Simplified sum-of-products Z = Simplest form Z =
15. Hardware and Virtual Machines  →  15.2. Boolean Algebra and Logic Circuits
Open
10
Reduced Instruction Set Computers (RISC) and Complex Instruction Set Computers (CISC) are two types of processor. Tick (3) one box in each row to show if the statement applies to RISC or CISC processors. Statement RISC CISC uses a smaller instruction set uses single-cycle instructions and limited addressing modes uses fewer general-purpose registers uses both hardwired and micro-coded control unit uses a system where cache is split between data and instructions Describe the process of pipelining during the fetch-execute cycle in RISC processors.
15. Hardware and Virtual Machines  →  15.1. Processors, Parallel Processing and Virtual Machines
4. Processor Fundamentals  →  4.1. Central Processing Unit (CPU) Architecture
Open
11
Define these Object-Oriented Programming (OOP) terms: Instance Inheritance Polymorphism In OOP, a class contains attributes and methods. Complete the pseudocode for the class Car to enable objects to be created. The class needs to include: • string attributes to store the make, model, body type and fuel type • an integer attribute to store the number of cars of that type built. The attributes must be available only through the methods of the class. CLASS PRIVATE Make : STRING PRIVATE PUBLIC PROCEDURE New(CarMake : STRING, , ) Make ← Model ← BodyType ← CarBodyType Fuel ← "" NumberBuilt ← 0 ENDPROCEDURE GetFuel() GetNumberBuilt()
20. Further Programming  →  20.1. Programming Paradigms
13. Data Representation  →  13.1. User-defined data types
Open
12
The array Names[0:99] is in alphabetical order. Complete this pseudocode binary search algorithm. Lower ← 0 Mid ← 0 Exit ← FALSE OUTPUT "Enter the name to be found " INPUT Target REPEAT THEN OUTPUT Target, " does not exist" Exit ← TRUE ENDIF Mid ← Lower + (Upper – Lower + 1) DIV 2 IF Names[Mid] ENDIF IF Names[Mid] > Target THEN ENDIF THEN OUTPUT Target, " was found at location ", Mid Exit ← TRUE ENDIF Big O notation is used to classify efficiency of algorithms. The Big O notation for time complexity in a binary search is O(log n). State the Big O notation for time complexity of a linear search. Describe the meaning of O(log n) as it applies to a binary search algorithm.
19. Computational thinking and Problem-solving  →  19.1. Algorithms
10. Data Types and Structures  →  10.2. Arrays
Open