1. A byte is a standardized unit of measure that is always 8-bits. 2. Bit patter
ID: 3614839 • Letter: 1
Question
1. A byte is a standardized unit of measure that is always 8-bits.
2. Bit patterns have no intrinsic meaning.
3. The meaning of bit patterns is determined by the way the HW and SW treat them.
4. The <a character set> has <some number> characters.
5. <A character set> is a <a number>-byte encoding scheme.
6. <A character set> and <A character set> are unrelated.
7. Overflow is usually ignored in most computer systems.
8. <integer encoding scheme> has one more negative than positive value.
9. <integer encoding scheme> has two ways to represent zero.
10. A normalized floating point value has no leading zeros on its exponent.
11. The exponent in floating point is stored as a biased value.
12. The architecture of a computer determines its machine language.
13. Fixed-length instruction architectures do not use memory as efficiently as variable-length architectures.
Short Answer
14. How is using 0 / 1 or true / false in specifying digital an abstraction?
15. A register in a computer has a <specified number> of bits. How many unique combinations can be stored in the register?
16. How would you write <some binary or hexadecimal digits> so that it is clear that they represent a <binary or hexadecimal> value?
17. Convert a specified value in <binary, hexadecimal, or decimal> value to equivalent value in <binary, hexadecimal, or decimal>.
18. Count in <binary, or hexadecimal > from <specified value> to <specified value>.
19. Given an ASCII table, give the bit pattern for <specified character>.
20. Suppose a computer design has <number>-bit integers. What happens when overflow occurs?
21. The value binary number <specified in hexadecimal> is stored at address <number> in a system using <big or little> endean design. What value is stored in byte with address <number>?
22. Given <negative decimal value> and using <specified number>-bit <sign-magnitude, ones complement, or twos complement> for signed integers, what bit pattern is used to encode the number?
23. What scheme is usually used today for encoding signed integers?
24. Given a twos complement value in < number> bits, how will it be represented when copied to a storage location with < number larger than the first> bits?
25. How is zero represent in floating point?
2. A <one of the categories in the range of processors> is one that can do any of several operations, according to how it is invoked.
3. A <one of the categories in the range of processors> is one that can do any of several operations, according to how it is invoked.
4. Generally, to reduce complexity, a <processor or computational engine> is viewed as a composite of < computational engines or processors >.
5. In the structure of a conventional processor, the computational engine is generally known as the arithmetic-logic unit.
6. In general,
7. The clock rate of a CPU is the same as the instruction rate.
8. Generally, a floating-point add instruction takes more clock cycles then a corresponding integer add instruction.
9. Generally, a multiply instruction takes more clock cycles than an add instruction.
Short Answer
10. What is the
11. In the structure of a conventional processor, what is the purpose of the data path?
12. What does it mean that a coprocessor is
13. What is the function of a clock for a CPU?
14. Generally, what is the term for storage locations in a processor?
15. For most general purpose processors, how does the operating system handle the situation when the processor is idle?
16. Where is the bootstrap program usually located?
True / False
1. There is no connection between programmer convenience and the amount of heat a processor chip produces.
2. The opcode of a ML instruction may vary according to the operand(s) of the instruction.
3. Variable length instructions generally use memory more efficiently than fixed-length instruction sets.
4. Fixed length instruction sets are generally slower to execute than variable-length instruction sets.
5. Registers are optimized for large storage capacity.
6. General purpose registers can be read and written by ML programs.
7. RISC instructions generally take fewer clock cycles than CISC instructions.
8. CICS systems usually have larger instruction sets than RISC systems.
9. CICS systems are usually more convenient for programmers than RISC systems.
10. Generally, variable-length systems use memory more efficiently than fixed-length systems.
11. Generally, variable-length systems more efficiently decode instructions than fixed-length systems.
12. An instruction’s opcode generally indicates the number and type of its operands.
13. Registers are generally optimized for capacity instead of speed.
14. In a pipeline architecture with 6 stages, an instruction will usually take just one clock cycle to go through the pipeline, and 6 instructions will complete each clock cycle.
15. Branch instructions are one technique for preventing instruction pipeline stalls.
16. Forwarding is one of the major causes of stalls in pipeline architectures.
17. The PC is always incremented by the same amount in fixed-length instruction set architectures.
18. Absolute branching makes creation of relocatable programs more difficult.
19. Generally, more orthogonal instruction sets are considered less elegant.
20. Most architectures do conditional branching based on value of the condition code that was set in an earlier instruction.
Short Answer
21. Why are fixed-length instruction sets generally faster to decode and execute?
22. How are general-purpose reg
Explanation / Answer
x.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.