Quick computer science questions. Answer ALL 21-30 for positive rate.

21. Tor F? The BCD encoding scheme does not use any form of binary representation. 22. For a given number of bits, which binary representation represents the largest range of integers? A: BCD B: 2's complement C: l's complement D: signed magnitude 23. What is the minimum number of bits of address required to address 16M bytes of byte-addressable main memory? A: 8 B: 16 C: 20 D: 24 E: 32 24. If the 32-bit, 4-byte word C7F0ABFF16 is stored on a big endian architecture, which hexadecimal byte is stored in the byte-addressable location with the smallest memory address? A: C7 B: FO C: AB D: FF E: none of these 25. If the 32-bit, 4-byte word C7FOABFF16 is stored on a little endian architecture, which hexadecimal byte is stored in the byte-addressable location with the largest memory address? A: C7 B: F0 C: AB D: FF E: none of these 26. What is the Hamming distance between 011101012 and 111001112? A: 0 B: 1 C: 2 D: 3 E: 4 27. T or F? The even parity bit for the 8-bit byte 1 1 1 00 1 1 1 2 is 1 . 28. How many check bits does 4-bit word require? A: 1 B: 2 C: 3 D: 4 E: none of these 29. T or F? The fact that the machine instructions generated by a compiler for the statements that define a single program module are stored in contiguous locations is one of the bases of the locality principle. 30. T or F? Caching would still make sense even if the execution of a computer program did not exhibit the locality principle