Register

Recent questions tagged test-series

395
views
2 answers
2 votes
time complextiy
User Avatar
583
views
1 answers
1 votes
Compiler-Design SDT
User Avatar
1.1k
views
1 answers
1 votes
OS TEST
Consider a byte addressable virtual memory system with 34-bit addresses where the first 23 bits are used as a page number, and the last 11 bits is the offset. Suppose the...
User Avatar
340
views
0 answers
0 votes
Test series
How it solve this ?
User Avatar
642
views
1 answers
1 votes
test series
Arrange the following functions in asymptotically increasing orderf1(n) = n0.999999 log nf2(n) = 10000000nPlease explain your solution. Thanks
User Avatar
811
views
1 answers
1 votes
test series
How many DFA states are constructed for the following augmented grammar using LR(0) parser?S'->S$S->x|(A)A->A,S|SWhere S is the start symbol and S′ → S$ is augmented ...
User Avatar
396
views
2 answers
0 votes
Algo-test
Let f (n) = Ο(n), g(n) = Ο(n) and h(n) = θ(n).Then [f (n) . g(n)] + h(n) is : a) Ο(n) b)θ(n)I think it must be 0(n)
User Avatar
822
views
2 answers
2 votes
GateForum Test Series
Assume we have two dimensional array of size 100x100, each element is occupying 4 bytes and array is stored in row major order. Further assume RAM is 1MB and cache is 4KB...
User Avatar
2.5k
views
2 answers
0 votes
test series
Consider the following statements:S1 : Three-address code is a linearized representation of syntax tree.S2 : The syntax tree not depicts the natural hierarchical structur...
User Avatar
466
views
2 answers
2 votes
Nielit
I studies in my book that time complexity of buble sort in best case =n^2 but I found it here ....its wrong ? If correct then how
User Avatar
288
views
0 answers
0 votes
Gatebook test
Consider the following code. int a = 1;int b = 1;Function foo() {print(a); }Function bar(int x, int y){int a = 0;foo() ;x = 0 ;b = b-y;r = Y+1;}Function foobar() {int r =...
User Avatar
518
views
1 answers
0 votes
test-series
What is the time complexity of the following code snippet? Assume x is a global variable and “statement” takes O(n) time?
User Avatar
401
views
0 answers
1 votes
Transaction
User Avatar
405
views
1 answers
2 votes
Transaction
User Avatar
609
views
1 answers
3 votes
transaction
User Avatar
599
views
2 answers
0 votes
Algo:- Test series
Consider the following code:Which of the following represents the number of additions performed by above code?
User Avatar
780
views
1 answers
1 votes
algorithm
User Avatar
281
views
1 answers
0 votes
class test
Which of the following strings will match the linux regex a?b*?1. (empty string)2. b,bb,bbb.... and ab,abb,abbb......3. both a and b4. acbd, acbde and acbdef
User Avatar
694
views
3 answers
0 votes
class test
m=1;for i=1 to n do begin m=m*3; for j=1 to m do {Something which is O(1)}What is the complexity of above algorithm?1. O(n*m3)2. O(n3)3. O(3n)...
User Avatar
581
views
2 answers
0 votes
LL1 grammer
User Avatar
1.7k
views
2 answers
0 votes
MadeEasy Test Series: Algorithms - Hashing
S1 :- if load factor of hash table is less than 1 then there are no collisionS2:- As the size of hash table increases, the number of collisions will decrease.True false?
User Avatar
714
views
1 answers
0 votes
Test Series
Please explain why first option is wrong
User Avatar
1.2k
views
1 answers
1 votes
DFS- Depth First Search
User Avatar
458
views
0 answers
4 votes
How to solve test series questions?
Hi All,Here, I have seen many fellow aspirants discuss questions from their respective test series where they try to validate their answers from here but the given answer...
User Avatar
396
views
0 answers
1 votes
MadeEasy Test Series: Databases - Transactions
Deadlock prevention(wait-kill && wound-wait) is free from both starvation as well as deadlock?True or false?
User Avatar
801
views
3 answers
1 votes
AVL tree rotations
User Avatar
1.2k
views
1 answers
0 votes
Database 2PL protocol
In 2PL protocol if all exclusive locks are acquired by transaction in increasing order of their accesses then is the 2PL starvation free ?
User Avatar
1.1k
views
1 answers
0 votes
Breadth first Search
User Avatar
445
views
1 answers
0 votes
self doubt
in 1 first part answer is d?in 2nd part i have doubt regarding c==>4. is it synthesised attribute?
User Avatar
Page: