# Tag Archives: GATE IT 2006

Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the… Read More
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the… Read More
A software project has four phases P1, P2, P3 and P4. Of these phases, P1 Is the first one and needs to be completed before… Read More
A software project has four phases P1, P2, P3 and P4. Of these phases, P1 Is the first one and needs to be completed before… Read More
Let L be a regular language. Consider the constructions on L below: repeat (L) = {ww | w ∊ L} prefix (L) = {u |… Read More
Let L be a regular language. Consider the constructions on L below: repeat (L) = {ww | w ∈ L} prefix (L) = {u |… Read More
Let L be a regular language. Consider the constructions on L below: I. repeat (L) = {ww | w ∊ L} II. prefix (L) =… Read More
A pipelined processor uses a 4-stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The arithmetic… Read More
A pipelined processor uses a 4-stage instruction pipeline with the following stages: Instruction fetch (IF), Instruction decode (ID), Execute (EX) and Writeback (WB). The arithmetic… Read More
x + y/2 = 9 3x + y = 10 What can be said about the Gauss-Seidel iterative method for solving the above set of… Read More
x + y/2 = 9 3x + y = 10 The value of the Frobenius norm for the above system of equations is: (A) 0.5… Read More
void swap(float* A1, float* A2) {     float temp;     if (*A1 = = *A2) return;     temp = *A1;     *A1 = *A2;     *A2 = temp;     return; }… Read More
void swap(float* A1, float* A2) {     float temp;     if (*A1 = = *A2) return;     temp = *A1;     *A1 = *A2;     *A2 = temp;     return; }… Read More
An array X of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is 0.… Read More
An array X of n distinct integers is interpreted as a complete binary tree. The index of the first element of the array is 0.… Read More