Register

Recent questions tagged made-easy-test-series

0 votes
1 answer
1171
MadeEasy Subject Test: Algorithms - Graph Algorithms
Will dijiktras's algoritm fail for the graph given in the question (or the question has been framed wrongly)?
Will dijiktras's algoritm fail for the graph given in the question (or the question has been framed wrongly)?
User Avatar
0 votes
1 answer
1176
made easy
Is the answer for question 20 correct?
Is the answer for question 20 correct?
User Avatar
0 votes
0 answers
1178
madeesy test series
Explain?
Explain?
User Avatar
1 votes
1 answer
1188
Made easy test series
Why is b incorrect?
Why is b incorrect?
User Avatar
0 votes
0 answers
1193
MadeEasy Advance Test Series: Algorithm - Searching
can someone provide me the detailed description for this answer?
can someone provide me the detailed description for this answer?
User Avatar
2 votes
0 answers
1195
Made Easy test series
L1 is recursive language L2 is recursive enumerable language Both (a) and (b) Both are not recursive enumerable please give explanation too
L1 is recursive languageL2 is recursive enumerable languageBoth (a) and (b)Both are not recursive enumerableplease give explanation too
User Avatar
1 votes
3 answers
1198
MadeEasy Subject Test: Digital Logic - Digital Counter
If the Initial state $(Q_{2}\,Q_{1}\,Q_{0})$ of the counter is $101$,then the state $(Q_{2}\,Q_{1}\,Q_{0})$ after $4$ clock pulses is
If the Initial state $(Q_{2}\,Q_{1}\,Q_{0})$ of the counter is $101$,then the state $(Q_{2}\,Q_{1}\,Q_{0})$ after $4$ clock pulses is
User Avatar
0 votes
2 answers
1200
MadeEasy Subject Test: Algorithms - Sorting
a. i>0,K>0, a[K]> a[max] b. i>0,K<0, a[K]< a[max] c. i<0,K>0, a[K]> a[max] d. i>0,K>0, a[K]< a[max]
a. i>0,K>0, a[K] a[max]b. i>0,K<0, a[K]< a[max]c. i<0,K>0, a[K] a[max]d. i>0,K>0, a[K]< a[max]
User Avatar
Page: