Back to marketplace

Binary

No description yet. This curated deck is ready for daily study.

Total cards: 24•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (24)

#1
Front (Question)

What do computers use binary to do?

Back (Answer)

• To represent data, such as numbers, text, sound and graphics • To program instructions

#2
Front (Question)

What is 4 bits known as?

Back (Answer)

A nibble

#3
Front (Question)

What is 8 bits known as?

Back (Answer)

A byte

#4
Front (Question)

(Exam-style question) Explain one reason why all instructions and data used by a computer are represented in binary. (3)

Back (Answer)

• A processor consists of billions of transistors, each having just two states, on/off • The on/off states of a transistor represent the binary digits 1/0

#5
Front (Question)

(Exam-style question) Describe a ‘bit’. (2)

Back (Answer)

• A bit is short for binary digit, the smallest unit of data in a computer • A bit has a single binary value, either 0 or 1

#6
Front (Question)

(Exam-style question) Give one reason why a computer doesn’t need to know what a binary pattern represents. (1)

Back (Answer)

The microprocessor hardware only operates on bits, so it has no concept of type or representation

#7
Front (Question)

(Exam-style question) Write an arithmetic expression to show that 256 different colours can be represented in 8 bits. (1)

Back (Answer)

2⁸ = 256 colours

#8
Front (Question)

What can denary numbers also be called?

Back (Answer)

Decimal numbers

#9
Front (Question)

(Exam-style question) Explain one reason why the denary number 256 cannot be represented in an 8-bit binary pattern. (2)

Back (Answer)

• The number would be represented in binary as 100000000 • You would need 9 bits to store it

#10
Front (Question)

Convert the following denary numbers into 8-bit binary numbers: a) 203 b) 241 c) 79 d) 100

Back (Answer)

a) 11001011 b) 11110001 c) 01001111 d) 01100100

#11
Front (Question)

Convert the 8-bit binary pattern 11011001 into a denary number.

Back (Answer)

217

#12
Front (Question)

List two ways of representing signed integer numbers.

Back (Answer)

• Two’s complement • Sign and magnitude

#13
Front (Question)

What happens if the most significant bit of a two’s complement or sign and magnitude pattern is 1?

Back (Answer)

The number will have a negative value

#14
Front (Question)

(Example) Convert -10 to binary two’s complement.

Back (Answer)

• Write out the positive number (+10) in binary: 00001010 • Flip all the bits: 11110101 • Add 1 (00000001) to the result. This gives: 11110110 • Therefore, -10 in two’s complement is 11110110

#15
Front (Question)

(Exam-style question) Convert the denary number -54 to 8-bit binary two’s complement representation. (3)

Back (Answer)

11001010

#16
Front (Question)

(Exam-style question) Give the denary value of the 8-bit two’s complement number 11101111. (3)

Back (Answer)

-17

#17
Front (Question)

(Exam-style question) Convert the denary number -94 to a binary pattern using sign and magnitude representation. (2)

Back (Answer)

11011110

#18
Front (Question)

(Exam-style question) Give the result of adding 00101011 and 00010111. (2)

Back (Answer)

01000010

#19
Front (Question)

(Exam-style question) Add the following 8-bit binary numbers: 01010111 + 01011111 Give your answer in 8-bit binary form. (2)

Back (Answer)

10110110

#20
Front (Question)

(Exam-style question) Give the result of applying a logical shift left, 2 places, to the 8-bit binary pattern 00010100. (1)

Back (Answer)

01010000

#21
Front (Question)

(Exam-style question) Give the result of applying a logical shift right, 3 places, to the 8-bit binary pattern 10111000. (1)

Back (Answer)

00010111

#22
Front (Question)

(Exam-style question) Give the result of applying an arithmetic shift right, 1 place, to the 8-bit binary pattern 10001000. (1)

Back (Answer)

11000100

#23
Front (Question)

(Exam-style question) Give the result of applying an arithmetic shift left, 1 place, to the 8-bit binary pattern 11101100. (1)

Back (Answer)

11011000

#24
Front (Question)

(Exam-style question) Describe one difference between a logical and an arithmetic shift. (2)

Back (Answer)

• An arithmetic shift preserves the most significant bit • A logical shift always fills the vacated bits with 0s