GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

349.

Consider the following grammar:
S → FR
R →*S| ε
F → id
In the predictive parser table, M, of the grammar the entries M[S, id] and M[R,$] respectively. [2 marks]
(A) {S → FR} and {R → e }
(B) {S → FR} and { }
(C) {S → FR} and {R → *S}
(D) {F → id} and {R → ε }

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
350.

Consider this C code to swap two integers and these five statements: the code
void swap (int *px, int *py) {
*px = *px - *py;
*py = *px + *py;
*px = *py - *px;
}
S1: will generate a compilation error
S2: may generate a segmentation fault at runtime depending on the arguments passed
S3: correctly implements the swap procedure for all input pointers referring to integers stored in memory locations accessible to the process
S4: implements the swap procedure correctly for some but not all valid input pointers
S5: may add or subtract integers and pointers. [2 marks]
(A) S1
(B) S2 and S3
(C) S2 and S4
(D) S2 and S5

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
351.

Consider the following code written in a pass-by-reference language like FORTRAN and these statements about the code.
subroutine swap(ix,iy)
it = ix
L1 : ix = iy
L2 : iy = it
end
ia = 3
ib = 8
call swap (ia, 1b+5)
print *, ia, ib
end
S1: The compiler will generate code to allocate a temporary nameless cell, initialize it to 13, and pass the address of the cell swap
S2: On execution the code will generate a runtime error on line L1
S3: On execution the code will generate a runtime error on line L2
S4: The program will print 13 and 8
S5: The program will print 13 and -2
Exactly the following set of statement(s) is correct: [2 marks]
(A) S1 and S2
(B) S1 and S4
(C) S3
(D) S1 and S5

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
352.

Consider these two functions and two statements S1 and S2 about them.

int work1(int *a, int i, int j)
{
int x = a[i+2];
a[j] = x+1;
return a[i+2] – 3;
}
int work2(int *a, int i, int j)
{
int t1 = i+2;
int t2 = a[t1];
a[j] = t2+1;
return t2 – 3;
}

S1: The transformation form work1 to work2 is valid, i.e., for any program state and input arguments, work2 will compute the same output and have the same effect on program state as work1
S2: All the transformations applied to work1 to get work2 will always improve the performance (i.e reduce CPU time) of work2 compared to work1 [2 marks]
(A) S1 is false and S2 is false
(B) S1 is false and S2 is true
(C) S1 is true and S2 is false
(D) S1 is true and S2 is true

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
353.

Given two arrays of numbers a₁....a_n and b₁.....b_n where each number is 0 or 1, the fastest algorithm to find the largest span (i, j ) such that
a_i + a_i+1 + ....a_j = b_i + b_i+1 + .....b_j, or report that there is not such span, [2 marks]
(A) Takes O(3ⁿ) and Ω(2ⁿ) time if hashing is permitted.
(B) Takes O(n³) and Ω(n^2.5) time in the key comparison model
(C) Takes Θ(n) time and space
(D) Takes O(√n) time only if the sum of the 2n elements is an even number

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]
354.

Consider the following C-function in which a[n] b[m] are two sorted integer arrays and c [n + m] be another integer array.
void xyz(int a[], int b [], int c []){
int i,j,k;
i=j=k=0;
while ((i<n) && (j<m))
if (a[i] < b[j]) c[k++] = a[i++];
else c[k++] = b[j++];
}
Which of the following condition(s) hold(s) after the termination of the while loop?
(i) j < m, k = n + j − 1, and a[n-1] < b[j] if i=n
(ii) i < n, k = m + i − 1, and b[m-1] ≤ a[i] if j=m
[2 marks]
(A) only (i)
(B) only (ii)
(C) either (i) or (ii) but not both
(D) neither (i) nor (ii)

asked in Computer Science And Engineering, 2006

View Comments [0 Reply]

801 1 ...‹‹57 5859 60 61 ›› ... 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