1 votes
165
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...
2 votes
166
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 ...
6 votes
168
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...
1 votes
171
3 votes
173
3 votes
175
How many memory refernces are required for fetching and executing each of the following instructions?(a)ADD 50(R­1),R2 b)SUB (R­1)+R­2­
2 votes
176
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 ...
1 votes
177
5 votes
178
How many times 8 is pushed into stack ? a detail answer will be welcomed.
5 votes
180
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
3 votes
181
Consider an array of 19 elements, Find the minimum number of comparisons required to find minimum and maximum elements in an array
4 votes
183
35 votes
184
26 votes
185
State whether the following statements are TRUE or FALSE:The problem as to whether a Turing machine $M$ accepts input $w$ is undecidable.
27 votes
186
State whether the following statement are TRUE or FALSE.$A$ is recursive if both $A$ and its complement are accepted by Turing machines.
31 votes
187
35 votes
188
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.
4 votes
189
State whether the following statements are TRUE or FALSE:Regularity is preserved under the operation of string reversal.