Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
sripo
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by sripo
1
votes
1
answer
1
JEST Sample Question 1-a
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
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
523
views
asked
Feb 15, 2019
Set Theory & Algebra
jest
discrete-mathematics
set-theory&algebra
+
–
3
votes
1
answer
2
JEST Sample Question 1-b
When is the following statement true? (A ∪ B) ∩ C = A ∩ C (A) If Ā ∩ B ∩ C = φ (B) If A ∩ B ∩ C = φ (C) always (D) never
When is the following statement true? (A ∪ B) ∩ C = A ∩ C(A) If Ā ∩ B ∩ C = φ(B) If A ∩ B ∩ C = φ(C) always(D) never
783
views
asked
Feb 15, 2019
Set Theory & Algebra
jest
discrete-mathematics
set-theory&algebra
+
–
2
votes
2
answers
3
JEST Sample Question 1-d
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
T (n) = T (n/2) + 2; T (1) = 1When 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
505
views
asked
Feb 15, 2019
Algorithms
jest
algorithms
recurrence-relation
+
–
1
votes
1
answer
4
JEST Sample Question 1-c
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
If a fair die (with 6 faces) is cast twice, what is the probability that the twonumbers obtained differ by 2?(A) 1/12(B) 1/6(C) 2/9(D) 1/2
652
views
asked
Feb 15, 2019
Probability
jest
probability
discrete-mathematics
+
–
0
votes
1
answer
5
JEST Sample Question-2
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.
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)}...
960
views
asked
Feb 15, 2019
Programming in C
jest
programming-in-c
+
–
1
votes
1
answer
6
JEST Sample Question-4
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 ... or a simple description of the steps in the algorithm, will suffice. What is the worst case time complexity of your algorithm?
A tournament is a directed graph in which there is exactly one directed edge betweenevery pair of vertices. Let Tn be a tournament on n vertices.(a) Use induction to prov...
786
views
asked
Feb 15, 2019
Algorithms
jest
algorithms
time-complexity
+
–
1
votes
0
answers
7
JEST Sample Question-6
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, ... demonstrated. What happens for larger values of n? Is it true that P (n) only increases with n? Justify your answer.
Two gamblers have an argument. The first one claims that if a fair coin is tossedrepeatedly, getting two consecutive heads is very unlikely. The second, naturally, isdeny...
334
views
asked
Feb 15, 2019
Probability
jest
engineering-mathematics
probability
+
–
1
votes
1
answer
8
JEST Sample Question-5
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.
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 ...
712
views
asked
Feb 15, 2019
Algorithms
jest
algorithms
time-complexity
+
–
0
votes
0
answers
9
JEST Sample Question-7
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.
Consider the following program:function mu(a,b:integer) returns integer;var i,y: integer;begin -P i = 0; y = 0;while (i < a) dobegin Q y := y + b ;i = i + 1endret...
460
views
asked
Feb 15, 2019
Programming in C
jest
programming-in-c
+
–
1
votes
1
answer
10
Jest Exam sample question-3
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.
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.
411
views
asked
Feb 15, 2019
Set Theory & Algebra
jest
set-theory&algebra
discrete-mathematics
+
–
1
votes
2
answers
11
Test Series For Gate 2020
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?
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?
4.2k
views
asked
Feb 5, 2019
GATE
gate-preparation
+
–
4
votes
5
answers
12
How many Binary Search Trees are possible for a labelled nodes?
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$?
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 possi...
6.7k
views
asked
Jan 16, 2019
DS
data-structures
binary-search-tree
+
–
1
votes
0
answers
13
Gate Preparation in the last 18 days from Now
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 ... 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.
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 m...
783
views
asked
Jan 15, 2019
GATE
gate-preparation
+
–
1
votes
1
answer
14
MadeEasy Test Series: Computer Networks -Sliding Window
I am unable to understand their explanation,can anyone explain it in a better way?
I am unable to understand their explanation,can anyone explain it in a better way?
568
views
asked
Jan 5, 2019
Computer Networks
computer-networks
sliding-window
go-back-n
made-easy-test-series
+
–
0
votes
0
answers
15
Language accepted by this Turing Machine
As per the given solution,B should be the correct answer right why is D given as the correct answer as the machine accepts atleast one b.
As per the given solution,B should be the correct answer right why is D given as the correct answer as the machine accepts atleast one b.
523
views
asked
Jan 5, 2019
Theory of Computation
theory-of-computation
turing-machine
recursive-and-recursively-enumerable-languages
regular-expression
+
–
0
votes
1
answer
16
MadeEasy Subject Test 2019: Theory Of Computation - Regular Languages
Can anyone explain how S2 is false,I did not understand their logic.
Can anyone explain how S2 is false,I did not understand their logic.
626
views
asked
Jan 1, 2019
Theory of Computation
regular-expression
theory-of-computation
finite-automata
regular-language
expression
made-easy-test-series
+
–
0
votes
0
answers
17
Madeeasy Test Series: Operating System - Process Schedule
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 ... and the solution given ends up giving the same answer,does this happen for all cases or just happening for this question?
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 th...
891
views
asked
Jan 1, 2019
Operating System
process-scheduling
operating-system
sjf
made-easy-test-series
+
–
1
votes
0
answers
18
Is ISRO not have exam for CSE students this year?
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
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/i...
801
views
asked
Dec 31, 2018
ISRO
job
isro-application
+
–
0
votes
1
answer
19
What is the reason for Belady's Anamoly
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.
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 pag...
895
views
asked
Dec 28, 2018
Operating System
page-replacement
virtual-memory
operating-system
+
–
0
votes
0
answers
20
Shortcut Method to find Maxima and Minima in Calculus
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?
https://www.youtube.com/watch?v=tyiQLindzCEThis is a great video but covers formula for cubic root what about for any given equation x^n,what would be the solution?
1.2k
views
asked
Dec 26, 2018
Calculus
calculus
maxima-minima
engineering-mathematics
+
–
Page:
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register