Questions by luc_Bloodstone

Questions by luc_Bloodstone

0 votes

0 answers 59 views

Madeeasy test series - Number of strings present

asked in Theory of Computation Jan 26, 2020

59 views

0 votes

0 answers 43 views

Madeeasy test series - Retrieve address of element in matrix

asked in DS Jan 21, 2020

43 views

0 votes

0 answers 54 views

Madeeasy test series - find order of relaxed vertices in a graph using dijkstra algo

asked in Algorithms Jan 8, 2020

54 views

0 votes

0 answers 138 views

Madeeasy test series - Increase order of function
I tried this by taking some bigger values of n and then comparing the results but getting the different answer then the one they have given. Please help.

asked in Algorithms Jan 8, 2020

138 views

0 votes

0 answers 50 views

Madeeasy test series - Max number of reduce moves
Ans :- 49

asked in Compiler Design Dec 31, 2019

50 views

0 votes

1 answer 52 views

Madeeasy Test Series - Number of comparisons
ans :- 94

asked in Algorithms Dec 26, 2019

52 views

0 votes

0 answers 56 views

Madeeasy Test Series - SSA form
Doubt :- In solution they used a variable more than once in LHS but in SSA form I think we always use new variable in LHS. Solution they have given:

asked in Compiler Design Dec 25, 2019

56 views

2 votes

0 answers 34 views

MadeEasy Test Series - Worst case height in Binary tree

asked in Algorithms Dec 7, 2019

34 views

0 votes

1 answer 45 views

String acceptance in PDA
In PDA is it okay that stack is not empty but string reached the final state? Can we accept such string?

asked in Theory of Computation Dec 2, 2019

45 views

0 votes

1 answer 68 views

Madeeasy Test series - time complexity
What is the time complexity of foo() and bar() ? I solved it and get ans correct for foo(), but for bar() I am getting wrong ans, for bar(): T(n) = 2T(n-1) + c; c is constant I solved it and get this: T(n) = 2^(n-1) * 3^n ... bar() is T(n) = O(2^n), I don't understand how they get this. Is my recurrence equation is wrong or something else, please solve this.

asked in Algorithms Nov 29, 2019

68 views

0 votes

1 answer 57 views

MadeEasy Test Series - Calculate time complexity
What is the time complexity of below function? Can we able to solve it by Masters Theorem?

asked in Algorithms Nov 25, 2019

57 views

0 votes

0 answers 88 views

MadeEasy Test Series - Question on array of pointers

asked in Algorithms Nov 25, 2019

88 views

0 votes

0 answers 128 views

Http(Persistent vs Non-Persistent) - MadeEasy Test series

asked in Computer Networks Nov 8, 2019

128 views

0 votes

1 answer 78 views

MadeEasy Test Series- Fragmentation
In this they asked about number of fragments and last fragment size. I know how to solve this but where I have stuck is I scaled the header length and took it as 60 B(15 x 4) because it is less than minimum IP header length. But in the ... tell me why they did this? Ans => Number of fragments = 7, last fragment offset = 360 and last datagram length = 120.

asked in Computer Networks Nov 5, 2019

78 views

0 votes

1 answer 100 views

Find number of Minimum cost spanning tree possible? (MadeEasy Test Series)

asked in Algorithms Oct 19, 2019

100 views

0 votes

2 answers 62 views

Is this a Regular language or not?
Here ‘w^r’ is the reverse of string ‘w’.

asked in Theory of Computation Oct 18, 2019

62 views

0 votes

0 answers 41 views

Made Easy Programming and DS test 1

asked in Programming Oct 1, 2019

41 views

Search GATE CSE Video Solutions