Answers by vaibhav101 / GATE Overflow for GATE CSE

9 votes

1

GATE2014 EC-3: GA-4
The next term in the series $81, 54, 36, 24,\dots $ is_________.

The next term in the series $81, 54, 36, 24,\dots $ is_________.

3.5k views

answered Feb 1, 2018

2 votes

2

Test by Bikram | Mock GATE | Test 4 | Question: 24
An unsorted array has this property that every element in it is at most $d$ distance from its position in the sorted version of the array (where $d$ is a positive integer smaller than the size of the array). Which among the following algorithms is best suited to sort this array? Insertion Sort Quick Sort Heap Sort Merge Sort

An unsorted array has this property that every element in it is at most $d$ distance from its position in the sorted version of the array (where $d$ is a positive integer...

607 views

answered Jan 24, 2018

7 votes

3

GATE CSE 1994 | Question: 2.6
The probability of an event $B$ is $P_1$. The probability that events $A$ and $B$ occur together is $P_2$ while the probability that $A$ and $\bar{B}$ occur together is $P_3$. The probability of the event $A$ in terms of $P_1, P_2$ and $P_3$ is _____________

The probability of an event $B$ is $P_1$. The probability that events $A$ and $B$ occur together is $P_2$ while the probability that $A$ and $\bar{B}$ occur together is $...

4.6k views

answered Jan 12, 2018

4 votes

4

GATE CSE 2004 | Question: 78
Two $n$ bit binary strings, $S_1$ and $S_2$ are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number of bit positions where the two strings differ) is equal to $d$ is $\dfrac{^{n}C_{d}}{2^{n}}$ $\dfrac{^{n}C_{d}}{2^{d}}$ $\dfrac{d}{2^{n}}$ $\dfrac{1}{2^{d}}$

Two $n$ bit binary strings, $S_1$ and $S_2$ are chosen randomly with uniform probability. The probability that the Hamming distance between these strings (the number of b...

7.4k views

answered Jan 9, 2018

10 votes

5

CMI2013-A-07
Consider the following two statements. There are infinitely many interesting whole numbers. There are finitely many uninteresting whole numbers. Which of the following is true? Statements $1$ and $2$ are equivalent. Statement $1$ implies statement $2$. Statement $2$ implies statement $1$. None of the above.

Consider the following two statements.There are infinitely many interesting whole numbers.There are finitely many uninteresting whole numbers.Which of the following is tr...

2.4k views

answered Dec 12, 2017

2 votes

6

Discrete Maths Rosen 6th Edition - Is the section 'proofs and strategy' part of the Gate syllabus?
Hi. I am new to Gate preparation. It would be very helpful if someone could clarify: Are Section 1.6 and 1.7 (Introduction to Proofs and Proof Methods and Strategy) from Kenneth Rosen (6th Edition) part of the Gate Syllabus? I didn't see them mentioned in the syllabus, hence asking. Thanks.

Hi.I am new to Gate preparation. It would be very helpful if someone could clarify:Are Section 1.6 and 1.7 (Introduction to Proofs and Proof Methods and Strategy) from Ke...

994 views

answered Jul 12, 2017

–1 votes

7

functional dependency
Is the above relation is dependency preserved or not

Is the above relation is dependency preserved or not

1.0k views

answered Jul 12, 2017

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