GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

133.

Let R and S be relational schemes such that R={a, b, c} and S={c}. Now consider the following queries on the database:

from R, S Where R.c = S.c
Which of the above queries are equivalent? [2 marks]
(A) I and II
(B) I and III
(C) II and IV
(D) III and IV

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]
134.

The following key values are inserted into a B⁺-tree in which order of the internal nodes is 3, and that of the leaf nodes is 2, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the order of leaf nodes is the maximum number of data items that can be stored in it. The B⁺-tree is initially empty.
10, 3, 6, 8, 4, 2, 1
The maximum number of times leaf nodes would get split up as a result of these insertions is [2 marks]
(A) 2
(B) 3
(C) 4
(D) 5

last reply by CpjJwWHV • 13 years ago • asked in Computer Science And Engineering, 2009

View Comments [1 Reply]
135.

Consider two transactions T₁ and T₂, and four schedules S₁, S₂, S₃, S₄ of T₁ and T₂ as given below:
T₁ : R₁[x] W₁ [x] W₁ [y]
T₂: R₂ [x] R₂ [y] W₂ [y]
S1: R₁[x] R₂ [x] R₂[y] W₁ [x] W₁ [y] W₂ [y]
S₂: R₁[x] W₁ [x] R₂[y] W₁ [x] R₂ [y] W₂ [y]
S₃: R₁[x] W₁ [x] R₂[x] W₁ [y] R₂ [y] W₂ [y]
S₄: R₂[x] R₂ [y] R₁[x] W₁ [x] W₁ [y] W₂ [y]
Which of the above schedules are conflict-serializable? [2 marks]
(A) S₁ and S₂
(B) S₂ and S₃
(C) S₃ only
(D) S₄ only

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]
136.

Which of the following statements are TRUE?
I. There exists parsing algorithm for some programming languages whose complexities are less then θ(n³)
II. A programming language which allows recursion to be implemented with static storage allocation
III. No L-attributed definition can be evaluated in the framework of bottom-up parsing
IV. Code improving transformations can be performed at both source language & intermediate code level [2 marks]
(A) I & II
(B) I & IV
(C) III & IV
(D) I,III & IV

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]
137.

The above DFA accepts the set of all strings over {0,1} that [2 marks]
(A) Begin either with 0 or 1
(B) end with 0
(C) end with 00
(D) contain the substring 00

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

View Comments [1 Reply]
138.

Let L = L1 ∩ L2, where L1 and L2 are languages as defined below:
L1 = {a^m b^m c aⁿ bⁿ | m,n³ ≥ 0}
L2 = {aⁱ bⁱ c^k | i, j, k ≥ 0} The L is [2 marks]
(A) not recursive
(B) regular
(C) context – free but not regular
(D) recursively enumerable but not context-free

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]

801 1 ...‹‹21 2223 24 25 ›› ... 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