GUJARAT UNIVERSITY
M. C. A. (Sem. 1) examination, January - 2003
Fundamentals of Computer Organization
Note:
1. Write answers of each section in separate answer books.
2. Assume suitable additional data, if necessary.
3. Figures on the right hand side indicate the marks.
| SECTION-I | |||
| Q.1 | | Answer Any 9 of following questions in brief. | 9 |
| | | 1. Draw a K-map for four variables. 2. Convert the following number from one base system to other base system.. Show your Calculation. 1. (111001.0111)2 = (?)10 = (?)8 2. (1AC.1)16 = (?)2 = (?)8 3. Calculate 9's and 10's complement of (52520) 10. 4. Perform the subtraction using 1's and 2's complement method. (10101001)2 - (10001001)2 5.Prove the following using Boolean algebra rules. (In each step specify which basic rule is used) 1).X(X+Y) = X 2).XY+YZ+Y’Z = XY+Z 6. State and Prove any one of De'morgan theorem. 7. Explain RS-flip-flop logic. 8. Find (10111) 2 + (10111)10= (?)10 Show your calculations. 9. List various types of ROMs. 10. What is cycle stealing? Explain in brief. 11. Derive a Boolean Algebra Expression for the output Y of the network shown here. 12.What is CRC? Where it is used? 13. List various types of Keyboards. | |
| Q.2 | a) | Use RS flip-flop to design a counter with binary sequence 0,2,3,5,7,4 and repeat. | 3 |
| | b) | Explain Full-adder. | 3 |
| | c) | Give truth table and logical symbol for following gates. 1.) AND 2.) OR 3.)NAND 4.) XOR | 2 |
| | | OR | |
| Q.2 | a) | Explain JK flip-flop with circuit diagram, Characteristic table and characteristic equation. | 3 |
| | b) | Draw Modulo-3 binary Ripple counter circuit and explain its working. | 3 |
| | c) | Simplify using K-map: M0+rn2+m4+m5+m8+m10+m12 | 2 |
| | | | |
| Q.3 | a) | Explain transfer Circuit. | 2 |
| | b) | Explain Master-Slave flip-flop with block diagram and logic design. | 3 |
| | c) | Write short note on FM and MFM recording formats with necessary sketches. | 3 |
| | | OR | |
| Q.3 | a) | Justify NAND gate is a universal gate. | 3 |
| | b) | Do as directed:
| 2 |
| | c) | Simplify the Boolean function F with the don't care conditions d in (1) Sum-of-Products form and (2) Product of Sums form. F(w,x,y,z) = S(0,1,2,3,7,8.10), d(w,x,y,z) = S(5, 6, 11, 15) | 3 |
| | | | |
| | | SECTION – II | |
| | | | |
| Q.4 | a) | Write a short note on interrupts. | 3 |
| | b) | Write a short note on Decoders. How many diodes we require to construct an 8 bit decoder using AND gales? | 5 |
| | | | |
| Q.5 | a) | Describe with necessary sketches: Keyboard interfacing Techniques and Keyboard status word generator | 6 |
| | b) | Why we require Tri State drivers in Bus? Draw symbol and truth table for a Tri-state driver with enable signal. | 2 |
| | | OR | |
| Q.5 | a) | Write a short note on Printers. | 3 |
| | b) | If the High speed memory for computer were assembled from a collection of IC memory including 50-, 200-, 5000-ns (nano seconds) memories, would a synchronous or asynchronous data bus be better? Explain your reasoning. | 2 |
| | c) | Write short note on isolated vs. Memory mapped I/O. | 3 |
| | | | |
| Q.6 | a) | Why we require various addressing techniques? List various addressing techniques with the example of 8 bit Intel microprocessor. | 5 |
| | b) | Distinguish Any 2 of following: 1. RAM & ROM. 2. Winchester Disks & Non-Winchester Disks. 3. Combinational Circuits & Sequential Circuits. 4. Sum of Products & Products of sum representation. | 3 |
| | | OR | |
| Q.6 | a) | Draw the architecture of 8086 Microprocessor. Draw the flag register for 8086 Processor and explain its function. | 4 |
| | b) | Write a short note on Cache memory or Virtual memory. | 3 |
| | c) | What is PSW ? Where it is used? | 1 |
