Aspire Faculty ID #18785 · Topic: UGC NET Computer Science Sep 2022 (Paper II) · Just now
UGC NET Computer Science Sep 2022 (Paper II)

Match List I with List II:
List-IList-II
A. BCNFI. It removes multivalued dependency.
B. 3NFII. It is not always dependency preserving.
C. 2NFIII. It removes transitive transparency.
D. 4NFIV. It removes partial functional dependency.
Choose the correct answer from the options given below:

Solution

We need to match each normal form with its correct property.

BCNF:

BCNF is stronger than 3NF.

A decomposition into BCNF is not always dependency preserving.

So,

$(A)-(II)$

3NF:

3NF removes transitive dependency.

In the question, it is written as transitive transparency, but the correct database term is transitive dependency.

So,

$(B)-(III)$

2NF:

2NF removes partial functional dependency.

A relation is in 2NF when it is in 1NF and no non-prime attribute is partially dependent on any candidate key.

So,

$(C)-(IV)$

4NF:

4NF removes multivalued dependency.

It is used when a relation has non-trivial multivalued dependencies.

So,

$(D)-(I)$

Final matching is:

$(A)-(II), (B)-(III), (C)-(IV), (D)-(I)$

Previous 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Nearest first
1
Let $\epsilon=0.0005$ and Let $R_e$ be the relation $\{(x,y)\in R^2:|x-y|<\epsilon\}$, $R_e$ could be interpreted as…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
2
For the graph; the following sequences of depth first search $(DFS)$ are given(A) $abcghf$(B) $abfchg$(C) $abfhgc$(D) $…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
3
Let $(\{a,b\},*)$ be a semigroup, where $a*a=b$.(A) $a*b=b*a$(B) $b*b=b$Choose the most appropriate answer from the opt…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
4
Consider $\alpha,\beta,\gamma$ as logical variables. Identify which of the following represents correct logical equival…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
5
In a game playing search tree, upto which depth $\alpha-\beta$ pruning can be applied?(A) Root $(0)$ level(B) $6$ level…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
6
Consider the grammar $S\to SbS\mid a$.Consider the following statements:The string $abababa$ has(A) two parse trees(B) …
Topic: UGC NET Computer Science Sep 2022 (Paper II)
7
 Consider the following related to Fourth Generation Technique $(4GT)$:(A) It controls efforts.(B) It controls res…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
8
Consider the following : List IList II(A) Activation record(I) Linker Loader(B) Location counter(II) Garbage Collection…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
9
Consider the properties of recursively enumerable sets:(A) Finiteness(B) Context Freedom(C) EmptinessWhich of the follo…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
10
Consider two lists A and B of three strings on $\{0,1\}$X:List AList B11111011110100Y:List AList B1010101111101011Which…
Topic: UGC NET Computer Science Sep 2022 (Paper II)

Next 10 Questions — UGC NET Computer Science Sep 2022 (Paper II)

Ascending by ID
1
Match List I with List II:List-IList-IIA. BCNFI. It removes multivalued dependency.B. 3NFII. It is not always dependenc…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
2
Match List I with List II:List-IList-IIA. LocalizationI. EncapsulationB. Packaging or binding of a collection of items.…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
3
Match List I with List II:List IList II(A) Type 0(I) Finite Automata(B) Type 1(II) Turing Machine(C) Type 2(III) Linear…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
4
Match List I with List II:List-IList-II(A) Ontological Engineering(I) Organizing subclass relations(B) Taxonomy Hierarc…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
5
Match List I with List II: List I List II (A) Least frequently used (I) Memory is distributed among processors (…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
6
Match List I with List II:List IList II(A) Firmware(I) Number of logical records into physical blocks(B) Batch file(II)…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
7
Match List I with List II:List IList II(A) DES(I) Key size - 256(B) AES(II) Key size - 1024(C) 3 DES(III) Key size - 56…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
8
Match List I with List II:List IList II(A) BIND(I) Block the caller until a connection attempt arrives(B) LISTEN(II) Gi…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
9
Match List I with List II:List IList II(A) Physical layer(I) Routing of the signals, divide the outgoing message into p…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
10
Consider the following algorithms and their running times:List IList II(A) Breadth First Search(I) $\theta(V+E)$(B) Rab…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
Ask Your Question or Put Your Review.

loading...