If the memory map of the interrupt controller starts from the offset 0x20000000 and has an
address range 128 bytes in a 32-bit addressing scheme then what will be the final address in the
memory map?
6406532757161.
0x2000007F
6406532757162.
0x20000080
6406532757163.
0x200001FF
6406532757164.
0x20000200
A published solution is not available for this question yet.
Assume that process A (parent) is (voluntarily) trying to create a daemon process B (child).
**Statement 1:** exit system call must be called by process A.
**Statement 2:** wait system call must be called by process B. Choose the correct answer from below.
6406532757179.
Statement 1 is correct but Statement 2 is incorrect
6406532757180.
Statement 2 is correct but Statement 1 is incorrect
6406532757181.
Both statements are correct
6406532757182.
Both statements are incorrect
A published solution is not available for this question yet.
What is the correct sequence of steps that an attacker would do to inject a payload into the stack
using buffer overflow vulnerabilty?
(i) Put machine code in string larger than the buffer
(ii) Get machine codes of payload
(iii) Find buffer overflow vulnerability in an application
(iv) Copy large string into buffer
6406532757236.
(i) → (ii) → (iii) → (iv)
6406532757237.
(i) → (iii) → (iv) → (ii)
6406532757238.
(ii) → (i) → (iv) → (iii)
6406532757239.
(ii) → (iii) → (i) → (iv)
A published solution is not available for this question yet.
Assume process A is waiting for an input, process B is running, and process C was running before
process B and is now waiting for its turn to run. Select all the correct statements from below.
6406532757175.
A is in RUNNABLE state
6406532757176.
A is in SLEEPING state
6406532757177.
C is in RUNNABLE state
6406532757178.
C is in SLEEPING state
A published solution is not available for this question yet.
Consider the scenario given below in which the requests are serviced by C-SCAN disk scheduling
algorithm.
Start: 12, tracks requested: [11, 0, 3, 4, 14, 8, 17, 9, 1].
Assume there are only 21 tracks in the disk numbered from 0 to 20.
What is the total number of head movements required to service all the requests using the C-
SCAN algorithm?
A published solution is not available for this question yet.
(1) - C-SCAN, (2) - C-LOOK, (3) - SSTF, (4) - FCFS
**LLM**
**Section Id :** 64065357858
**Section Number :** 7
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 12
**Number of Questions to be attempted :** 12
**Section Marks :** 50
**Display Number Panel :** Yes
**Section Negative Marks :** 0
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
Yes
**Clear Response :**
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.
