Register
Filter

Questions by thor

0 votes
0 answers
121
ME test
1 votes
1 answer
122
Doubt:::
0 votes
0 answers
123
[syllabus]
Is leaky bucket and token bucket algorithms are in Syllabus? Are calls like listen(), connect() in Syllabus? Also suggest some resources if you can?
Is leaky bucket and token bucket algorithms are in Syllabus?Are calls like listen(), connect() in Syllabus?Also suggest some resources if you can?
0 votes
2 answers
124
Programming
3 votes
1 answer
125
ME -- Hashing
Suppose there are $11$ slots in a Hash Table. At an instant there are $5$ empty slots and a new element $x$ is inserted in Hash Table. What is the the probablity that new element fits without collision? I think it should be $\frac{5}{11}$ but answer given says ::: EDIT :: Actual question is
Suppose there are $11$ slots in a Hash Table. At an instant there are $5$ empty slots and a new element $x$ is inserted in Hash Table. What is the the probablity that new...
1 votes
0 answers
128
Doubt Primitive root n
$m$ is said to be primitive root of $n$ if we are able to get all remainder from $0$ to $n-1$ when $m^k$ ($k = 1 \dots n-1$) is divided by $n$. Is it correct ?? Is $n$ necessarily has to be a prime number or it holds always true?
$m$ is said to be primitive root of $n$ if we are able to get all remainder from $0$ to $n-1$ when $m^k$ ($k = 1 \dots n-1$) is divided by $n$. Is it correct ??Is $n$ nec...
2 votes
1 answer
129
Imp doubt
2 votes
2 answers
130
Sorting
I answered this as $O(n^2)$ considering the question asks for best worst case of all inplace sorting algorithms.
I answered this as $O(n^2)$ considering the question asks for best worst case of all inplace sorting algorithms.
0 votes
1 answer
131
MadeEasy Test Series: Computer Networks - Ethernet
Please explain question first ::: For gigabit ethernet, the length of the cable, if length of the cable in standard ethernet l (2000) to maintain same frame size is _______.
Please explain question first :::For gigabit ethernet, the length of the cable, if length of the cable in standard ethernet l (2000) to maintain same frame size is ______...
0 votes
2 answers
133
linked list
3 votes
1 answer
134
Find output
0 votes
3 answers
135
Binary tree Made-easy-test-series
The minimum size that an array may require to store a binary tree with n nodes $2^{\left \lceil(log_2(n+1)) \right \rceil -1}$ $2n-1$ $2n-n+1$ $n+1$
The minimum size that an array may require to store a binary tree with n nodes$2^{\left \lceil(log_2(n+1)) \right \rceil -1}$$2n-1$$2n-n+1$$n+1$
1 votes
1 answer
137
Hashing
How do i prove that : : : In hashing n items into a hash table with k locations, the expected number of collisions is $n - k + k( 1-\frac{1}{k})^n$ ??
How do i prove that : : : In hashing n items into a hash table with k locations, the expected number of collisions is $n - k + k( 1-\frac{1}{k})^n$ ??
1 votes
1 answer
139
Linked List
0 votes
0 answers
140
Grid problem
I tried this by taking some test cases, but i think none of these is answer. Please explain and also show answer for something(2,3)
I tried this by taking some test cases, but i think none of these is answer. Please explain and also show answer for something(2,3)
Page: