GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

85.

The grammar S → aSa | bS | c is [2 marks]
(A) LL(1) but not LR(1)
(B) LR (1) but not LL(1)
(C) Both LL(1) and LR(1)
(D) Neither LL(1) nor LR(1)

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2010

View Comments [1 Reply]
86.

The program below uses six temporary variables a, b, c, d, e, f.
a = 1
b = 10
c = 20
d = a + b
e = c + d
f = c + e
b = c + e
e = b + f
d = 5 + e
return d + f
Assuming that all operations take their operands from registers, what is the minimum number of registers needed to execute this program without spilling? [2 marks]
(A) 2
(B) 3
(C) 4
(D) 6

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2010

View Comments [1 Reply]
87.

The following C function takes a singly-linked list as input argument. It modifies the list by moving the last element to the front of the list and returns the modified list. Some part of the code is left blank.
typedef struct node
{
int value; struct node *next;
} Node;
Node *move_to_front (Node *head)
{
Node *p, *q;
if ( (head = = NULL) | | (head - > next = = NULL ) ) return head;
q = NULL; p = head;
while (p->next ! = NULL)
{
q = p;
p = p - > next;
}
return head;
}
Chose the correct alternative to replace the blank line. [2 marks]
(A) q = NULL; p - > next = head; head = p;
(B) q - > next = NULL; head = p; p - > next = head;
(C) head = p ; p - > next = q; q - > next = NULL;
(D) q - > next = NULL; p - > next = head; head = p;

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2010

View Comments [1 Reply]
88.

What is the value printed by the following C program?
# include <stdio . h>
int f(int *a, int n)
{
if (n < = 0 )
return 0;
else
if (*a % 2 = = 0 )
return *a + f (a + 1, n – 1) ;
else
return *a – f (a + 1, n – 1);
}
int main ( )
{
int a [ ] = {12, 7, 13, 4, 11, 6} ;
printf(“%d”, f (a, 6) ) ;
return 0;
}
[2 marks]
(A) -9
(B) 5
(C) 15
(D) 19

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2010

View Comments [2 Reply]
89.

The weight of a sequence a_o, a₁, ...........a_n-1 of real numbers is defined as a_o + a₁/2 +......a_n-1/2^n-1. A subsequence of a sequence is obtained by deleting some elements from the sequence, keeping the order of the remaining elements the same. Let X denote the maximum possible weight of a subsequence of a_o, a₁, ...........a_n-1 and Y the maximum possible weight of a subsequence of a₁, ...........a_n-1. Then X is equal to [2 marks]
(A) max(Y, a_o+Y)
(B) max(Y, a_o+Y/2)
(C) max(Y, a_o+2Y)
(D) a_o+ Y/2

asked in Computer Science And Engineering, 2010

View Comments [0 Reply]
90.

A 5-stage pipelined processor has Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Write Operand (WO) stages. The IF, ID, OF and WO stages take 1 clock cycle each for any instruction. The PO stage takes 1 clock cycle for ADD and SUB instructions, 3 clock cycles for MUL instruction, and 6 clock cycles for DIV instruction respectively. Operand forwarding is used in the pipeline. What is the number of clock cycles needed to execute the following sequence of instructions?

Instruction Meaning of instruction

I_o: MUL R₂,R₀,R₁
R₂ <- R₀*R₁

I₁: DIV R₅, R₃, R₄
R₅ <- R₃/R₄

I₂: ADD R₂, R₅, R₂
R₂ <- R₅+R₂

I₃: SUB R₅, R₂, R₆
R₅ <- R₂-R₆

[2 marks]
(A) 13
(B) 15
(C) 17
(D) 19

last reply by CpjJwWHV • 14 years ago • asked in Computer Science And Engineering, 2010

View Comments [1 Reply]

801 1 ...‹‹13 1415 16 17 ›› ... 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