Register

Recent questions tagged test-series

0 votes
2 answers
361
Compiler design
User Avatar
0 votes
0 answers
369
Test Series
Maximun number of nodes in the derivation tree when a word of lenght $2^k$ is derived from a gramar in CNF? My answer was ($2^{k+1}$)-1. But the answer given is 3* $2^k$ -1. Please someone explain
Maximun number of nodes in the derivation tree when a word of lenght $2^k$ is derived from a gramar in CNF? My answer was ($2^{k+1}$)-1. But the answer given is 3* $2^k$...
User Avatar
0 votes
1 answer
370
Compiler design
In this why questions why the left recursion is not removed as it is necessary for $LL1 $ Why they given the option without removing the left recursion $S->Aa|b$ $A->Ac|Sd|Null$
In this why questions why the left recursion is not removed as it is necessary for $LL1 $Why they given the option without removing the left recursion$S->Aa|b$$A->Ac|Sd|N...
User Avatar
1 votes
2 answers
371
Transaction 1
How many concurrent schedules are conflict serializable of given transactions T1 and T2:
How many concurrent schedules are conflict serializable of given transactions T1 and T2:
User Avatar
0 votes
1 answer
372
Test Series
If there are Q states in NFA, DFA should have at max $2^{Q}$ states. Keeping this thing in mind I answered the question but it went wrong. Please if anyone can give the correct solution.
If there are Q states in NFA, DFA should have at max $2^{Q}$ states. Keeping this thing in mind I answered the question but it went wrong.Please if anyone can give the co...
User Avatar
0 votes
2 answers
373
TheGateAcademy Test Series
In DFA, does each state need to have transition on "EACH" input alphabet? The answer was given "False" but I dont think so. Can anyone explain? Because if this statement is False, then there is no use of "Dead State"
In DFA, does each state need to have transition on "EACH" input alphabet?The answer was given "False" but I dont think so. Can anyone explain?Because if this statement is...
User Avatar
2 votes
1 answer
376
Algorithms time Complexity
What is the time complexity of this code?
What is the time complexity of this code?
User Avatar
0 votes
1 answer
377
test series
is it true that space complexity is always less than equal to time complexity i.e. S(n) = O(T(n)) I think it is.
is it true that space complexity is always less than equal to time complexity i.e. S(n) = O(T(n)) I think it is.
User Avatar
2 votes
2 answers
378
Gradeup Test series
Suppose prim’s algorithm is implemented using array as queue for a graph $G(V,E)$. Then what is the time complexity of Prim’s algorithm? $O (E \hspace{0.1cm}log\hspace{0.1cm} V)$ $O (V^2 \hspace{0.1cm}log\hspace{0.1cm} V)$ $O(V^2)$ $O(VE)$
Suppose prim’s algorithm is implemented using array as queue for a graph $G(V,E)$. Then what is the time complexity of Prim’s algorithm?$O (E \hspace{0.1cm}log\hspace...
User Avatar
1 votes
0 answers
380
BARC , General
Can anyone suggest a good platform for giving practice tests in order to prepare for BARC exam(100 questions in 120 minutes).
Can anyone suggest a good platform for giving practice tests in order to prepare for BARC exam(100 questions in 120 minutes).
User Avatar
0 votes
2 answers
381
Gradeup Test Series
Consider the following information of a source code. $10$ operators are used which includes 4 unique operators. $6$ operands are used which include 4 unique operands. Estimate the program length. $8$ $12$ $32$ $16$
Consider the following information of a source code. $10$ operators are used which includes 4 unique operators. $6$ operands are used which include 4 unique operands. Est...
User Avatar
2 votes
1 answer
383
Sorting
User Avatar
0 votes
1 answer
387
Test series
$\text{What is three address code representation of this ?}$ -a+b|c^d^e*f|g
$\text{What is three address code representation of this ?}$-a+b|c^d^e*f|g
User Avatar
0 votes
1 answer
388
gatebook
User Avatar
0 votes
1 answer
389
Test Questiion
$G: S\rightarrow SbS\mid a$ Grammars are ambiguous True/False.
$G: S\rightarrow SbS\mid a$Grammars are ambiguous True/False.
User Avatar
1 votes
0 answers
390
test series
hello.everyone i am preparing for gate 2018 and i am getting around 45 marks and rank is around 500 to 800 in test series(made easy ) . in two three full test mi rank was 250 also. but i am unable to cross 50marks ...i am obc student . is there any chance for me to iit...plz advice me
hello.everyone i am preparing for gate 2018 and i am getting around 45 marks and rank is around 500 to 800 in test series(made easy ) . in two three full test mi rank wa...
User Avatar
Page: