Tag Archives: GATE-GATE CS 2012

Consider the following relations A, B, C. How many tuples does the result of the following relational algebra expression contain? Assume that the schema of… Read More »

Consider the above question. What output will be generated by the given code d\segment if: Line 1 is replaced by “auto int a = 1;”… Read More »

Consider the following C program filter_none edit close play_arrow link brightness_4 code int a, b, c = 0; void prtFun (void); int main () {… Read More »

Consider a random variable X that takes values +1 and −1 with probability 0.5 each. The values of the cumulative distribution function F(x) at x… Read More »

Register renaming is done in pipelined processors (A) as an alternative to register allocation at compile time (B) for efficient access to function parameters and… Read More »

The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocode… Read More »

Consider the set of strings on {0,1} in which, every substring of 3 symbols has at most two zeros. For example, 001110 and 011001 are… Read More »

Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2… Read More »

Consider a source computer(S) transmitting a file of size 106 bits to a destination computer(D)over a network of two routers (R1 and R2) and three links(L1, L2,… Read More »

Suppose (A, B) and (C,D) are two relation schemas. Let r1 and r2 be the corresponding relation instances. B is a foreign key that refers… Read More »

Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 On a demand paged virtual memory system running on… Read More »

A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1 indirect block address and 1 doubly indirect block… Read More »

Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by… Read More »

A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this… Read More »

Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4… Read More »