Aspire Faculty ID #18418 · Topic: UGC NET Computer Science June 2023 (Paper II) · Just now
UGC NET Computer Science June 2023 (Paper II)

Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R.

Assertion A: A process involves a library function to create a thread.

Reason R: The threads make system calls to convey their resource and I/O requirement to the Kernel.

In the light of the above statements, choose the correct answer from the options given below.

Solution

Assertion A is true because threads are generally created using library functions such as pthread_create().


Reason R is also true because threads can make system calls for resource and I/O requirements.


But Reason R does not correctly explain Assertion A.

Previous 10 Questions — UGC NET Computer Science June 2023 (Paper II)

Nearest first
1
Let N denote the set of all natural numbers and R be the relation on N X N defined by (a, b) R(c, d), if ad(b + c) = bc…
Topic: UGC NET Computer Science June 2023 (Paper II)
2
Consider the following statementsA. C-Fuzzy means clustering is a supervised method of learningB. PCA is used for dimen…
Topic: UGC NET Computer Science June 2023 (Paper II)
3
Sutherland Hodgeman method is used on
Topic: UGC NET Computer Science June 2023 (Paper II)
4
How will you free the memory allocated by the following program?#include <stdio.h>#define MAXROW 3#define MAXCOL …
Topic: UGC NET Computer Science June 2023 (Paper II)
5
Find the sum of all four digit numbers formed using the digits 1, 2, 4 and 6.
Topic: UGC NET Computer Science June 2023 (Paper II)
6
Consider a disk system with cylinders. The request to access the cylinders occurs in the following sequence:4, 34, 10, …
Topic: UGC NET Computer Science June 2023 (Paper II)
7
Match List I with List II List I List II A. The running time of straight forward recursive method to com…
Topic: UGC NET Computer Science June 2023 (Paper II)
8
What is the output of following code?main()struct s1{char *z;int i;struct s1 *p;}static struct s1 a[] = {{"Nagpur", 1, …
Topic: UGC NET Computer Science June 2023 (Paper II)
9
What will be the output of the following code?include <stdio.h>int main() {int a, b, c;a = 0x10; b = 010;c = a + …
Topic: UGC NET Computer Science June 2023 (Paper II)
10
Given below are two statements:Statement I: Fuzzifier is a part of a fuzzy systemStatement II: Inference engine is a pa…
Topic: UGC NET Computer Science June 2023 (Paper II)

Next 10 Questions — UGC NET Computer Science June 2023 (Paper II)

Ascending by ID
1
Let R (A, B, C, D) be a relational schema with following functional dependencies:$A \to B,\ B \to C$$C \to D$ and $D \t…
Topic: UGC NET Computer Science June 2023 (Paper II)
2
Consider the following table of arrival time and burst time for three processes P0, P1, P2:Process arrival time Burst t…
Topic: UGC NET Computer Science June 2023 (Paper II)
3
Which of the following scenario may lead to an irrecoverable error in a database system?
Topic: UGC NET Computer Science June 2023 (Paper II)
4
Given below are two statements:Which of the following statement/s is/are correct with respect to virtual memoryStatemen…
Topic: UGC NET Computer Science June 2023 (Paper II)
5
Which phase of compiler checks the grammar of programming?
Topic: UGC NET Computer Science June 2023 (Paper II)
6
Let $G = \frac{R}{{0}}$ and $H = {-1, 1}$ be groups under the multiplication. Then, the map $\phi : G \to H$ defined by…
Topic: UGC NET Computer Science June 2023 (Paper II)
7
Which of the following parser is most powerful parser?
Topic: UGC NET Computer Science June 2023 (Paper II)
8
Which of the following statement is correct?
Topic: UGC NET Computer Science June 2023 (Paper II)
9
Match List I with List II LIST I LIST II A. RAID level 2 I. Bit interleaved parity B. RAID lev…
Topic: UGC NET Computer Science June 2023 (Paper II)
10
Consider the following statements.A. The identity is unique in any monoid.B. A monoid is a group if there exists invers…
Topic: UGC NET Computer Science June 2023 (Paper II)
Ask Your Question or Put Your Review.

loading...