A SAMPLE GATE QUIZ FOR THOSE WHO ARE PREPARING FOR THE GATE
9
8
512
258
Commutativity
Associativity
Existence of inverse for every element
Existence of identity
2
3
N-1
N
No two vertices have the same degree.
At least two vertices have the same degree
At least three vertices have the same degree.
All vertices have the same degree.
R is symmetric but NOT antisymmetric
R is NOT symmetric but antisymmetric
R is both symmetric and antisymmetric
R is neither symmetric nor antisymmetric
(1217)16
(028F)16
(2297)10
(0B17)16
2
3
4
5
8
32
64
128
As soon as an interrupt is raised
By checking the interrupt register at the end of fetch cycle.
By checking the interrupt register after finishing the execution of the current instruction.
By checking the interrupt register at fixed time intervals.
FIFO
OPTIMAL
LRU
MRU
Virtual page numbe
Page frame number
Both virtual page number and page frame number
Access right information
θ(n)
θ(n log n)
θ(n )
θ(n log n)
All palindromes.
All odd length palindromes.
Strings that begin and end with the same symbol
All even length palindromes.
P only
Q only
Both P and Q
Neither P nor Q
There is no polynomial time algorithm for π
If A π can be solved deterministically in polynomial time, then P = NP.
If A π is NP-hard, then it is NP-complete.
π may be undecidable.
The set of all strings containing the substring 00.
The set of all strings containing at most two 0’s.
The set of all strings containing at least two 0’s.
The set of all strings that begin and end with either 0 or 1.
There is unique minimal DFA for every regular language
Every NFA can be converted to an equivalent PDA.
Complement of every context-free language is recursive.
Every nondeterministic PDA can be converted to an equivalent deterministic PDA.
P-4. Q-1, R-2, S-3
P-3, Q-1, R-4, S-2
P-3, Q-4, R-1, S-2
P-2, Q-1, R-4, S-3
6
8
14
15
I-II-III-IV-V
I-II-III-IV-V
I-III-V -II-IV
IV-II-V -III-I
I only
I and II
II and III
IV only
It reduces the memory access time to read or write a memory location.
It helps to reduce the size of page table needed to implement the virtual address space of a process
It is required by the translation lookaside buffer.
It helps to reduce the number of page faults in page replacement algorithms.
θ(n)
θ(n log n)
θ(n*n)
θ(n*n log n)
95ms
119ms
233ms
276ms
2
3
4
5
Quiz Review Timeline +
Our quizzes are rigorously reviewed, monitored and continuously updated by our expert board to maintain accuracy, relevance, and timeliness.