Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
161 views

CS-01 Computer Fundamentals

This document contains questions for a computer fundamentals exam. It includes: 1. A question with multiple parts asking to (a) make a truth table and Karnaugh map for a Boolean function and draw the logic diagram, (b) explain how the number of instruction addresses affects program size, and (c) write an 8086 assembly program to count characters in a string. 2. Questions asking to (a) explain floating point representation using 32 bits and (b) explain the functioning of a master-slave flip flop. 3. Questions asking to (a) explain vector computation with an example and (b) explain the basic control unit structure, and (c) write an 8

Uploaded by

dhritimohan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
161 views

CS-01 Computer Fundamentals

This document contains questions for a computer fundamentals exam. It includes: 1. A question with multiple parts asking to (a) make a truth table and Karnaugh map for a Boolean function and draw the logic diagram, (b) explain how the number of instruction addresses affects program size, and (c) write an 8086 assembly program to count characters in a string. 2. Questions asking to (a) explain floating point representation using 32 bits and (b) explain the functioning of a master-slave flip flop. 3. Questions asking to (a) explain vector computation with an example and (b) explain the basic control unit structure, and (c) write an 8

Uploaded by

dhritimohan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

No.

of Printed Pages : 3

CS-01(

PGDCA/MCA (I YEAR)/BCA Term-End Examination December, 2011 c\i


O CS-01 : COMPUTER FUNDAMENTALS O

Time : 3 hours
Note :

Maximum Marks : 75

Question number 1 is compulsory and carries 30 marks. Answer any three questions from the rest.

1. (a) Make the truth table for the following 5


boolean function : F(A, B, C, D)=A'B+B'C+C'D Simplify the function above using Karnaugh's map. Draw. the resultant logic diagram. Using AND, OR and NOT gates. (Please note A' represents complement of A). (b) Explain with the help of an example how 5 number of addresses in an instruction changes the size of a program. (c) Write a program in 8086 assembly language 6 programming that counts the number of characters in a given string. You may

CS-01

P.T.O.

assume that the string is stored in the consecutive memory locations and is terminated by a $ character. (d) What is instruction pipelining ? How is it implemented in RISC machine ? Explain with the help of a diagram. (e) Define the following terms in the context of computer organisation : (i) (ii) (iii) (iv) Interrupt driven Input/Output Associative memory Register indirect addressing Flag register

2. (a) Explain the floating point representation with the help of any example using 32 bit representation. (b) (c) Explain the functioning of master - slave flip - flop using a suitable diagram. List three uses of INT 21h in 8086 assembly language programs.

3. (a) What is vector computation ? Explain with the help of an example. (b) Explain the basic structure of a control unit with the help of a diagram. CS-01 2

(c) Write a program using 8086 assembly 6 language that converts two ASCII digits stored in consecutive memory location to a packed BCD number. The resultant BCD number is left in AL register. 4. (a) What is the need of memory hierarchy ? 5 Explain the terms seek time and rotational (b) Explain the following addressing modes 5 with the help of an example each : (i) Displacement addressing using base register. Stack addressing. (c) Explain the multiport memory organisation 5 for multiprocessor as system with the help of a diagram. 5. Explain the following with the help of an 15 example/diagram, if needed : (a) Micro - instruction (b) (c) (d) (e) Fetch Cycle Subroutine call DRAM Advantages of Integrated Circuits (ii) latency in the context of a magnetic disk.

CS-01

You might also like