GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

643.

Consider the following three claims
I. (n + k)^m = Θ(n^m) where k and m are constants
II. 2ⁿ⁺¹ = O(2ⁿ)
III. 2²ⁿ⁺¹ = O(2ⁿ)
Which of these claims are correct? [1 mark]
(A) I and II
(B) I and III
(C) II and III
(D) I, II, and III

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
644.

Suppose the numbers 7, 5, 1, 8, 3, 6, 0, 9, 4, 2 are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. What is the in-order traversal sequence of the resultant tree? [1 mark]
(A) 7 5 1 0 3 2 4 6 8 9
(B) 0 2 4 3 1 6 5 9 8 7
(C) 0 1 2 3 4 5 6 7 8 9
(D) 9 8 6 4 2 3 0 1 5 7

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
645.

Assume that the SLR parser for a grammar G has n₁ states and the LALR parser for G has n₂ states. The relationship between n₁ and n₂ is [1 mark]
(A) n₁ is necessarily less than n₂
(B) n₁ is necessarily equal to n₂
(C) n₁ is necessarily greater than n₂
(D) None of the above

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
646.

In a bottom-up evaluation of a syntax directed definition, inherited attributes can
[1 mark]
(A) always be evaluated
(B) be evaluated only if the definition is L-attributed
(C) be evaluated only if the definition has synthesized attributes
(D) never be evaluated

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
647.

Which of the following suffices to convert an arbitrary CFG to an LL(1) grammar?
[1 mark]
(A) Removing left recursion alone
(B) Factoring the grammar alone
(C) Removing left recursion and factoring the grammar
(D) None of the above

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]
648.

If the strings of a language L can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true? [1 mark]
(A) L is necessarily finite
(B) L is regular but not necessarily finite
(C) L is context free but not necessarily regular
(D) L is recursive but not necessarily context free

asked in Computer Science And Engineering, 2003

View Comments [0 Reply]

801 1 ...‹‹106 107108 109 110 ›› ... 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