# Recent activity 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
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.
5
According to the answer first is’nt well ordered but we do have least element 0 there, how is 0 not least element?
6
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
7
8
9
What should be default order of msb lsb in flip flops if msb lsb flip flop not given for a counter
10
11
1-) 1 2-) 2 3-) 3 4-) 4
12
13
True of False Bellman ford algorithm correctly computes shortest path in graph with no negative edges //graph can be disconnected as well.
14
Has gate asked any questions on compound interest and simple interest ?
15
Answer has R4 and E2 merged, I cant visualize how? what will be primary key? What will be other attributes?
16
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
17
Answer is 6,6 Can anybody explain how?
18
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)
19
CONSIDER THE FLLOWING LANGUAGE L={<M>| M is a TM and L(M)=empty} Which of the following is true? a- Decidable REC B- Undecidable and RE c-Undecidable and non RE d- Decidable but RE
20
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
21
Is nfs part of gate sullsyll for operating system?
22
Are following part of gate syllabus? 1- Thread scheduling 2- multiple processor scheduling 3- real time scheduling like earliest deadline first scheduling
23
A block-set associative cache memory consists of $128$ blocks divided into four block sets. The main memory consists of $16, 384$ blocks and each block contains $256$ eight bit words. How many bits are required for addressing the main memory? How many bits are needed to represent the TAG, SET and WORD fields?
24
Is superscalar operations in pipelining part of gate syllabus?
25
Is branch prediction in pipelining im Co and architecture part of gate syllabus?
26
Consider the following statements. S1: f(x) = x5 + 3x - 1 is an increasing function for all values of x. S2: f(x) = 1-x3-x9 is decreasing function for all values of x where x 0. Which of the above statements are TRUE. A-S1 only B-S2 only C-Both S1 and S2 D-Neither S1 nor S2