GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

679.

(a) Obtain the eigen values of the matrix

(b) Determine whether each of the following is a tautology, a contradiction, or neither (“∨” is disjunction, “Λ” is conjunction, “->” is implication, “¬” in negation, and “<->” is biconditional (if and only if).
(i) A <-> (A ∨ A)
(ii) (A ∨ B) -> B
(iii) A Λ (¬(A ∨ B)
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
680.

(a) S = { (1,2) , (2,1) } is binary relation on set A = {1,2,3}. Is it irreflexive? Add the minimum number of ordered pairs to S to make it an equivalence relation. Give the modified S.
(b)
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
681.

Let A be a set of n(>0) elements. Let N_r be the number of binary relations on A and let N_f be the number of functions from A to A.
(a) Give the expression for N_r in terms of n.
(b) Give the expression for N_f in terms of n.
(c) Which is larger for all possible n, N_r or N_f?
[5 marks]

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
682.

From the following instance of a relation schema R(A,B,C), we can conclude that:

A B C

1 1 1

1 1 0

2 3 2

3 3 2

[2 marks]
(a) A functionally determines B and B functionally determines C
(b) A functionally determines B and B does not functionally determines C
(c) B does not functionally determines C
(d) A does not functionally determines B and B does not functionally determines C

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
683.

Relation R is decomposed using a set of functional dependencies, F, and relation S is decomposed using another set of functional dependencies, G. One decomposition is definitely BCNF, the other is definitely. 3NF, but it is not known which is which. To make a guaranteed identification, which one of the following tests should be used on the decompositions? (Assume that the closures of F and G are available). [2 marks]
(a) Dependency-preservation
(b) Lossless-join
(c) BCNF definition
(d) 3NF definition

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]
684.

A B⁺ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of length 8 bytes, disk blocks are of size 512 bytes, and index pointers are of size 4 bytes. Given this scenario, what would be the best choice of the degree (i.e. the number of pointers per node) of the B⁺ - tree? [2 marks]
(a) 16
(b) 42
(c) 43
(d) 44

asked in Computer Science And Engineering, 2002

View Comments [0 Reply]

801 1 ...‹‹112 113114 115 116 ›› ... 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