1
GATE CSE 1995
Subjective
+5
-0
How many minimum spanning tress does the following graph have? Draw them (Weights are assigned to the edges). GATE CSE 1995 Discrete Mathematics - Graph Theory Question 31 English
2
GATE CSE 1995
MCQ (Single Correct Answer)
+2
-0.6
If the proposition $$\neg p \Rightarrow q$$ is true, then the truth value of the proposition $$\neg p \vee \left( {p \Rightarrow q} \right)$$ where $$'\neg '$$ is negation, $$' \vee '$$ is inclusive or and $$' \Rightarrow '$$ is implication, is
A
true
B
multiple-valued
C
false
D
cannot be determined
3
GATE CSE 1995
MCQ (Single Correct Answer)
+1
-0.3
The probability that a number selected at random between $$100$$ and $$999$$ (both inclusive ) will not contain the digit $$7$$ is
A
$${{16} \over {25}}$$
B
$${\left( {{9 \over {10}}} \right)^3}$$
C
$${{27} \over {75}}$$
D
$${{18} \over {25}}$$
4
GATE CSE 1995
MCQ (Single Correct Answer)
+1
-0.3
In a paged segmented scheme of memory management, the segment table itself must have a page table because:
A
The segment table is often too large to fit in one page.
B
Each segment is spread over a number of pages
C
Segment tables point to page table and not to the physical locations of the segment.
D
The processor’s description base register points to a page table.
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