9618_w22_qp_32
A paper of Computer Science, 9618
Questions:
11
Year:
2022
Paper:
3
Variant:
2
Login to start this paper & get access to powerful tools
1
Normalised floating-point numbers are stored in a computer system using two’s complement for both the mantissa and the exponent with: • 11 bits for the mantissa • 5 bits for the exponent. Write the largest positive two’s complement binary number that can be stored in this system. Mantissa Exponent Calculate the denary value of the given binary floating-point number. Show your working. Mantissa Exponent Working Answer State when underflow occurs in a binary floating-point system.
13. Data Representation  →  13.3. Floating-point numbers, representation and manipulation
Open
4
A program to manage regular flight details at an airport requires some user-defined data types. Write pseudocode statements to declare the enumerated data type Aircraft to hold data about the types of aircraft used for a flight. These types of aircraft are: C300, C350, D242, E757, X380. Write pseudocode statements to declare the composite data type Flight to hold data about flights to a specific destination. These include: • flight number, which could be any combination of letters and numbers • destination • date of departure • type of aircraft used. Use the enumerated data type you created in part . Write the pseudocode statement to set up a variable for one record of the composite data type Flight. Write pseudocode to store the details of the following flight in the variable you set up in part . Field Data flight number XA782 destination Cambridge date of departure 12/12/2022 type of aircraft used C350 Use the field names you created in part .
10. Data Types and Structures  →  10.1. Data Types and Records
Open
10
Define these Object-Oriented Programming (OOP) terms: Encapsulation Getter Setter A school has a program written using OOP to maintain its staff and student records. The object SubstituteTeacher allows the details of the school’s substitute teachers to be stored. This includes their full name, telephone number and whether or not they are in school today. For example: SubName Sarah Jones Telephone InSchool TRUE Complete the diagram for the object SubstituteTeacher, including appropriate properties and their getters and setters. SubstituteTeacher SubName : STRING InSchool : BOOLEAN SetTelephone(Tel : STRING) GetSubName()
20. Further Programming  →  20.1. Programming Paradigms
13. Data Representation  →  13.1. User-defined data types
10. Data Types and Structures  →  10.4. Introduction to Abstract Data Types (ADT)
Open
11
A simplified linked list is used to store the names of flowers in alphabetical order. It is implemented using two 1D arrays: • Flower stores the names of the flowers. • NextPointer stores the pointer to the next flower name in the list. HeadPointer indicates the index of the first flower name in the linked list. HeadPointer When the end of the linked list is reached, the next pointer has the value of 0. The following table shows the initial content of the arrays. Index Flower NextPointer Rose Marigold Foxglove Iris Daisy Dahlia Saxifrage Lupin Lily Hydrangea Several flower names have been deleted from the linked list. These are crossed out in the following table. Complete the table to show the new values of HeadPointer and NextPointer to keep the remaining flower names in alphabetical order. HeadPointer Index Flower NextPointer Rose Marigold Foxglove Iris Daisy Dahlia Saxifrage Lupin Lily Hydrangea Complete the pseudocode algorithm so that it achieves the following when applied to the arrays: • The flower name is input. • The linked list is searched, in order, for the flower name. • If the flower name is found, an appropriate message is output to indicate it has been found. • If the flower name is not found, an appropriate message is output to indicate it has not been found. • The algorithm terminates when the next pointer value is 0. Pointer HeadPointer Found OUTPUT "Enter a flower name " …………………………………………………………………. …………………………………………………………………. IF Flower[Pointer] = FlowerName THEN Found Pointer Pointer ELSE …………………………………………………………………. ENDIF ENDWHILE …………………………………………………………………. OUTPUT Flower[Found], " is found" ELSE …………………………………………………………………. ENDIF Explain how you could improve the simplified linked list structure.
19. Computational thinking and Problem-solving  →  19.1. Algorithms
10. Data Types and Structures  →  10.2. Arrays
11. Programming  →  11.2. Constructs
Open