search
Log In

Questions by sripo

1 vote
1 answer
1
Let a and b be positive integers such that a > b and a^ 2 − b^ 2 is a prime number. Then a^2 − b^ 2 is equal to (A) a − b (B) a + b (C) a × b (D) none of the above
asked Feb 15, 2019 in Set Theory & Algebra 127 views
3 votes
1 answer
2
When is the following statement true? (A ∪ B) ∩ C = A ∩ C (A) If Ā ∩ B ∩ C = φ (B) If A ∩ B ∩ C = φ (C) always (D) never
asked Feb 15, 2019 in Set Theory & Algebra 128 views
1 vote
1 answer
3
T (n) = T (n/2) + 2; T (1) = 1 When n is a power of 2, the correct expression for T (n) is: (A) 2(log n + 1) (B) 2 log n (C) log n + 1 (D)2 log n + 1
asked Feb 15, 2019 in Algorithms 180 views
1 vote
1 answer
4
If a fair die (with 6 faces) is cast twice, what is the probability that the two numbers obtained differ by 2? (A) 1/12 (B) 1/6 (C) 2/9 (D) 1/2
asked Feb 15, 2019 in Probability 120 views
0 votes
1 answer
5
Consider the following function, defined by a recursive program: function AP(x,y: integer) returns integer; {if {x = 0 then return y+1} else if { y = 0 then return AP(x-1,1)} else return AP(x-1, AP(x,y-1)) } (a) Show that on all nonnegative arguments x and y, the function AP terminates. (b) Show that for any x, AP(x, y) > y.
asked Feb 15, 2019 in Programming 130 views
1 vote
1 answer
6
A tournament is a directed graph in which there is exactly one directed edge between every pair of vertices. Let Tn be a tournament on n vertices. (a) Use induction to prove the following statement: Tn has a directed hamiltonian path (a directed path that visits ... , or a simple description of the steps in the algorithm, will suffice. What is the worst case time complexity of your algorithm?
asked Feb 15, 2019 in Algorithms 156 views
1 vote
0 answers
7
Two gamblers have an argument. The first one claims that if a fair coin is tossed repeatedly, getting two consecutive heads is very unlikely. The second, naturally, is denying this. They decide to settle this by an actual trial; if, within n coin tosses, no two ... has been demonstrated. What happens for larger values of n? Is it true that P (n) only increases with n? Justify your answer.
asked Feb 15, 2019 in Probability 73 views
1 vote
1 answer
8
Describe two different data structures to represent a graph. For each such representation, specify a simple property about the graph that can be more efficiently checked in that representation than in the other representation. Indicate the worst case time required for verifying both of your properties in either representation.
asked Feb 15, 2019 in Algorithms 95 views
0 votes
0 answers
9
Consider the following program: function mu(a,b:integer) returns integer; var i,y: integer; begin ---------P---------- i = 0; y = 0; while (i < a) do begin --------Q------------ y := y + b ; i = i + 1 end return y end Write a condition P such that the program terminates, and a condition Q which is true whenever program execution reaches the place marked Q above.
asked Feb 15, 2019 in Programming 115 views
1 vote
1 answer
10
How many subsets of even cardinality does an n-element set have ? Justify answer. Please give a proof if possible.This is part of subjective JEST paper.
asked Feb 15, 2019 in Set Theory & Algebra 74 views
1 vote
2 answers
11
Which are the best Test-Series for gate 2020.In terms of quality of question and for practice purposes. Just solving PYQ’s is it enough?
asked Feb 5, 2019 in GATE 2.6k views
2 votes
4 answers
12
Let us there are n nodes which are labelled. Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$ Then the binary search trees possible is just 1?
asked Jan 16, 2019 in DS 1.2k views
1 vote
0 answers
13
I have completed some amount of syllabus,I have takes some tests also,I haven't solved all the PYQ's of the GO book.My FLT scores are very poor.I have realized that my ability to take stress is poor one bad score and the time I take to recover increase.Any anyone tell me strategies ... miss the exam as I wake up late. I just feel that Gate exam is not my cup of tea and I am wasting my time on it.
asked Jan 15, 2019 in GATE 320 views
0 votes
0 answers
17
For the given question instead of the given order if we take one unit of P2 as its arrival time is 1 and then schedule P1 next we get the same answer,even in the hint they have given as the process which comes first should get first priority instead in ... first.My approach and the solution given ends up giving the same answer,does this happen for all cases or just happening for this question?
asked Jan 1, 2019 in Operating System 330 views
1 vote
0 answers
18
Below are the links of ISRO notification there are no positions advertised for CSE students? So ISRO is not having an exam for CSE students this year? https://gradeup.co/isro-recruitment-i?utm_campaign=gate3112&utm_medium=gate&utm_source=email_manual https://gradeup.co/liveData/f/2018/12/bilingual_advt_for_website.pdf-17.pdf
asked Dec 31, 2018 in ISRO 336 views
0 votes
1 answer
19
What is the reason for Belady’s Anomaly,I am aware that it is not a stack based algorithm and for a certain set of pages it shows this anomaly where the increase in page frame increases the page fault rate.
asked Dec 28, 2018 in Operating System 273 views
0 votes
0 answers
20
https://www.youtube.com/watch?v=tyiQLindzCE This is a great video but covers formula for cubic root what about for any given equation x^n,what would be the solution?
asked Dec 26, 2018 in Calculus 299 views
...