Ca Unit 1

Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1of 2

CS2253 COMPUTER ORGANIZATION AND ARCHITECTURE

question bank

UNIT I

BASIC STRUCTURE OF COMPUTERS

Part – A( 2Marks)

1. What is meant by the stored program concept?


2. What are the basic functional units of a computer?
3. What is the use of buffer register?
4. Define memory access time.
5. Write the differences between RISC and CISC.
6. What is meant by MAR and MDR?
7. What is an interrupt?
8. Why data bus is bidirectional in most microprocessors?
9. What do you mean by multiprogramming or multitasking?
10. Give the basic performance equation.
11. What are the limitations of assembly language?
12. What are the two techniques used to increase the clock rate R?
13. What are big-endian and little-endian representations?
14. What is the information conveyed by addressing modes?
15. What are the different types of addressing modes available?
16. What is indirect addressing mode?
17. What is indexed addressing mode?
18. Define auto increment mode of addressing?
19. Define auto decrement mode of addressing?
20. What are condition code flags?
21. What is the use of assembler directive?
22. What is meant by straight – line sequencing?
23. What is stack?
24. Which data structure is best supported using indirect addressing mode?
25. What are the differences between Stack and Queue?
26. What is byte addressable memory?
27. What is big endian and Little endian format?
28. Define clock rate?
29. What is the function of ALU?
30. Draw the full adder circuit using two half adders and give the truth table.
31. Why floating point number is more difficult to represent and process than integer?
32. What are the two approaches used to reduce delay in adders?
33. What is a carry look-ahead adder?
34. Discuss the principle behind the Booth’s algorithm?
35. How can we speed up the multiplication process?
36. What is bit pair recoding? Give an example.
37. What are the two methods of achieving the 2’s complement?
38. What is the advantage of using Booth algorithm?
39. Write the algorithm for restoring division.
40. Write the algorithm for non restoring division.
41. Define IEEE floating point single and double precision standard.
42. When can you say that a number is normalized?
43. Explain about the special values in floating point numbers.
44. Write the Add/subtract rule for floating point numbers.
45. Write the multiply rule for floating point numbers.
46. What is the purpose of guard bits?
47. What are the ways to truncate the guard bits?
48. Define carry save addition (CSA) process.
49. What are generated and propagate function?
50. What is excess-127 format?
51. What is a ripple carry adder?
52. Draw the structure of 4-bit MSI ALU circuit block.
53. What are the various ways of representing signed integers in the system?
54. Give the booth’s recoding and bit pair recoding of the number 1000011100100101.
55. When performing signed division, the sign of the remainder should be the same as the sign of
the dividend. Why?

Part – B
1. Explain the basic functional units of a simple computer. (8)
2. Explain the basic I/O operations of modern processors. (8)
3. Explain various addressing modes found in modern processors (16)
4. Explain various assembler directives used in assembly language program (8)
5. What are stack and queues? Explain its use and give its differences (10)
6. What are the various types of ISAs possible? Discuss. (8)
7. Discuss the various issues to be considered while designing the ISA of a processor.(8)
8. Write the difference between CISC and RISC.
9. Discuss the principle of operation of carry-look ahead adders. (8)
10. Discuss the non-restoring division algorithm. Simulate the same for 23/5. (8)
11. Multiply the following pair of signed 2’s complements numbers using bit pair
recoded multiplier: Multiplicand = 110011 Multiplier = 101100. (8)
12. With a neat sketch, Explain in detail about logic design for fast adders. (16)
13. Describe how the floating-point numbers are represented and used in digital
arithmetic operations. Give an example. (16)
14. Explain the representations of floating point numbers in detail. (6)
15. Design a multiplier that multiplies two 4-bit numbers. (6)
16. Give the block diagram of the hardware implementation of addition and subtraction
of signed number and explain its operations. (10)
17. Explain the working of floating point adder and subtractor. (10)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy