The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged jest
+1
vote
1
answer
1
JEST Cut Off for CDS CSA
What is the cut off rank in JEST called for Mtech Research in CSA and CDS in general category and EWS category?
asked
Apr 18
in
IISc/IITs
by
N
(
377
points)

69
views
jest
iisc
cutoffs
mtech
admission
cse
0
votes
1
answer
2
JEST 2019
Three dice are rolled independently. Probability of obtaining the difference from largest and smallest number as exactly 4 :
asked
Feb 18
in
Probability
by
Sayan Bose
Loyal
(
7k
points)

94
views
jest
probability
+1
vote
0
answers
3
JEST 2019
A directed graph with n vertices, in which each vertex has exactly 3 outgoing edges. Which one is true? A) All the vertices have indegree = 3 . B) Some vertices will have indegree exactly 3. C)Some vertices have indegree atleast 3. D) Some of the vertices have indegree atmost 3
asked
Feb 18
in
Graph Theory
by
Sayan Bose
Loyal
(
7k
points)

90
views
jest
graphtheory
+1
vote
0
answers
4
JEST 2019
Let ${(0,1)}^n$ set of all binary string of length n. Hamming sphere of radius around a string C in ${(0,1)}^n$ is the set of all strings d$\epsilon$ ${(0,1)}^n$ that differ from C in at most r of n position, S(C,r) for n=2k+1 For C,C’ $\epsilon$ ${(0,1)}^n$ S(C,k) and S(C’,k) are disjoint couldn't remember rest of the options.
asked
Feb 17
in
Set Theory & Algebra
by
vivek_mishra
(
459
points)

73
views
jest
2019
discretemathematics
0
votes
1
answer
5
JEST 2019
Solve the recurrence relation given as: T(n)=2T(n2)+n; where T(2)=2 and T(1)=0 What is the time complexity?
asked
Feb 17
in
Algorithms
by
vivek_mishra
(
459
points)

254
views
jest
2019
algorithms
0
votes
0
answers
6
JEST 2019 Descriptive Q4 (8 Marks)
Give an efficient algorithm for maximum size rectangle binary submatrix with all 1s . [Complexity should be O($n^c$)] (Memory based – Original question had a lot of added details)
asked
Feb 17
in
Algorithms
by
dan31
Junior
(
831
points)

76
views
jest
2019
algorithms
0
votes
0
answers
7
JEST 2019 Descriptive Q2 (8 Marks)
Given a sequence $a_1$, $a_2$ , $a_3$ ... $a_n$ of any different positive integers, exhibit an arrangement of integers between 1 and $n^2$ which has no increasing or decreasing subsequence of length n+1.
asked
Feb 17
in
Graph Theory
by
dan31
Junior
(
831
points)

91
views
jest
2019
discretemathematics
0
votes
0
answers
8
JEST 2019 Descriptive Q1 (8 Marks)
Suppose that G contains a cycle C, and a path of length at least k between some two vertices of C. Show that G contains a cycle of length at least √k.
asked
Feb 17
in
Graph Theory
by
dan31
Junior
(
831
points)

56
views
jest
2019
discretemathematics
0
votes
1
answer
9
JEST Sample Question 1a
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
in
Set Theory & Algebra
by
sripo
Active
(
2.3k
points)

73
views
jest
discretemathematics
settheory&algebra
+2
votes
1
answer
10
JEST Sample Question 1b
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
in
Set Theory & Algebra
by
sripo
Active
(
2.3k
points)

70
views
jest
discretemathematics
settheory&algebra
0
votes
1
answer
11
JEST Sample Question 1d
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
in
Algorithms
by
sripo
Active
(
2.3k
points)

114
views
jest
algorithms
timecomplexity
0
votes
1
answer
12
JEST Sample Question 1c
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
in
Probability
by
sripo
Active
(
2.3k
points)

53
views
jest
probability
discretemathematics
0
votes
1
answer
13
JEST Sample Question2
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(x1,1)} else return AP(x1, AP(x,y1)) } (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
in
Programming
by
sripo
Active
(
2.3k
points)

62
views
jest
programminginc
0
votes
1
answer
14
JEST Sample Question4
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?
asked
Feb 15
in
Algorithms
by
sripo
Active
(
2.3k
points)

65
views
jest
algorithms
timecomplexity
+1
vote
0
answers
15
JEST Sample Question6
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.
asked
Feb 15
in
Probability
by
sripo
Active
(
2.3k
points)

28
views
jest
engineeringmathematics
probability
0
votes
1
answer
16
JEST Sample Question5
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
in
Algorithms
by
sripo
Active
(
2.3k
points)

36
views
jest
algorithms
timecomplexity
0
votes
0
answers
17
JEST Sample Question7
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
in
Programming
by
sripo
Active
(
2.3k
points)

33
views
jest
programminginc
0
votes
1
answer
18
Jest Exam sample question3
How many subsets of even cardinality does an nelement set have ? Justify answer. Please give a proof if possible.This is part of subjective JEST paper.
asked
Feb 15
in
Set Theory & Algebra
by
sripo
Active
(
2.3k
points)

25
views
jest
settheory&algebra
discretemathematics
0
votes
0
answers
19
Jest Exam
please give answer or name a book from where i can access Describe two different data structures to represent a graph. For each such representa tion, 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
Jan 18
in
Written Exam
by
sahadebmandal
(
15
points)

37
views
jest
0
votes
0
answers
20
Links to puzzles and riddles relevant to Gate syllabus
I want a link to sites or pdf repos which have list of mathematical puzzles or riddles which involve concepts of Discrete Math,Data Structure etc It should be relevant to the gate syllabus as I feel that I need to ... with new approach rather than a fixed approach. Just want to improve my analytical skills when answering entrance tests.
asked
Dec 25, 2018
in
Study Resources
by
sripo
Active
(
2.3k
points)

61
views
careeradvice
discretemathematics
gatepreparation
jest
0
votes
1
answer
21
What is the value of T(n) for the given recurrence relation
T(n)=T(n/2)+2; T(1)=1 when n is power of 2 the correct expression for T(n) is: a) 2(logn+1) b) 2logn c)logn+1 d)2logn+1
asked
Nov 14, 2018
in
Algorithms
by
sripo
Active
(
2.3k
points)

123
views
recurrence
algorithms
timecomplexity
jest
+2
votes
1
answer
22
JEST Exam
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 17, 2018
in
Probability
by
Sukannya
Active
(
2.7k
points)

148
views
jest
0
votes
0
answers
23
JEST EXAM
CSE Jest exam rank143 part 1 paper any chance of colleges
asked
Mar 29, 2017
in
Others
by
Aman Chauhan
(
491
points)

217
views
jest
To see more, click for the
full list of questions
or
popular tags
.
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
Follow @csegate
Recent questions tagged jest
Recent Blog Comments
Can you tell me when the stock will be back in...
received the GO books in good conditions!! thanks
Sir please update your stocks, when it will be...
Yes. Stock is over with Indiapost.
But on Amazon the stock is there and a way too...
49,845
questions
54,784
answers
189,430
comments
80,447
users