Skip to content

Easy reading, no stress

Hello Rakib, here is your list of questions based on the previous year question analysis:

What are the classes of computer? ๐Ÿ’ป๐Ÿค” Explain briefly with their characteristics. ๐Ÿ“โœจ

Explain the layers of computer system architecture ๐Ÿ—๏ธโš™๏ธ with a neat diagram. ๐Ÿ“Šโœ๏ธ

Define throughput ๐Ÿš€ and response time. โฑ๏ธ How do they differ in measuring system performance? ๐Ÿ“ˆ๐Ÿ“Š

Discuss the basic functional units of a computer. ๐Ÿง ๐Ÿ”Œ

Briefly discuss the bus structure ๐ŸšŒ of a processor. ๐Ÿงฎ

What do you mean by instruction set architecture (ISA)? ๐Ÿ“œ๐Ÿ—๏ธ Explain the MIPS instruction set format with examples. ๐Ÿ’ก๐Ÿ“‹

Differentiate between RISC and CISC architecture. โš–๏ธ๐Ÿ” Give at least four differences. 4๏ธโƒฃ๐Ÿ“

  1. Consider the below instruction: โฌ‡๏ธ๐Ÿค”
    Load R2, LOC ๐Ÿ“ฅ
    Write the execution step of the above machine instruction. โš™๏ธโœ๏ธ
  2. What are the characteristics of a RISC processor? โšก๐Ÿง 
  3. Draw the three-bus CISC-style processor organization. ๐ŸšŒ๐ŸšŒ๐ŸšŒ๐ŸŽจ
  4. Write the execution steps with its architecture ๐Ÿ—๏ธ to complete the below instruction: ๐Ÿƒโ€โ™‚๏ธโœ…
    Add (R3), R1 โž•
  5. Explain the MIPS addressing modes ๐Ÿ“๐Ÿ—บ๏ธ with suitable examples. ๐ŸŒŸ
  6. Write down the MIPS assembly code ๐Ÿง‘โ€๐Ÿ’ป for the following C code: ๐Ÿ‡จ๐Ÿ’ป
    f = (a + b) โˆ’ (c + d); โž•โž–
    g = f + A[10]; ๐Ÿงฎ
  7. Explain the compilation process ๐Ÿ”„ of a C program step by step. ๐Ÿšถโ€โ™‚๏ธ How does a high-level language ๐Ÿ—ฃ๏ธ convert to machine language? ๐Ÿค–0๏ธโƒฃ1๏ธโƒฃ
  8. Explain various addressing modes ๐ŸŽฏ with examples. โœจ
  9. What is an instruction? ๐Ÿ“œ How is an instruction represented by a computer? ๐Ÿ’ป๐Ÿค”
  10. Explain with block diagram ๐Ÿ”ฒ the data path ๐Ÿ›ฃ๏ธ of a processor. ๐Ÿง 
  11. What are the control signals ๐Ÿšฆ for the data path? ๐Ÿ›ค๏ธ
  12. Briefly explain about dynamic scheduler ๐Ÿ“… with block diagram. ๐Ÿ“Š
  13. Briefly explain the micro-programmed control unit ๐ŸŽ›๏ธ for the branch instruction. ๐ŸŒฟ
  14. What is the purpose of a control unit? ๐ŸŽฏ๐ŸŽ›๏ธ
  15. Define Word, ๐Ÿ”ค Address, ๐Ÿ“ and Memory Access Time. โฑ๏ธ๐Ÿง 
  16. How does the pipeline ๐Ÿšฐ increase the performance ๐Ÿš€ of a processor? ๐Ÿง  Explain. ๐Ÿ—ฃ๏ธ
  17. Explain the pipelined operation ๐Ÿ”„ in the ideal case. ๐ŸŒŸ
  18. What are the issues โš ๏ธ of pipelined operation? ๐Ÿšง
  19. Explain with example ๐Ÿ’ก the use of operand forwarding โฉ to resolve the data dependency issue. ๐Ÿ”—โœ…
  20. Show the modification ๐Ÿ› ๏ธ in the data path ๐Ÿ›ค๏ธ to support data forwarding. ๐Ÿ“ค
  21. What is a data hazard? โ˜ข๏ธ How can it be overcome? ๐Ÿ›ก๏ธ Discuss its side effects on pipeline performance. ๐Ÿ“‰๐Ÿšฐ
  22. Show the algorithm ๐Ÿ“œ and hardware diagram ๐Ÿ–ฅ๏ธ๐Ÿ”Œ for multiplication โœ–๏ธ in a processor. ๐Ÿง  Explain with an example. ๐ŸŒŸ
  23. Divide (1010)โ‚‚ โž— by (0010)โ‚‚ using the division algorithm. ๐Ÿงฎ Show all steps. ๐Ÿชœ
  24. Show the IEEE 754 binary representation 0๏ธโƒฃ1๏ธโƒฃ of the number โˆ’0.625โ‚โ‚€ in single ๐Ÿฅ‡ and double precision. ๐Ÿฅˆ
  25. Design a 4-bit binary multiplier โœ–๏ธ๐Ÿ’ป with detailed implementation. ๐Ÿ› ๏ธ๐Ÿ“
  26. Briefly analyze the Booth multiplication algorithm ๐Ÿง for the given input: 16 ร— (โˆ’2). โœ–๏ธ๐Ÿ”ข
  27. How is the performance ๐Ÿ“ˆ of a computer measured? ๐Ÿ“ Explain with examples ๐Ÿ’ก using clock rate, โฑ๏ธ CPI, โš™๏ธ and MIPS. ๐Ÿš€
  28. Consider three processors ๐Ÿง  P1, P2, and P3 executing the same instruction set: ๐Ÿ“œ
    P1: Clock rate = 3 GHz, โฑ๏ธ CPI = 1.5 โš™๏ธ P2: Clock rate = 2.5 GHz, โฑ๏ธ CPI = 1.0 โš™๏ธ
    P3: Clock rate = 4.0 GHz, โฑ๏ธ CPI = 2.5 โš™๏ธ
    (i) Which processor ๐Ÿง  has the highest performance ๐Ÿ† in instructions per second? โšก
    (ii) If each processor executes a program in 12 seconds, โฑ๏ธ find the number of cycles ๐Ÿ”„ and number of instructions ๐Ÿ“œ for each. ๐Ÿ”ข
    (iii) We want to reduce the execution time by 25%, ๐Ÿ“‰ but this causes a 15% increase in CPI. ๐Ÿ“ˆ What clock rate is needed? โฑ๏ธ๐Ÿค”
  29. Explain Flynnโ€™s classification ๐Ÿ—‚๏ธ of parallel hardware ๐Ÿ–ฅ๏ธ๐Ÿ–ฅ๏ธ (SISD, SIMD, MISD, MIMD) in detail ๐Ÿ“ with examples. ๐ŸŒŸ
  30. What is cache memory? โšก๐Ÿง  Define cache-hit, ๐ŸŽฏ cache-miss, โŒ and miss-penalty. โณ Explain with an example. ๐Ÿ’ก
  31. Explain the write-through โœ๏ธโžก๏ธ and write-back โœ๏ธ๐Ÿ”™ cache handling policies. What are the advantages โž• and disadvantages โž– of each? ๐Ÿค”
  32. Explain the Register Transfer Logic (RTL) ๐Ÿ”„๐Ÿ—„๏ธ for the following MIPS instructions: addu, addi, lw, sw, and beq. ๐Ÿ“œ๐Ÿ’ป
  33. Briefly describe the basic connection ๐Ÿ”Œ of memory ๐Ÿง  to the processor. โš™๏ธ
  34. Briefly explain the internal organization ๐Ÿข of bit cells 0๏ธโƒฃ1๏ธโƒฃ in a memory chip. ๐Ÿ’พ
  35. Design a 2Mร—32 memory module ๐Ÿ’พ๐Ÿงฉ using 512Kร—8 static memory chips. ๐Ÿ–ฅ๏ธ๐Ÿ”ง
  36. What is virtual memory? โ˜๏ธ๐Ÿง  Why is a mapping function ๐Ÿ—บ๏ธ needed in cache memory. โšก