1. T/F – The ALU does not take any action if the output of an operation leads to excess bits.
2. T/F – An eight bit word can represent up to 256 numbers.
3. T/F – One important difference between sign-magnitude and two complement representations is the type of zeros that can be represented.
4. T/F – A negative integer is obtained by adding a 2n-1 term to the summation output.
5. T/F – A negative number is extended into larger bit size by appending zeros to the left of the most significant bit.
6. T/F – In sign-magnitude form, negation involves the changing of only the most significant bit.
7. T/F – To perform subtraction, the twos complement representation of both the numbers is used.
8. T/F – Like in addition, multiplication can also be done using twos complement approach.
9. T/F – Arithmetic shifting is done to store the product of sums while performing arithmetic addition.
10. T/F – Dividing by negative numbers cannot be performed using any representations available.
11. T/F – Small and large fractions can also be represented using twos complement floating point representation.
12. T/F – The scientific representation for floating point numbers uses the biased representation.
13. T/F – The bias remains the same for 32 and 64 bit floating point numbers.
14. T/F – Rounding and guard bits affect the accuracy of floating point calculations.
15. T/F – Zero check is performed to see whether the given numbers are positive or negative.
16. T/F – Arithmetic exponent overflow is one of the drawbacks of floating point normalization.
1. T/F - One of the most important functions of the OS is scheduling processes/tasks.
2. T/F - In terms of total control, the OS has the most control of the entire system operation.
3. T/F – Multi and Uni-programming systems are types of Simple batch systems.
4. T/F – Memory protection is done to prevent data from over-writing specific regions of the memory.
5. T/F – Multi-tasking involves the process of switching between different programs while holding them in an expanded memory.
6. T/F – The main objective of time-sharing systems is to maximize processor usage.
7. T/F – Different process requests from an I/O device is stored in a central queue.
8. T/F – Paging helps in reducing the number of holes in the memory.
9. T/F – Demand paging brings all the pages required for the program into the main memory.
10. T/F – Virtual Memory uses demand paging to make appear a bigger memory than that is present in hardware.
11. T/F – The TLB to Page Table relationship is the same as a Cache to Main memory.
12. T/F – The end user has complete access to the Operating System.
13. T/F – The interrupt handler is a part of the computer hardware.
14. T/F – The programmer can have access to privileged instructions of OS.
15. T/F – Early systems did not have interrupt servicing capability.
16. T/F – The OS also keeps track of processor and clock time used.
1. T/F – Operand data can be logical data or addresses.
2. T/F – Stacks are visible elements of the system that store program information.
3. T/F – Memory instructions are used to move data to and from memory locations.
4. T/F – Stacks are memory elements that follow a first-in first-out data policy.
5. T/F – A less complex instruction representation also calls for a simpler processor.
6. T/F – The packed decimal representation is smaller in storage size compared to the binary coded decimal format.
7. T/F – All Boolean operations are performed in the ALU.
8. T/F – Arithmetic shifts can change the sign of the input number.
9. T/F – Conversion operations involve changing the representation of the opcode.
10. T/F – Exceptions can trigger the execution of control transfer instructions.
11. T/F – An exception is unconditional branch instruction.
12. T/F – Storage space is an important concern during programming.
13. T/F – Parallel addition and subtraction operations of ARM are similar to the SIMD operations of x86 architecture.
14. T/F – Signed comparisons cannot be performed in the x86 or ARM architectures.
15. T/F – Multiple operations can take in half and full words as inputs
16. T/F – There can be several open calls to a single procedure.
1. T/F – Operand data can be represented in any order in an instruction.
2. T/F – Addressing modes define whether operand values are reside in registers or in memory.
3. T/F – The type of addressing mode in the current instruction is found during execution stage.
4. T/F – Indexing is a type of displacement addressing.
5. T/F – Incrementing or decrementing index registers take one extra clock cycle.
6. T/F – In certain addressing modes, there are special bits allocated to indicate floating point/integer registers.
7. T/F – In the x86 architecture, all addressing modes that involve memory access need to specify the base address and displacement value.
8. T/F – Branch instruction also follow register indirect type of addressing.
9. T/F – Different branch types follow different addressing modes.
10. T/F – Instruction lengths can be of any arbitrary size.
11. T/F – The number of inputs to the ALU unit plays a vital role in deciding the instruction format.
12. T/F – The PDP-11 was primarily used for a 8bit machine.
13. T/F – VAX type instructions can include up to 6 operands.
14. T/F – The ARM Thumb instruction format encodes the 32-bit instruction into 16-bits.
15. T/F – Assembly language programming uses hexadecimal representation.
16. T/F – I/O and system commands can be run using assembly language.
1. T/F – Stages in the pipeline occur in sequence for every instruction cycle.
2. T/F – Problems arising due to branches and jumps are solved by pipelining the instruction cycle.
3. T/F – Control paths define units that receive direct cycle-by-cycle signals from the control unit.
4. T/F – The return address register stores the address of the most recently accessed instruction.
5. T/F – Registers MAR and MBR can be accessed by the user.
6. T/F – The Motorola MC68000 had all registers as general purpose.
7. T/F – The execution stage takes equal number of cycles as the fetch stage in a 2-stage pipeline.
8. T/F – Stage register latching delay is higher than the stage delay.
9. T/F – Any two instructions can request the use of the same arithmetic unit.
10. T/F – A WAW hazard occurs only if two consecutive instructions want to write to the same memory location.
11. T/F – More than one pipeline can be implemented in a system.
12. T/F – Branch history is not considered for predict not taken approach.
13. T/F – Intel 8086 performs two stages of decoding.
14. T/F – Software interrupts are given in the user mode.
15. T/F – Condition codes allow multi-way branches.
16. T/F – After an interrupt is handled in an ARM processor, the contents of the link register is copied over to the program counter.
1. T/F – RISC architecture has a very simple instruction set.
2. T/F – If assignment operations form a large part of the instruction set, then the architecture gives high importance to data transmission.
3. T/F – Interrupts & procedure calls have max processing time in any architecture.
4. T/F – The time consumed by a procedure call with fewer variables is more compared to a one that has a lot of variables.
5. T/F – More locality of operands and assignment operations in HLLs suggest a requirement of more memory space and fewer registers.
6. T/F – The software approach to implement the use of more register access requires complex program analysis.
7. T/F – Not more than N-1 calls can be made using an N-window register file.
8. T/F – Overwrite of frequently used variables is a concern in the window register file.
9. T/F – Symbolic registers are user accessible registers.
10. T/F – Only a limited number of symbolic registers can be assigned to a program.
11. T/F – The compiler are very simple in a CISC architecture.
12. T/F – CISC's reduction in the number of instructions for a program, shows a drastic improvement in execution time as compared to RISC.
13. T/F – CISC does not combine load/store with an arithmetic operation.
14. T/F – Delayed branches help in increasing the efficiency of the pipeline.
15. T/F – Loop unrolling increases loop overhead.
16. T/F – R4000 uses condition codes for all overflows, exceptions and interrupts.
1. T/F – The control unit supervises the process of an micro-code moving through the pipeline.
2. T/F – The fetch, decode, execute etc form the micro-code of a program.
3. T/F – Micro-operation that occur out-of-order can be grouped.
4. T/F – The PC is loaded with address in the IR register for the interrupt-processing step.
5. T/F – Only indirect addressing mode instructions can trigger an extra cycle between fetch and execution cycles.
6. T/F – Transfer of data between registers is also a type of micro-operation.
7. T/F – Control also involves execution.
8. T/F – The ALU and the data path are controlled by separate control units.
9. T/F – The system bus also has control inputs to monitor the bus.
10. T/F – The number of cycles for all instructions is fixed for a given architecture.
11. T/F – Control signals are Boolean expressions of control inputs.
12. T/F – Control signals to registers are an example of signals within the processor.
13. T/F – The arithmetic and logic operation can cause exceptions that transfer control to the control unit.
14. T/F – The more complex the architecture is, the more complex is the control unit.
15. T/F – Execution under a condition can be executed in one cycle.
16. T/F – Microprogramming is another version of implementing control signals.
提升卡
变色卡
千斤顶
1/10 
京公网安备 11010802033920号
Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved
