1. What is the corresponding binary digit of the word ‘BE’ in base 2?

‘BE’ in base 2 wouldn't be a single binary digit, but a sequence of them! Computers use binary,
which means they use digits 0 and 1 to represent information. Text characters are typically
represented using a system called ASCII (American Standard Code for Information Interchange).
Each character in ASCII is assigned a unique number, and that number can be converted to binary.

So, to get the binary representation of ‘BE’, we need to convert each letter to its ASCII equivalent
and then convert those numbers to binary.

Here's the breakdown:

B in ASCII is 66

E in ASCII is 69

Converting these to binary:

66 in binary is 01000010

69 in binary is 01000101

Putting it together, the binary representation of ‘BE’ is 0100001001000101.

2. Perform the operation NOT ((1 0R 0) AND 0).

(1 OR 0):

OR operation (often denoted by |) signifies "at least one operand being true". In this case, 1 OR 0 is
1 (since 1 is true).

(1 AND 0):

AND operation (often denoted by &) signifies "both operands being true". Since 0 is false, 1 AND
0 becomes 0 (both operands need to be true).

NOT (0):

NOT operation (often denoted by !) flips the truth value. NOT applied to 0 (which is false)
becomes 1 (true).

Therefore, the entire expression NOT ((1 OR 0) AND 0) evaluates to 1.

3. Convert 11000101 to hexadecimal.

To convert binary to hexadecimal, we can group the binary digits into groups of four,
starting from the rightmost digit. Then, convert each group of four binary digits to its
corresponding hexadecimal digit using a conversion table.

Binary Group Hexadecimal Digit

1100 C
0101 5

Therefore, 11000101 in hexadecimal is C5.

In conclusion, the hexadecimal equivalent of 11000101 is C5.

4. ADD the following binary numbers 1000 and 1001.

Adding the binary numbers 1000 and 1001 gives us 10001.

To add binary numbers:

If the sum of two digits is 0, the result digit is 0 and the carry is 0.

If the sum of two digits is 1, the result digit is 1 and the carry is 0.

If the sum of two digits is 2, the result digit is 0 and the carry is 1.

If the sum of two digits is 3, the result digit is 1 and the carry is 1.

In this case:

Binary Digit 1000 + 1001 (Carry) Result

1 0 + 1 0 1
2 0 + 0 0 0
3 0 + 0 1 1
4 (MSB) 1 + 1 0 0 (Carry)
Therefore, 1000 + 1001 = 10001

5. Compute 72 – 1C

The expression 72 - 1C is a mix of decimal and non-standard notation.

72 is in decimal: It represents the number seventy-two in the base-10 number system.

1C is not standard: The letter ‘C’ isn't typically used in standard mathematical notation for
representing numbers.

Here are some possibilities depending on the intended meaning of 1C:

Hexadecimal: If 1C represents a hexadecimal number (base-16), it would be equivalent to 1 x 16^1

+ 12 (decimal) = 28. However, subtracting a hexadecimal number from a decimal number directly
isn't possible.

Custom notation: It's possible 1C represents a specific value within a custom notation system
defined for a particular context. Without knowing that context, we can't interpret its value.

To perform the calculation, we need a clear representation of 1C.

If 1C is meant to be a decimal number (unlikely due to the ‘C’), we can simply subtract 1 from 72,
resulting in 71.

If 1C has a specific meaning in a defined system (like hexadecimal), provide the details of that
system so the conversion and subtraction can be performed correctly.

6. Convert D16 to binary.

The notation ‘ D16’ isn't a standard way to represent a hexadecimal number. In hexadecimal,
digits range from 0 to 9 and then A to F to represent values 10 to 15. ‘D’ itself isn't a valid
hexadecimal digit.

7. How many words are there in 72 bits?

The concept of ‘words’ in computing refers to a fixed group of bits processed by the system's
central processing unit (CPU) at once. The size of a word varies depending on the computer
architecture, typically ranging from 8 bits (1 byte) to 64 bits.

For instance, if the system has 16-bit words (meaning each word can hold 16 bits), then to store 72
bits, we would need:

Number of words = 72 bits / 16 bits/word = 4.5 words

Because we can't have half words, we would round up to 5 words in this scenario.

8. What is A OR B, if B = 1 and A = 0?

In this case, A OR B (represented by the symbol "∨") will be 1.

Here's why:

OR (∨) is a logical operator in Boolean algebra. It represents a situation where at least one of the
operands (A or B) needs to be true (1) for the entire expression to be true (1).

Since B is already given as 1 (true), it doesn't matter what value A has (0 in this case). As long as
one operand is true, the entire OR operation is true. Therefore, A OR B will be 1.

9. 8 byte is equivalent to __________ nibbles.

We know 1 byte = 8 bits.

Since a nibble is half a byte, it contains 8 bits / 2 = 4 bits.

Therefore, to find the number of nibbles in 8 bytes, we then multiply the number of bytes by the
conversion factor (nibbles per byte);

8 bytes X (4 nibbles/byte) = 16 nibbles.

10. Convert F9 to binary.

Converting between hexadecimal and binary involves representing numbers using different base
systems. Hexadecimal (base-16) uses digits 0-9 and A-F, while binary (base-2) uses only 0 and 1.

Therefore:

F in hexadecimal: This translates to 15 in decimal (F = 15).

15 in decimal to binary: We can keep dividing 15 by 2 and noting the remainders (0 for even
division, 1 for odd). Working backwards from the remainders gives us the binary representation:
15 (decimal) = 1111 (binary).

Therefore, combining the binary equivalents of each digit (1111 for F and 0001 for 9), F9 in
hexadecimal translates to 11111001 in binary.
References

https://www.rapidtables.com/convert/number/Hex_Convert.html

https://www.geeksforgeeks.org/problems/decimal-to-binary-1587115620/1

https://www.binaryhexconverter.com/ascii-text-to-binary-converter

https://simple.wikipedia.org/wiki/ASCII

https://en.wikipedia.org/wiki/Boolean_algebra

https://simple.wikipedia.org/wiki/Truth_table

https://www.coursera.org/learn/logic-introduction (This is a free course on Coursera)

https://brilliant.org/wiki/combinations/ (Combinations in Combinatorics)

https://www.khanacademy.org/math/statistics-probability/counting-permutations-and-combinations
(Combinations on Khan Academy)