Lesson 1.4.1b
1.4.1b Hexadecimal, floating point and bitwise manipulation Quiz: OCR Computer Science, Unit 4
20 questions
In partnership with Revision Ninja
Lesson 1.4.1b, Hexadecimal, floating point and bitwise manipulation: 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 is the main advantage of using hexadecimal instead of binary to represent numbers?
- Faster processing
- Uses less memory
- More precise
- Easier to read
-
What is the denary equivalent of the hexadecimal number 2F?
- 45
- 31
- 63
- 47
-
What is the 8-bit binary representation of the hexadecimal number A5?
- 10100101
- 10010101
- 10101001
- 10100100
-
Which of the following is commonly represented using hexadecimal notation in computer science?
- Processor speed
- MAC addresses
- ASCII text
- Hard drive capacity
-
In normalised floating point representation, what attribute does the mantissa determine?
- Exponent size
- Sign bit count
- Precision
- Range
-
In normalised floating point representation, what attribute does the exponent determine?
- Overflow limit
- Accuracy
- Precision
- Range
-
How does a positive normalised floating point number always begin in two's complement?
- 01
- 10
- 11
- 00
-
How does a negative normalised floating point number always begin in two's complement?
- 01
- 00
- 10
- 11
-
Which bitwise operation is used to clear specific bits in a binary number to zero?
- NOT
- XOR
- AND
- OR
-
Which bitwise operation is used to set specific bits in a binary number to one?
- NOT
- AND
- XOR
- OR
-
Which bitwise operation toggles specific bits while leaving other bits unchanged?
- NOT
- XOR
- OR
- AND
-
What is the effect of shifting an unsigned binary integer two places to the left?
- Multiply by 4
- Add 4
- Multiply by 2
- Divide by 4
-
What denary value results from applying a logical right shift of two to binary 00010000?
- 64
- 4
- 8
- 2
-
What is preserved at the Most Significant Bit during an arithmetic shift right of a negative number?
- Sign bit
- Zero bit
- Overflow bit
- Parity bit
-
What error occurs when a floating point calculation generates a number too small to be represented?
- Overflow
- Truncation
- Rounding error
- Underflow
-
What is the absolute error if 3.25 is stored as 3.0 in binary floating point?
- 0.25
- 0.08
- 3.00
- 0.75
-
What hexadecimal value represents the byte 11001011?
- D11
- C11
- CB
- B3
-
Which 8-bit mask is needed with an AND operation to isolate the lower 4 bits?
- 11110000
- 00001111
- 00000000
- 11111111
-
Increasing the number of bits allocated to the exponent in floating point representation reduces what?
- Underflow risk
- Precision
- Accuracy loss
- Range
-
What is the result of applying a bitwise NOT operation to the byte 10100110?
- 11011001
- 01011001
- 10100111
- 01011010
Related quizzes
- Primitive data types and binary number representation Quiz · 1.4.1a · 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