Register

Recent questions tagged test-series

3 votes
2 answers
391
Compiler: Bottom Up Parser
Given answer is (D), how?
Given answer is (D), how?
User Avatar
2 votes
1 answer
392
Algorithms:Asymptotic Notations
plz help me . how to solve that type of question
plz help me . how to solve that type of question
User Avatar
1 votes
1 answer
393
Compiler-Design SDT
Not able to construct the SDT ... :(
Not able to construct the SDT ... :(
User Avatar
2 votes
0 answers
394
test series
User Avatar
1 votes
1 answer
395
Top Down Parsing
Since it is a Bottom Up Parser do we need to evaluate expressions following Right Hand Derivations or Left Hand Derivations,i.e. should we evaluate D -> d first or B -> B first?
Since it is a Bottom Up Parser do we need to evaluate expressions following Right Hand Derivations or Left Hand Derivations,i.e. should we evaluate D - d first or B - B f...
User Avatar
2 votes
1 answer
396
algorithms
User Avatar
0 votes
3 answers
401
time complexity
i am getting t.c as O(n^5) but given answer as O(n^4) what should be the answer
i am getting t.c as O(n^5) but given answer as O(n^4) what should be the answer
User Avatar
1 votes
1 answer
402
Test series
The recurrence relation T(n) =2t(n/2) + n/logn , T(1) =1 Evaluates to Plz explain how to evaluate ?
The recurrence relationT(n) =2t(n/2) + n/logn , T(1) =1Evaluates to Plz explain how to evaluate ?
User Avatar
4 votes
0 answers
403
CO: Memory
User Avatar
2 votes
1 answer
406
Algorithm Question
User Avatar
2 votes
1 answer
407
Question
User Avatar
4 votes
1 answer
409
MOCK TEST compiler design
Consider the given below grammar S→ cAd A→ bA | aA | b If a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
Consider the given below grammarS→ cAdA→ bA | aA | bIf a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
User Avatar
2 votes
1 answer
410
Test Series
If T(n) = n √n then:( Marks: 2) None of these T(n) is O(n3) T(n) is O(n log n) T(n) is O(n) Please show method on how to solve such problems?
If T(n) = n √n then:( Marks: 2) None of these T(n) is O(n3) T(n) is O(n log n) T(n) is O(n)Please show method on how to solve such problems?
User Avatar
1 votes
0 answers
414
Ace Test series: CO & Architecture - Cache Memory
I got answer 450 but the answer given is 410 400(to access 4 words in L2) + 40(4 access to store word read from L2 in L1) + 10(final one access by CPU) = 450
I got answer 450 but the answer given is 410400(to access 4 words in L2) + 40(4 access to store word read from L2 in L1) + 10(final one access by CPU) = 450
User Avatar
1 votes
1 answer
416
doubt algo 2
User Avatar
1 votes
1 answer
417
doubts algorithm
User Avatar
1 votes
1 answer
418
Computer Networks - MockTest
What will be the minimum and maximum bandwidth of the channel required for 7 channels of 400 kHz bandwidth multiplexed together with each guard band of 20 kHz ?
What will be the minimum and maximum bandwidth of the channel required for 7 channels of 400 kHz bandwidth multiplexed together with each guard band of 20 kHz ?
User Avatar
2 votes
2 answers
419
time complextiy
User Avatar
Page: