1
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+2
-0.6
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?

Process Arrival Time Processing Time
A 0 3
B 1 6
D 4 4
E 6 2

A
First Come First Serve
B
Non-preemptive Shortest Job First
C
Shortest Remaining Time
D
Round Robin with Quantum value two
2
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+1
-0.3
The maximum number of processes that can be in $$Ready$$ state for a computer system with $$n$$ $$CPUs$$ is
A
$$n$$
B
$${n^2}$$
C
$${2^n}$$
D
Independent of $$n$$
3
GATE CSE 2015 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Consider the following C program segment.
#include < stdio.h >
int main()
{
    char s1[7] = "1234", *p;
    p = s1 + 2;
   *p = ā€˜0’;
    printf("%s", s1);
}
What will be printed by the program?
A
12
B
120400
C
1204
D
1034
4
GATE CSE 2015 Set 3
Numerical
+1
-0
Consider a software program that is artificially seeded with $$100$$ faults. While testing this program, $$159$$ faults are detected, out of which $$75$$ faults are from those artificially seeded faults. Assuming that both real and seeded faults are of same nature and have same distribution, the estimated number of undetected real faults is ____________.
Your input ____
EXAM MAP