Dark Mode

Answers by mani312

0 votes

1

GATE CSE 2017 Set 2 | Question: GA-8
$X$ is a $30$ digit number starting with the digit $4$ followed by the digit $7$. Then the number $X^3$ will have $90$ digits $91$ digits $92$ digits $93$ digits

answered in Quantitative Aptitude Jan 27, 2022

9.0k views

0 votes

2

GATE IT 2006 | Question: 25
Consider the undirected graph $G$ defined as follows. The vertices of $G$ are bit strings of length $n$. We have an edge between vertex $u$ and vertex $v$ if and only if $u$ and $v$ differ in exactly one bit position (in other words, $v$ can be obtained from $u$ by ... $\left(\frac{1}{n}\right)$ $\left(\frac{2}{n}\right)$ $\left(\frac{3}{n}\right)$

answered in Graph Theory Nov 18, 2021

10.3k views

0 votes

3

GATE CSE 2004 | Question: 62
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time ... the carry network has been implemented using two-level AND-OR logic. 4 time units 6 time units 10 time units 12 time units

answered in Digital Logic Nov 12, 2021

23.8k views

0 votes

4

GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$

answered in Algorithms Nov 9, 2021

19.2k views

0 votes

5

GATE CSE 2013 | Question: 9
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilon$ and $A \rightarrow a$) to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^{n}$

answered in Compiler Design Apr 29, 2021

19.2k views

1 vote

6

GATE CSE 1998 | Question: 14
Let $G_1 = (N, T, P, S_1)$ be a CFG where, $N=\{S_1, A, B\},T=\{a, b\}$ and $P$ ... $5$ production rules. Is $L_2$ inherently ambiguous?

answered in Compiler Design Apr 28, 2021

3.3k views

5 votes

7

GATE IT 2006 | Question: 32
Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ is always regular never regular always a deterministic context-free language always a context-free language

answered in Theory of Computation Dec 25, 2020

7.5k views