Aspire Faculty ID #18793 · 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) BIND(I) Block the caller until a connection attempt arrives
(B) LISTEN(II) Give a local address to a socket
(C) ACCEPT(III) Show willingness to accept connections
(D) SOCKET(IV) Create a new point
Choose the correct answer from the options given below:

Solution

This question is based on socket system calls.

BIND is used to assign a local address to a socket.

So,

$(A)-(II)$

LISTEN is used by the server to show that it is ready to accept incoming connection requests.

So,

$(B)-(III)$

ACCEPT is used to accept a connection request.

If no connection request is available, it blocks the caller until a connection attempt arrives.

So,

$(C)-(I)$

SOCKET is used to create a new communication endpoint.

So,

$(D)-(IV)$

Final matching is:

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

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

Nearest first
1
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)
2
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)
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) 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 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)
6
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)
7
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)
8
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)
9
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)
10
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)

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) Physical layer(I) Routing of the signals, divide the outgoing message into p…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
2
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)
3
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)
4
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)
5
Consider the following statements:Statement I: Conservative 2 PL is a deadlock-free protocol.Statement II: Thomas's wri…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
6
Consider the following statements:Statement I: Composite attributes cannot be divided into smaller subparts.Statement I…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
7
A top down approach to programming calls for:Statement I: Working from the general to the specific.Statement II: Postpo…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
8
Consider the following statements:Statement I: LALR parser is more powerful than canonical LR Parser.Statement II: SLR …
Topic: UGC NET Computer Science Sep 2022 (Paper II)
9
Consider the following statements about Context Free Language (CFL):Statement I: CFL is closed under homomorphism.State…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
10
Consider the following in Boolean Algebra$X:a\lor(b\land(a\lor c))=(a\lor b)\land(a\lor c)$$Y:a\land(b\lor(a\land c))=(…
Topic: UGC NET Computer Science Sep 2022 (Paper II)
Ask Your Question or Put Your Review.

loading...