What is the return value of the fork() system call in the child process, assuming fork is successful?
-1
0
The PID of the child process
The PID of the parent process
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Which system call is used to allocate memory in Unix-like operating systems?
malloc()
brk()
exec()
fork()
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Which operation is NOT associated with the Process Control Block (PCB)?
Context switch
Process creation
File system management
Process termination
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Which of the following statements about threads is true?
Threads within the same process do not share memory
Threads within the same process share the same process ID (PID)
Threads within the same process execute independently of each other
Threads within the same process share resources like memory and files
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Which scheduling policy typically results in a shorter average response time for interactive tasks?
First Come First Serve (FCFS)
Shortest Job Next (SJN)
Round Robin
Priority Scheduling
Difficulty Level: 1
Positive Marks: 1.00
Negative Marks: 0.33
Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. The total context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm is ________? Do not count the context switches at time zero and at the end.
2
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider the following process information:

Using FCFS scheduling the average waiting time is ________ units.

2.2
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider the following process information:

Using RR scheduling (time quantum 2 units) the average turnaround time is ________ units.

7.2
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider the following process information:

Using SJF scheduling the average waiting time is ________ units.

1.6
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider the following process information:

Using SRTF scheduling the average waiting time is ________ units.

1.6
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00
Consider the following process information:

Using HRRN scheduling the average waiting time is ________ units

2.2
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.00

Consider the following processes arrive at time 0 in that order ( process 1,2,3,4) with given information. The priority (lowest number is treated as high priority) is used only for Priority scheduling algorithm or as tie breaker

Assuming no context switch overhead, which of the following is the correct order according to the average completion time for First Come First Serve (FCFS), Shortest Job First (SJF) and Priority Scheduling (PR)?

SJF > FCFS = PR

FCFS > PR > SJF

PR > FCFS > SJF

FCFS>SJF>PR

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

Consider the following processes arrive at time 0 in that order ( process 1,2,3,4) with given information.

A round robin scheduling algorithm is used with an initial time quantum of 5 units. The round robin algorithm has no context switch overhead and the time quantum of each process is doubled every cycle (each cycle is complete when each process passes through the ready queue and comes back to ready queue again, i.e, READY -> RUNNING -> READY), the completion time of process P3 is :

34

39

44

45

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

Assume four processes A, B, C and D with burst time a, b, c and d, respectively arrive at same time in that order. The relation between burst times are a<d<c<b. With no context switch delay involved the average turn around time using SJF scheduling algorithm is :

(3a+b+c+d)/4

(3b+2c+d)/4

(4a+3b+c+d)/4

(4a+3d+2c+b)/4
Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66

Consider the following process information table. The average waiting time (AvgWT) and average turnaround time (AvgTAT), using SRTF scheduling algorithm are :

AvgWT= 6.25 , AvgTAT = 12.25

AvgWT= 6, AvgTAT = 12

AvgWT= 6.25, AvgTAT = 12.25

AvgWT= 6.75 , AvgTAT = 12.75

Difficulty Level: 1
Positive Marks: 2.00
Negative Marks: 0.66