TED-Ed: Can you solve the risky disk riddle? | James Tanton

The video tutorial explains a problem involving malware corrupting one of four disks in a mainframe. The solution involves using binary code to identify the corrupted disk by flipping a switch. The tutorial explores different scenarios and introduces the concept of parity to solve the problem. The strategy works for any mainframe with disks that are a power of two.

What is the main task of the antivirus agent in the mainframe?

• To identify and destroy the corrupted disk

• To reset the mainframe

• To install new software

• To turn off all the lights

How are the four disks represented in the binary system?

• As 4-bit binary numbers

• As 2-bit binary numbers

• As 1-bit binary numbers

• As 3-bit binary numbers

What mathematical operation is initially considered to identify the corrupted disk?

• Subtraction of binary numbers

• Addition of binary numbers

• Multiplication of binary numbers

• Division of binary numbers

What issue arises when using binary addition to identify the corrupted disk?

• It sometimes results in incorrect sums

• It requires more than one switch flip

• It always results in a 3-digit number

• It cannot handle more than two disks

How is the problem of incorrect sums resolved in the hypothetical scenario?

• By flipping all switches

• By ignoring the lights

• By treating twos as zeros

• By using a different numbering system

What does parity help determine in the context of the mainframe problem?

• The total number of disks

• The color of the lights

• Whether a number is even or odd

• The speed of the mainframe

Why is the solution scalable to larger systems?

• It uses a universal numbering system

• It is based on a simple algorithm

• It can handle any number of disks that are a power of two

• It requires no additional resources