Académique Documents
Professionnel Documents
Culture Documents
.C
O
[8+8]
EW
4. a) What is a system call? Explain in brief the types of system calls provided by OS.
b) Give Banker's algorithm and explain with suitable example.
[8+8]
[8+8]
[8+8]
[8+8]
O
R
LD
5. a) List and explain the techniques for structuring the page table.
b) Explain the following program threats.
i) Trojan horse
ii) Stack and Buffer overflow
JN
TU
1 of 1
Set No: 2
.C
O
EW
[8+8]
O
R
LD
4. a) Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600KB (in
order), how would each of the first-fit, best-fit, and worst-fit algorithms place
processes of 236 KB, 543 KB, 92 KB and 350 KB (in order)? Which algorithm makes
the most efficient use of memory?
b) What is RAID? Explain the concept of improvement of reliability via redundancy
and improvement in performance via parallelism.
[8+8]
JN
TU
5. a) Consider the following set of processes, with the length of the CPU-burst time given
in milliseconds:
Process
Burst Time
P1
3
P2
1
P3
5
P4
2
P5
7
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0.
i) Draw four Gnatt charts illustrating the execution of these processes using SJF, and
RR (quantum = 1) scheduling. ii) What is the waiting time of each process for each of
the scheduling algorithms in part (i)?
b) What is segmentation? Explain
[8+8]
6. a) Explain about the interprocess communication.
b) Explain the following system threats i) Viruses ii) Denial of service
[8+8]
[8+8]
[8+8]
Set No: 3
.C
O
[8+8]
EW
[8+8]
[16]
O
R
LD
JN
TU
1 of 1
Set No: 4
.C
O
[8+4+4]
[4+4+8]
EW
O
R
LD
[8+8]
[8+8]
JN
TU
1 of 1
[8+8]