BACHELOR IN COMPUTER APPLICATIONS
Term-End Examination
June, 2011
CS-64: INTRODUCTION TO COMPUTER ORGANISATION
Time : 3 Hours
Max. Marks : 75
Note : Question one is compulsory. Answer any three questions from the rest.
1. (a) List the basic key features of a von-Neuman machine. Also draw structure of von-Neuman machine.
(b) What is a combinational circuit? Draw a combinational circuit for Boolean expression
(d) What is a bus? Explain the working of a shared bus system with an example.
(e) Explain the need of error detection and correction. What is a parity bit? How a parity bit can be used for the purpose of error detection?
(f) What is Addressing? List and explain any two addressing schemes with the help of an example of each.
2. (a) Simplify the following Boolean expression using K-Map
Also draw the logic circuit for the simplified Boolean expression.
(b) What is an interrupt? Explain U88 Of interrupt in assembly programming with an example.
(c) What is a hardwired control unit? Explain its advantages.
3. (a) Draw a combinational circuit for 3-bit odd parity generator. Also make truth table for it.
(b) What is random access memory (RAM)? Briefly explain working of RAM.
(c) Perform the following arithmetic operations on 8 bit numbers using 2's Complement notation. Indicate overflow/underflow, if any:
(i) 57–48
(ii) –82+41
4. (a) What are four types of segments in 8086 assembly programming ? Explain the use of ASSUME directive with an example.
(b) What are the four general purpose registers in 8086? Explain uses of each of them.
(c) What is redundant array of independent disk (RAID)? Explain three basic characteristics of RAID.
5. (a) Write an assembly program to add two 8 bit numbers.
(b) Differentiate between synchronous and asynchronous circuits. Also explain the need of a flip-flop in circuit design with the help of an example.
(c) Explain the following terms with the help of an example/ diagram/ illustrations, if needed.
(i) Assembler
(ii) Memory hierarchy.
0 comments:
Post a Comment