GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

457.

A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is given below:
10, 8, 5, 3, 2
Two new elements ‘1’ and ‘7’ are inserted in the heap in that order. The level order traversal of the heap after the insertion of the elements is: [2 marks]
(a) 10, 8, 7, 5, 3, 2, 1
(b) 10, 8, 7, 2, 3, 1, 5
(c) 10, 8, 7, 1, 2, 3, 5
(d) 10, 8, 7, 3, 2, 1, 5

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
458.

Postorder traversal of a given binary search tree, T produces the following sequence of keys
10, 9, 23, 22, 27, 25, 15, 50, 95, 60, 40, 29
which one of the following sequences of keys can be the result of an in-order traversal of the tree T? [2 marks]
(a) 9, 10, 15, 22, 23, 25, 27, 29, 40, 50, 60, 95
(b) 9, 10, 15, 22, 40, 50, 60, 95, 23, 25, 27, 29
(c) 29, 15, 9, 10, 25, 22, 23, 27, 40, 60, 50, 95
(d) 95, 50, 60, 40, 27, 23, 22, 25, 10, 9, 15, 29

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
459.

Consider the following C-program:
double foo (double); /* Line 1 */
int main () {
double da, db;
// input da
db = foo (da);
}
double foo (double a) {
return a;
}
The above code compiled without any error or warning. If Line 1 is deleted, the above code will show: [2 marks]
(a) no compile warning or error
(b) some compiler-warnings not leading to unintended results
(c) some compiler-warnings due to type-mismatch eventually leading to unintended results
(d) compiler errors

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
460.

Consider the following C-program:
void foo (int n, int sum 0) {
int k = 0, j = 0;
if (n==0) return;
k = n % 10; j = n / 10;
sum = sum + k;
foo (j, sum);
printf (“%d,”, k);
}
int main () {
int a = 2048, sum = 0;
foo (a, sum);
printf(“%d\n”, sum);
}
What does the above program print? [2 marks]
(a) 8, 4, 0, 2, 14
(b) 8, 4, 0, 2, 0
(c) 2, 0, 4, 8, 14
(d) 2, 0, 4, 8, 0

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
461.

Let r be a relation instance with schema R=(A,B,C,D). We define r₁=Π_A,B,C(r)and r₂=Π_A,D(r). Let S =r₁ * r₂ where * denotes natural join. Given that the decomposition of r into r₁ and r₂ is lossy, which one of the following is TRUE? [1 mark]
(A) s ⊂ r
(B) r ∪ s=r
(C) r ⊂ s
(D) r*s=s

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]
462.

Which one of the following statements about normal forms is FALSE? [1 mark]
(a) BCNF is stricter than 3NF
(b) Lossless, dependency-preserving decomposition into 3NF is always possible
(c) Lossless, dependency-preserving decomposition into BCNF is always possible
(d) Any relation with two attributes is in BCNF

asked in Computer Science And Engineering, 2005

View Comments [0 Reply]

801 1 ...‹‹75 7677 78 79 ›› ... 134

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now