UGC NET 2019 Paper 2 Computer Science Prev Year Paper (04-Dec-2019) (Shift 1)

Question 1

Consider the language $L = \left\{ {{a^n}{b^{n - 3}}\ | n > 2} \right\}$ on &sum; = {a, b}. Which one of the following grammars generates the language L?

Accepted Answer

S &rarr; aaaA, A &rarr; aAb|&lambda;

Answer

S &rarr; aA|a, A &rarr; aAb|b

Answer

S &rarr; aaA|&lambda;, A &rarr; aAb|&lambda;

Answer

S &rarr; aaaA|a, A &rarr; aAb|&lambda;

Question 2

A computer uses a memory unit of 512 K words of 32 bits each. A binary instruction code is stored in one word of the memory. The instruction has four parts: an addressing mode field to specify one of the two-addressing mode (direct and indirect), an operation code, a register code part to specify one of the 256 registers and an address part. How many bits are there in addressing mode part, opcode part, register code part and the address part?

Accepted Answer

1, 4, 8, 19

Answer

1, 3, 9, 19

Answer

1, 4, 9, 18

Answer

1, 3, 8, 20

Question 3

What is the output of following C program?#include <stdio.h>main(){                int i, j, x = 0                for (i = 0; i < 5; ++i)                for (j = 0; j < i; ++j)                       {                                                            x + =(i + j &ndash; 1);                break;                }                Printf (&ldquo;%d&rdquo;, x);}

Accepted Answer

6

Answer

5

Answer

4

Answer

3

Question 4

Consider the following languages:${L_1} = \left\{ {{a^n}{b^n}{c^m}} \right\} \cup \left\{ {{a^n}{b^m}{c^m}} \right\},\;n,\;m \ge 0$${L_2} = \{ w{w^R}|w \in \left\{ {a,\;b} \right\}*\}$ Where R represents reversible operation.Which one of the following is (are) inherently ambiguous language(s)?

Accepted Answer

only L 1

Answer

only L 2

Answer

both L 1and L 2

Answer

neither L 1nor L 2

Question 5

A fuzzy conjunction operators, t(x, y), and a fuzzy disjunction operator, s(x, y), form a pair if they satisfy:

t(x, y) = 1 – s(1 – x, 1 - y).

If $t\left( {x,\;y} \right) = \frac{{xy}}{{\left( {x + y - xy} \right)}}$ then s(x, y) is given by

Accepted Answer

$\frac{{x\; + \;y\; - \;2xy}}{{1\; - \;xy}}$

Answer

$\frac{{x\; + \;y}}{{1\; -\; xy}}$

Answer

$\frac{{x\; + \;y\; - \;xy}}{{1\; - \;xy}}$

Answer

$\frac{{x\; + \;y\; - \;xy}}{{1\; + \;xy}}$

UGC NET 2019 Paper 2 Computer Science Prev Year Paper (04-Dec-2019) (Shift 1)

UGC NET (Paper 1) 2026 Mock Test Series

UGC NET Library and Information Science 2024 - 2025 Mock Test Series

UGC NET (Paper 1) 2025 Mock Test Series (Updated)

UGC NET-SET-JRF Previous Year Paper Test Series (Paper 1 & 2)

UGC NET-JRF-SET Teaching & Research Aptitude(General Paper I) Mock Test Series

UGC NET Electronic Science Mock Test Series

UGC NET Education Mock Test Series

UGC NET 2025 Sociology Mock Test Series

UGC NET 2025 Sanskrit Mock Test Series

UGC NET 2025 Political Science Mock Test Series (New)

UGC NET 2025 Management Mock Test Series

UGC NET 2025 History Mock Test Series

UGC NET 2025 Hindi Mock Test Series

UGC NET 2025 Geography Mock Test Series

UGC NET 2025 English Mock Test Series

UGC NET 2025 Education Mock Test Series

UGC NET 2025 Economics Mock Test Series

UGC NET 2025 Computer Science Mock Test Series

UGC NET 2025 Commerce Mock Test Series

UGC NET 2025 Paper 1 Mock Test Series