Lesson 1.4.1a
1.4.1a Primitive data types and binary number representation Quiz: OCR Computer Science, Unit 4
20 questions
In partnership with Revision Ninja
Lesson 1.4.1a, Primitive data types and binary number representation: 20 multiple choice questions for the OCR Computer Science (H446), Unit 4: Data types, data structures and algorithms, written with Revision Ninja.
Host it live on the board and students join with a game code on their own devices, or revise alone with Free Play. The answers are revealed in the game.
The 20 questions
-
What primitive data type stores a single true or false value?
- Integer
- Boolean
- Character
- String
-
How many bits are in a single byte?
- 32
- 4
- 16
- 8
-
Which primitive data type represents a single letter, number, or symbol?
- Character
- Boolean
- String
- Float
-
Which system uses base-16 to represent numbers compactly?
- Denary
- Hexadecimal
- Binary
- Octal
-
What is the denary equivalent of the unsigned 8-bit binary number 00001010?
- 10
- 8
- 14
- 12
-
What is the hexadecimal representation of the denary number 15?
- 10
- E
- 15
- F
-
What is the most significant bit in an 8-bit two's complement binary number?
- Exponent bit
- Least significant bit
- Sign bit
- Parity bit
-
What is the denary value of the 8-bit sign and magnitude binary number 10000101?
- -5
- -133
- -123
- 5
-
What is the 8-bit two's complement binary representation of -1?
- 00000001
- 11111110
- 10000001
- 11111111
-
Which error occurs when a calculation produces a number too large for the allocated bits?
- Truncation error
- Overflow
- Rounding error
- Underflow
-
What is the result of adding binary 0101 and 0011?
- 1001
- 0110
- 1000
- 0111
-
What is the denary value of the two's complement binary number 11111100?
- -252
- 252
- -4
- -2
-
In binary floating point representation, what part of the number determines its precision?
- Mantissa
- Radix point
- Sign bit
- Exponent
-
In binary floating point representation, what part of the number determines its range?
- Sign bit
- Modulus
- Mantissa
- Exponent
-
Why are floating point numbers normalised in binary representation?
- Maximise precision
- Prevent overflow
- Eliminate sign bit
- Increase range
-
What bitwise operation shifts bits to the left to multiply an unsigned binary number by two?
- Circular shift
- Logical shift
- Bitwise AND
- Bitwise OR
-
What is the absolute error when 3.75 is rounded to 4?
- 0.05
- 0.75
- 0.25
- 1.25
-
What is the binary result of performing bitwise AND on 1100 and 1010?
- 0110
- 0001
- 1110
- 1000
-
How many distinct denary values can be represented using 4 unsigned binary bits?
- 15
- 8
- 16
- 32
-
Which fixed-point binary representation with 4 integer bits and 4 fractional bits represents denary 2.5?
- 0010.0100
- 0001.1000
- 0010.1000
- 0100.0100
Related quizzes
- Hexadecimal, floating point and bitwise manipulation Quiz · 1.4.1b · 20 questions
- Character sets: ASCII and Unicode Quiz · 1.4.1c · 20 questions
- Arrays, records, lists, graphs, stacks, queues, trees and hash tables Quiz · 1.4.2 · 20 questions
- Boolean problems, simplification and Karnaugh maps Quiz · 1.4.3a · 20 questions
- Logic gates, truth tables, flip-flops, half and full adders Quiz · 1.4.3b · 20 questions
- Processor components: ALU, control unit, registers and buses Quiz · 1.1.1a · 20 questions
- Operating systems and memory management Quiz · 1.2.1a · 20 questions
- Compression, encryption and hashing Quiz · 1.3.1 · 20 questions
- Data Protection Act 1998 and Computer Misuse Act 1990 Quiz · 1.5.1a · 20 questions
- The nature and need for abstraction and abstract models Quiz · 2.1.1 · 20 questions