search
Log In

Recent activity by bts1jimin

0 answers
1
asked Jan 30, 2019 in Verbal Ability 62 views
0 answers
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.
asked Jan 25, 2019 in Mathematical Logic 99 views
0 answers
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?
asked Jan 24, 2019 in Computer Networks 131 views
0 answers
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.
commented Jan 22, 2019 in CO and Architecture 143 views
0 answers
5
According to the answer first is’nt well ordered but we do have least element 0 there, how is 0 not least element?
commented Jan 22, 2019 in Mathematical Logic 81 views
1 answer
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
asked Jan 22, 2019 in Mathematical Logic 74 views
0 answers
7
asked Jan 22, 2019 in Algorithms 68 views
0 answers
9
What should be default order of msb lsb in flip flops if msb lsb flip flop not given for a counter
asked Jan 21, 2019 in Digital Logic 133 views
0 answers
10
asked Jan 21, 2019 in CO and Architecture 43 views
0 answers
11
1-) 1 2-) 2 3-) 3 4-) 4
asked Jan 21, 2019 in Mathematical Logic 114 views
0 answers
12
asked Jan 21, 2019 in Programming 94 views
1 answer
13
True of False Bellman ford algorithm correctly computes shortest path in graph with no negative edges //graph can be disconnected as well.
asked Jan 20, 2019 in Algorithms 232 views
0 answers
14
Has gate asked any questions on compound interest and simple interest ?
asked Jan 19, 2019 in Verbal Ability 64 views
2 answers
15
Answer has R4 and E2 merged, I cant visualize how? what will be primary key? What will be other attributes?
commented Jan 18, 2019 in Databases 143 views
0 answers
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
commented Jan 13, 2019 in Mathematical Logic 105 views
1 answer
17
0 answers
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)
commented Jan 12, 2019 in Algorithms 142 views
0 answers
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
commented Jan 9, 2019 in Theory of Computation 182 views
0 answers
20
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
asked Jan 9, 2019 in Databases 113 views
0 answers
21
1 answer
22
Are following part of gate syllabus? 1- Thread scheduling 2- multiple processor scheduling 3- real time scheduling like earliest deadline first scheduling
asked Oct 18, 2018 in Operating System 75 views
1 answer
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?
commented Oct 5, 2018 in CO and Architecture 5.5k views
0 answers
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
commented Sep 15, 2018 in Mathematical Logic 57 views
1 answer
27
Numerical methods like newton method or bisection method part of syllabus of Gate?
asked Sep 15, 2018 in Mathematical Logic 72 views
0 answers
28
Are following part of gate syllabus? Multitape turing machine Multidimension turing machine Linear bounded automata Universal turing machine Linear bounded automata
asked Sep 14, 2018 in Theory of Computation 60 views
0 answers
29
Is CYK algorithm for membership for cfg grammar part of Gate syllabus?
asked Sep 13, 2018 in Theory of Computation 246 views
1 answer
30
Is chomsky normal form and greibach normal f in syllabus?
asked Sep 13, 2018 in Theory of Computation 114 views
...