Register

Recent questions tagged gate1992

43 votes
4 answers
31
GATE CSE 1992 | Question: 02,xviii
If $G$ is a context free grammar and $w$ is a string of length $l$ in $L(G)$, how long is a derivation of $w$ in $G$, if $G$ is in Chomsky normal form? $2l$ $2l +1$ $2l -1$ $l$
If $G$ is a context free grammar and $w$ is a string of length $l$ in $L(G)$, how long is a derivation of $w$ in $G$, if $G$ is in Chomsky normal form?$2l$$2l +1$$2l -1$$...
User Avatar
42 votes
8 answers
32
GATE CSE 1992 | Question: 02,xvii
Which of the following regular expression identities is/are TRUE? $r^{(^\ast)} =r^\ast$ $(r^\ast s^\ast)=(r+s)^\ast$ $(r+s)^\ast = r^\ast + s^\ast$ $r^\ast s^\ast = r^\ast+s^\ast$
Which of the following regular expression identities is/are TRUE?$r^{(^\ast)} =r^\ast$$(r^\ast s^\ast)=(r+s)^\ast$$(r+s)^\ast = r^\ast + s^\ast$$r^\ast s^\ast = r^\ast+s^...
User Avatar
24 votes
4 answers
33
GATE CSE 1992 | Question: 02,xvi
Which of the following is/are a tautology? $a \vee b \to b \wedge c$ $a \wedge b \to b \vee c$ $a \vee b \to \left(b \to c \right)$ $a \to b \to \left(b \to c \right)$
Which of the following is/are a tautology?$a \vee b \to b \wedge c$$a \wedge b \to b \vee c$$a \vee b \to \left(b \to c \right)$$a \to b \to \left(b \to c \right)$
User Avatar
23 votes
4 answers
34
GATE CSE 1992 | Question: 02,xix
Context-free languages are: closed under union closed under complementation closed under intersection closed under Kleene closure
Context-free languages are:closed under unionclosed under complementationclosed under intersectionclosed under Kleene closure
User Avatar
24 votes
4 answers
38
GATE CSE 1992 | Question: 02-xi
A computer system has $6$ tape devices, with n processes competing for them. Each process may need $3$ tape drives. The maximum value of n for which the system is guaranteed to be deadlock-free is: $2$ $3$ $4$ $1$
A computer system has $6$ tape devices, with n processes competing for them. Each process may need $3$ tape drives. The maximum value of n for which the system is guarant...
User Avatar
9 votes
4 answers
40
GATE CSE 1992 | Question: 02,viii
A non-planar graph with minimum number of vertices has $9$ edges, $6$ vertices $6$ edges, $4$ vertices $10$ edges, $5$ vertices $9$ edges, $5$ vertices
A non-planar graph with minimum number of vertices has$9$ edges, $6$ vertices$6$ edges, $4$ vertices$10$ edges, $5$ vertices$9$ edges, $5$ vertices
User Avatar
28 votes
5 answers
41
GATE CSE 1992 | Question: 02,vii
A $2-3$ tree is such that All internal nodes have either $2$ or $3$ children All paths from root to the leaves have the same length The number of internal nodes of a $2-3$ tree having $9$ leaves could be $4$ $5$ $6$ $7$
A $2-3$ tree is such thatAll internal nodes have either $2$ or $3$ childrenAll paths from root to the leaves have the same lengthThe number of internal nodes of a $2-3$ t...
User Avatar
9 votes
3 answers
42
GATE CSE 1992 | Question: 02,vi
Which of the following problems is not $\text{NP}$-hard? Hamiltonian circuit problem The $0/1$ Knapsack problem Finding bi-connected components of a graph The graph coloring problem
Which of the following problems is not $\text{NP}$-hard?Hamiltonian circuit problemThe $0/1$ Knapsack problemFinding bi-connected components of a graphThe graph coloring ...
User Avatar
9 votes
2 answers
43
GATE CSE 1992 | Question: 02,v
Start and stop bits do not contain any 'information' but are used in serial communication Error detection Error correction Synchronization Slowing down the communications
Start and stop bits do not contain any 'information' but are used in serial communicationError detectionError correctionSynchronizationSlowing down the communications
User Avatar
39 votes
5 answers
44
GATE CSE 1992 | Question: 02,ix
Following algorithm(s) can be used to sort $n$ in the range $[1\ldots n^3]$ in $O(n)$ time Heap sort Quick sort Merge sort Radix sort
Following algorithm(s) can be used to sort $n$ in the range $[1\ldots n^3]$ in $O(n)$ timeHeap sortQuick sortMerge sortRadix sort
User Avatar
3 votes
0 answers
45
GATE CSE 1992 | Question: 02,iv
02. Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:
02. Choose the correct alternatives (more than one may be correct) and write the corresponding letters only:
User Avatar
30 votes
4 answers
48
GATE CSE 1992 | Question: 02-i
The operation which is commutative but not associative is: AND OR EX-OR NAND
The operation which is commutative but not associative is:ANDOREX-ORNAND
User Avatar
10 votes
1 answer
49
GATE CSE 1992 | Question: 01,x
Maximum number of edges in a planar graph with $n$ vertices is _____
Maximum number of edges in a planar graph with $n$ vertices is _____
User Avatar
16 votes
4 answers
50
GATE CSE 1992 | Question: 01,viii
The purpose of instruction location counter in an assembler is _______
The purpose of instruction location counter in an assembler is _______
User Avatar
7 votes
3 answers
51
GATE CSE 1992 | Question: 01,vii
Macro expansion is done in pass one instead of pass two in a two pass macro assembler because _________
Macro expansion is done in pass one instead of pass two in a two pass macro assembler because _________
User Avatar
11 votes
1 answer
53
GATE CSE 1992 | Question: 01,v
A simple and reliable data transfer can be accomplished by using the 'handshake protocol'. It accomplishes reliable data transfer because for every data item sent by the transmitter _______.
A simple and reliable data transfer can be accomplished by using the 'handshake protocol'. It accomplishes reliable data transfer because for every data item sent by the ...
User Avatar
37 votes
10 answers
54
GATE CSE 1992 | Question: 01,ix
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
User Avatar
7 votes
4 answers
55
GATE CSE 1992 | Question: 01-iv
Many of the advanced microprocessors prefetch instructions and store it in an instruction buffer to speed up processing. This speed up is achieved because ________
Many of the advanced microprocessors prefetch instructions and store it in an instruction buffer to speed up processing. This speed up is achieved because ________
User Avatar
19 votes
2 answers
56
GATE CSE 1992 | Question: 01-iii
Many microprocessors have a specified lower limit on clock frequency (apart from the maximum clock frequency limit) because _____
Many microprocessors have a specified lower limit on clock frequency (apart from the maximum clock frequency limit) because _____
User Avatar
23 votes
4 answers
58
GATE CSE 1992 | Question: 01-i
The Boolean function in sum of products form where K-map is given below (figure) is _______
The Boolean function in sum of products form where K-map is given below (figure) is _______
User Avatar
Page: