58 lines
2.1 KiB
Markdown
58 lines
2.1 KiB
Markdown
|
## How many bits are needed to represent 1024 different bit patterns?
|
||
|
|
10.0
|
||
|
|
|
||
|
|
## How many errors in a single code pattern could be corrected when using an error-correcting code in which each code pattern is a Hamming distance of at least seven from any other code pattern?
|
||
|
|
3, Three
|
||
|
|
|
||
|
|
## A computer's main memory consists of numerous memory cells, each of which contains **(eight, 8)** Each memory cell is identified by a numeric value called the cell's**(memory address, address)**.
|
||
|
|
|
||
|
|
|
||
|
|
## If the patterns 101.11 and 1.011 represent values in binary notation, what is the binary representation of their sum?
|
||
|
|
###111.001
|
||
|
|
|
||
|
|
## In which of the following addition problems (using two's complement notation) does an overflow error occur?
|
||
|
|
0100 + 0100
|
||
|
|
|
||
|
|
## Represent the bit pattern 1011010010011111 in hexadecimal notation
|
||
|
|
B49F
|
||
|
|
|
||
|
|
## The following is an error-correcting code in which any two patterns differ by a Hamming distance of at least three. Decode each of the following patterns:
|
||
|
|
| Symbol | Representation |
|
||
|
|
|--------|----------------|
|
||
|
|
| A | 000000 |
|
||
|
|
| B | 001111 |
|
||
|
|
| C | 010011 |
|
||
|
|
| D | 011100 |
|
||
|
|
| E | 100110 |
|
||
|
|
| F | 101001 |
|
||
|
|
| G | 110101 |
|
||
|
|
| H | 111010 |
|
||
|
|
|
||
|
|
010011 - C
|
||
|
|
101010 - H
|
||
|
|
011000 - D
|
||
|
|
101101 - F
|
||
|
|
|
||
|
|
## What is the smallest negative integer that can be represented in a two's complement system in which each value is represented by eight bits?
|
||
|
|
10000000, -128 (either is correct)
|
||
|
|
|
||
|
|
## Which of the following data storage systems provides the most efficient random access to individual data items?
|
||
|
|
Main memory
|
||
|
|
|
||
|
|
## Which of the following is the binary representation of 4 5/8?
|
||
|
|
100.101
|
||
|
|
|
||
|
|
## Which of the following representations in two's complement notation represents the largest value?
|
||
|
|
00000010
|
||
|
|
|
||
|
|
## A7DF is the hexadecimal representation for what bit pattern? Put a single space between each group of 4 bits, for ease of reading
|
||
|
|
1010 0111 1101 1111
|
||
|
|
|
||
|
|
## Which of the following best describes the NAND operation?
|
||
|
|
An AND followed by a NOT
|
||
|
|
|
||
|
|
## What is the result of the following subtraction problem (using two's compliment notation)? 00001111 - 10101010
|
||
|
|
01100101
|
||
|
|
|
||
|
|
|