If the memory map of the DMA controller starts from the offset 0x30001000 and has an address
range of 256 bytes in a 32-bit addressing scheme, what will be the final address in the memory
map?
6406533053257.
0x30001100
6406533053258.
0x300012FF
6406533053259.
0x300010FF
6406533053260.
0x30001300
A published solution is not available for this question yet.
In a cryptographic implementation where memory access patterns depend on the value of a
secret key, which type of attack is likely to exploit this vulnerability?
6406533053299.
Differential Power Analysis (DPA)
6406533053300.
Cache Timing Attack
6406533053301.
Frequency Analysis
6406533053302.
Brute Force Attack
A published solution is not available for this question yet.
In the Xv6 OS, What is the correct sequence of tasks as listed below that takes place as part of
timer interrupt?
(i) Supervisor mode executes
(ii) CPU goes to machine mode
(iii) Timer interrupt occurs
(iv) The function in machine mode triggers the supervisor mode software interrupt
(v) Context switch occurs
6406533053274.
(i) → (ii) → (iii) → (iv) → (v)
6406533053275.
(iii) → (ii) → (iv) → (i) → (v)
6406533053276.
(iii) → (i) → (ii) → (iv) → (v)
6406533053277.
(iii) → (i) → (iv) → (ii) → (v)
A published solution is not available for this question yet.
Consider a system with three processes (P1, P2, and P3) and three resources (R1, R2 and R3). The
following Resource Allocation Graph (RAG) represents the current state of resource allocation:
Based on the given Resource Allocation Graph (RAG), is there a deadlock situation present in the
system?
6406533053285.
Yes, involving P1, P2 and P3.
6406533053286.
No, there is no deadlock situation.
6406533053287.
Yes, involving P1 and P3.
6406533053288.
Yes, involving P1 and P2.
A published solution is not available for this question yet.
Assume Process A is currently running, Process B and Process D are waiting for an I/O operation,
and Process C was running before Process A and is now waiting for its turn. Select all the correct
statements about the states of the processes.
6406533053269.
Process A is in the WAITING state.
6406533053270.
Process B is in the SLEEPING state.
6406533053271.
Process C is in the RUNNABLE state.
6406533053272.
Process A is in the RUNNING state.
6406533053273.
Process D is in the RUNNING state.
A published solution is not available for this question yet.
Consider a system with four processes, P1, P2, P3, and P4, arriving at different times and needing
the following CPU bursts to complete:
Assuming that the system employs the First-Come-First-Served (FCFS) scheduling algorithm, what
is the average waiting time?
Note: Write up to two decimal place
A published solution is not available for this question yet.
Consider a system with four processes, P1, P2, P3, and P4, arriving at different times and needing
the following CPU bursts to complete:
Assuming that the system employs the Shortest Job First (SJF) scheduling algorithm, what will be
the average response time?
Note: Write up to two decimal place
A published solution is not available for this question yet.
