Register

Recent questions tagged true-false

2 votes
1 answer
211
parser
every LL(k) grammer is also SLR(k) grammer. (true / false)
every LL(k) grammer is also SLR(k) grammer. (true / false)
User Avatar
0 votes
1 answer
212
complexity
1.(n + a)b = $\Omega$(nb) for all real numbers a , b >0 2.na+1=theta(nb) iff a=b for all real numbers a , b>0 which is true? Acyclic graph directory structure is more flexible than simple tree structure - true or false
1.(n + a)b = $\Omega$(nb) for all real numbers a , b >02.na+1=theta(nb) iff a=b for all real numbers a , b>0which is true?Acyclic graph directory structure is more flexib...
User Avatar
1 votes
1 answer
213
Algo:- BFS
If in a given graph all edge weights are equal and negative then BFS will correctly find out single source shortest path to all vertices,starting from vertex v? True/False?
If in a given graph all edge weights are equal and negative then BFS will correctly find out single source shortest path to all vertices,starting from vertex v? True/Fals...
User Avatar
0 votes
1 answer
214
GRAPH THEORY
Let G be an undirected graph on n nodes. Any two of the following statements implies the third. Is it true or False? 1. G is connected. 2. G doesn't have cycles. 3. G contain n-1 edges.
Let G be an undirected graph on n nodes. Any two of the following statements implies the third. Is it true or False?1. G is connected.2. G doesn't have cycles.3. G contai...
User Avatar
5 votes
2 answers
215
AVL tree
State If True or False. Give reason too Inserting in an AVL tree with n nodes requires $\Theta \left ( \log n \right )$ rotations
State If True or False. Give reason tooInserting in an AVL tree with n nodes requires $\Theta \left ( \log n \right )$ rotations
User Avatar
2 votes
2 answers
216
Please solve my doubt
Q if any Grammar is LL(1) definitely LALR(1) ? It is true or false Please ans explain in detail.
Q if any Grammar is LL(1) definitely LALR(1) ?It is true or falsePlease ans explain in detail.
User Avatar
1 votes
1 answer
217
True/False?
The depth of any DFS (Depth First Search) tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex. I think in line graph has the same depth in both DFS and BFS. So it may be false.
The depth of any DFS (Depth First Search) tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex.I think in line graph has the...
User Avatar
1 votes
1 answer
218
Parse tree ambiguous or not
If i am wrong please let me correct with giving proper explanation.
If i am wrong please let me correct with giving proper explanation.
User Avatar
2 votes
4 answers
219
Bellman Ford Shortest path
Is the below statement correct: Bellman Ford finds all negative weight cycles in the graph. This is true or false?
Is the below statement correct:Bellman Ford finds all negative weight cycles in the graph.This is true or false?
User Avatar
1 votes
2 answers
220
parsing
State True/False : "LR(0)⊂SLR(1)⊂LALR(1)⊂LR(1)".
State True/False : "LR(0)⊂SLR(1)⊂LALR(1)⊂LR(1)".
User Avatar
0 votes
1 answer
221
self doubta
please explain these few point: how is longest path between any pair of vertices different from diameter of a agraph.? in dijkstra algorithm,each edge is relaxed eaxtly one time..is it true or false?
please explain these few point:how is longest path between any pair of vertices different from diameter of a agraph.?in dijkstra algorithm,each edge is relaxed eaxtly one...
User Avatar
0 votes
2 answers
222
parsers
State Trur/False: "every LL grammar is a proper subset of LR grammar".
State Trur/False: "every LL grammar is a proper subset of LR grammar".
User Avatar
2 votes
1 answer
223
Parsing doubt
$\begin{align*} &\color{blue}{\text{Top down predictive parsers detect errors earlier than bottom up parsers (true/false)}} \\ &\color{maroon}{\text{Justify your answer}} \\ \end{align*}$
$\begin{align*} &\color{blue}{\text{Top down predictive parsers detect errors earlier than bottom up parsers (true/false)}} \\ &\color{maroon}{\text{Justify your answer}}...
User Avatar
1 votes
1 answer
224
[Algorithms] BFS Back edges
True / False? 1. For a directed graph, the absence of back edges with respect to a BFS tree implies that the graph is acyclic. 2. The depth of any DFS tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex.
True / False?1. For a directed graph, the absence of back edges with respect to a BFS tree implies that the graph is acyclic.2. The depth of any DFS tree rooted at a vert...
User Avatar
17 votes
2 answers
225
GATE CSE 1990 | Question: 4-v
State whether the following statements are TRUE or FALSE with reason: The Link-load-and-go loading scheme required less storage space than the link-and-go loading scheme.
State whether the following statements are TRUE or FALSE with reason:The Link-load-and-go loading scheme required less storage space than the link-and-go loading scheme.
User Avatar
4 votes
0 answers
226
GATE CSE 1990 | Question: 4-iv
State whether the following statements are TRUE or FALSE with reason: Transferring data in blocks from the main memory to the cache memory enables an interleaved main memory unit to operate at its maximum speed.
State whether the following statements are TRUE or FALSE with reason:Transferring data in blocks from the main memory to the cache memory enables an interleaved main memo...
User Avatar
9 votes
3 answers
227
GATE CSE 1990 | Question: 4-iii
State whether the following statements are TRUE or FALSE with reason: The flags are affected when conditional CALL or JUMP instructions are executed.
State whether the following statements are TRUE or FALSE with reason:The flags are affected when conditional CALL or JUMP instructions are executed.
User Avatar
19 votes
4 answers
228
GATE CSE 1990 | Question: 4-ii
State whether the following statements are TRUE or FALSE with reason: The data transfer between memory and I/O devices using programmed I/O is faster than interrupt-driven I/O.
State whether the following statements are TRUE or FALSE with reason:The data transfer between memory and I/O devices using programmed I/O is faster than interrupt-driven...
User Avatar
10 votes
1 answer
229
GATE CSE 1990 | Question: 4-i
State whether the following statements are TRUE or FALSE with reason: RAM is a combinational circuit and PLA is a sequential circuit.
State whether the following statements are TRUE or FALSE with reason:RAM is a combinational circuit and PLA is a sequential circuit.
User Avatar
0 votes
1 answer
230
Parsing
which is false? a) An unambiguous grammar has same RMD for every sentence. b)An ambiguous grammar may have an infinite no. of derivation trees for some sentences in the language generated.
which is false?a) An unambiguous grammar has same RMD for every sentence.b)An ambiguous grammar may have an infinite no. of derivation trees for some sentences in the la...
User Avatar
21 votes
3 answers
231
GATE CSE 1987 | Question: 2n
State whether the following statements are TRUE or FALSE: A relation $r$ with schema $(X, Y)$ satisfies the function dependency $X \rightarrow Y$, The tuples $\langle 1, 2\rangle$ and $\langle 2, 2 \rangle$ can both be in $r$ simultaneously.
State whether the following statements are TRUE or FALSE:A relation $r$ with schema $(X, Y)$ satisfies the function dependency $X \rightarrow Y$, The tuples $\langle 1, 2...
User Avatar
14 votes
2 answers
232
GATE CSE 1987 | Question: 2m
State whether the following statements are TRUE or FALSE: The problem as to whether a Turing machine $M$ accepts input $w$ is undecidable.
State whether the following statements are TRUE or FALSE:The problem as to whether a Turing machine $M$ accepts input $w$ is undecidable.
User Avatar
14 votes
4 answers
233
GATE CSE 1987 | Question: 2l
State whether the following statement are TRUE or FALSE. $A$ is recursive if both $A$ and its complement are accepted by Turing machines.
State whether the following statement are TRUE or FALSE.$A$ is recursive if both $A$ and its complement are accepted by Turing machines.
User Avatar
21 votes
4 answers
234
GATE CSE 1987 | Question: 2k
State whether the following statements are TRUE or FALSE: The intersection of two CFL's is also a CFL.
State whether the following statements are TRUE or FALSE:The intersection of two CFL's is also a CFL.
User Avatar
13 votes
2 answers
235
GATE CSE 1987 | Question: 2i
State whether the following statements are TRUE or FALSE: All subsets of regular sets are regular.
State whether the following statements are TRUE or FALSE:All subsets of regular sets are regular.
User Avatar
17 votes
5 answers
236
GATE CSE 1987 | Question: 2h
State whether the following statements are TRUE or FALSE: Regularity is preserved under the operation of string reversal.
State whether the following statements are TRUE or FALSE:Regularity is preserved under the operation of string reversal.
User Avatar
19 votes
3 answers
237
GATE CSE 1987 | Question: 2g
State whether the following statements are TRUE or FALSE: If the number of leaves in a tree is not a power of $2,$ then the tree is not a binary tree.
State whether the following statements are TRUE or FALSE:If the number of leaves in a tree is not a power of $2,$ then the tree is not a binary tree.
User Avatar
2 votes
2 answers
238
GATE CSE 1987 | Question: 2f
State whether the following statements are TRUE or FALSE: Every infinite cyclic group is isomorphic to the infinite cyclic group of integers under addition.
State whether the following statements are TRUE or FALSE:Every infinite cyclic group is isomorphic to the infinite cyclic group of integers under addition.
User Avatar
4 votes
1 answer
239
GATE CSE 1987 | Question: 2e
State whether the following statement is TRUE or FALSE: There is a linear-time algorithm for testing the planarity of finite graphs.
State whether the following statement is TRUE or FALSE:There is a linear-time algorithm for testing the planarity of finite graphs.
User Avatar
22 votes
4 answers
240
GATE CSE 1987 | Question: 2d
State whether the following statements are TRUE or FALSE: The union of two equivalence relations is also an equivalence relation.
State whether the following statements are TRUE or FALSE:The union of two equivalence relations is also an equivalence relation.
User Avatar
Page: