SECTION 08 / 8

How to Solve Week 1 Exam Questions

12 min read
On this page 19 headings
PAST-PAPER PRACTICE

Choose a paper

15 of 15 questions shown

Start here Every Week 1 question in the past papers is on this page, with the exact paper it came from. For each type you first learn the method from zero (Level 1 → Level 3), then you see every real question solved step by step, writing out every line.

Six question types from Week 1. Each card shows the one rule you need.
Six question types from Week 1. Each card shows the one rule you need.
Open image ↗
Week 1 question types

How to read this page: each grey “Asked in” box is a real past-paper question. It shows the paper, the question number and the marks. Below it, How to solve shows every step.


Type 1: Converting any base to decimal (the skill behind everything)

Method

Learn the method

Every digit is worth digit × (base)^(position). Positions are counted from the right, starting at 0.

Level 1: decimal, which you already know

329 = 3×10² + 2×10¹ + 9×10⁰ = 3×100 + 2×10 + 9×1 = 300 + 20 + 9 = 329

Level 2: binary (base 2)

11₂ = 1×2¹ + 1×2⁰ = 1×2 + 1×1 = 2 + 1 = 3

1011₂ = 1×2³ + 0×2² + 1×2¹ + 1×2⁰ = 1×8 + 0×4 + 1×2 + 1×1 = 8 + 0 + 2 + 1 = 11

Level 3: any base

(431)₆ = 4×6² + 3×6¹ + 1×6⁰ = 4×36 + 3×6 + 1×1 = 144 + 18 + 1 = 163

(143)₇ = 1×7² + 4×7¹ + 3×7⁰ = 1×49 + 4×7 + 3×1 = 49 + 28 + 3 = 80

Remember: anything⁰ = 1. So the rightmost digit is always just itself.

Going the other way: decimal → binary

Divide by 2 again and again. Write the remainders. Read them from the bottom up.

Step Divide Answer Remainder
1 11 ÷ 2 5 1
2 5 ÷ 2 2 1
3 2 ÷ 2 1 0
4 1 ÷ 2 0 1

Read bottom → top: 1011. Check: 8 + 0 + 2 + 1 = 11 ✔

The same method works for any base: divide by 16 for hex, by 8 for octal, and so on.


Type 2: Base → hex

Method

Learn the method

Go base → decimal → hex. To get hex, divide by 16. Remainders 10–15 become the letters A–F.

Decimal 10 11 12 13 14 15
Hex A B C D E F

Past paper question

Asked in
2025 T2 Quiz 1Q1033 marks

Question: A number in base 6 is 431. What is its hexadecimal representation?

Answer: A3

Show solution
  1. Change base 6 → decimal: (431)₆ = 4×6² + 3×6¹ + 1×6⁰ = 4×36 + 3×6 + 1 = 144 + 18 + 1 = 163
  2. Change decimal → hex by dividing by 16: 163 ÷ 16 = 10, remainder 3 10 ÷ 16 = 0, remainder 10 → A
  3. Read the remainders bottom → top: A3
  4. Check: A3 = 10×16¹ + 3×16⁰ = 160 + 3 = 163 ✔

Trap: don’t write “103”. The remainder 10 is one hex digit: A.


Type 3: Find the unknown bases

Method

Learn the method

  1. Expand both sides in decimal using the letters a and b (Type 1).
  2. Put each answer option in. The correct option makes both sides equal.

Level 1 example: (12)ₐ = (5)₁₀. Find a. 1×a1+2×a0=5→a+2=5→1 \times a^{1} + 2 \times a^{0} = 5 \to a + 2 = 5 \to a=3a = 3

Past paper questions

Asked in
2025 T2 Quiz 1Q954 marks

Question: If (143)ₐ = (212)ᵦ, where a and b are the bases, what are a and b? Options: a=6,b=5/a=8,b=5/a=7,b=6/a=9,b=7/a=5,b=4a = 6 , b = 5 / a = 8 , b = 5 / a = 7 , b = 6 / a = 9 , b = 7 / a = 5 , b = 4

Answer: a=7,b=6a = 7 , b = 6

Show solution
  1. Left side: (143)ₐ = 1×a2+4×a1+3×a0=1 \times a^{2} + 4 \times a^{1} + 3 \times a^{0} = a2+4a+3a^{2} + 4 a + 3
  2. Right side: (212)ᵦ = 2×b2+1×b1+2×b0=2 \times b^{2} + 1 \times b^{1} + 2 \times b^{0} = 2b2+b+22 b^{2} + b + 2
  3. Test the options:
Option a2+4a+3a^{2} + 4 a + 3 2b2+b+22 b^{2} + b + 2 Equal?
a=6,b=5a = 6 , b = 5 36 + 24 + 3 = 63 50 + 5 + 2 = 57 ✗
a=8,b=5a = 8 , b = 5 64 + 32 + 3 = 99 57 ✗
a=7,b=6a = 7 , b = 6 49 + 28 + 3 = 80 72 + 6 + 2 = 80 ✔
a=9,b=7a = 9 , b = 7 81 + 36 + 3 = 120 98 + 7 + 2 = 107 ✗
a=5,b=4a = 5 , b = 4 25 + 20 + 3 = 48 32 + 4 + 2 = 38 ✗
Asked in
2025 T3 Quiz 1Q1654 marks

Question: If (234)ₐ = (143)ᵦ, what are a and b? Options: a=3,b=4/a=4,b=5/a=5,b=6/a=6,b=7/a=7,b=8a = 3 , b = 4 / a = 4 , b = 5 / a = 5 , b = 6 / a = 6 , b = 7 / a = 7 , b = 8

Answer: a=4,b=5a = 4 , b = 5

Show solution
  1. Left: (234)ₐ = 2×a2+3×a+42 \times a^{2} + 3 \times a + 4
  2. Right: (143)ᵦ = 1×b2+4×b+31 \times b^{2} + 4 \times b + 3
  3. Test a=4,b=5a = 4 , b = 5: left = 2×16 + 3×4 + 4 = 32 + 12 + 4 = 48; right = 25 + 20 + 3 = 48 ✔
  4. Every other option gives two different numbers (for example a=5,b=6a = 5 , b = 6 gives 69 vs 63).

Note: strictly, base 4 can only use the digits 0–3, so “234 in base 4” isn’t a valid number. The official answer is still a=4,b=5a = 4 , b = 5, because it is the only option that makes both sides equal. In the exam, trust the equation.

Asked in
2026 T2 Quiz 1Q134 marks

Question: If (344)ₐ = (243)ᵦ, what are a and b? Options: a=3,b=4/a=4,b=5/a=5,b=6/a=6,b=7/a=7,b=8a = 3 , b = 4 / a = 4 , b = 5 / a = 5 , b = 6 / a = 6 , b = 7 / a = 7 , b = 8

Answer: a=5,b=6a = 5 , b = 6

Show solution
  1. Left: (344)ₐ = 3×a2+4×a+43 \times a^{2} + 4 \times a + 4
  2. Right: (243)ᵦ = 2×b2+4×b+32 \times b^{2} + 4 \times b + 3
  3. Test a=5,b=6a = 5 , b = 6: left = 3×25 + 4×5 + 4 = 75 + 20 + 4 = 99; right = 2×36 + 4×6 + 3 = 72 + 24 + 3 = 99 ✔
  4. Check one wrong option, a=4,b=5:48+16+4=68a = 4 , b = 5 : 4 8 + 1 6 + 4 = 6 8 vs 50 + 20 + 3 = 73 ✗

Trap: don’t try to solve this with algebra. Testing 5 options takes about 1 minute.


Type 4: An equation written in an unknown base

Method

Learn the method

For x2−Sx+P=0x^{2} - S x + P = 0 with roots p and q:

  • p + q = S (the roots add up to the middle number)
  • p × q = P (the roots multiply to the last number)

Level 1: x2−5x+6=0x^{2} - 5 x + 6 = 0 has roots 2 and 3. Check: 2 + 3 = 5 ✔, 2 × 3 = 6 ✔.

Past paper question

Asked in
2025 T3 End-term (AN)Q93 marks

Question: The solutions of the quadratic equation x2−x^{2} - 11ᵦx + 21ᵦ = 0 are x=3x = 3 and x=5x = 5. What is the base b?

Answer: 7

Show solution
  1. “11” and “21” are written in base b. Expand them: 11ᵦ = 1×b1+1×b0=1 \times b^{1} + 1 \times b^{0} = b+1b + 1 21ᵦ = 2×b1+1×b0=2 \times b^{1} + 1 \times b^{0} = 2b+12 b + 1
  2. Roots add up to the middle number: 3+5=b+1→8=b+1→3 + 5 = b + 1 \to 8 = b + 1 \to b=7b = 7
  3. Check with the product: 3 × 5 = 15 and 2b+1=2×7+1=152 b + 1 = 2 \times 7 + 1 = 1 5 ✔
Asked in
2025 T3 End-term (FN)Q73 marks

Question: The solutions of x2−x^{2} - 11ᵦx + 22ᵦ = 0 are x=3x = 3 and x=6x = 6. What is the base b?

Answer: 8

Show solution
  1. 11ᵦ = 1×b+1=1 \times b + 1 = b+1b + 1; 22ᵦ = 2×b+2=2 \times b + 2 = 2b+22 b + 2
  2. Roots add up to the middle number: 3+6=b+1→9=b+1→3 + 6 = b + 1 \to 9 = b + 1 \to b=8b = 8
  3. Check with the product: 3 × 6 = 18 and 2×8 + 2 = 18 ✔

Type 5: Minimum bits

Method

Learn the method

n bits can make 2ⁿ different patterns. Learn the powers of 2:

n 1 2 3 4 5 6 7 8 9 10
2ⁿ 2 4 8 16 32 64 128 256 512 1024

There are two different questions:

Question Rule Example
Bits to write the number N Find n with 2n−1≤N2^{n-1} \le N < 2ⁿ 11 = 1011 → 4 bits (8 ≤ 11 < 16)
Bits (or flip-flops) for N different states Smallest n with 2n≥N2^{n} \ge N 11 states → 4 bits (16 ≥ 11)

Past paper questions

Asked in
2025 T3 Quiz 1Q1723 marks

Question: What is the minimum number of bits required to represent the number (128)₁₀ in binary?

Answer: 8

Show solution
  1. Find the powers of 2 around 128: 2⁷ = 128 and 2⁸ = 256.
  2. 2⁷ ≤ 128 < 2⁸, so n=n = 8.
  3. Check by writing it: 128 = 1×2⁷ = 10000000. Count the digits: 8 ✔

Trap: 7 bits only reach 2⁷ − 1 = 127. 128 needs one more bit.

Asked in
2026 T2 Quiz 1Q63 marks

Question: What is the minimum number of bits required to represent (515)₁₀ in binary?

Answer: 10

Show solution
  1. 2⁹ = 512 and 2¹⁰ = 1024.
  2. 512 ≤ 515 < 1024, so n=n = 10.
  3. Check: 515 = 512 + 2 + 1 = 1×2⁹ + 1×2¹ + 1×2⁰ = 1000000011 → 10 digits ✔
Asked in
2025 T2 End-term (AN)Q1511 mark

Question: In a system with 64 unique states, 4 flip-flops are sufficient to represent all the states. True or False?

Answer: FALSE

Show solution
  1. Each flip-flop stores 1 bit, so n flip-flops give 2ⁿ states.
  2. 4 flip-flops → 2⁴ = 16 states.
  3. 16 < 64, so 4 is not enough. (You need 6, because 2⁶ = 64.)
Asked in
2025 T2 End-term (FN)Q1191 mark

Question: In a system with 64 unique states, 6 flip-flops are sufficient to represent all the states. True or False?

Answer: TRUE

Show solution
  1. 6 flip-flops → 2⁶ = 64 states. 64 ≥ 64 ✔, so it is enough.

Asked in
2026 T2 End-term (FN)Q41 mark

Question: In a system with 65 unique states, 6 flip-flops are sufficient to represent all the states. True or False?

Answer: FALSE

Show solution
  1. 6 flip-flops → 2⁶ = 64 states. 64 < 65, so it is one short. You need 7 (2⁷ = 128).


Type 6: Moore’s Law true/false

Method

Learn the method

Moore’s Law: the number of transistors on a chip doubles about every 2 years.

  1. How many times bigger? Y ÷ X
  2. Write it as 2ⁿ → that’s n doublings
  3. Time = n×2n \times 2 years

Level 1: 1 million → 4 million. 4 ÷ 1 = 4 = 2² → 2 doublings → 2 × 2 = 4 years.

Past paper questions

Asked in
2025 T2 End-term (AN)Q1531 mark

Question: According to Moore’s law, if a computer system has 2 million transistors today, it will have approximately 32 million transistors in 7 years. True or False?

Answer: FALSE

Show solution
  1. 32 ÷ 2 = 16
  2. 16 = 2 × 2 × 2 × 2 = 2⁴ → 4 doublings
  3. 4 × 2 years = 8 years, not 7 → FALSE
Asked in
2025 T2 End-term (FN)Q1211 mark

Question: 2 million transistors today → approximately 32 million in 8 years. True or False?

Answer: TRUE

Show solution
  1. same steps as above: 16× = 2⁴ = 4 doublings = 8 years ✔

Asked in
2026 T2 End-term (FN)Q61 mark

Question: 2 million transistors today → approximately 32 million in 4 years. True or False?

Answer: FALSE

Show solution
  1. it needs 8 years. In 4 years you get only 2 doublings: 2 → 4 → 8 million, not 32.

Asked in
2025 T3 End-term (AN and FN)Q61 mark

Question: According to Moore’s Law, the size of transistors on an integrated circuit doubles approximately every two years. True or False?

Answer: FALSE

Show solution
  1. Moore’s Law is about the number of transistors doubling. Transistors get smaller, which is why more of them fit. One wrong word (“size”) makes the sentence false.


Practice set (new questions, same types)

  1. Convert (1101)₂ to decimal. Show every term.
1×2³ + 1×2² + 0×2¹ + 1×2⁰ = 8 + 4 + 0 + 1 = 13.
  1. Convert 25 to binary using repeated division.
25÷2 = 12 r1; 12÷2 = 6 r0; 6÷2 = 3 r0; 3÷2 = 1 r1; 1÷2 = 0 r1. Bottom → top: 11001. Check: 16 + 8 + 1 = 25.
  1. (321)₅ in hex?
3×25 + 2×5 + 1 = 75 + 10 + 1 = 86. 86 ÷ 16 = 5 r6 → 0x56.
  1. (25)ₐ = (17)ᵦ. Options: a=6,b=10/a=7,b=9/a=8,b=9a = 6 , b = 1 0 / a = 7 , b = 9 / a = 8 , b = 9.
2a+5=b+72 a + 5 = b + 7. a=6,b=10:17=17a = 6 , b = 1 0 : 1 7 = 1 7 ✔. Answer: a=6,b=10a = 6 , b = 1 0.
  1. Minimum bits to write 300?
256 ≤ 300 < 512 → 9 bits.
  1. 100 states, 6 flip-flops. Enough?
No. 2⁶ = 64 < 100. You need 7 (128).
  1. 3 million → 48 million in 8 years (Moore). True or false?
48 ÷ 3 = 16 = 2⁴ → 4 doublings → 8 years. True.

In one line: Expand every number as digit × base^position, compare powers of 2 for bit questions, and for Moore’s Law count doublings × 2 years. Exam words: place value, base conversion, repeated division, hexadecimal, unknown base, sum and product of roots, minimum bits, flip-flops for states, Moore’s Law.

YOUR STUDY PROGRESS

Finished this section? Save your progress.

Back to top ↑