GATE CSE 2008 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

Consider the following functions: F(n) = 2ⁿ
G(n) = n!
H(n) = n^logn
Which of the following statements about the asymptotic behaviour of f(n), g(n), and h(n) is true?

f(n) = O (g(n)); g(n) = O(h(n))

f(n) = $$\Omega$$ (g(n)); g(n) = O(h(n))

g(n) = O (f(n)); h(n) = O(f(n))

h(n) = O (f(n)); g(n) = $$\Omega$$ (f(n))

GATE CSE 2008

MCQ (Single Correct Answer)

-0.3

Which of the following describes a handle (as applicable to LR-parsing) appropriately?

It is the position in a sentential form where the next shift or reduce operation will occur

It is non-terminal whose production will be used for reduction in the next step

It is a production that may be used for reduction in a future step along with a position in the sentential form where the next shift or reduce operation will occur

It is the production p that will be used for reduction in the next step along with a position in the sentential form where the right hand side of the production may be found

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

Which of the following are true?

I. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation

II. Multi-level access link (or display) arrangement is needed to arrange activation records only if the programming language being implemented has nesting of procedures/functions

III. Recursion in programming languages cannot be implemented with dynamic storage allocation

IV. Nesting procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records

V. Programming languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records

II only

I, III and IV only

I, II and V only

II, III and V only

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if

The SLR(1) parser for G has S - R conflicts

The LR(1) parser for G has S - R conflicts

The LR(0) parser for G has S - R conflicts

The LALR(1) parser for G has reduce-reduce conflicts

PREVIOUS NEXT

GATE CSE Papers

2024