35 minutes. Instant-marked. Unlimited attempts. Each answer is marked as soon as you choose it, with an explanation. Nothing is saved in this course.
P1. A 4,000-byte message in 1,000-byte packets needs:
4,000 ÷ 1,000.
P2. A 4,300-byte message in 1,000-byte packets needs:
Round up.
P3. The number of 3-digit passwords is:
10 × 10 × 10.
P4. Encrypt HI with a Caesar shift of 2:
H moves to J and I to K.
P5. Integrity means:
It is about correctness.
P6. The halting problem has:
Turing showed this.
P7. The second-highest (ties twice) of 8, 8, 3 is:
The tied top score counts twice.
P8. Checking every subset of 30 items is hard in practice because:
It is exponential.