• Placement Questions
• /
• Gate
• /
• Programming

Gate Programming Sample Question with Solutions

(#M40154104) GATE QUESTION Hashing Keep an EYE

Consider a hash table with 100 slots. Collisions are resolved using chaining. Assuming
simple uniform hashing, what is the probability that the first 3 slots are unfilled after the first
3 insertions?

Asked In Gate premlata (10 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (0)   (0) Submit Your Solution

(#M40109884) GATE QUESTION Keep an EYE

There is a full binary tree with 200 leaf nodes then find the number of such nodes who has exactly 2 child nodes.

Asked In Gate Sourabh Prasad (10 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (1)   (0) Submit Your Solution

(#M40109882) GATE QUESTION Keep an EYE

int get(int n)
{
if n<1 get(n-1);
get(n-3);
return (0);
}

If get(6) is called through main then how many times get() function is called?

Asked In Gate Sourabh Prasad (10 years ago)

Unsolved Read Solution (4)

Is this Puzzle helpful?   (0)   (0) Submit Your Solution

(#M40104601) GATE QUESTION Keep an EYE

Assume that the memory is word addressable. The number of Memory references for accessing the data in executing the program completely is
(A) 10
(B) 11
(C) 20
(D) 21

Asked In Gate Ponni (10 years ago)

Unsolved

Is this Puzzle helpful?   (0)   (0) Submit Your Solution

(#M40040800) GATE QUESTION Digital Logic Keep an EYE

Number of Address lines required for 1MB?

a.) 16
b.) 20
c.) 18

Asked In Gate Sarabeshwar (11 years ago)

Solved AMIT SARKAR Read Solution (3)

Is this Puzzle helpful?   (25)   (4) Submit Your Solution

(#M40040799) GATE QUESTION Operating System Keep an EYE

Percentage of Error Distribution in Coding Phase?

a.) 20
b.) 30
c.) 50
d.) 70

Asked In Gate Sarabeshwar (11 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (0)   (0) Submit Your Solution

(#M40040798) GATE QUESTION Operating system Keep an EYE

Error Distribution in coding phase?

Asked In Gate Sarabeshwar (11 years ago)

Unsolved

Is this Puzzle helpful?   (0)   (0) Submit Your Solution

(#M40037610) GATE QUESTION Keep an EYE

Consider the following C function:
int f(int n)
{
static int are = 0;
If (n < = 0) return 1;
If (n > 3)
{ r = n;
return f (n – 2) + 2;
}
return f(n – 1) + r;
}
What is the value of f(5)?

Asked In Gate Hardip Bhalani (11 years ago)

Unsolved Read Solution (4)

Is this Puzzle helpful?   (3)   (1) Submit Your Solution Database

(#M40037385) GATE QUESTION binary search tree Keep an EYE

Which method is used by binary search tree ?
1- Dynamic programming
2-Divide and concquer
3- greedy algorithms
4- Broute force

Asked In Gate TARUN VISHNOI (11 years ago)

Unsolved Read Solution (6)

Is this Puzzle helpful?   (4)   (6) Submit Your Solution Technical

(#M40037381) GATE QUESTION Keep an EYE

Which algorithm will perform better ? O(n^2) or O(n^3)

1. O(n^2)
2. O(n^3)
3. Depends upon problem instance.
4. Can't say.

Asked In Gate TARUN VISHNOI (11 years ago)

Unsolved Read Solution (5)

Is this Puzzle helpful?   (0)   (0) Submit Your Solution