COMP-273 - Introduction to Computer Systems Practice Questions for Final Examination
Hello, dear friend, you can consult us at any time if you have any questions, add WeChat: daixieit
Faculty of science
COMP-273 - Introduction to Computer systems (Fall 2016)
Practice Questions for Final Examination
Practice Questions
1. As covered in this course, what are the classic components found in any computer?
(a) keyboard, monitor, mouse, processor, and disk
(b) control,datapath, memory, input, and output
(c) compiler, assembler, linker, and loader
(d) processor, memory, cache, interrupts, and devices
(e) registers, cache, memory, and disk
2. How many rows are needed to write down the full truth table (without using don,t care) for a multi- plexor with one output bit and n selection bits?
(a) 2n+2π
(b) 2n
(c) 22π
(d) 2n - 1
3. How many different boolean functions are there with n inputs?
(a) 2n-1
(b) 2n+1
(c) 2n2
(d) 22π
(e) 2n - 1
4. when can a boolean function be implemented with NOR gates?
(a) never
(b) only when the function is symmetric
(c) only when the function has two inputs
(d) only when the function it true for at least one input
(e) always
5. what best describes a typical clocked sequential circuit? OMIT
(a) analog
(b) continuous
(c) asynchronous
(d) synchronous
6. what is a lip lop?
(a) an analog device capable of providing synchronization
(b) a cell capable of storing one bit of information
(c) a set of registers
(d) a clock that cycles high and low
7. which of the following instructions computes the negative of the integer stored in $大0?
(a) xor $t0, $0, $t0
(b) sub $t0, $0, $t0
(c) nor $t0, $t0, $t0
(d) nor $t0, $t0, $0
(e) sub $t0, $t0, $0
8. If procedure foo calls procedure bar, which of the following is true? BAD FIX ME!!
(a) foo must always store $ra to the stack
(b) bar must always store $ra to the stack
(c) all of the above
(d) none of the above
9. convert +addi $a1, $a1, 一1 to the 32 bit word represending the instruction. use the green reference sheet. check your answer in MARS.
10. which of the following is a pseudo-instruction?
(a) addi $t0, $t1, 10000
(b) beq $s0, $0, Exit
(c) sub $t0, $t1, $0
(d) ori $t0, $t1, 0xffff
(e) subi $t0, $t1, 1
11. Given a 32 KB cache (i.e., 215 bytes) with 8 word blocks, and assuming memory addresses are speciied by 32-bits, how big is the index for a fully associative cache?
(a) index has 0 bits
(b) index has 7 bits
(c) index has 12 bits
(d) index has 15 bits
(e) index has 17 bits
12. which of the following are advantages of virtual memory?
(a) different regions of memory can be set to be read only or execute only
(b) portions of a program can be placed anywhere in physical memory without relocation (c) only the working set of a program needs to be retained in memory
(d) shared memory can be provided by mapping the same physical page to multiple users (e) all of the above
Use the combined datapath and fetch unit diagram below to answer the questions in this section. see also the MIPs information sheet at the end of the exam.
13. Give an example of an instruction (just the mnemonic) that has EXtop=X and Regwr=1.
14. which set of control signals are necessary as part of the speciication the instruction addi?
15. situations exist in pipelined execution when it would seem that a stall is necessary before the next instruction can be executed as planned. we saw several types of these situations in class，and a variety of clever ways to resolve them. what types did we see?
(a) protection，sharing，and translation
(b) structural，control，and data
(c) conlict，compulsory，and capacity
(d) misses，faults，and exceptions
(e) virtual，physical，and supernatural
Answers: B A D E D B B A (check your answer in MARS) E A E ADD 0111ADD0000 B
2023-08-05