# Questions by bts1jimin

1
2
how to know when to apply which case for : in-distinguishable object in-distinguishable boxes. Example- 12 balls are distributed at random among three boxes.The probability that the first box will contain three balls is_____. Example - number of ways we can arrange 5 books in 3 shelves.
3
Accorsing to Kenneth rosen, poison reverse cant solve count to infinity What is difference between split horizon and poison reverse. Can split horizon solve count to infinity problem? Can split horizon with poison reverse solve count to infinity problem?
4
why is my approach giving wrong answer: choose 2 men from 8: 8C2 choose 3 women from 5: 5C3 rest 8 people left ( 8+5- 5= 8) , choose 1 from these 8 people = 8C1 Hence after multiplying above three we get 4480 but answer given is 700
5
6
What should be default order of msb lsb in flip flops if msb lsb flip flop not given for a counter
7
8
1-) 1 2-) 2 3-) 3 4-) 4
9
According to the answer first is’nt well ordered but we do have least element 0 there, how is 0 not least element?
10
11
12
True of False Bellman ford algorithm correctly computes shortest path in graph with no negative edges //graph can be disconnected as well.
13
Has gate asked any questions on compound interest and simple interest ?
14
here it is given byte addressable. So these locations refer to words or byte location. What are set, block fields here : number of words or number of bytes for these location.
15
Answer has R4 and E2 merged, I cant visualize how? what will be primary key? What will be other attributes?
16
Answer is 6,6 Can anybody explain how?
17
In how many different ways can a set of 3n elements be partitioned into 3 subsets of equal number of elements? Isn't this case of distributing distinguishable objects and distinguishable boxes, so the answer should be $(3n)! / ((n!)^3 )$. But answer given is $(3n)! / (6*(n!)^3)$ Can anybody explain? Or post a link where to study all concepts of permutation and combination and counting
1 vote
Let f(n) =O(n), g(n)=Ώ(n) and h(n)=Θ(n). Then g(n)+f(n).h(n) is _____? a- Ω($n^{2}$) b- Θ($n^{2}$) c-Ω(n) d-Θ(n)