Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Prashant.
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Prashant.
5
votes
161
Compiler SDT Evaluation
342
views
answered
Nov 14, 2016
Compiler Design
compiler-design
syntax-directed-translation
numerical-answers
test-series
+
–
5
votes
162
Compiler Parse Tree Evaluation
479
views
answered
Nov 14, 2016
Compiler Design
compiler-design
parsing
expression-evaluation
test-series
+
–
5
votes
163
Compiler SDT Evaluation
1.3k
views
answered
Nov 14, 2016
Compiler Design
compiler-design
syntax-directed-translation
expression-evaluation
test-series
+
–
5
votes
164
no of comparisons are needed in the worst case to find min and max in an array
745
views
answered
Nov 13, 2016
Algorithms
sorting
+
–
1
votes
165
decidiability
Which of the following statements is/are true? I. If L is decidable, LR may or may not be decidable. II. If L⊆{0}*, then L is decidable III. If L≤m {0n 1n│n≥0}, then L is Decidable
Which of the following statements is/are true?I. If L is decidable, LR may or may not be decidable.II. If L⊆{0}*, then L is decidableIII. If L≤m {0n 1n│n≥0}, then...
341
views
answered
Nov 13, 2016
2
votes
166
Language regular or not?
L={w(wR)* , w=(a+b)* }. Is this language regular? According to me it should not be regular as we can have strings of form wwR which is not regular but the answer is that its a regular language.
L={w(wR)* , w=(a+b)* }. Is this language regular?According to me it should not be regular as we can have strings of form wwR which is not regular but the answer is that ...
548
views
answered
Nov 13, 2016
Theory of Computation
theory-of-computation
regular-language
+
–
1
votes
167
Asymptotic functions
When can i used logarithms to compare two functions asymptotically? What is the procedure and rules? If we have n^2 ans n^3..if we compare using logarithms..thwn they tuen out to be asymptotically equal.should i then compare them by "not" ignoring the constant terms?.
When can i used logarithms to compare two functions asymptotically?What is the procedure and rules?If we have n^2 ans n^3..if we compare using logarithms..thwn they tuen ...
435
views
answered
Nov 13, 2016
Algorithms
logarithmic-function
asymptotic-notation
+
–
6
votes
168
Location of element using Row Major Order
My question is : in the row [8][-8] to [8][5] will be 5-(-8)+1 = 14 elements , right ? so , it should be 1060 then considering 4 Byte is one element. I know , this is pretty basic question. But , still got me wrong :)
My question is : in the row [8][-8] to [8][5] will be 5-(-8)+1 = 14 elements , right ? so , it should be 1060 then considering 4 Byte is one element.I know , this is pret...
3.7k
views
answered
Nov 13, 2016
DS
data-structures
+
–
1
votes
169
correct ?
Which of the following statement(s) is/are correct? I.A constraint showing the maximum number of entities to which another entity can be associated via a relationship set is called participation constraint. II.The number of entity sets participating in the relationship is known as the degree of that relationship
Which of the following statement(s) is/are correct?I.A constraint showing the maximum number of entities to which another entity can be associated via a relationship set ...
615
views
answered
Nov 13, 2016
1
votes
170
Priority Queue Delete
826
views
answered
Nov 12, 2016
Algorithms
algorithms
time-complexity
test-series
+
–
1
votes
171
Finding if decomposition is in 3NF
Consider the relation $R(A,B,C,D,E)$ with $FD\{ A\rightarrow C, D\rightarrow CE\} $. Which of the following decomposition is in 3NF? (A) $R_1(A,C); R_2(B,E); R_3(A,B,D)$ (B) $R_1(A,C); R_2(D,C,E); R_3(A,B,D)$ (C) Already is in 3NF (D) None of these
Consider the relation $R(A,B,C,D,E)$ with $FD\{ A\rightarrow C, D\rightarrow CE\} $. Which of the following decomposition is in 3NF?(A) $R_1(A,C); R_2(B,E); R_3(A,B,D)$(B...
576
views
answered
Nov 12, 2016
Databases
databases
database-normalization
+
–
3
votes
172
Select the correct statement about TTL
Select the correct statement about TTL (Time to Live) field in IP: I. TTL value can never be increased while the packet is going from source machine to destination machine. II. Whenever TTL value is decreased at each intermediate node, its value is alwyas decrmeented by 1 , not more than that. a. I only b. II only c. Both I and II d. Neither I nor II
Select the correct statement about TTL (Time to Live) field in IP:I. TTL value can never be increased while the packet is going from source machine to destination machin...
2.3k
views
answered
Nov 12, 2016
Computer Networks
computer-networks
+
–
3
votes
173
ACE Database Grand Test-1
291
views
answered
Nov 12, 2016
3
votes
174
Compiler-LL(1)/LL(0)
4.1k
views
answered
Nov 12, 2016
Compiler Design
compiler-design
parsing
ll-parser
test-series
+
–
3
votes
175
How many memory refernces are required for fetching and executing...
How many memory refernces are required for fetching and executing each of the following instructions? (a)ADD 50(R1),R2 b)SUB (R1)+R2
How many memory refernces are required for fetching and executing each of the following instructions?(a)ADD 50(R1),R2 b)SUB (R1)+R2
3.5k
views
answered
Nov 11, 2016
CO and Architecture
co-and-architecture
+
–
2
votes
176
Conflict serializability when schedule contains commit
Is following schedule conflict serializable? $W_1(x), W_2(x),C_2,W_1(x),C_1$ Does existence of commit operation have any effect on deciding conflict serializability of the schedule?
Is following schedule conflict serializable?$W_1(x), W_2(x),C_2,W_1(x),C_1$Does existence of commit operation have any effect on deciding conflict serializability of the ...
3.1k
views
answered
Nov 11, 2016
1
votes
177
which of the following instr. is needed if we want to convert from Kernel mode to User mode in OS?
option a) Previlized instr. with interrupt Option b) Non previlized instr option c) Previlized instr. without interrupt
option a) Previlized instr. with interruptOption b) Non previlized instroption c) Previlized instr. without interrupt
506
views
answered
Nov 11, 2016
5
votes
178
DFS based question
How many times 8 is pushed into stack ? a detail answer will be welcomed.
How many times 8 is pushed into stack ? a detail answer will be welcomed.
2.5k
views
answered
Nov 10, 2016
Programming in C
stack
graph-theory
depth-first-search
+
–
3
votes
179
Testbook :
$S_1 :$ Recursive decent parser takes more time and less space. $S_2 :$ LL(1) Parser takes more time and more space. $S_3 :$ LL(1) Parser takes less time and less space. $S_4 :$ Recursive descent Parser takes more time and more space. a). (1) and (2) is ... and (3) is correct. Ques2: Consider $2^{nd}$ production as $\tt A \rightarrow Bc|dA|\epsilon$ (I think answer given is wrong)
$S_1 :$ Recursive decent parser takes more time and less space.$S_2 :$ LL(1) Parser takes more time and more space.$S_3 :$ LL(1) Parser takes less time and less space.$S_...
837
views
answered
Nov 10, 2016
Compiler Design
compiler-design
parsing
testbook-test-series
+
–
5
votes
180
What does a foreign key refer?
A foreign key can refer to columns in another table, that are A. Primary key only B. Candidate key only C. Unique column only. D. Foreign key can refer any column
A foreign key can refer to columns in another table, that areA. Primary key onlyB. Candidate key onlyC. Unique column only.D. Foreign key can refer any column
2.7k
views
answered
Nov 9, 2016
Databases
databases
+
–
3
votes
181
Arrays
Consider an array of 19 elements, Find the minimum number of comparisons required to find minimum and maximum elements in an array
Consider an array of 19 elements, Find the minimum number of comparisons required to find minimum and maximum elements in an array
1.0k
views
answered
Nov 9, 2016
Algorithms
algorithms
sorting
normal
numerical-answers
+
–
5
votes
182
GATE CSE 2006 | Question: 48
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $2$ ... exist a cycle in $G$ containing $u$ and $ν$ There must exist a cycle in $G$ containing $u$ and all its neighbours in $G$
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $...
20.9k
views
answered
Nov 9, 2016
Algorithms
gatecse-2006
algorithms
graph-algorithms
normal
+
–
4
votes
183
c programming
623
views
answered
Nov 9, 2016
Programming in C
programming-in-c
+
–
35
votes
184
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...
3.5k
views
answered
Nov 9, 2016
Databases
gate1987
databases
database-normalization
true-false
+
–
26
votes
185
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.
3.9k
views
answered
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
turing-machine
decidability
true-false
+
–
27
votes
186
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.
3.5k
views
answered
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
turing-machine
decidability
true-false
+
–
31
votes
187
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.
3.3k
views
answered
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
context-free-language
true-false
+
–
35
votes
188
GATE CSE 1987 | Question: 2j
State whether the following statements are TRUE or FALSE: A minimal DFA that is equivalent to an NDFA with $n$ nodes has always $2^{n}$ states.
State whether the following statements are TRUE or FALSE:A minimal DFA that is equivalent to an NDFA with $n$ nodes has always $2^{n}$ states.
5.1k
views
answered
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
finite-automata
minimal-state-automata
+
–
4
votes
189
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.
3.6k
views
answered
Nov 9, 2016
Theory of Computation
gate1987
theory-of-computation
regular-language
true-false
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
21
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register