search
Log In

Questions by Nandkishor3939

0 votes
0 answers
1
asked Apr 28, 2019 in Algorithms 67 views
0 votes
1 answer
2
What are the important topics in WIFI : It would be very helpful if some one answered this thank you:)
asked Mar 7, 2019 in Computer Networks 261 views
0 votes
3 answers
3
What was the Expectancy in the full binary tree question asked in the exam ? I got 3
asked Feb 4, 2019 in GATE 702 views
0 votes
1 answer
4
There was one question of OS : TLB based : what is its answer : 256 x 2^10 ??
asked Feb 4, 2019 in Operating System 543 views
0 votes
0 answers
5
What will be the answer to this question ? Will it go in infinite loop ?
asked Feb 4, 2019 in Digital Logic 613 views
0 votes
1 answer
6
0 votes
0 answers
7
A quick question Is every multiplication modulo function a Abelian group....Or is it the case that the function should have prime number as modulo
asked Feb 2, 2019 in Graph Theory 60 views
1 vote
2 answers
8
Can any one verify this soln plz.. Thank you
asked Feb 1, 2019 in Compiler Design 178 views
0 votes
0 answers
9
In exam if they are mentioning LR(1) parser Then which parser to consider: SLR(1) / LALR(1) / CLR(1)
asked Jan 31, 2019 in Compiler Design 84 views
0 votes
1 answer
10
I think its answers should be 500 m , is any one having idea of this:
asked Jan 26, 2019 in Computer Networks 131 views
0 votes
0 answers
11
0 votes
1 answer
12
How to calculate such a value: Please, someone explain because this is not possible on cal….!
asked Jan 26, 2019 in Computer Networks 125 views
1 vote
0 answers
13
Let G be a complete undirected graph on 5 vertices 10 edges, with weights being 1, 2, 3, 4, 5, 6, 7, 8, 9, 10. Let X be the value of the maximum possible weight a MST of G can have. Then the value of x will be_____ the answer to this question is given as 11 but there is no procedure given . Please ,can anyone help me out in understanding the procedure
asked Jan 26, 2019 in Graph Theory 172 views
0 votes
1 answer
14
0 votes
0 answers
15
I think its answer is 8 .Please ,can any one make it sure for me :)
asked Jan 25, 2019 in DS 143 views
0 votes
1 answer
16
Can any one please help me out in understanding how to read : f(n)=O(n^2) I am confused in : 1] f(n) is the upper bound of n^2 2]f(n)’s upper bound is n^2 Or is their any another way of reading it out…! THANK YOU
asked Jan 25, 2019 in Algorithms 51 views
0 votes
0 answers
17
Number of labelled subgraphs possible for the graph given below______________
asked Jan 25, 2019 in DS 151 views
0 votes
0 answers
18
Does RDP require back tracking ? I am asking this because I have read that if RDP doesn't require back tracking then it is a predictive parser(LL(1))!! A predictive parser is a recursive descent parser that does not require backtracking. Predictive parsing is ... for the class of LL(k) grammars ( https://en.wikipedia.org/wiki/Recursive_descent_parser ) Does it mean that the RDP requires BT
asked Jan 24, 2019 in Compiler Design 156 views
4 votes
1 answer
19
Nullity of a matrix = Total number columns – Rank of that matrix But how to calculate value of x when nullity is already given(1 in this case)
asked Jan 24, 2019 in Linear Algebra 427 views
0 votes
0 answers
20
My answer came out to be 13: because when we will compute T(13) { as we are using Dynamic programming , it will have to compute value of T(12),T(11),…...T(2) only once(as it will store it and reuse it) so the stack size will be 1 (for T(13))+11 (for T(12),T(11),…...T(2)) = 12…...(48/4) } will any one help me out
asked Jan 22, 2019 in Algorithms 123 views
...