Register
Filter

Answers by goxul

0 votes
42
recurrence equation:
T(1) = 1 T(n) = 2T(n - 1) + n, n ≥ 2 evaluates to (a) 2n + 1 - n – 2 (b) 2n – n (c) 2n + 1 – 2n – 2 (d) 2n – n HOW TO EVALUATES USING MASTER THEOREM
T(1) = 1 T(n) = 2T(n - 1) + n, n ≥ 2 evaluates to(a) 2n + 1 - n – 2(b) 2n – n(c) 2n + 1 – 2n – 2(d) 2n – n HOW TO EVALUATES USING MASTER THEOREM
3 votes
46
GATEBOOK-Combinatorics
How many license plates with 3 decimal digits followed by 3 letters do not contain both the number 0 and the letter O?
How many license plates with 3 decimal digits followed by 3 letters do not contain both the number 0 and the letter O?
0 votes
48
testbook Testseries
An organism is born on day k = 1 with 1 cells. During day k = 2, 3, . . . the organism produces k 2 k−1 times more new cells than it produced on day k − 1. Give a simplified expression for the total of all its cells after n days
An organism is born on day k = 1 with 1 cells. During day k = 2, 3, . . . the organism produces k 2 k−1 times more new cells than it produced on day k − 1. Give a sim...
2 votes
49
me book
how we can solve such type of question?
how we can solve such type of question?
0 votes
50
Prepositions
0 votes
51
TANCET 2011 ALGORITHMS
Suppose f, g, h, k : N → N. If f = O(h) and g = O(k), then 1) f + g = O(h + k) 2) fg = O(hk) 3) Both 1 and 2 4) None of the above
Suppose f, g, h, k : N → N. If f = O(h) and g = O(k), then1) f + g = O(h + k)2) fg = O(hk)3) Both 1 and 24) None of the above
1 votes
54
Example of a countable set which is infinite
I wanted an example of a set which is infinite and countable. Is hair on human head an example of countable set being infinite?
I wanted an example of a set which is infinite and countable. Is hair on human head an example of countable set being infinite?
1 votes
55
Aptitude Doubt
The least number of five digits which is exactly divisible by 12,15 and 18 is: a)10080 b)10800 c)18000 d)81000
The least number of five digits which is exactly divisible by 12,15 and 18 is:a)10080 b)10800 c)18000 d)81000
1 votes
56
You can do it. Passive voice
0 votes
57
PREDICATE LOGIC DOUBT
Only Area 51 has Extra-Terresstrials A(x) = x is Area 51 E(x) = x has Extra-Terresstrials Which of the following is correct? (∀x)(A(x) -> E(x)) (∀x)(E(x) -> A(x)) (∀x)(A(x) <-> E(x))
Only Area 51 has Extra-TerresstrialsA(x) = x is Area 51E(x) = x has Extra-TerresstrialsWhich of the following is correct?(∀x)(A(x) - E(x))(∀x)(E(x) - A(x))(∀x)(A(x)...
1 votes
58
self doubt
what is trivial or nontrivial property of a language please explain?????
what is trivial or nontrivial property of a language please explain?????
1 votes
59
mock test
how to solve this
how to solve this
0 votes
60
Mathematical Logic
prove $(¬A→¬B)∧(A→C)→(B→C)$
prove $(¬A→¬B)∧(A→C)→(B→C)$
2 votes
63
Decidability-12.9.5
Let $L_1$ be a regular language and G be a context-free grammar. Show that the problem "$L_1 \subseteq L(G)$" is undecidable.
Let $L_1$ be a regular language and G be a context-free grammar. Show that the problem "$L_1 \subseteq L(G)$" is undecidable.
3 votes
65
Decidability
Let M1 be a Turing machine and M2 be a finite automaton. Is the problem, whether M1 and M2 accept the same language decidable? An elaborative answer with proof is most welcome.
Let M1 be a Turing machine and M2 be a finite automaton. Is the problem, whether M1 and M2 accept the same language decidable?An elaborative answer with proof is most wel...
0 votes
66
Probability
0 votes
67
Doubt in Compilers
Which of the following optimization techniques are typically applied on loops? (a) Removal of invariant computation (b) Elimination of induction variables (c) Peephole optimization (d) Constant folding
Which of the following optimization techniques are typically applied on loops?(a) Removal of invariant computation (b) Elimination of induction variables(c) Peephole opti...
3 votes
68
TM that accepts input string x
$D = \left \{ M \mid \ M \text{ is a TM that accepts the input string } x \right \}$ What is complement of D and is it Decidable, Turing recognizable or not Turing recognizable?
$D = \left \{ M \mid \ M \text{ is a TM that accepts the input string } x \right \}$What is complement of D and is it Decidable, Turing recognizable or not Turing recogni...
Page: