1
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
A process executes the following code
for (i = 0; i < n; i + +) fork ( ); 
The total number of child processes created is
A
$$n$$
B
$${2^n} - 1$$
C
$${2^n}$$
D
$${2^{n + 1}} - 1$$
2
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Which of the following is/are true of the auto-increment addressing mode?
$${\rm I}.\,\,\,$$ It is useful in creating self-relocating code
$${\rm II}.\,\,\,$$ If it is included in an Instruction Set Architecture, then an additional $$ALU$$ is required for effective address calculation.
$${\rm III}.\,\,\,$$ The amount of increment depends on the size of the data item accessed
A
$${\rm I}$$ only
B
$${\rm II}$$ only
C
$${\rm III}$$ only
D
$${\rm II}$$ & $${\rm III}$$ only
3
GATE CSE 2007
MCQ (Single Correct Answer)
+2
-0.6
An operating system uses Shortest Remaining Time first $$(SRT)$$ process scheduling algorithm. Consider the arrival times and execution times for the following processes: GATE CSE 2007 Operating Systems - Process Concepts and Cpu Scheduling Question 23 English

What is the total waiting time for process $$P2?$$

A
$$5$$
B
$$15$$
C
$$40$$
D
$$55$$
4
GATE CSE 2006
MCQ (Single Correct Answer)
+2
-0.6
Consider three processes (process id $$0,1,2,$$ respectively) with compute time bursts $$2, 4,$$ and $$8$$ time units. All processes arrive at time zero. Consider the longest remaining time first $$(LRTF)$$ scheduling algorithm. In $$LRTF$$ ties are broken by giving priority to the process with the lowest process id. The average turn around time is
A
$$13$$ units
B
$$14$$ units
C
$$15$$ units
D
$$16$$ units
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
CBSE
Class 12