0% found this document useful (0 votes)
154 views4 pages

Computer Organization Overview for MAKAUT

The document provides a comprehensive overview of computer organization, including key concepts such as stored program computers, instruction execution steps (fetch, decode, execute), and the roles of compilers and operating systems. It covers various addressing modes, instruction formats, and the functions of components like the ALU and registers. Additionally, it includes detailed explanations and comparisons of compilers and assemblers, as well as the instruction cycle and the basic organization of a stored program computer.

Uploaded by

z900loverudl
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
154 views4 pages

Computer Organization Overview for MAKAUT

The document provides a comprehensive overview of computer organization, including key concepts such as stored program computers, instruction execution steps (fetch, decode, execute), and the roles of compilers and operating systems. It covers various addressing modes, instruction formats, and the functions of components like the ALU and registers. Additionally, it includes detailed explanations and comparisons of compilers and assemblers, as well as the instruction cycle and the basic organization of a stored program computer.

Uploaded by

z900loverudl
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Module 1: Computer Organization (MAKAUT)

1 Mark Questions with Answers

1. What is a stored program computer?

Ans: A computer where instructions are stored in memory before execution.

2. Name the three steps of instruction execution.

Ans: Fetch, Decode, Execute.

3. What is the function of a compiler?

Ans: It translates high-level language into machine code.

4. Define operand.

Ans: Operand is the data on which an operation is performed.

5. Define operator.

Ans: Operator is the symbol that tells the computer to perform a specific operation.

6. What does the fetch cycle do?

Ans: It retrieves instructions from memory.

7. What is decoding in instruction execution?

Ans: It interprets the fetched instruction to determine the operation.

8. Name any two general-purpose registers.

Ans: AX, BX.

9. What is the role of the accumulator?

Ans: It stores intermediate arithmetic and logic results.

10. What is an instruction set?

Ans: A collection of machine instructions supported by a CPU.

11. Define instruction format.

Ans: The layout of bits in an instruction.

12. What is an assembler?

Ans: A tool that converts assembly language into machine code.

13. What is the operating system's role in execution?

Ans: Manages hardware and software resources, and program scheduling.

14. What is the use of the Program Counter (PC)?

Ans: It holds the address of the next instruction to be executed.


15. Difference between compiler and interpreter?

Ans: Compiler translates the whole code at once; interpreter does it line-by-line.

16. Define immediate addressing mode.

Ans: Operand is directly specified in the instruction.

17. What is direct addressing?

Ans: Operand's memory address is specified in the instruction.

18. Define register addressing mode.

Ans: Operand is in a register.

19. What is the memory unit in a computer?

Ans: It stores data and instructions (e.g., RAM, ROM).

20. State one function of the ALU.

Ans: Performs arithmetic and logical operations.


5 Marks Questions with Answers

1. Explain the fetch-decode-execute cycle with a diagram.

Ans: The CPU performs fetch (from memory), decode (by Control Unit), and execute (via ALU or Memory). It

uses PC, MAR, MDR, IR, and repeats this cycle for each instruction.

2. Differentiate between compiler and assembler.

Ans: Compiler converts high-level language to machine code, whole program at once. Assembler converts

assembly code to machine code, instruction by instruction.

3. Explain any three addressing modes with examples.

Ans: Immediate (MOV A, #5), Direct (MOV A, 2000H), Register (MOV A, R1).

4. Write short notes on instruction format and types.

Ans: Instruction format includes opcode, operand, mode fields. Types: 0-address (stack), 1-address,

2-address, 3-address.

5. Describe the role of OS in program execution.

Ans: OS schedules processes, allocates memory, handles I/O, and switches between kernel/user modes.
15 Marks Questions with Full Answers

Q1. Basic Organization of Stored Program Computer

[Full answer on previous page - includes block diagram, units like ALU, CU, Memory, and explanation of Von

Neumann model.]

Q2. Explain instruction cycle - fetch, decode, execute.

[Detailed steps of instruction fetch from memory using PC, MAR, MDR, IR, followed by decoding and

execution using ALU.]

Q3. Addressing Modes with Examples

[Explains Immediate, Direct, Indirect, Register, Indexed, and Relative modes with examples like MOV A, #5

or JMP +4.]

Q4. Operator, Operand, Registers and Memory Roles

[Describes how operator tells action, operand is data, registers store intermediate values, and memory stores

both data and instructions.]

Q5. Instruction Sets and Formats

[Explains instruction types (Arithmetic, Logical, Branch), CISC vs RISC, and formats like 1-address,

2-address, and 3-address instructions.]

Common questions

Powered by AI

Instruction formats impact CPU design and function by determining the layout of bits in an instruction, influencing the complexity and capability of a CPU's instruction set architecture (ISA). Formats vary in the number and type of address fields, enabling different operational widths like 0, 1, 2, or 3-address instructions, which affect the computational efficiency, memory usage, and performance of CPUs. Such variations are crucial for balancing between speed, memory use, and functional breadth in CPU designs .

Addressing modes determine the method used by a computer architecture to specify the operand(s) in an instruction. They affect how operands are accessed and operations are performed by varying the instruction's complexity and flexibility. Common addressing modes include Immediate, where operands are part of the instruction itself; Direct, where the operand's memory address is specified; and Register, where operands are stored in registers. These modes influence instruction execution by affecting processing speed and instruction flexibility .

The fetch-decode-execute cycle manages instruction processing by executing three main steps: Firstly, the fetch step retrieves the next instruction's address from the memory and updates the program counter (PC). Secondly, the decode step interprets the fetched instruction using the instruction register (IR), identifying the operation and locating operands. Lastly, the execute step carries out the decoded instructions using the Arithmetic Logic Unit (ALU) or relevant peripherals .

Operands refer to the data values upon which operations are performed, whereas operators are the symbols or functions that dictate the specific operation to be executed with these operands. In an instruction set, operators are typically represented by opcodes that determine the action (e.g., addition, subtraction), while operands represent the data that will be manipulated. The execution of an instruction involves applying the operator to the operand(s) to produce a result, often involving intermediate storage in registers for efficiency .

The primary functions of a stored program computer based on the Von Neumann model include storing instructions in a memory alongside data, which allows the computer to execute programs sequentially from memory. This model emphasizes the use of a single memory space for both data and instructions, the presence of key units like the Arithmetic Logic Unit (ALU) for executing operations, the Control Unit (CU) for directing processing, and the critical role of the Program Counter (PC) for sequencing .

The fetch cycle differs from the execute cycle in that it is primarily concerned with retrieving the next instruction from memory into the CPU, utilizing the Program Counter (PC) to track instruction sequence and updating the Instruction Register (IR) with the fetched instruction. The execute cycle, conversely, focuses on carrying out the actual operations defined by the instruction, using the Arithmetic Logic Unit (ALU) to perform calculations or manipulate data as specified by the decoded instruction .

The operating system facilitates program execution by managing hardware and software resources effectively. It schedules processes, allocates CPU time through multitasking, and manages memory hierarchy, ensuring efficient resource distribution among applications. It also handles input/output operations and provides an interface between hardware and applications. Moreover, the OS ensures protection and security, maintaining system stability and reliability .

Immediate and direct addressing modes differ primarily in how operands are accessed within an instruction. In immediate addressing, the operand is embedded directly within the instruction, such as in the command `MOV A, #5`, where `A` is loaded with the value `5` directly. However, in direct addressing, the instruction specifies the memory address of the operand, as in `MOV A, 2000H`, where the actual data is found at the memory address `2000H`. These differences affect instruction execution by altering speed and flexibility .

A compiler translates a high-level programming language into machine code all at once, optimizing across the entire program for efficiency. This process allows for execution without the source code present, often resulting in faster runtime. An assembler, however, converts assembly language, which is closer to machine code, into actual machine instructions, translating them instruction by instruction, which directly allows low-level hardware interaction but requires precise control over the code .

The Program Counter (PC) contributes to CPU operation by holding the memory address of the next instruction to be executed, ensuring a sequential flow of program execution. It automatically increments to point to the subsequent instruction after each fetch, which is critical for maintaining order and efficiency in processing multiple instructions, and enables branching by updating to addresses specified by control flow instructions such as jumps or calls .

You might also like