Register

Recent questions tagged testbook-test-series

0 votes
0 answers
152
Testbook Test Series: Probability - Probability
Chandler is selling tickets for \$1 per ticket. In the queue for tickets, there are m people with a single \$ ... (m+1) (b) 2 / (m+1) (c) 18 / (m)(m+1)(m+2) (d) (m-2) / (m+2)
Chandler is selling tickets for \$1 per ticket. In the queue for tickets, there are ‘m‘ people with a single \$1 coin and 2 with a \$2 coin. Each person in the queue ...
User Avatar
0 votes
0 answers
153
Testbook Test Series: General Aptitude: Numerical Aptitude
On a grid of 6*5 ,how many ways exist to get from Top-Left corner to the Bottom-Right corner if You can only move one unit Right or One unit Down at a time.
On a grid of 6*5 ,how many ways exist to get from Top-Left corner to the Bottom-Right corner if You can only move one unit Right or One unit Down at a time.
User Avatar
0 votes
0 answers
154
testbook test series
None of these according to me.
None of these according to me.
User Avatar
0 votes
1 answer
159
Test Book- Complier Design
Consider the following issues Simplifies the phases. Compiler efficiency is improved. Compiler works faster. Does not require a stack. Which is/are true in context of lexical analysis? pls provide an explanation as well..
Consider the following issuesSimplifies the phases.Compiler efficiency is improved.Compiler works faster.Does not require a stack.Which is/are true in context of lexical ...
User Avatar
0 votes
1 answer
164
test series - Testbook
Which of the following functions given by their recurrences grows the fastest asymptotically? $T(n) = 8T(n/4) + 100n^2$ $T(n) = 81T(n/9) + 10n^2$ $T(n) = 16T(n/4)+ 100(n \log n)^{1.99}$ $T(n) = 100T(n/100)+ n \log^2 n$
Which of the following functions given by their recurrences grows the fastest asymptotically?$T(n) = 8T(n/4) + 100n^2$$T(n) = 81T(n/9) + 10n^2$$T(n) = 16T(n/4)+ 100(n \lo...
User Avatar
0 votes
1 answer
165
Testbook Test Series: Databases - Transactions
Let a schedule be strict recoverable schedule then it will suffer from which problem? 1.ww 2.rw 3.wr 4.lost update
Let a schedule be strict recoverable schedule then it will suffer from which problem? 1.ww2.rw3.wr4.lost update
User Avatar
0 votes
0 answers
176
Testbook Test Series: Digital Logic - Flip Flop
Assume the initial state of the clock and the flip flop is LOW (=0). If the frequency of the clock signal is f with 50% duty cycle and the flip-flop delay (< Tclk/2) the output frequency is ?
Assume the initial state of the clock and the flip flop is LOW (=0). If the frequency of the clock signal is f with 50% duty cycle and the flip-flop delay (< Tclk/2) the...
User Avatar
Page: