GATE CS question library

A priority queue is implemented as a Max-Heap. Initially, it has $5$ elements. The level-order traversal of the heap is: $10, 8, 5, 3, 2$. Two new elements $1$ and $7$ are inserted into the heap in that order. The level-order traversal of the heap after the insertion of the elements is:

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$?

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:

Consider the following C-program: void foo (int n, int sum) { 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?

Let r be a relation instance with schema R = (A, B, C, D). We define $r_1 = \pi_{A, B, C} (R)$ and $r_2=\pi_{A, D} (r)$. Let $s =r_1 \: * \: r_2$ where $*$ denotes natural join. Given that the decomposition of $r$ into $r_1$ and $r_2$ is lossy, which one of the following is TRUE?

Which one of the following statements about normal forms is $\text{FALSE}?$

Which of the following is a key factor for preferring $B^+$-trees to binary search trees for indexing database relations?

An organization has a class $B$ network and wishes to form subnets for $64$ departments. The subnet mask would be:

In a network of LANs connected by bridges, packets are sent from one LAN to another through intermediate bridges. Since more than one path may exist between two LANs, packets may have to be routed through multiple bridges. Why is the spanning tree algorithm used for bridge-routing?

The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is:

The address resolution protocol (ARP) is used for:

Packets of the same session may be routed through different paths in:

Increasing the RAM of a computer typically improves performance because:

What is the swap space in the disk used for?

Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured by having the I/O instruction privileged. In a CPU with memory mapped I/O, there is no explicit I/O instruction. Which one of the following is true for a CPU with memory mapped I/O?

Which one of the following is true for a CPU having a single interrupt request line and a single interrupt grant line?

The switching expression corresponding to $f(A,B,C,D)=\Sigma(1, 4, 5, 9, 11, 12)$ is:

The hexadecimal representation of (657)8 is:

The range of integers that can be represented by an $n$ bit $2’s$ complement number system is:

Consider the following circuit. Which one of the following is TRUE?