NIELIT STQC 2021 Quiz-34

If every two elements of a poset are comparable then the poset is called ________

Let A = {2, 3, 4, …, 100} with the partial order of divisibility. The number of maximal elements in the poset is.

Consider the following matrix A.

The value of x for which the matrix A is not invertible is?

A minimal DFA that is equivalent to a NDFA has:

Consider the following DFA:

Which of the following represents number of states needed for minimal DFA for (L(M) AND L(N))?

In a 4- bit look ahead carry adder circuit, the carry circuit is generated using the 2 - level AND - OR logic circuits then the number of AND gates required for carry circuit is ______

A 4-to-1 multiplexer has ___  select lines

Consider the relation scheme R = (E, F, G, H, I, J, K, L, M, N) and the set of functional dependencies {{E, F} → {G}, {F} →{I, J}, {E, H} → {K, L}, {K} → {M}, {L} →{N}} on R. What is the key for R?

Consider relation R with five attributes as R (A B C D E), How many super keys are possible if AB is the candidate key?