int x = 128, y = 110;

do {

    if (x > y) x = x - y;

    else       y = y - x;

} while (x != y);

printf("%d", x);

1

Match List I with List II List I (Grammar Type) List II (Production Form) A. Type 3 Grammar …

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

2

Which of the following gates do not give output 1 when both inputs are 0?A. NAND gateB. NOR gateC. XOR gateD. XNOR gate

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

3

void main() {    int *i, a = 12, b = 2, c;    c = (a = a + b, b = a / b, a = a * b, b = a - b);&nbs…

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

4

Arrange the following types of testing in the order they are usually performed in the Software Development Life Cycle (…

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

5

Which of the following is NOT a parent selection technique used in genetic algorithm implementations?

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

6

Identify the correct statement(s) from the following with respect to Spinlock Semaphores:A. The name refers to busy wai…

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

7

CB84000D001C001C is the content of a UDP header in hexadecimal format. The source port number is:

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

8

In a Stop-and-Wait system, the bandwidth of the line is 1 Mbps, and 1 bit takes 30 milliseconds to make a round trip. T…

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

9

Binary equivalent to $(A0F)_{16}$ is:

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

10

Match List I with List II List I (Hashing Collision Handling Method)List II (Strategy) A. ChainingI. Check next slot …

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

1

Which of the following is not a requirement elicitation technique?

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

2

Which of the following cohesions are better than the Procedural Cohesion?A. Functional CohesionB. Sequential CohesionC.…

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

3

Consider the following steps used by a knowledge base designer to represent a world:A. Selects atoms to represent propo…

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

4

Only legal pointer operations:A. pointer + number → pointerB. pointer – number → numberC. pointer + pointer → pointerD.…

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

5

Which of the following statements are TRUE about encryption techniques?A. In symmetric key cryptography, the secrecy/pr…

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

6

Consider the following statements regarding Agent systems:A. Agent system comprises of an agent and an environment on w…

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

7

Which of the following algorithms use the Greedy strategy?A. Dijkstra’s algorithmB. Kruskal’s algorithmC. Huffman codin…

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

8

List I List II A. Overloading III. Supports compile-time polymorphism B. Early Binding …

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

9

Consider T1(A,B,C,D,E) with FDs { EB→C, D→E, EA→B } and T2(A,B,C,D) with FDs { C→A, A→B, A→D }. Which is TRUE?

Topic: UGC NET Computer Science 26 June 2025 (Paper II)

10

Once a process is executing on the CPU, which events could not occur?A. Issues an I/O request and then placed in the Re…

Topic: UGC NET Computer Science 26 June 2025 (Paper II)