Dark Mode

Recent questions tagged testbook-test-series

1 vote

1 answer

301

TestBook Test Series: Compiler Design - Grammar

Sumit1311 asked in Compiler Design Jan 21, 2016

2.2k views

0 votes

2 answers

302

TestBook Test Series: Algorithms - Sorting

Akash Kanase asked in Algorithms Jan 19, 2016

by Akash Kanase

1.1k views

2 votes

4 answers

303

TestBook Test Series: Compiler Design - Lexical Analysis
I think answer should be 13. We got 13 tokens printf ( "string" ++ & & * * * a ) ;

Akash Kanase asked in Compiler Design Jan 19, 2016

by Akash Kanase

1.4k views

0 votes

1 answer

304

TestBook Test Series: Verbal Ability - Passage Reading
I think answer given by them is stupid. ( If anyone is allowed to seat anywhere, people will buy economy class & will want to seat in First class :P I think any option apart from first one does not even make sense :P

Akash Kanase asked in Verbal Aptitude Jan 19, 2016

by Akash Kanase

557 views

6 votes

3 answers

305

Calculating number of tokens
Given solution: Please explain how the number of tokens are 11.

shikharV asked in Compiler Design Jan 19, 2016

18.5k views

0 votes

1 answer

306

Algorithms: Master Method Testbook

Prasanna asked in Algorithms Jan 18, 2016

447 views

4 votes

4 answers

307

TestBook Test Series: Theory Of Computation - Grammar
Number of nodes in the derivation tree when a word of length $2^{k}$ is derived from a grammar in CNF? $2^{k+1} -1$ $3.2^{k+1} - 1$ $2^{k+1} + 1$ $2^{k+1} + 1$

Tushar Shinde asked in Theory of Computation Jan 18, 2016

by Tushar Shinde

2.3k views

0 votes

2 answers

308

TestBook Test Series: Algorithms - Time Complexity

Tushar Shinde asked in Algorithms Jan 18, 2016

by Tushar Shinde

356 views

4 votes

1 answer

309

TestBook Test Series: Databases - Super Keys
I think here even with Ph is removed from table we still get 12 Super keys. Because Salary & One of CK must be there.

Akash Kanase asked in Databases Jan 15, 2016

by Akash Kanase

721 views

0 votes

1 answer

310

TestBook Test Series: CO & Architecture - Cache Memory

Akash Kanase asked in CO and Architecture Jan 15, 2016

by Akash Kanase

578 views

0 votes

2 answers

311

TestBook Test Series: Databases - Transactions

Akash Kanase asked in Databases Jan 15, 2016

by Akash Kanase

508 views

1 vote

1 answer

312

TestBook Test Series: Databases - Sql
Consider $\rm STUDENT$ table with following tuples: SName CPI Deepak 8.7 Dilip 9.7 Kaustav 8.5 Pallab 9.8 Sourav 8.7 Swapnil 8.5 (SELECT * FROM STUDENT S1 WHERE 3 >= (SELECT COUNT(*) FROM STUDENT S2 WHERE S1.CPI <= S2.CPI) ) UNION ( ... ) How many number of tuples are there in the output ? I'm getting $2$ as the answer, while the given answer is $4$.

Akash Kanase asked in Databases Jan 15, 2016

by Akash Kanase

437 views

0 votes

0 answers

313

TestBook Live Test 1 Q No 20
I got that Statement 3 can be false in case we have function 1/n, then its square become 1/n^2. But I don't think statement 2 is true either. Please prove whether I'm correct or wrong.

Akash Kanase asked in Algorithms Jan 15, 2016

by Akash Kanase

393 views

1 vote

1 answer

314

TestBook Test Series: Theory Of Computation - Finite Automata
Only way NFA of 6 states can be reduced to DFA of one state if all remaining 5 states of NFA are useless (Unreachable etc) & THere are no Dead State. In any normal NFA without useless states, I think we need at least same no ... states. !) I do not agree to 1 , as it means that all states other than start state in NFA was useless.

Akash Kanase asked in Theory of Computation Jan 15, 2016

by Akash Kanase

669 views

3 votes

2 answers

315

TestBook Test Series Algo Q
Q). What is the complexity of finding the $50^{th}$ smallest elements in an already constructed binary min-heap? $\theta(1)$ $\theta(logn)$ $\theta(n)$ $\theta(nlogn)$ solution: Exact complexity would be $50logn$ for heapify when we do heap sort iteration $50$ times

Akash Kanase asked in Algorithms Jan 6, 2016

by Akash Kanase

786 views

1 vote

1 answer

316

Verifying Shift-Reduce conflicts in this SLR grammer
S -> BB B -> aB | bB | a | b How many SLR conflicts will occur when we try make parsing table for it. a) 0 b) 1 c) 2 d) None of these ------------------------------------------------------------ ... in Qstn). As you can see, there is such a situation in I3 (left-bottom) and in I4 (right-bottom). So, how many SR conflicts are there 2 or 4 ??

Tushar Shinde asked in Compiler Design Jan 4, 2016

by Tushar Shinde

2.3k views

Page:

« prev
1
...
6
7
8
9
10
11

Recent questions tagged testbook-test-series