1
GATE CSE 1991
Fill in the Blanks
+2
-0
The maximum number of possible edges in an undirected graph with a vertices and $$k$$ components is _________ .
2
GATE CSE 1991
Subjective
+2
-0
Match the pairs in the following question by writing the corresponding letters only. GATE CSE 1991 Operating Systems - Memory Management Question 59 English
3
GATE CSE 1991
True or False
+2
-0
State whether the following statement TRUE or FALSE.

The amount of virtual memory available is limited by the availability of secondary storage.

A
TRUE
B
FALSE
4
GATE CSE 1991
True or False
+2
-0
State whether the following statement TRUE or FALSE.

Any implementation of a critical section requires the use of an indivisible machine instruction such as test-and-set.

A
TRUE
B
FALSE
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12