Register

Recent questions tagged jest

0 votes
0 answers
1
JEST 2023
Anyone received any mail regarding JEST 2023 result for Theoretical Computer Science?
Anyone received any mail regarding JEST 2023 result for Theoretical Computer Science?
User Avatar
1 votes
1 answer
2
JEST 2020
X AND Y is an arbitrary sets, F: $X\rightarrow Y$ show that a and b are equivalent F is one-one For all set Z and function g1: $Z\rightarrow X$ and g2: $Z\rightarrow X$, if $g1 \neq g2$ implies $f \bigcirc g1 \neq f \bigcirc g2$ Where $\bigcirc$ is a fucntion composition.
X AND Y is an arbitrary sets, F: $X\rightarrow Y$ show that a and b are equivalent F is one-oneFor all set Z and function g1: $Z\rightarrow X$ and g2: $Z\rightarrow X$, ...
User Avatar
1 votes
1 answer
3
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?
What is the cut off rank in JEST called for Mtech Research in CSA and CDS in general category and EWS category?
User Avatar
2 votes
2 answers
4
JEST 2019
Three dice are rolled independently. Probability of obtaining the difference from largest and smallest number as exactly 4 :
Three dice are rolled independently. Probability of obtaining the difference from largest and smallest number as exactly 4 :
User Avatar
2 votes
0 answers
5
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
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 i...
User Avatar
1 votes
1 answer
7
JEST 2019
Solve the recurrence relation given as: T(n)=2T(n-2)+n; where T(2)=2 and T(1)=0 What is the solution?
Solve the recurrence relation given as: T(n)=2T(n-2)+n; where T(2)=2 and T(1)=0What is the solution?
User Avatar
1 votes
0 answers
8
JEST 2019 Descriptive Q4 (8 Marks)
Give an efficient algorithm for maximum size rectangle binary sub-matrix with all 1s . [Complexity should be O($n^c$)] (Memory based – Original question had a lot of added details)
Give an efficient algorithm for maximum size rectangle binary sub-matrix with all 1s . [Complexity should be O($n^c$)](Memory based – Original question had a lot of ad...
User Avatar
0 votes
0 answers
9
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.
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 decr...
User Avatar
1 votes
0 answers
10
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.
Suppose that G contains a cycle C, and a path of length at least k between some twovertices of C. Show that G contains a cycle of length at least √k.
User Avatar
1 votes
1 answer
11
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
User Avatar
3 votes
1 answer
12
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
User Avatar
2 votes
2 answers
13
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
User Avatar
1 votes
1 answer
14
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
User Avatar
1 votes
1 answer
20
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.
User Avatar
1 votes
1 answer
23
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
T(n)=T(n/2)+2; T(1)=1when n is power of 2 the correct expression for T(n) is:a) 2(logn+1)b) 2lognc)logn+1d)2logn+1
User Avatar
0 votes
0 answers
25
JEST EXAM
CSE- Jest exam rank-143 part -1 paper any chance of colleges
CSE- Jest exam rank-143 part -1 paper any chance of colleges
User Avatar
To see more, click for the full list of questions or popular tags.