GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

157.

An unbalanced dice (with 6 faces, numbered from 1 to 6) is thrown. The probability that the face value is odd is 90% of the probability that the face value is even. The probability of getting any even numbered face is the same.
If the probability that the face is even given that it is greater than 3 is 0.75, which one of the following options is closest to the probability that the face value exceeds 3 ?
[2 marks]
(A) 0.453
(B) 0.468
(C) 0.485
(D) 0.492

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]
158.

Consider the HTML table definition given below:
< table border = 1 >
< tr > <td rowspan = 2 > ab </td>
<td colspan=2> cd</td>
</tr>
<tr> <td> ef </td>
<td rowspan = 2 > gh </td>
</tr>
<tr> <td colspan = 2 > ik </td>
</tr>
</table>
The number of the rows in each column and the number of columns in each row are
[1 mark]
(A) {2,2,3} and {2,3,2}
(B) {2,2,3} and {2,2,3}
(C) {2,3,2} and {2,3,2}
(D) {2,3,2} and {2,2,3}

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]
159.

The coupling between different modules of a software is categorized as follows:
I. Content coupling
II. Common coupling
III. Control coupling
IV. Stamp coupling
V. Data coupling
Coupling between modules can be ranked in the order of strongest (least desirable) to weakest (most desirable) as follows: [1 mark]
(A) I-II-III-IV-V
(B) V-IV-III-II-I
(C) I-III-V-II-IV
(D) IV-II-V-III-I

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]
160.

Consider the program below :
# include <stdio.h> int fun (int n, int *f_p)
{
int t, f;
if( n< = 1)
{
*f_p = 1;
return 1;
}
t = fun( n – 1, f_p);
f = t + *f_p;
*f_p = t;
return f;
}
int main( )
{
int x = 15;
printf(“%d\n”, fun(5, &x));
return 0;
}
The value printed is: [1 mark]
(A) 6
(B) 8
(C) 14
(D) 15

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

View Comments [3 Reply]

161.

Match all items in Group I with correct options from those given in Group 2.

Group 1 Group 2

P. Regular expression 1. Syntax analysis

Q. Pushdown automata 2. Code generation

R. Dataflow analysis 3. Lexical analysis

S. Register allocation 4. Code Optimization

[1 mark]
(A) P-4, Q-1, R-2, S-3
(B) P-3, Q-1, R-4, S-2
(C) P-3, Q-4, R-1, S-2
(D) P-2, Q-1, R-4, S-3

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]

162.

Which one of the following is FALSE? [1 mark]
(A) There is a unique minimal DFA for every regular language.
(B) Every NFA can be converted to an equivalent PDA.
(C) Complement of every context-free language is recursive.
(D) Every nondeterministic PDA can be converted to an equivalent deterministic PDA.

asked in Computer Science And Engineering, 2009

View Comments [0 Reply]

801 1 ...‹‹25 2627 28 29 ›› ... 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