Register

Recent questions tagged test-series

316
views
1 answers
2 votes
Test series
T(n)= T(n-1) + log nAns theta( n log n)Facing problem while solving..Tell me the valid source also to practice and learn .
User Avatar
444
views
1 answers
0 votes
Backtracking
Here , Number of backtracks are 3 or 4 ? I am getting 3 but given answer is 4. Please explain.
User Avatar
539
views
1 answers
0 votes
TestSeries
Can Bfs be applied for topological sort?
User Avatar
1.2k
views
1 answers
1 votes
test series
given an unsorted array with n distinct elements with a property that every element can be atmost k distance from its original position . what is the worst case time co...
User Avatar
433
views
1 answers
2 votes
test series
consider a set of n distinct numbers by comparison find the 3 largest numbers,which of the following is true1.3 largest elements can be found by O(log^2 n) comparisons.2....
User Avatar
1.5k
views
1 answers
2 votes
In basic timestamp ordering, say a transaction T issues write (Q) operation, then which of the below is true?
(TS: time stamp)If TS (T) < Read-TS (Q), then write is rejected and T is rolled backIf TS (T) < write-TS (Q), then write is rejected and T is rolled backBoth (A) and (B)N...
User Avatar
860
views
1 answers
5 votes
Heap - Please explain first statement
User Avatar
639
views
0 answers
0 votes
Test series
User Avatar
1.1k
views
1 answers
1 votes
Will GATEOVERFLOW mock test enough or will I need Mocktests of other institutes?
So, I am just wondering if test series like Madeeasy mocktest, ACE, or other necessary or will Virtual Gate and GO sufficient?
User Avatar
1.8k
views
1 answers
0 votes
gate academy test series
Which of the following are the criteria for CPU scheduling algorithm evaluation.A. Maximum CPU utilization under the constraint that maximum response time is one second.B...
User Avatar
389
views
1 answers
0 votes
runtime enviornment
User Avatar
1.4k
views
1 answers
2 votes
operator grammer
someone please explain how to draw operator precedence table to solve this question.
User Avatar
1.1k
views
1 answers
2 votes
knapsack problem what is answer to this anyone ??
User Avatar
1.5k
views
2 answers
0 votes
Bottom up parsing SDT
User Avatar
522
views
1 answers
–2 votes
LR(1) DFA
User Avatar
710
views
2 answers
0 votes
Fibonacci Series Complexity
PLEASE EXPLAIN HOW TO APPROACH THESE KIND OF PROBLEMS
User Avatar
1.2k
views
1 answers
1 votes
parser
1)shift e2)reduce the configuration3)sr conflict4)rr conflictQues 2 In LL(1) parsing algorithm let X is the topmost symbol of the stack and "a" is a lookahaed symbol the...
User Avatar
5.7k
views
4 answers
4 votes
Tokens, Lexeme and Pattern
There are 40 tokens in this question.But I have doubt that what should be the wording of the question "The number of LEXEMES generated by the Lexical Analyzer in the abov...
User Avatar
539
views
2 answers
2 votes
parsing
what is the output produced for the input "abdbdc" using bottom up and top down parsing ?
User Avatar
325
views
1 answers
2 votes
Finding Minimum
.........
User Avatar
4.8k
views
1 answers
0 votes
Propagation Delay of Not Gates
In the circuit shown below, the propagation delay of each NOT gate is 2 nsec, then the time period of generated square wave is –I think it should be 22ns but it is give...
User Avatar
908
views
1 answers
1 votes
SDT-compiler
what is the output produced for the input "pqsqsr" using the top down parsing?Also what is the result if semantic actions are at right not in middle
User Avatar
2.7k
views
2 answers
4 votes
no of tokens
User Avatar
470
views
0 answers
1 votes
test-series-tree
User Avatar
550
views
1 answers
1 votes
Master Theorem
User Avatar
909
views
1 answers
2 votes
Asymptotic time order
User Avatar
498
views
1 answers
2 votes
Test series
An array ‘A’ of length n contains numbers {0, 1, 2}, numbers are present in array in arbitrary order.The best sorting algorithms, takes 250 units of time when n = 100...
User Avatar
263
views
1 answers
1 votes
#GroupTheory #TestBook
User Avatar
482
views
2 answers
0 votes
Compiler_design_LL(1)
Given answer is 3. I am getting Two entries.Check it once.
User Avatar
1.8k
views
2 answers
2 votes
Algorithm: Selection Sort
Consider the following code which sort all elements of an array ‘A’ in descending order.Which of the following will represents correct value of X, Y, Z in above code ...
User Avatar
Page: