Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged true-false
5
5 votes
2
answers
2 answers
1.5k
1.5k views
AVL tree
State If True or False. Give reason tooInserting in an AVL tree with n nodes requires $\Theta \left ( \log n \right )$ rotations
srestha
1.5k
views
asked
Sep 15, 2017
Data Structures
data-structures
avl-tree
true-false
+
–
2
2 votes
2
2 answers
1.3k
1.3k views
Please solve my doubt
Q if any Grammar is LL(1) definitely LALR(1) ?It is true or falsePlease ans explain in detail.
kallu singh
1.3k
views
asked
Sep 5, 2017
Compiler Design
compiler-design
parsing
ll-parser
lr-parser
true-false
+
–
1
1 vote
1
1 answer
2.6k
2.6k views
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...
dileswar sahu
2.6k
views
asked
Sep 2, 2017
Algorithms
algorithms
graph-algorithms
true-false
+
–
1
1 vote
1
answers
1 answer
1.0k
1.0k views
Parse tree ambiguous or not
If i am wrong please let me correct with giving proper explanation.
learner_geek
1.0k
views
asked
Aug 2, 2017
Compiler Design
compiler-design
parsing
ambiguous-grammar
true-false
+
–
2
2 votes
4
4 answers
2.6k
2.6k views
Bellman Ford Shortest path
Is the below statement correct:Bellman Ford finds all negative weight cycles in the graph.This is true or false?
Bongbirdie
2.6k
views
asked
Apr 6, 2017
Algorithms
algorithms
shortest-path
bellman-ford
true-false
+
–
1
1 vote
2
answers
2 answers
881
881 views
parsing
State True/False : "LR(0)⊂SLR(1)⊂LALR(1)⊂LR(1)".
gate_forum
881
views
asked
Dec 31, 2016
Compiler Design
compiler-design
parsing
lr-parser
true-false
+
–
0
0 votes
1
answers
1 answer
1.4k
1.4k views
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...
Akriti sood
1.4k
views
asked
Dec 28, 2016
Algorithms
graph-theory
dijkstras-algorithm
true-false
+
–
0
0 votes
2
2 answers
745
745 views
parsers
State Trur/False: "every LL grammar is a proper subset of LR grammar".
gate_forum
745
views
asked
Dec 21, 2016
Compiler Design
compiler-design
parsing
bad-question
true-false
+
–
2
2 votes
1
1 answer
2.2k
2.2k views
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}}...
Anusha Motamarri
2.2k
views
asked
Dec 19, 2016
Compiler Design
compiler-design
parsing
true-false
+
–
1
1 vote
1
1 answer
3.1k
3.1k views
[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 vert...
rahul sharma 5
3.1k
views
asked
Dec 15, 2016
Algorithms
algorithms
graph-algorithms
true-false
+
–
21
21 votes
2
2 answers
5.8k
5.8k views
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.
Misbah Ghaya
5.8k
views
asked
Nov 23, 2016
Compiler Design
gate1990
true-false
compiler-design
runtime-environment
+
–
5
5 votes
3
3 answers
4.0k
4.0k views
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 memo...
Misbah Ghaya
4.0k
views
asked
Nov 23, 2016
CO & Architecture
gate1990
true-false
co-and-architecture
cache-memory
memory-interfacing
+
–
18
18 votes
7
7 answers
6.0k
6.0k views
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.
Misbah Ghaya
6.0k
views
asked
Nov 23, 2016
CO & Architecture
gate1990
true-false
co-and-architecture
instruction-execution
+
–
33
33 votes
5
answers
5 answers
11.7k
11.7k views
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...
Misbah Ghaya
11.7k
views
asked
Nov 23, 2016
CO & Architecture
gate1990
true-false
co-and-architecture
io-handling
interrupts
+
–
10
10 votes
1
1 answer
7.4k
7.4k views
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.
Misbah Ghaya
7.4k
views
asked
Nov 23, 2016
Digital Logic
gate1990
true-false
digital-logic
ram
pla
non-gatecse
+
–
0
0 votes
1
1 answer
916
916 views
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 la...
Sanket_
916
views
asked
Nov 10, 2016
Compiler Design
compiler-design
parsing
ambiguous-grammar
true-false
+
–
50
50 votes
6
answers
6 answers
9.7k
9.7k views
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...
Misbah Ghaya
9.7k
views
asked
Nov 9, 2016
Databases
gate1987
databases
database-normalization
true-false
+
–
19
19 votes
5
answers
5 answers
7.0k
7.0k views
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.
Misbah Ghaya
7.0k
views
asked
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
turing-machine
decidability
true-false
+
–
21
21 votes
5
answers
5 answers
6.8k
6.8k views
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.
Misbah Ghaya
6.8k
views
asked
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
turing-machine
decidability
true-false
+
–
27
27 votes
4
answers
4 answers
6.5k
6.5k views
GATE CSE 1987 | Question: 2k
State whether the following statements are TRUE or FALSE:The intersection of two CFL's is also a CFL.
Misbah Ghaya
6.5k
views
asked
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
context-free-language
true-false
+
–
18
18 votes
2
answers
2 answers
4.7k
4.7k views
GATE CSE 1987 | Question: 2i
State whether the following statements are TRUE or FALSE:All subsets of regular sets are regular.
Misbah Ghaya
4.7k
views
asked
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
regular-language
true-false
+
–
22
22 votes
5
answers
5 answers
6.4k
6.4k views
GATE CSE 1987 | Question: 2h
State whether the following statements are TRUE or FALSE:Regularity is preserved under the operation of string reversal.
Misbah Ghaya
6.4k
views
asked
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
regular-language
true-false
+
–
27
27 votes
4
answers
4 answers
8.8k
8.8k views
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.
Misbah Ghaya
8.8k
views
asked
Nov 9, 2016
Data Structures
gate1987
data-structures
binary-tree
true-false
+
–
3
3 votes
2
2 answers
1.5k
1.5k views
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.
Misbah Ghaya
1.5k
views
asked
Nov 9, 2016
Graph Theory
gate1987
graph-theory
graph-isomorphism
true-false
out-of-gatecse-syllabus
+
–
12
12 votes
2
2 answers
3.1k
3.1k views
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.
Misbah Ghaya
3.1k
views
asked
Nov 9, 2016
Graph Theory
gate1987
graph-theory
graph-planarity
true-false
+
–
31
31 votes
5
answers
5 answers
10.1k
10.1k views
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.
Misbah Ghaya
10.1k
views
asked
Nov 9, 2016
Set Theory & Algebra
gate1987
set-theory&algebra
relations
true-false
+
–
43
43 votes
8
answers
8 answers
11.7k
11.7k views
GATE CSE 1987 | Question: 2c
State whether the following statements are TRUE or FALSE:It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given?
Misbah Ghaya
11.7k
views
asked
Nov 9, 2016
Data Structures
gate1987
binary-tree
data-structures
normal
true-false
+
–
15
15 votes
4
4 answers
4.3k
4.3k views
GATE CSE 1987 | Question: 2b
State whether the following statements are TRUE or FALSE:Data transfer between a microprocessor and an I/O device is usually faster in memory-mapped-I/O scheme than in I/...
Misbah Ghaya
4.3k
views
asked
Nov 9, 2016
CO & Architecture
gate1987
co-and-architecture
io-handling
true-false
+
–
13
13 votes
5
5 answers
6.5k
6.5k views
GATE CSE 1987 | Question: 2a
State whether the following statements are TRUE or FALSEIn a microprocessor-based system, if a bus (DMA) request and an interrupt request arrive sumultaneously, the micro...
Misbah Ghaya
6.5k
views
asked
Nov 9, 2016
CO & Architecture
gate1987
co-and-architecture
interrupts
io-handling
true-false
+
–
0
0 votes
1
1 answer
520
520 views
Gate practice question
True or false1. b*a* intersection a*b* = a* union b*2. If L is regular, the minimum state DFA for both L and ~L(complement) have same number of states.
Ravi_1511
520
views
asked
Nov 8, 2016
Theory of Computation
regular-language
true-false
+
–
Page:
« prev
1
...
4
5
6
7
8
9
10
next »