Register
Filter

Recent activity by mohan123

3 answers
2
GATE CSE 2007 | Question: 18
Which one of the following is a top-down parser? Recursive descent parser. Operator precedence parser. An LR(k) parser. An LALR(k) parser.
Which one of the following is a top-down parser?Recursive descent parser.Operator precedence parser.An LR(k) parser.An LALR(k) parser.
8 answers
3
GATE IT 2008 | Question: 28
Consider the following Hasse diagrams. Which all of the above represent a lattice? (i) and (iv) only (ii) and (iii) only (iii) only (i), (ii) and (iv) only
Consider the following Hasse diagrams. Which all of the above represent a lattice?(i) and (iv) only(ii) and (iii) only(iii) only(i), (ii) and (iv) only
6 answers
6
GATE CSE 2009 | Question: 6
What is the minimum number of gates required to implement the Boolean function $\text{(AB+C)}$ if we have to use only $2\text{-input NOR}$ gates? $2$ $3$ $4$ $5$
What is the minimum number of gates required to implement the Boolean function $\text{(AB+C)}$ if we have to use only $2\text{-input NOR}$ gates?$2$$3$$4$$5$
2 answers
9
GATE2017 EC-2: GA-8
$1200$ men and $500$ women can build a bridge in $2$ weeks. $900$ men and $250$ women will take $3$ weeks to build the same bridge. How many men will be needed to build the bridge in one week? $3000$ $3300$ $3600$ $3900$
$1200$ men and $500$ women can build a bridge in $2$ weeks. $900$ men and $250$ women will take $3$ weeks to build the same bridge. How many men will be needed to build t...
6 answers
15
GATE CSE 1989 | Question: 1-iv
The transitive closure of the relation $\left\{(1, 2), (2, 3), (3, 4), (5, 4)\right\}$ on the set $\left\{1, 2, 3, 4, 5\right\}$ is ___________.
The transitive closure of the relation $\left\{(1, 2), (2, 3), (3, 4), (5, 4)\right\}$ on the set $\left\{1, 2, 3, 4, 5\right\}$ is ___________.
2 answers
16
ring counter is analogous to
1 answer
18
GATE CSE 1990 | Question: 16a
Show that grammar $G_1$ is ambiguous using parse trees: $G_{1}: S \rightarrow$ if $S$ then $S$ else $S$ $S \rightarrow$ if $S$ then $S$
Show that grammar $G_1$ is ambiguous using parse trees:$G_{1}: S \rightarrow$ if $S$ then $S$ else $S$ $S \rightarrow$ if $S$ then $S$
4 answers
20
GATE CSE 2015 Set 1 | Question: 24
A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index. Then that index is called Dense Sparse Clustered Unclustered
A file is organized so that the ordering of the data records is the same as or close to the ordering of data entries in some index. Then that index is calledDenseSparseCl...
4 answers
21
GATE CSE 2013 | Question: 7
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of $n$ nodes? $O(1)$ $O(\log n)$ $O(n)$ $O(n \log n)$
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of $n$ nodes?$O(1)$$O(\log n)$...
6 answers
22
GATE CSE 1987 | Question: 1-V
The most relevant addressing mode to write position-independent codes is: Direct mode Indirect mode Relative mode Indexed mode
The most relevant addressing mode to write position-independent codes is:Direct modeIndirect modeRelative modeIndexed mode
4 answers
28
GATE CSE 2016 Set 2 | Question: 09
Let $X$ be the number of distinct $16$-bit integers in $2's$ complement representation. Let $Y$ be the number of distinct $16$-bit integers in sign magnitude representation Then $X - Y$ is______.
Let $X$ be the number of distinct $16$-bit integers in $2's$ complement representation. Let $Y$ be the number of distinct $16$-bit integers in sign magnitude representati...