search
Log In

Recent questions tagged jest

1 vote
1 answer
1
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.
asked Feb 17 in Set Theory & Algebra vivek_mishra 257 views
1 vote
1 answer
2
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, 2019 in IISc/IITs N 401 views
1 vote
1 answer
3
Three dice are rolled independently. Probability of obtaining the difference from largest and smallest number as exactly 4 :
asked Feb 18, 2019 in Probability Sayan Bose 143 views
2 votes
0 answers
4
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, 2019 in Graph Theory Sayan Bose 162 views
2 votes
0 answers
5
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, 2019 in Set Theory & Algebra vivek_mishra 139 views
1 vote
1 answer
6
Solve the recurrence relation given as: T(n)=2T(n-2)+n; where T(2)=2 and T(1)=0 What is the time complexity?
asked Feb 17, 2019 in Algorithms vivek_mishra 457 views
1 vote
0 answers
7
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)
asked Feb 17, 2019 in Algorithms dan31 136 views
0 votes
0 answers
8
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, 2019 in Graph Theory dan31 147 views
1 vote
0 answers
9
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, 2019 in Graph Theory dan31 97 views
1 vote
1 answer
10
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, 2019 in Set Theory & Algebra sripo 126 views
3 votes
1 answer
11
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, 2019 in Set Theory & Algebra sripo 127 views
1 vote
1 answer
12
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, 2019 in Algorithms sripo 178 views
1 vote
1 answer
13
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, 2019 in Probability sripo 118 views
0 votes
1 answer
14
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.
asked Feb 15, 2019 in Programming sripo 129 views
1 vote
1 answer
15
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 path that visits ... , 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, 2019 in Algorithms sripo 152 views
1 vote
0 answers
16
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 15, 2019 in Probability sripo 73 views
1 vote
1 answer
17
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, 2019 in Algorithms sripo 93 views
0 votes
0 answers
18
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, 2019 in Programming sripo 113 views
1 vote
1 answer
19
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.
asked Feb 15, 2019 in Set Theory & Algebra sripo 74 views
0 votes
0 answers
20
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, 2019 in Written Exam sahadebmandal 70 views
0 votes
0 answers
21
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 train my mind to solve problems 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 sripo 163 views
1 vote
1 answer
22
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 sripo 220 views
2 votes
1 answer
23
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 consecutive ... 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 Sukannya 290 views
0 votes
0 answers
24
CSE- Jest exam rank-143 part -1 paper any chance of colleges
asked Mar 29, 2017 in Others Aman Chauhan 293 views
To see more, click for the full list of questions or popular tags.
...