1
GATE CSE 2021 Set 2
Numerical
+2
-0
Let S be a set consisting of 10 elements. The number of tuples of the form (A, B) such that A and B are subsets of S, and A ⊆ B is _______
Your input ____
2
GATE CSE 2021 Set 2
Numerical
+1
-0
Suppose that P is a 4 × 5 matrix such that every solution of the equation Px = 0 is a scalar multiple of [2 5 4 3 1]T​. The rank of P is _________
Your input ____
3
GATE CSE 2021 Set 2
MCQ (More than One Correct Answer)
+2
-0

Consider a computer system with multiple shared resource types, with one instance per resource type. Each instance can be owned by only one process at a time. Owning and freeing of resources are done by holding a global lock (L). The following scheme is used to own a resource instance:

function OWNRESOURCES(Resource R)

Acquire lock L / / a global lock

if R is available then

Acquire R

Release lock L

else

if R is owned by another process P then

Terminate P, after releasing all resources owned by P

Acquire R

Restart P

Release lock L

end if

end if

end function

Which of the following choice(s) about the above scheme is/are correct?

A
The scheme may lead to starvation.
B
The scheme may lead to live-lock.
C
The scheme ensures that deadlocks will not occur.
D
The scheme violates the mutual exclusion property.
4
GATE CSE 2021 Set 2
MCQ (More than One Correct Answer)
+1
-0
Which of the following statement(s) is/are correct in the context of CPU scheduling?
A
Implementing preemptive scheduling needs hardware support.
B
Turnaround time includes waiting time.
C
Round-robin policy can be used even when the CPU time required by each of the processes is not known apriori.
D
The goal is to only maximize CPU utilization and minimize throughput.
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12