Solve your IGNOU Doubts
Solve your IGNOU Doubts
Question:

To personalize the start screen using the charms bar and Change PC Settings.

See Answer →
Question:

Write about the App management, APIs, behaviour changes (privacy, security and performance), flash memory management and Battery Resource Utilization in Android 13 Mobile Operating System.

See Answer →
Question:

Discuss in detail the I/O management, File management and Security and Protection in WINDOWS 11 Operating System.

See Answer →
Question:

Write a program in C to implement Banker’s Algorithm to avoid Deadlock. Also explain the code briefly.

See Answer →
Question:

Consider the following page-reference string:
1, 7. 6, 5, 4 , 3, 2, 1, 2, 3, 4, 2, 1, 3, 4, 6, 2, 1, 2, 3, 7, 6, 3, 2
How many page faults would occur for following replacement algorithms assuming four frames?
Remember that all frames are initially empty, so your first unique pages will all cost one fault each.
i. FIFO replacement.
ii. LRU replacement.
iii. Optimal replacemen

See Answer →
Question:

On a disk with 1000 cylinders, numbers 0 to 999, compute the number of tracks the disk arm must move to satisfy all the requests in the disk queue. Assume the last request serviced was at track 345 and head is moving to track 0. The queue in FIFO order contains requests for the following tracks: 128, 870, 694, 470, 107, 378. Show the disk arm movement and calculate the number of tracks traversed using the following policies:

(a) FIFO (b) SSTF (c) SCAN (d) LOOK

See Answer →
Question:

Consider the following jobs:

Job # Arrival time Run time
A 0 7
B 2 4
C 3 6
D 5 3

a) Using the FCFS method, compute the completion times of the above jobs, average turn around time and average waiting time.
b) Using the SJF (Shortest Job First) method, compute the completion times of the above jobs, the
average turn around time and the average waiting time.
c) Using the Round Robin method (with Quantum = 3), compute the completion times of the above
jobs and the average waiting time. 

See Answer →
Question:

Inter-processor arbitration

See Answer →
Question:

Array processing

See Answer →
Question:

Arithmetic pipelining

See Answer →
Question:

Write a program in 8086 assembly language, which converts a four-digitpacked BCD number to ASCII digits and then prints them. Explain each step of the program.The program should take the BCD value from the memory.

See Answer →
Question:

Write a program in 8086 assembly language, which converts a four-digitpacked BCD number to ASCII digits and then prints them. Explain each step of the program.The program should take the BCD value from the memory.

See Answer →
Question:

How does 8086 microprocessor handle interrupts? Explain with the help of an example. Write a program using 8086 assembly language to output a string “Computer Organisation includes assembly programming”

See Answer →
Question:

Explain the structure of 8086 micro-processor. What are segment registers? Explain how segment registers can be used for computation of physical address in 8086 micro-processor.

See Answer →
Question:

Explain how the circular buffer in RISC helps in implementation of efficient procedure calls. Also, explain the concept of RISC pipelining and optimisation of RISC pipelining.

See Answer →
Question:

What is a micro-instruction? Explain the organisation of control unit. How microinstruction-based control unit work? Explain with the help of a diagram.

See Answer →
Question:

With the help of micro-operations, explain how an instruction that uses direct addressing mode can be fetched, decoded and executed by a machine. You April follow the conventions as given in Unit 10 of Block 3.

See Answer →
Question:

Assume that a computer has 16-bit memory words. The size of instructions on this machine is 32 bits,
which consists of an 8-bit operation code, a 4-bit addressing mode, one4-bit register address and one
16-bit memory address. Some of the opcodes and addressing modes for this machine are shown
below:
Opcode: 10001111 – Add the content of the operand into the Accumulator register
Opcode: 10001110 - Subtract the content of the operand from the Accumulator register
Addressing Mode: 0011 Direct addressing using a memory address
 Addressing Mode: 0100 Base Register Addressing; where the 4-bit register address is the address
of the register and the 16-bit memory address contains the offset from the base
register.
Show the content of memory containing two add instructions one using addressing mode 0011 and
the other using addressing mode 0100 along with operands and operand addresses. You should show
instructions, operandsand memory addresses in the diagram.

See Answer →
Question:

Subroutine call and return instructions

See Answer →
Question:

Branch and Jump Instructions

See Answer →
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★
Top
📞
Call Support Instant phone assistance
🟢
WhatsApp Chat Fast live messaging
Email Us Business enquiries & support