Register
Filter

Answers by Ravi_1511

0 votes
3
ISRO2012-ECE Number system
If $(146)_x + (313) _{x-2} = (246)_ 8$ then the value of $x$ will be $5$ $6$ $7$ $9$
If $(146)_x + (313) _{x-2} = (246)_ 8$ then the value of $x$ will be$5$$6$$7$$9$
1 votes
6
Maximum File Size
I am getting 282. Answer given is 256..??
I am getting 282. Answer given is 256..??
6 votes
9
GATE CSE 2010 | Question: 10
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child? $0$ $1$ $\frac{(n-1)}{2}$ $n-1$
In a binary tree with $n$ nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree ...
2 votes
10
GATE CSE 2010 | Question: 18
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node? $1$ $2$ $3$ $4$
Consider a $B^+$-tree in which the maximum number of keys in a node is $5$. What is the minimum number of keys in any non-root node?$1$$2$$3$$4$
2 votes
16
GATE CSE 2014 Set 3 | Question: 51
If $G$ is the forest with $n$ vertices and $k$ connected components, how many edges does $G$ have? $\left\lfloor\frac {n}{k}\right\rfloor$ $\left\lceil \frac{n}{k} \right\rceil$ $n-k$ $n-k+1$
If $G$ is the forest with $n$ vertices and $k$ connected components, how many edges does $G$ have?$\left\lfloor\frac {n}{k}\right\rfloor$$\left\lceil \frac{n}{k} \right\r...
2 votes
17
LR(1) states
Here what will be the lookahead for first state? Here is given answer:
Here what will be the lookahead for first state?Here is given answer:
0 votes
18
Doubts
An umambiguous grammar has same right most and left most derivation>?? True or false.?
An umambiguous grammar has same right most and left most derivation>??True or false.?
0 votes
20
Ace test Series
Which of the following is CSL?
Which of the following is CSL?
0 votes
23
ACE test series
3 votes
25
GATE CSE 2015 Set 2 | Question: 22
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is $\Theta(n \log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta(1)$
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is$\Theta(n \log n)$$\Thet...
7 votes
26
GATE IT 2004 | Question: 77
Consider the following schedule $S$ of transactions $T1$ and $T2:$ ... only as $T2, T1$ $S$ is serializable both as $T1, T2$ and $T2, T1$ $S$ is not serializable either as $T1,T2$ or as $T2,T1$
Consider the following schedule $S$ of transactions $T1$ and $T2:$$${\begin{array}{l|l}\textbf{T1}& \textbf{T2} \\\hline\text{Read(A)} \\\text{A = A – 10}\\& \text...