Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged jest
1
vote
1
answer
1
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.
vivek_mishra
asked
in
Set Theory & Algebra
Feb 17, 2020
by
vivek_mishra
667
views
jest
functions
set-theory
1
vote
1
answer
2
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?
N
asked
in
IISc/IITs
Apr 18, 2019
by
N
904
views
jest
iisc
cutoffs
mtech
admission
cse
1
vote
1
answer
3
JEST 2019
Three dice are rolled independently. Probability of obtaining the difference from largest and smallest number as exactly 4 :
Sayan Bose
asked
in
Probability
Feb 18, 2019
by
Sayan Bose
305
views
jest
probability
2
votes
0
answers
4
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
Sayan Bose
asked
in
Graph Theory
Feb 18, 2019
by
Sayan Bose
392
views
jest
graph-theory
2
votes
0
answers
5
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.
vivek_mishra
asked
in
Set Theory & Algebra
Feb 17, 2019
by
vivek_mishra
328
views
jest
2019
discrete-mathematics
1
vote
1
answer
6
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?
vivek_mishra
asked
in
Algorithms
Feb 17, 2019
by
vivek_mishra
751
views
jest-2019
jest
algorithms
recurrence-relation
1
vote
0
answers
7
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)
dan31
asked
in
Algorithms
Feb 17, 2019
by
dan31
288
views
jest
2019
algorithms
0
votes
0
answers
8
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.
dan31
asked
in
Graph Theory
Feb 17, 2019
by
dan31
311
views
jest
2019
discrete-mathematics
1
vote
0
answers
9
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.
dan31
asked
in
Graph Theory
Feb 17, 2019
by
dan31
286
views
jest
2019
discrete-mathematics
1
vote
1
answer
10
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
sripo
asked
in
Set Theory & Algebra
Feb 15, 2019
by
sripo
380
views
jest
discrete-mathematics
set-theory&algebra
3
votes
1
answer
11
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
sripo
asked
in
Set Theory & Algebra
Feb 15, 2019
by
sripo
541
views
jest
discrete-mathematics
set-theory&algebra
2
votes
2
answers
12
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
sripo
asked
in
Algorithms
Feb 15, 2019
by
sripo
411
views
jest
algorithms
recurrence-relation
1
vote
1
answer
13
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
sripo
asked
in
Probability
Feb 15, 2019
by
sripo
470
views
jest
probability
discrete-mathematics
0
votes
1
answer
14
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.
sripo
asked
in
Programming
Feb 15, 2019
by
sripo
650
views
jest
programming-in-c
1
vote
1
answer
15
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?
sripo
asked
in
Algorithms
Feb 15, 2019
by
sripo
554
views
jest
algorithms
time-complexity
1
vote
0
answers
16
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.
sripo
asked
in
Probability
Feb 15, 2019
by
sripo
236
views
jest
engineering-mathematics
probability
1
vote
1
answer
17
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.
sripo
asked
in
Algorithms
Feb 15, 2019
by
sripo
568
views
jest
algorithms
time-complexity
0
votes
0
answers
18
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.
sripo
asked
in
Programming
Feb 15, 2019
by
sripo
327
views
jest
programming-in-c
1
vote
1
answer
19
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.
sripo
asked
in
Set Theory & Algebra
Feb 15, 2019
by
sripo
307
views
jest
set-theory&algebra
discrete-mathematics
0
votes
0
answers
20
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.
sahadebmandal
asked
in
Written Exam
Jan 18, 2019
by
sahadebmandal
227
views
jest
0
votes
0
answers
21
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.
sripo
asked
in
Study Resources
Dec 25, 2018
by
sripo
473
views
career-advice
discrete-mathematics
gate-preparation
jest
1
vote
1
answer
22
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
sripo
asked
in
Algorithms
Nov 14, 2018
by
sripo
1.2k
views
recurrence-relation
algorithms
time-complexity
jest
2
votes
1
answer
23
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.
Sukannya
asked
in
Probability
Feb 17, 2018
by
Sukannya
642
views
jest
0
votes
0
answers
24
JEST EXAM
CSE- Jest exam rank-143 part -1 paper any chance of colleges
Aman Chauhan
asked
in
Others
Mar 29, 2017
by
Aman Chauhan
588
views
jest
To see more, click for the
full list of questions
or
popular tags
.
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
My journey from being a MSc student to AIR 239 in GATE CSE 2023 and qualified UGC-NET JRF.
NEEPCO Recruitment 2023
GATE CSE 2023 Results
IIIT Banglore MTech 2023-24
IIIT-Delhi MTech 2023-24
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(653)
Exam Queries
(844)
Tier 1 Placement Questions
(17)
Job Queries
(76)
Projects
(9)
Unknown Category
(866)
Recent questions tagged jest
Recent Blog Comments
congrats pranab
Congratulations @Pranab Paul 10 🥳
sir give access to these tests at least mid May...
Was there interview for mtech as well?
Check CCMT website for previous year cutoff for...