Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
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?
Priyangshu_AIR__
90
views
Priyangshu_AIR__
asked
Apr 25, 2023
Others
jest
+
–
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$, ...
vivek_mishra
864
views
vivek_mishra
asked
Feb 17, 2020
Set Theory & Algebra
jest
functions
set-theory
+
–
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?
N
1.1k
views
N
asked
Apr 18, 2019
IISc/IITs
jest
iisc
cutoffs
mtech
admission
cse
+
–
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 :
Sayan Bose
520
views
Sayan Bose
asked
Feb 18, 2019
Probability
jest
probability
+
–
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...
Sayan Bose
537
views
Sayan Bose
asked
Feb 18, 2019
Graph Theory
jest
graph-theory
+
–
2
votes
0
answers
6
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.
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 dif...
vivek_mishra
493
views
vivek_mishra
asked
Feb 17, 2019
Set Theory & Algebra
jest
2019
discrete-mathematics
+
–
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?
vivek_mishra
956
views
vivek_mishra
asked
Feb 17, 2019
Algorithms
jest-2019
jest
algorithms
recurrence-relation
+
–
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...
dan31
399
views
dan31
asked
Feb 17, 2019
Algorithms
jest
2019
algorithms
+
–
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...
dan31
486
views
dan31
asked
Feb 17, 2019
Graph Theory
jest
2019
discrete-mathematics
+
–
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.
dan31
419
views
dan31
asked
Feb 17, 2019
Graph Theory
jest
2019
discrete-mathematics
+
–
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
sripo
537
views
sripo
asked
Feb 15, 2019
Set Theory & Algebra
jest
discrete-mathematics
set-theory&algebra
+
–
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
sripo
821
views
sripo
asked
Feb 15, 2019
Set Theory & Algebra
jest
discrete-mathematics
set-theory&algebra
+
–
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
sripo
519
views
sripo
asked
Feb 15, 2019
Algorithms
jest
algorithms
recurrence-relation
+
–
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
sripo
678
views
sripo
asked
Feb 15, 2019
Probability
jest
probability
discrete-mathematics
+
–
0
votes
1
answer
15
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)}...
sripo
988
views
sripo
asked
Feb 15, 2019
Programming in C
jest
programming-in-c
+
–
1
votes
1
answer
16
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...
sripo
815
views
sripo
asked
Feb 15, 2019
Algorithms
jest
algorithms
time-complexity
+
–
1
votes
0
answers
17
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...
sripo
350
views
sripo
asked
Feb 15, 2019
Probability
jest
engineering-mathematics
probability
+
–
1
votes
1
answer
18
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 ...
sripo
723
views
sripo
asked
Feb 15, 2019
Algorithms
jest
algorithms
time-complexity
+
–
0
votes
0
answers
19
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...
sripo
475
views
sripo
asked
Feb 15, 2019
Programming in C
jest
programming-in-c
+
–
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.
sripo
426
views
sripo
asked
Feb 15, 2019
Set Theory & Algebra
jest
set-theory&algebra
discrete-mathematics
+
–
0
votes
0
answers
21
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.
please give answer or name a book from where i can accessDescribe two different data structures to represent a graph. For each such representa-tion, specify a simple prop...
sahadebmandal
367
views
sahadebmandal
asked
Jan 18, 2019
Written Exam
jest
+
–
0
votes
0
answers
22
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.
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 etcIt should be relevant to ...
sripo
597
views
sripo
asked
Dec 25, 2018
Study Resources
career-advice
discrete-mathematics
gate-preparation
jest
+
–
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
sripo
1.6k
views
sripo
asked
Nov 14, 2018
Algorithms
recurrence-relation
algorithms
time-complexity
jest
+
–
2
votes
1
answer
24
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.
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 de...
Sukannya
984
views
Sukannya
asked
Feb 16, 2018
Probability
jest
+
–
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
Aman Chauhan
688
views
Aman Chauhan
asked
Mar 29, 2017
Others
jest
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register