• Placement Questions
• /
• Gate
• /
• Programming

Frequently Asked Gate Programming Sample Question with Solutions

(#M40029646) GATE QUESTION GATE-CS Keep an EYE

Which of the following statements are TRUE about an SQL query?
P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause
Q : An SQL query can contain a HAVING clause only if it has a GROUP BY clause
R : All attributes used in the GROUP BY clause must appear in the SELECT clause
S : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause

option
(A) P and R
(B) P and S
(C) Q and R
(D) Q and S

Asked In Gate Rats (12 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (7)   (4) Submit Your Solution Database

(#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

(#M40019940) GATE QUESTION DIFFERENTIAL EQUATIONS Keep an EYE

how to find differential eqn. of all conics whose axes coincide with coordinate axes??

Asked In Gate vignesh (12 years ago)

Unsolved Read Solution (1)

Is this Puzzle helpful?   (10)   (9) Submit Your Solution Arrays

(#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

(#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

(#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

(#M40009840) GATE QUESTION Keep an EYE

Given digits 2,2,3,3,4,4,4,4 how many distinct 4 digit numbers greater than 3000 can be formed?

Asked In Gate Devendra Marghade (13 years ago)

Unsolved Read Solution (6)

Is this Puzzle helpful?   (44)   (13) Submit Your Solution Database

(#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

(#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