Study guide of Final Exam CS 147, Spring 2001Study guide of Final Exam CS 147, Spring 20011. Define the terms: Stack, control bus, ALU, Buffer, CPU, Computer instructions, decoder, multiplexer.2. Give the following boolean function F=A*BC*+A*BC+AB*Ca) Develop an equivalent expression using only NAND operations, and draw the logic diagram.b) Develop an equivalent expression using only NOR operations, and draw the logic diagram.3. For the logic function of F(A, B, C, D)=(0, 1, 3, 4, 5, 7, 8, 10, 12, 14, 15)a) Show the truth table.b) Write the SOP form.c) Write the POS form.d) Simplify by K-map.4. Is there a Boolean function that cannot be realized using only NAD of OR gates? If so, give a simple example; If not, explain.5. Construct a NOR function by only NAND gates.6. Write the Boolean function for a 4-input NAND gates.7. Describe the function and the operation of a bus in a microcomputer.8. What are the advantages and disadvantages of a single-bus structure?9. What kind of devices can be uses as storage units in modern microcomputers?10. How is the main memory organized?11. Describe the operation of the CPU when writing a word of data into the main memory.12. What are the functions and the structure of the CPU?13. What is the purpose of the program counter?14. Give the Karnaugh map of the following functions:a) f=x*y*z*+xy*z+xyz+x*yz*+x*yzb) f=a*b*cd*+bd+acd*+a+d15. What are the cache memory? Define the term hit ratio.16. Determine the inputs I0, I1, I2, I3 of an 4-input multiplexer to implement f(x, y, z)=x*yz+xy*z*+xz17. Determine the inputs I0,...,I7 of an 8-input multiplexer to implement f(w, x, y, z)=(2, 3, 5, 6, 8, 10, 11, 12, 13, 14)18. Design a ROM to convert binary inputs to gray code output (4-bit)19. People have any one of four basic blood types -- A, B, AB and O. Type O can donate blood toany other type but receive only O. Type AB can receive blood from any type but can donate only to AB. A can donate to A or AB and receive from A or O. B ca donate to B or AB and receive fromB or O. Design a logic circuit that will accept as inputs the blood types of a desired donor-receivepair and will output a 1 if the transfusion is permissible by these rules. Only four inputs are needed.20. Implement a converter to convert six-bit binary numbers into BCD, using a ROM of the appropriate size.21. Implement the following using a)ROM, b) a PLA.i) A 4*4 multiplier.ii) A circuit that squares that three-bit number input to it.22. A divide-by-three circuit is needed to divide the input four-bit binary number to generate the quotient and the remainder. Draw the truth table for the circuit and implement the circult with the PLA of minimum size.23. Implement the following multiple-output function using the minimum PLA:F(A, B, C, D)= m(0, 2, 8, 10)+d(1, 3, 9, 15)F(A, B, C, D)= m(3, 6, 7, 14)+d(0, 8, 11)F(A, B, C, D)= m(1, 5, 11, 13)+d(2, 7, 12)24. Use Quine-McCluskey Algorithm simplify the following functions:F(A, B, C, D)= m(3, 6, 7, 14)+d(0, 8, 11)F(A, B, C, D)= m(1, 5, 11, 13)+d(2, 7, 12)25. Given the memory values below and a one-address machine with an accumulator, what values do the following instructions load into the accumulator?word20 contain40word30 contain50word40 contain60word50 contain70a) Load Immediate 20b) Load Indirect 20c) Load Direct 20d) Load Immediate 30e) Load Indirect 3026. Compare 0-, 1-, 2- and 3-address machines by writing programs to compute X=(A+B*C)/(D-E*F). For each of the four machines. The instructions available for use are as follows:0-Address 1-Address 2-Address 3-AddressPush M Load M MOV (X:=Y) MOV (X:=Y) Pop M Store M ADD (X:=X+Y) ADD (X:=Y+Z)ADD ADD M SUB (X:=X-Y) SUB (X:=Y-Z)SUB SUB M MUL (X:=X*Y) MUL (X:=Y*Z)MUL MUL M DIV (X:=X/Y) DIV (X:=X/Y)DIV DIV M27. Given a JK flip-flop packaged in a chip, is it possible to convert it to a D flip-flop using externallogic? If not, why not? What about the reverse, that is, converting a D flip-flop into a JK one?28. Convert the following formulas from index to reverse Polish.a) A+B+C+D+Eb) (A+B)*(C+D)=Ec) (A*B)+(C*D)+Ed) (A-B)*(((C-D)*E)/F)/G)*H29. Convert the following reverse Polish formulas to infix.a) AB+C+D*b) AB/CD/+c) ABCDE+**/d) ABCDE*F/+G-H/*+30. A register is desired which will be able to load a number, count up, or negate (twos complement) the number. All three operations will be synchronous. The outputs from the register are Qi and the data inputs (for the load operation) are Di. There are two other inputs, Load and Neg, which control the action to be performed on the next clock edge. When Load is 1, a load operation will be performed on the next clock edge (Di -> Qi). When Load is 0 and Neg is 1, the contents of the register will be negated (twos complemented) on the next clock edge. When Load and Neg are both 0, the register will count up on the next clock edge. The operation of this register is summarized below.Load Neg Action----------------------------------------------- 1 X Load Di into Qi 0 1 Negate (twos complement) the register 0 0 Count upDesign this register by giving Karnaugh maps for the Ji and Ki inputs to a typical bit (Qi).The values of Ji and Ki will depend on Load, Neg, Di, Ji-1, and Qi-1. Give expressions for Ji and Ki, indicating any part of the expressions that can be shared between the two. Do not draw a circuit diagram. Do not consider Q0, which will be a special case31. A machine has a 32-bit byte-addressable virtual address space. The page size is 8 KB. How many pages of virtual address space exist?32. A virtual memory has a page size of 1024 words, eight virtual pages, and four physical page frames. The page table is as follows:Virtual page Page frame0 31 12 Not in main memory3 Not in main memory4 25 Not in main memory6 07 Not in main memorya. Make a list of all virtual addresses that will cause page fault.b. What are the physical addresses for 0, 3728, 1023, 1024, 1025, 7800, and 4096?33. A computer has 16 pages of virtual address space but only four page frames. Initially, the memory is empty. A program references the virtual pages in the order 0, 7, 2, 7, 5, 8, 9, 2, 4a. which references cause a page fault with LRU?b. Which references cause a page fault with FIFO?c.34. A segmented memory has paged segments. Each virtual address has a 2-bit segment number, a 2-bit page number, and an 11-bit offset within the page. The main memory contains 32 KB, divided up into 2-KB pages. Each segment is either
View Full Document
Unlocking...