GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

277.

In a simplified computer the instructions are:
OP R_j,R_i :: Performs R_j OP R_i and stores the result in register R_i.
OP m,R_i :: Performs val OP R_i and stores the result in R_i val denotes the content of memory location m.
MOV m,R_i :: Moves the content of memory location m to register R_i.
MOV R_i,m - Moves the content of register R_i to memory location m.
The computer has only to registers, and OP is either ADD or SUB. Consider the following basic block:
t₁ = a+b
t₂ = c+d
t₃ = e-t2
t₄ = t₁-t₃
Assume that all operands are initially in memory. The final value of the computation should be in memory. What is the minimum number of MOV instructions in the code generated for this basic block? [2 marks]
(A) 2
(B) 3
(C) 5
(D) 6

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
278.

Consider the grammar with non-terminals N = {S,C,S₁} , terminals T = {a,b, i, t,e}, with S as the start symbol, and the following set of rules:
S→iCtSS₁|a
S₁→eS|ε
C→b
[2 marks]
The grammar is NOT LL(1) because:
(A) it is left recursive
(B) it is right recursive
(C) it is ambiguous
(D) it is not context-free.

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
279.

Consider the following two statements:
P: Every regular grammar is LL(1)
Q: Every regular set has a LR(1) grammar
Which of the following is TRUE? [2 marks]
(A) Both P and Q are true
(B) P is true and Q is false
(C) P is false and Q is true
(D) Both P and Q are false

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
280.

Consider the following C code segment:
int IsPrime(n)
{
int i,n;
for(i=2;i<=sqrt(n);i++)
if(n%i == 0)
{printf(“Not Prime\n”); return 0;}
return 1;
}
Let T (n)denote the number of times the for loop is executed by the program on input n. Which of the following is TRUE? [2 marks]
(A) T(n) = O(√n ) and T(n) = Ω(√n )
(B) T(n) = O(√n ) and T(n) = Ω(1)
(C) T(n) = O(n) and T(n) = Ω(√n )
(D) None of the above

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
281.

Consider the process of inserting an element into a Max Heap, where the Max Heap is represented by an array. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of comparisons performed is: [2 marks]
(A) Θ(log₂n)
(B) Θ(log₂logn)
(C) Θ(n)
(D) Θ(nlog₂n)

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
282.

An array of n numbers is given, where n is an even number. The maximum as well as the minimum of these n numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed? [2 marks]
(A) At least 2n − c comparisons, for some constant c, are needed.
(B) At most 1.5n − 2 comparisons are needed.
(C) At least nlog₂ n comparisons are needed.
(D) None of the above.

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]

801 1 ...‹‹45 4647 48 49 ›› ... 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