0 votes
1
Match List-I with List-II:$$\begin{array}{|c|c|c|c|} \hline {} & \text{List-I} & {} & \text{List-II} \\ \hline (a) & p \rightarrow q & (i) & \rceil ( q \rightarrow \rcei...
0 votes
3
Match the following :$\begin{array}{llll} & \textbf{List – I} & {} & \textbf{List – II} \\ \text{a.} & \text{Absurd} & \text{i.} & \text{Clearly impossible being con...
1 votes
4
0 votes
6
In propositional logic, which of the following is equivalent to $p \rightarrow q$?$\sim p\rightarrow q$$ \sim p \vee q$$ \sim p \vee \sim q$$p\rightarrow \sim q$
1 votes
9
1 votes
11
1 votes
12
If the input $\text{J}$ is connected through $\text{K}$ input of $\text{J-K}$, then flip-flop will behave as a D type flip-flopT type flip-flopS-R flip-flopToggle switch
1 votes
13
If a clock with time period $“T”$ is used with $n$ stage shift register, then output of final stage will be delayed by$nT$ sec$(n-1)T$ sec$n/T$ sec$(2n-1)T$ sec
0 votes
19
The multivalued dependencies (MVDs) can be eliminated using ______ normal form on _____ normal form relations.$1$st, $2$nd$2$nd, $3$rd$3$rd, BCNF$4$th, BCNF
1 votes
22
Which of the following desired features are beyond the capability of relational algebra?Aggregate ComputationMultiplicationFinding transitive closureAll of the above
1 votes
24
Consider the relational schema $\text{R(A B C D)}$ with following functional dependency set $F=\{A\rightarrow BC,C\rightarrow D\};$ The relation $\text{R}$ is in $2$NFBCN...
0 votes
25
Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$.$2...
1 votes
27
0 votes
28
If every functional dependency in set $E$ is also in closure of $F$ then this is classified as$FD$ is covered by $E$$E$ is covered by $F$$F$ is covered by $E$$F$ plus is ...
1 votes
29
0 votes
30