Aspire Faculty ID #18787 · 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. LocalizationI. Encapsulation
B. Packaging or binding of a collection of items.II. Abstraction
C. Mechanism that enables a designer to focus on essential details of a program component.III. Characteristic of software that indicates in a manner which information is concentrated in the program.
D. Information hiding.IV. Suppressing the operational details of a program component.
Choose the correct answer from the options given below:

Solution

We have to match each concept with its correct meaning.

First, consider Localization.

Localization means related information or functionality is concentrated in one place or module.

So, it matches with:

III. Characteristic of software that indicates in a manner which information is concentrated in the program.

Therefore,

$(A)-(III)$

Now, consider Packaging or binding of a collection of items.

This is the definition of Encapsulation.

Encapsulation means wrapping data and related operations together in one unit.

Therefore,

$(B)-(I)$

Now, consider the mechanism that enables a designer to focus on essential details of a program component.

This is the definition of Abstraction.

Abstraction hides unnecessary details and shows only essential features.

Therefore,

$(C)-(II)$

Now, consider Information hiding.

Information hiding means hiding or suppressing internal operational details of a program component.

Therefore,

$(D)-(IV)$

Final matching is:

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

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

Nearest first
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. BCNFI. It removes multivalued dependency.B. 3NFII. It is not always dependenc…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
3
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)
4
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)
5
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)
6
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)
7
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)
8
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)
9
 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)
10
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)

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

Ascending by ID
1
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)
2
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)
3
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)
4
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)
5
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)
6
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)
7
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)
8
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)
9
Consider the following:List IList II(A) Stack algorithm(I) Deadlock(B) Elevator algorithm(II) Disk scheduling(C) Priori…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
10
Consider the following statements of approximation algorithm:Statement I: Vertex-cover is a polynomial time 2-approxima…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
Ask Your Question or Put Your Review.

loading...