Skip to content

Tag Archives: GATE-GATE-CS-2006

In the correct grammar of above question, what is the length of the derivation (number of steps starring from S) to generate the string albm… Read More
Which one of the following grammars generates the language L = {aibj | i ≠ j} (A) A (B) B (C) C (D) D Answer:… Read More
Consider the data given in above question. Consider the correct spanning tree for the previous question. Let host H1 send out a broadcast ping packet.… Read More
Consider the diagram shown below where a number of LANs are connected by (transparent) bridges. In order to avoid packets looping through circuits in the… Read More
A CPU has a 32 KB direct mapped cache with 128-byte block size. Suppose A is a twodimensional array of size 512×512 with elements that… Read More
A CPU has a 32 KB direct mapped cache with 128-byte block size. Suppose A is a twodimensional array of size 512×512 with elements that… Read More
Barrier is a synchronization construct where a set of processes synchronizes globally i.e. each process in the set arrives at the barrier and waits for… Read More
Barrier is a synchronization construct where a set of processes synchronizes globally i.e. each process in the set arrives at the barrier and waits for… Read More
A 3-ary max heap is like a binary max heap, but instead of 2 children, nodes have 3 children. A 3-ary heap can be represented… Read More
A 3-ary max heap is like a binary max heap, but instead of 2 children, nodes have 3 children. A 3-ary heap can be represented… Read More
Consider two cache organizations: The first one is 32 KB 2-way set associative with 32-byte block size. The second one is of the same size… Read More
Consider two cache organizations: The first one is 32 KB 2-way set associative with 32-byte block size. The second one is of the same size… Read More
The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n >= 6. Two vertices of G… Read More
The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n >= 6. Two vertices of G… Read More
The 2n vertices of a graph G corresponds to all subsets of a set of size n, for n >= 6 . Two vertices of… Read More