Register

Recent questions tagged made-easy-test-series

1 votes
0 answers
901
MadeEasy Test Series 2018: Algorithms - Time Complexity
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers? a) O(logn) b) O(nlogn) c) O(n^2) d) O(n^2logn)
What is the worst case time complexity to count pairs of numbers with difference ‘k’ from an input array of ‘n’ numbers?a) O(logn)b) O(nlogn)c) O(n^2)d) O(n^2logn...
User Avatar
2 votes
1 answer
902
MadeEasy Test Series 2018: Computer Networks - Network Flow
my approach is 1 <= Td(x)/(Td+2Tp), x is size of SW then the answer wil be - ceil(log x) Is my approach is correct, if not then how to solve this?
my approach is 1 <= Td(x)/(Td+2Tp), x is size of SWthen the answer wil be - ceil(log x)Is my approach is correct, if not then how to solve this?
User Avatar
2 votes
2 answers
906
DFS Traversal
If DFS algorithm applied starting from vertex ‘A’ which uses stack data structure then the height of stack is needed in worst case for DFS traversal is _________.
If DFS algorithm applied starting from vertex ‘A’ which uses stack data structure then the height of stack is needed in worst case for DFS traversal is _________.
User Avatar
8 votes
2 answers
908
MadeEasy Test Series 2018: Graph Theory - Graph Coloring
Consider the following graph: Which of the following will represents the chromatic number of the graph? answer given is 4. Please provide a detailed solution.
Consider the following graph: Which of the following will represents the chromatic number of the graph?answer given is 4.Please provide a detailed solution.
User Avatar
2 votes
0 answers
910
MadeEasy Test Series 2018: Algorithms - Graph Algorithms
For a directed graph, the absence of back edges in a DFS tree can have cycle. true or fale.please explain with an example.
For a directed graph, the absence of back edges in a DFS tree can have cycle.true or fale.please explain with an example.
User Avatar
1 votes
6 answers
911
The grammar G is
Consider the following grammar G: $S\rightarrow AB\mid d$ $A\rightarrow aA\mid b$ $B\rightarrow bB\mid c$ The grammar G is: LL (1) grammar and not LR (0) LL (1) and LR (0) Not LL (1) but LR (0) Neither LL (1) nor LR (0)
Consider the following grammar G:$S\rightarrow AB\mid d$$A\rightarrow aA\mid b$$B\rightarrow bB\mid c$The grammar G is:LL (1) grammar and not LR (0)LL (1) and LR (0)Not L...
User Avatar
1 votes
1 answer
919
madeeasy test series
Consider the following functions: $f1=n^{\log n}$ $f2=2^n$ $f3=2^{\sqrt{n}}$ Which of the following is true with regard to asymptotic growth? A. $f1\leq f3\leq f2$ B. $f3\leq f1\leq f2$
Consider the following functions:$f1=n^{\log n}$$f2=2^n$$f3=2^{\sqrt{n}}$Which of the following is true with regard to asymptotic growth?A. $f1\leq f3\leq f2$B. $f3\leq f...
User Avatar
2 votes
1 answer
926
MadeEasy Test Series: Linear Algebra - Matrices
If $A=\begin{bmatrix} cos \alpha & sin \alpha \\ -sin \alpha & cos \alpha \end{bmatrix}$ be such that $A +A ^{'}=I$ then the value of $\alpha$ is
If $A=\begin{bmatrix} cos \alpha & sin \alpha \\ -sin \alpha & cos \alpha \end{bmatrix}$be such that $A +A ^{'}=I$ then the value of $\alpha$ is
User Avatar
2 votes
1 answer
929
test series
plz explain this question
plz explain this question
User Avatar
Page: