Register
Filter

Recent activity by bhavnakumrawat5

0 answers
1
Barc exam
Can any one tell me....IT branch student can apply for barc in CS branch...
Can any one tell me....IT branch student can apply for barc in CS branch...
1 answer
2
GATE2019
Answer for Minimum no of nor gates question
Answer for Minimum no of nor gates question
1 answer
5
doubt
What is semi and Partially decidable...and how we know
What is semi and Partially decidable...and how we know
3 answers
6
doubt
How to check any set is countable or not
How to check any set is countable or not
0 answers
7
doubt
L1 = { a^n b^n c^m | n,m>=0} L2 = { a^m b^n c^n | m,n>=0} L1 intersection L2 = { { a^n b^n c^n | n>=0} how we do intersection plz explain using grammer....
L1 = { a^n b^n c^m | n,m>=0}L2 = { a^m b^n c^n | m,n>=0}L1 intersection L2 = { { a^n b^n c^n | n>=0}how we do intersection plz explain using grammer....
2 answers
8
B+ Tree insertion
I think it would be 7..please check
I think it would be 7..please check
0 answers
9
doubt - synchronization
what is difference between in both question...? it is totally look same just difference in variable. https://gateoverflow.in/1256/gate2007-58 https://gateoverflow.in/8405/gate2015-3-10
what is difference between in both question...? it is totally look same just difference in variable.https://gateoverflow.in/1256/gate2007-58 https://gateoverflow.in/8405...
3 answers
10
Cn: Optimal windows size
The round trip delay between x and y is given as 60 ms and bandwidth of link between X and Y is 512 KBps. What is the optimal window size (in packets) if the packet size is 64 bytes and channel is full duplex
The round trip delay between x and y is given as 60 ms and bandwidth of link between X and Y is 512 KBps. What is the optimal window size (in packets) if the packet size...
3 answers
13
self-doubt
Consider a binary tree T that has 50 leaf nodes. Then the number of nodes in T that have exactly ONE children are ______.
Consider a binary tree T that has 50 leaf nodes. Then the number of nodes in T that have exactlyONE children are ______.
2 answers
15
Test-series algorithms
What is the time complexity of following function fun()? Assume that log(x) returns log value in base 2. void fun() { int i, j; for (i=1; i<=n; i++) for (j=1; j<=log(i); j++) printf("GeeksforGeeks"); }
What is the time complexity of following function fun()? Assume that log(x) returns log value in base 2.void fun() { int i, j; for (i=1; i<=n; i++) for (j=1; j<=log(i); j...
1 answer
17
worst case possible height of an AVL tree .
What is the worst case possible height of an AVL tree?? a. 2logn (Assume base of log is 2) b. 1.44log n (Assume base of log is 2) c. Depends upon implementation d. Theta(n)
What is the worst case possible height of an AVL tree??a. 2logn (Assume base of log is 2) b. 1.44log n (Assume base of log is 2)c. Depends upon implementationd. Thet...
1 answer
19
T(n) = T(n/4) + T(3n/4) +n
How to solve above recurrence relation (With substitution method)??
How to solve above recurrence relation (With substitution method)??
1 answer
20
Introduction To Algorithms
T(N) = 3T(N/4) + NlogN T(N) = 2T(N/2)+ NlogN Master theorem applicable to this ??
T(N) = 3T(N/4) + NlogNT(N) = 2T(N/2)+ NlogNMaster theorem applicable to this ??
1 answer
21
self - doubt
how the get 3n/2 -2 comparision
how the get 3n/2 -2 comparision
2 answers
23
Hamming Code
0 answers
24
doubt-tree
If each node of the B-tree is 80 percent full, then what is the average number of keys per node of the above B tree?
If each node of the B-tree is 80 percent full, then what is the average number of keys per node of the above B tree?
0 answers
25
Doubt
Can we solve it by master Theorem T(n)=T(n/3)+T(n/4)+6n
Can we solve it by master TheoremT(n)=T(n/3)+T(n/4)+6n
0 answers
28
doubt
How to Calculate Propagation Delay In Carry Look Ahead Adder.
How to Calculate Propagation Delay In Carry Look Ahead Adder.