Register
Filter

Answers by Himanshu1

4 votes
31
Probability
In a hash table of size 6 currently the locations 0,2,4 and 5 are occupied. The probability of a new record going into location 1 with a hash function resolving collisions by linear probing is (assume uniform hashing) a)2/3 b)1/3 c)1 d) 1/6
In a hash table of size 6 currently the locations 0,2,4 and 5 are occupied. The probability of a new record going into location 1 with a hash function resolving collision...
11 votes
36
Combination
For a game in which 2 partners oppose 2 other partners, six men are available. If every possible pair must play against every other pair, the number of games to be played is 9a) 36 (b) 45 (c) 42 (d) 90
For a game in which 2 partners oppose 2 other partners, six men are available. If every possible pair must play against every other pair, the number of games to be played...
1 votes
38
toc
for DCFL there exists LL(k) or not?
for DCFL there exists LL(k) or not?
1 votes
39
which of the following statements is correct regarding Regular language?
1.Every Ragular Language have an equivalent LR(0)grammer. 2. Every DCFL have an equivalent LR(0) grammer
1.Every Ragular Language have an equivalent LR(0)grammer.2. Every DCFL have an equivalent LR(0) grammer
10 votes
40
In how many ways can the entrepreneur assign 5 different tasks to 3 employees if each should get atleast 1 task ?
For this I considered cases1. 1 job each to 2 people and then jobs to a single person2. 2 jobs each to 2 people and then 1 job to a single person For the first case I di...
2 votes
42
no. of gates
0 votes
43
longest common subsequence
For X= BDCABA and Y=ABCBDAB find length of lcs and no of such lcs..(solve it using table method)
For X= BDCABA and Y=ABCBDAB find length of lcs and no of such lcs..(solve it using table method)
2 votes
44
associative cache
Consider a 32 bit processor that has an on chip 16Kbyte 4 way set associative cache. assume that cache has a size of four 32 bit words. the set no in the cache to which the word from memory location FFFAE8FA is mapped_________
Consider a 32 bit processor that has an on chip 16Kbyte 4 way set associative cache. assume that cache has a size of four 32 bit words. the set no in the cache to which ...
0 votes
45
Hashing function
Consider a hashing function that resolves collision by quadratic probing. Assume the address space is indexed from 1 to 8.If a collision occurs at position 4, then the location which will never be probed is..
Consider a hashing function that resolves collision by quadratic probing. Assume the address space is indexed from 1 to 8.If a collision occurs at position 4, then the lo...
3 votes
47
combinatory
How many ways are there for a horse race with 4 horses to finish if ties are possible?(any number of horses may tie)
How many ways are there for a horse race with 4 horses to finish if ties are possible?(any number of horses may tie)
2 votes
48
probability
Explain this question . what they mean ? A six faced die is so biased that, when thrown, it is twice as likely to show an even number than an odd number. if it is thrown twice, what is the probability that sum of two numbers thrown is odd ans = 4/9
Explain this question . what they mean ?A six faced die is so biased that, when thrown, it is twice as likely to show an even number than an odd number. if it is thrown t...
1 votes
50
total probability
A bag contains 3 balls. Given that one of the balls is red and the other two balls can be either red or non-red..what is the probability of picking up a red ball?
A bag contains 3 balls. Given that one of the balls is red and the other two balls can be either red or non-red..what is the probability of picking up a red ball?
94 votes
54
GATE IT 2007 | Question: 25
What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ? $1$ $2$ $3$ $n$
What is the largest integer $m$ such that every simple connected graph with $n$ vertices and $n$ edges contains at least $m$ different spanning trees ?$1$$2$$3$$n$
5 votes
56
GATE IT 2006 | Question: 11
If all the edge weights of an undirected graph are positive, then any subset of edges that connects all the vertices and has minimum total weight is a Hamiltonian cycle grid hypercube tree
If all the edge weights of an undirected graph are positive, then any subset of edges that connects all the vertices and has minimum total weight is aHamiltonian cyclegri...
40 votes
58
GATE IT 2004 | Question: 15
Let $x$ be an integer which can take a value of $0$ or $1$. The statement if (x == 0) x = 1; else x = 0; is equivalent to which one of the following ? $x = 1 + x;$ $x = 1 - x;$ $x = x - 1;$ $x = 1\% x;$
Let $x$ be an integer which can take a value of $0$ or $1$. The statementif (x == 0) x = 1; else x = 0;is equivalent to which one of the following ?$x = 1 + x;$$x = 1 - ...
Page: