1 answer
2
Please see example 6. l am not getting the mathematical insight. Can anyone please tell how they are arriving at the answer.
0 answers
3
My gate 2019 rank is 2966, score 563, marks 48.67 which colleges I can get with this rank? I belong to unreserved category. Graduation marks 68%.
0 answers
4
Which fields of DLL, NL and TL header get changed during routing?
2 answers
5
If t(n) and s(n) denotes the time and space complexity of an algorithm with input size n element then which one of the following is always true?S(n)=O(t(n)) correct H...
2 answers
6
Consider the following language:?L= {w | w $\epsilon$ {0,1}* , w has equal number of occurrences of ‘001’ and ‘010’}Is L regular? If so, please provide a DFA for ...
2 answers
7
Let L = { (a^p)* | p is prime number } and input is {a} . what is minimum number of state in NFA and DFA ?
0 answers
8
Time complexity of Prim's algorithm for computing minimum cost spanning tree for a complete graph with n vertices and e edges using Heap data structure is-1. (n+e)*log^2n...
1 answer
9
What is the exact definition of full and complete binary tree? And what is the relation between them.
0 answers
10
What is the relation between cut set and edge connectivity?
1 answer
13
0 answers
14
I got confused between 2 options of a question-1. Safe and not deadlock2. Not safe and not deadlock.Can anybody tell me the difference between these 2 options?
2 answers
15