GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

79.

The following program is to be tested for statement coverage:
begin
if (a = = b) {S1; exit ;}
else if (c = = d){S2 ;}
else {S3 ; exit ;}
S4;
end
The test cases T1, T2, T3 and T4 given below are expressed in terms of the properties satisfied by the values of variables a, b, c and d. The exact values are not given.
T1: a, b, c and d are all equal
T2: a, b, c and d are all distinct
T3: a = b and c ! = d
T4: a ! = b and c = d
Which of the test suites given below ensures of statements S1, S2, S3 and S4?
[2 marks]
(A) T1, T2, T3
(B) T2, T4
(C) T3, T4
(D) T1, T2, T4

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

View Comments [1 Reply]
80.

The following functional dependencies hold for relations R(A, B, C) and S(B, D, E)
B → A,
A → C
The relation R contains 200tuples and the relation S contains 100tuples. What is the maximum number of tuples possible in the natural join
R⋈S ? [2 marks]
(A) 100
(B) 200
(C) 300
(D) 2000

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

View Comments [2 Reply]
81.

Consider the following schedule for transactions T1, T2 and T3:

Which one of the schedules below is the correct serialization of the above?
[2 marks]
(A) T1 → T3 → T2
(B) T2 → T1 → T3
(C) T2 → T3 → T1
(D) T3 → T1 → T2

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

View Comments [2 Reply]
82.

Consider the languages
L1 = {0ⁱ1^j | i≠j}
L2 = {0ⁱ1^j | i=j}
L3 = {0ⁱ1^j | i=2j+1}
L4 = {0ⁱ1^j | i≠2j}
Which one of the following statements is true? [2 marks]
(A) Only L2 is context free
(B) Only L2 and L3 are context free.
(C) Only L1 and L2 are context free.
(D) All are context free.

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

View Comments [1 Reply]
83.

Let w any string of length n in {0, 1}*. Let L be the set of all substring of w. What is the minimum number of states in a non-deterministic finite automation that accepts L?
[2 marks]
(A) n-1
(B) n
(C) n+1
(D) 2^n-1

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

View Comments [1 Reply]
84.

Let L = { w ε (0 + 1)* | w has even number of 1s}, i.e. L is the set of all bit strings with even number of 1s. Which one of the regular expressions below represents L?
[2 marks]
(A) (0*10*1) *
(B) 0*(10*10*)*
(C) 0*(10*1)*0*
(D) 0*1(10*1)*10*

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

View Comments [1 Reply]

801 1 ...‹‹12 1314 15 16 ›› ... 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