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
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
3
GATE CSE 1991
True or False
+2
-0
State whether the following statement TRUE or FALSE.

The $$LRU$$ page-replacement policy may cause thrashing for some type of programs.

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

The use of monitors ensures that no dead -locks will be caused.

A
TRUE
B
FALSE
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