JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech III COMPUTER ORGANIZATION AND OPERATING SYSTEMS Previous Question Paper (February - 2022 - R13)

B.Tech | III | I | R13 | February - 2022

Answer PaperPaper Code: 115ENMaximum Marks: 75Time: 3 hours

Answer any five questions

All questions carry equal marks

Main

115 marks
a

Describe instruction cycle with flowchart.

7 marks

Answer

The instruction cycle is the fundamental process by which a computer retrieves a program instruction from its memory, determines what actions the instruction requires, and carries out those actions. It consists of three primary phases: Fetch, Decode, and Execute.

  1. Fetch: The CPU fetches the instruction from the memory address stored in the Program Counter (PC). The instruction is loaded into the Instruction Register (IR), and the PC is incremented to point to the next instruction.
  2. Decode: The control unit interprets the opcode in the IR to determine the specific operation to be performed and identifies the required operands.
  3. Execute: The CPU performs the operation, such as arithmetic, logic, or data transfer, and updates registers or memory as necessary.

Flowchart representation: Start -> Fetch Instruction -> Decode Instruction -> Calculate Effective Address -> Fetch Operands -> Execute Operation -> Store Result -> Check for Interrupts -> Return to Fetch.

b

Explain any five addressing modes in detail.

8 marks

Answer

Addressing modes define how the effective address of an operand is calculated. Five common modes are:

  • Immediate Addressing: The operand is specified directly in the instruction itself. Example: MOV R1, #10 (moves the value 10 into register R1).
  • Direct Addressing: The instruction contains the actual memory address where the operand is stored. Example: MOV R1, [1000] (moves the content of memory location 1000 into R1).
  • Register Addressing: The operand is held in a CPU register specified by the instruction. This is the fastest mode as it avoids memory access. Example: ADD R1, R2 (adds contents of R2 to R1).
  • Register Indirect Addressing: The instruction specifies a register that contains the memory address of the operand. Example: MOV R1, [R2] (moves data from the address stored in R2 into R1).
  • Indexed Addressing: The effective address is calculated by adding a constant displacement to the content of an index register. This is useful for accessing arrays. Example: MOV R1, [R2 + offset] (moves data from the calculated address into R1).
215 marks
a

Describe design of Arithmetic Logic Unit in detail.

7 marks

Answer

Sign in to view the complete answer paper.

b

Distinguish between fixed point and floating point representation.

8 marks

Answer

Sign in to view the complete answer paper.

3

Explain in detail the design of Micro programmed control unit. What are advantages and disadvantages?

15 marks

Answer

Sign in to view the complete answer paper.

4

Write brief note on the following:

15 marks
a

Virtual Memory

7 marks

Answer

Sign in to view the complete answer paper.

b

Cache Memory.

8 marks

Answer

Sign in to view the complete answer paper.

515 marks
a

Distinguish between programmed I/O and Interrupt driven I/O.

7 marks

Answer

Sign in to view the complete answer paper.

b

Show internal configuration of DMA controller with diagram and explain how its working.

8 marks

Answer

Sign in to view the complete answer paper.

615 marks
a

Explain daisy chaining process of priority interrupts.

7 marks

Answer

Sign in to view the complete answer paper.

b

The size of the word count register of a DMA controller is 16 bits. The processor needs to transfer a file of 29,154 Kbytes from disk to main memory. The memory is byte addressable. Calculate the minimum number of times the DMA controller needs to get control of the system bus from the processor to transfer the file from disk to main memory? Assume 1K = 1024.

8 marks

Answer

Sign in to view the complete answer paper.

715 marks
a

Write short notes on: (i) deadlock (ii) starvation.

7 marks

Answer

Sign in to view the complete answer paper.

b

Assume a maximum-claim reusable resource system with four processes and three resource types. The total units of each resource type are given by vector [5 8 16]. The claim matrix C and the allocation matrix A are provided. Determine if the current state is safe and check safety of requested resource allocations.

8 marks

Answer

Sign in to view the complete answer paper.

8

Write a short note on the following:

a) File system, File attributes b) RAID organization c) Free space management.

15 marks

Answer

Sign in to view the complete answer paper.

About this paper

This page contains the solved question paper with answers of COMPUTER ORGANIZATION AND OPERATING SYSTEMS from JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD for B.Tech ECE III I, February - 2022, R13.

For the question paper without answers, switch to the Question Paper tab.

Other papers in COMPUTER ORGANIZATION AND OPERATING SYSTEMS

Loading Question Papers

Fetching data from database...