Turing Prep | Previous Year Questions | UGC NET CSE - June 2019

Question : 1

How many ways are there to place 8 indistinguishable balls into four distinguishable bins?

\(70\)

\(165\)

\(8C_4\)

\(8P_4\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 2

Match List-I with List-II:

\(\begin{array}{c c c c } & \text{List-I}\\ & \text{(Software} \\ & \text{Process} \\ & \text{Models)} & & \text{List-II} \\ & & & \text{(Software Systems)} \\ (a) & \text{Waterfall model} & (i) & \text{e-business software that starts with only the} \\ & & & \text{basic functionalities and then moves on to } \\ & & & \text{more advanced features} \\(b) & \text{Incremental} \\ & \text{development} & (ii) & \text{An inventory control system for super-} \\ & & & \text{market to be developed within three months} \\(c) & \text{Prototyping} & (iii) & \text{A virtual reality system for simulating} \\ & & & \text{vehicle nevigation in a highway} \\ (d) & \text{RAD} & (iv) & \text{Automate the manual system for student} \\ & & & \text{record maintenance in a school} \\ \end{array}\)

Choose the correct option from those given below:

\(a-ii; b-iv; c-i; d-iii \)

\(a-i; b-iii; c-iv; d-ii \)

\(a-iii; b-ii; c-iv; d-i \)

\(a-iv; b-i; c-iii; d-ii\)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 3

A computer has six tape drives with 𝑛 processes competing for them. Each process may need two drives. What is the maximum value of 𝑛 for the system to be deadlock free?

5

4

3

6

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 4

In the context of 3D computer graphics, which of the following statements is/are true?

P : Orthographic transformations keep parallel lines parallel.

Q : Orthographic transformations are affine transformations.

Select the correct answer from the options given below:

Both P and Q

Neither P nor Q

Only P

Only Q

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 5

Which of the following statements are DML statements?

(a) Update [tablename]

Set [columnname]=VALUE

(b) Delete [tablename]

(c) Select * from [tablename]

a and b

a and d

a, b and c

b and c

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 6

What percentage (%) of the IPv4, IP address space do all class C addresses consume?

12.5%

25%

37.5%

50%

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 7

Which of the following key constraints is required for functioning of foreign key in the context relational databases?

Unique key

Primary key

Candidate key

Check key

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 8

Software reuse is

the process of analysing software with the objective of recovering its design and specification

the process of using existing software artifacts and knowledge to build new software

concerned with reimplementing legacy system to make them more maintainable

the process of analysing software to create a representation of a higher level of abstraction and breaking software down into its parts to see how it works

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 9

Which of the following is principal conjunctive normal form for \([(𝑝∨𝑞)∧ ¬𝑝→¬𝑞] \) ?

\(𝑝 ∨¬𝑞 \)

\(𝑝∨𝑞 \)

\(¬𝑝∨𝑞 \)

\(¬𝑝 ∨¬𝑞 \)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 10

Match List-I with List-II:

\(\begin{array}{cccc} {} & \text{List-I} & {} & \text{List-II} \\ (a) & p \rightarrow q & (i) & \rceil ( q \rightarrow \rceil p) \\ (b) & p \vee q & (ii) & p \wedge \rceil q \\ (c) & p \wedge q & (iii) & \rceil p \rightarrow q \\ (d) & \rceil ( p \rightarrow q) & (iv) & \rceil p \vee q \\ \end{array}\)

Choose the correct option from those given below:

\((a) – (ii); (b) – (iii); (c) – (i); (d) – (iv) \)

\((a) – (ii); (b) – (i); (c) – (iii); (d) – (iv) \)

\((a) – (iv); (b) – (i); (c) – (iii); (d) – (ii) \)

\((a) – (iv); (b) – (iii); (c) – (i); (d) – (ii)\)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 11

Consider the following methods:

𝑀₁: Mean of maximum

𝑀₂: Centre of area

𝑀₃: Height method

Which of the following is/are defuzzification method(s)?

Only 𝑀₂

Only 𝑀₁and 𝑀₂

Only 𝑀₂ and 𝑀₃

𝑀₁, 𝑀₂ and 𝑀₃

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 12

Replacing the expression 4∗2⋅14 by 8⋅56 is known as

constant folding

induction variable

strength reduction

code reduction

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 13

A fuzzy conjunction operator denoted as \(𝑡(𝑥,𝑦)\) and a fuzzy disjunction operator denoted as \(𝑠(𝑥,𝑦)\) form a dual pair if they satisfy the condition:

\(𝑡(𝑥,𝑦)=1−𝑠(𝑥,𝑦) \)

\(𝑡(𝑥,𝑦)=𝑠(1−𝑥,1−𝑦) \)

\(𝑡(𝑥,𝑦)=1−𝑠(1−𝑥,1−𝑦) \)

\(𝑡(𝑥,𝑦)=𝑠(1+𝑥,1+𝑦)\)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 14

Which data structure is used by the compiler for managing variables and their attributes?

Binary tree

Link list

Symbol table

Parse table

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 15

Which type of addressing mode, less number of memory references are required?

Immediate

Implied

Register

Indexed

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 16

How many different Boolean functions of degree \(𝑛\) are the

\(2^{2^𝑛} \)

\((2^2)^𝑛 \)

\(2^{2^𝑛}−1 \)

\(2^𝑛 \)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 17

Consider the equation \((146)_𝑏+(313)_{𝑏−2}=(246)_8\). Which of the following is the value of \(𝑏\)?

8

7

10

16

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 18

Match List-I with List-II:

\(\begin{array}{cccc} {}& \text{List-I} & {} & \text{List-II} \\ (a) & \text{Disk} & (i) & \text{Thread} \\ (b) & \text{CPU} & (ii) & \text{Signal} \\ (c) & \text{Memory} & (iii) & \text{File system} \\ (d) & \text{Interrupt} & (iv) & \text{Virtual address space} \\ \end{array}\)

Choose the correct option from those given below:

\(a-i; b-ii; c-iii; d-iv \)

\(a-iii; b-i; c-iv; d-ii \)

\(a-ii; b-i; c-iv; d-iii \)

\(a-ii; b-iv; c-iii; d-i\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 19

The value of the derivative of Sigmoid function given by

\(f(x)=\dfrac{1}{1+e^{-2x}}\)

at \(𝑥=0\) is

\(0\)

\(1 \over 2\)

\(1 \over 4\)

\(\infty\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 20

In the TCP/IP model, encryption and decryption are functions of ____ layer.

data link

network

transport

application

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 21

Suppose that a connected planar graph has six vertices, each of degree four. Into how many regions is the plane divided by a planar representation of this graph?

6

8

12

20

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 22

Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequences:

4,34,10,7,19,73,2,15,6,20

Assuming that the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 1 ms to move from the cylinder to adjacent one and the shortest seek time first policy is used?

357 ms

238 ms

276 ms

119 ms

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 23

Which of the following problems is/are decidable problem(s) (recursively enumerable) on turing machine 𝑀?

(a) 𝐺 is a CFG with 𝐿(𝐺)=𝜙

(b) There exist two TMs 𝑀₁ and 𝑀₂ such that 𝐿(𝑀)⊆{𝐿(𝑀₁)∪𝐿(𝑀₂)}= language of all TMs.

(c) 𝑀 is a TM that accepts 𝜔 using at most 2^∣𝜔∣ cells of tape

(a) and (b) only

(a) only

(a), (b) and (c)

(c) only

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 24

Consider the Euler’s phi function given by

\(\phi(n) = n \underset{p/n}{\Pi } \bigg( 1 – \frac{1}{p} \bigg)\)

where \(𝑝\) runs over all the primes dividing \(𝑛\). What is the value of \(𝜙(45)\)?

3

12

6

24

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 25

Consider double hashing of the form

\(h(k,i)=(h_1(k)+ih_2(k)) \text{mod m}\) where

\(h_{1}(k) = \text{k mod m} \ , \ \ h_{2}(k)=1+(\text{k mod n})\) where \(n=m-1\) and \(m=701\) . For \(𝑘=123456\), what is the difference between first and second probes in terms of slots?

255

256

257

258

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 26

At a particular time of computation, the value of a counting semaphore is 7. Then 20 𝑃 (wait) operations and 15 𝑉 (signal) operations are completed on this semaphore. What is the resulting value of the semaphore?

28

12

2

42

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 27

Software validation mainly checks for inconsistencies between

use cases and user requirements

implementation and system design blueprints

detailed specifications and user requirements

functional specifications and use cases

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 28

Consider the poset ({3,5,9,15,24,45},∣).

Which of the following is correct for the given poset ?

There exist a greatest element and a least element

There exist a greatest element but not a least element

There exist a least element but not a greatest element

There does not exist a greatest element and a least element

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 29

Shift-reduce parser consists of

(a) input buffer

(b) stack

(c) parse table

Choose the correct option from those given below:

(a) and (b) Only

(a) and (c) Only

(c) Only

(a), (b) and (c)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 30

For a statement

A language \(𝐿⊆Σ^∗\) is recursive if there exists some turing machine \(𝑀\). Which of the following conditions is satisfied for any string \(𝜔\)?

If \(𝜔∈𝐿\), then \(𝑀\) accepts \(𝜔\) and \(𝑀\) will not halt

If \(𝜔∉𝐿\), then \(𝑀\) accepts \(𝜔\) and \(𝑀\) will halt by reaching at final stateate

If \(𝜔∉𝐿\), then \(𝑀\) halts without reaching to acceptable state

If \(𝜔∉𝐿\), then \(𝑀\) halts without reaching to an acceptable state

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 31

K-mean clustering algorithm has clustered the given 8 observations into 3 clusters after 1st iteration as follows:

𝐶1 : {(3,3),(5,5),(7,7)}

𝐶2 : {(0,6),(6,0),(3,0)}

𝐶3 : {(8,8),(4,4)}

What will be the Manhattan distance for observation (4,4) from cluster centroid 𝐶1 in the second iteration?

\(2\)

\(\sqrt 2\)

\(0\)

\(18\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 32

What is the output of the following JAVA program?

public class Good {

private int m;

public Good (int m){this.m=m;}

public Boolean equals (Good n) {return n.m==m;}

public static void main (string args[]){

Good m1 = new Good(22);

Good m2 = new Good(22);

Object s1 = new Good(22);

Object s2 = new Good(22);

System.out.println(m1.equals(m2));

System.out.println(s1.equals(s2));

System.out.println(m1.equals(s2));

System.out.println(s1.equals(m2));

}

True, True, False, False

True, False, True, False

True, True, False, True

True, False, False, False

Correct Answer : MTA

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 33

In relational databases, if relation R is in BCNF, then which of the following is true about relation R?

R is in 4NF

R is not in 1NF

R is in 2NF and not in 3NF

R is in 2NF and 3NF

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 34

Find the zero-one matrix of the transitive closure of the relation given by the matrix \(A\) :

\(A =\begin{bmatrix} 1 & 0& 1\\ 0 & 1 & 0\\ 1& 1& 0 \end{bmatrix}\)

\(\begin{bmatrix} 1 & 1& 1\\ 0 & 1 & 0\\ 1& 1& 1 \end{bmatrix}\)

\(\begin{bmatrix} 1 & 0& 1\\ 0 & 1 & 0\\ 1& 1& 0 \end{bmatrix}\)

\(\begin{bmatrix} 1 & 0& 1\\ 0 & 1 & 0\\ 1& 0& 1 \end{bmatrix}\)

\(\begin{bmatrix} 1 & 1& 1\\ 0 & 1 & 0\\ 1& 0& 1 \end{bmatrix}\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 35

In relational database management, which of the following is/are property/properties of candidate key?

P: Uniqueness

Q: Irreducibility

P only

Q only

Both P and Q

Neither P nor Q

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 36

Consider three CPU intensive processes, which require 10, 20 and 30 units of time and arrive at times 0, 2 and 6 respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end.

4

2

3

1

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 37

Reinforcement learning can be formalized in terms of ____ in which the agent initially only knows the set of possible _____ and the set of possible actions.

Markov decision processes, objects

Hidden states, objects

Markov decision processes, states

objects, states

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 38

Which of the following statements is/are true?

P : In a scripting language like JacaScript, types are typically associated with values, not variables.

Q : It is not possible to show images on a web page without the <img> tag of HTML.

Select the correct answer from the options given below:

P only

Q only

Both P and Q

Neither P nor Q

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 39

Match List-I with List-II:

\(\begin{array}{cccc} {} & \text{List-I} & {} & \text{List-II} \\ (a) & \text{Prim’s algorithm} & (i) & O(V^3 \log V) \\ (b) & \text{Dijkstra’s algorithm} & (ii) & O(VE^2) \\ (c) & \text{Faster all-pairs shortest path} & (iii) & O(ElgV) \\ (d) & \text{Edmonds-Karp algorithm} & (iv) & O(V^2) \\ \end{array}\)

Choose the correct option from those options given below:

\((a) – (ii); (b)-(iv); (c)-(i); (d)-(iii) \)

\((a) – (iii); (b)-(iv); (c)-(i); (d)-(ii) \)

\((a) – (ii); (b)-(i); (c)-(iv); (d)-(iii) \)

\((a) – (iii); (b)-(i); (c)-(iv); (d)-(ii)\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 40

How many address lines and data lines are required to provide a memory capacity of 16𝐾 × 16?

10,4

16,16

14,16

4,16

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 41

Consider the following steps:

𝑆₁: Characterize the structure of an optimal solution

𝑆₂: Compute the value of an optimal solution in bottom-up fashion

Which of the following step(s) is/are common to both dynamic programming and greedy algorithms?

Only 𝑆₁

Only 𝑆₂

Both 𝑆₁ and 𝑆₂

Neither 𝑆₁ nor 𝑆₂

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 42

Hadoop (a big data tool) works with number of related tools. Choose from the following, the common tools included into Hadoop:

MySQL, Google API and Map reduce

Map reduce, Scala and Hummer

Map reduce, H Base and Hive

Map reduce, Hummer and Heron

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 43

Match List-I with List-II :

where \(𝐿_1\): Regular language

\(𝐿_2\): Context-free language

\(𝐿_3\): Recursive language

\(𝐿_4\): Recursively enumerable language

\(\begin{array}{clcl} {}& \text{List-I} & {} & \text{List-II} \\ \text{(a)} & \overline{L_3} \cup L_4 & \text{(i)} & \text{Context-free language} \\ \text{(b)} & \overline{L_2} \cup L_3 & \text{(ii)} & \text{Recursively enumerable language} \\ \text{(c)} & L_{1}^{\ast} \cap L_2 & \text{(iii)} & \text{Recursive Language} \\ \end{array}\)

Choose the correct option from those given below :

\((a)-(ii); (b)-(i); (c)-(iii) \)

\((a)-(ii); (b)-(iii); (c)-(i) \)

\((a)-(iii); (b)-(i); (c)-(ii) \)

\((a)-(i); (b)-(ii); (c)-(iii)\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 44

A fully connected network topology is a topology in which there is a direct link between all pairs of nodes. Given a fully connected network with \(𝑛\) nodes, the number of direct links as a function of \(𝑛\) can be expressed as

\(\frac{n(n+1)}{2}\)

\(\frac{(n+1)}{2}\)

\(\frac{n}{2}\)

\(\frac{n(n-1)}{2}\)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 45

Suppose that the register 𝐴 and the register 𝐾 have the bit configuration. Only the three leftmost bits of 𝐴 are compared with memory words because 𝐾 has 1’s in these positions. Because of its organization, this type of memory is uniquely suited to parallel searches by data association. This type of memory is known as

RAM

ROM

content addressable memory

secondary memory

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 46

What will be the number of states when a MOD-2 counter is followed by a MOD-5 counter?

5

10

15

20

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 47

Consider the following properties with respect to a flow network \(𝐺=(𝑉,𝐸)\) in which a flow is a real-valued function \(𝑓:𝑉×𝑉→𝑅\):

\(𝑃_1\): For all \(𝑢,𝑣,∈𝑉,𝑓(𝑢,𝑣)=−𝑓(𝑣,𝑢)\)

\(𝑃_2\): \(\underset{v \in V}{\Sigma} f(u,v)=0\) for all \(𝑢∈𝑉\)

Which one of the following is/are correct?

Only \(𝑃_1\)

Only \(𝑃_2\)

Both \(𝑃_1\) and \(𝑃_2\)

Neither \(𝑃_1\) nor \(𝑃_2\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 48

In the context of software testing, which of the following statements is/are NOT correct?

P: A minimal test set that achieves 100% path coverage will also achieve 100% statement coverage.

Q: A minimal test set that achieves 100% path coverage will generally detect more faults than one that achieves 100% statement coverage.

R: A minimal test set that achieves 100% statement coverage will generally detect more faults than one that achieves 100% branch coverage.

R only

Q only

P and Q only

Q and R only

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 49

Let \(A_{\alpha_0}\) denotes the \(𝛼\)-cut of a fuzzy set \(𝐴\) at \(\alpha_0\). If \(\alpha_1 < \alpha_2\), then

\(A_{\alpha_1} \supseteq A_{\alpha_2}\)

\(A_{\alpha_1} \supset A_{\alpha_2}\)

\(A_{\alpha_1} \subseteq A_{\alpha_2}\)

\(A_{\alpha_1} \subset A_{\alpha_2}\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 50

Consider the following:

(a) Evolution

(b) Selection

(c) Reproduction

(d) Mutation

Which of the following are found in genetic algorithms?

(b), (c) and (d) Only

(b) and (d) Only

(a), (b), (c) and (d)

(a), (b) and (d) Only

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 51

Which of the following statements is/are true with regard to various layers in the Internet stack?

P: At the link layer, a packet of transmitted information is called a frame.

Q: At the network layer, a packet of transmitted information is called a segment.

P only

Q only

P and Q

Neither P nor Q

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 52

Consider the following C-code fragment running on a 32-bit 𝑋86 machine:

typedef struct {

union {

unsigned char a;

unsigned short b;

} U;

unsigned char c;

}S;

S B[10];

S*p=&B[4];

S*q=&B[5];

p → U.b=0x1234;

/* structure S takes 32-bits */

If M is the value of 𝑞−𝑝 and 𝑁 is the value of ((int )&(𝑝→𝑐))–((int)𝑝), then (𝑀,𝑁) is

(1, 1)

(3, 2)

(1, 2)

(4, 4)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 53

Consider an LPP given as

\(\text{Max } Z=2x_1-x_2+2x_3\)

subject to the constraints

\(2x_1+x_2 \leq 10 \\ x_1+2x_2-2x_3 \leq 20 \\ x_1 + 2x_3 \leq 5 \\ x_1, \: x_2 \: x_3 \geq 0\)

What shall be the solution of the LLP after applying first iteration of the Simplex Method?

\(x_1 = \frac{5}{2},\: x_2=0, \: x_3=0, \: Z=5\)

\(x_1 = 0, x_2=0, \: x_3=\frac{5}{2}, \: Z=5\)

\(x_1 = 0, x_2=\frac{5}{2}, \: x_3=0, \: Z=-\frac{5}{2}\)

\(x_1 = 0, x_2=0, \: x_3=10, \: Z=20\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 54

A Web application and its support environment has not been fully fortified against attack. Web engineers estimate that the likelihood of repelling an attack is only 30 percent. The application does not contain sensitive or controversial information, so the threat probability is 25 percent. What is the integrity of the web application?

0.625

0.725

0.775

0.825

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 55

Which of the following terms best describes Git?

Issue Tracking System

Integrated Development Environment

Distributed Version Control System

Web-based Repository Hosting Service

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 56

How can the decision algorithm be constructed for deciding whether context-free language 𝐿 is finite?

(a) By constructing redundant CFG G in CNF generating language 𝐿

(b) By constructing non-redundant CFG G in CNF generating language 𝐿

(c) By constructing non-redundant CFG G in CNF generating language 𝐿−{∧} ( ∧ stands for null)

Which of the following is correct?

(a) Only

(b) Only

(c) Only

None of (a), (b) and (c)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 57

For which values of 𝑚 and 𝑛 does the complete bipartite graph 𝑘_𝑚,𝑛 have a Hamiltonian circuit ?

𝑚≠𝑛, 𝑚,𝑛≥2

𝑚≠𝑛, 𝑚,𝑛≥3

𝑚=𝑛, 𝑚,𝑛≥2

𝑚=𝑛, 𝑚,𝑛≥3

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 58

What is the name of the protocol that allows a client to send a broadcast message with its MAC address and receive an IP address in reply?

ARP

DNS

RARP

ICMP

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 59

The RSA encryption algorithm also works in reverse, that is, you can encrypt a message with the private key and decrypt it using the public key. This property is used in

instruction detection systems

digital signatures

data compression

certification

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 60

Which of the following features is supported in the rational database model?

Complex data-types

Multivalued attributes

Associations with multiplicities

Generalization relationships

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 61

Which of the following statements is/are true?

P: In software engineering, defects that are discovered earlier are more expensive to fix.

Q: A software design is said to be a good design, if the components are strongly cohesive and weakly coupled.

Select the correct answer from the options given below:

P only

Q only

P and Q

Neither P nor Q

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 62

For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due to

non-uniform distribution of requests

arm starting or stopping inertia

higher capacity of tracks on the periphery of the platter

use of uniform arm scheduling policies

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 63

How many states are there in a minimum state automata equivalent to regular expression given below?

Regular expression is 𝑎^∗𝑏(𝑎+𝑏)

1

2

3

4

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 64

How many bit strings of length ten either start with a 1 bit or end with two bits 00 ?

320

480

640

768

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 65

Consider that a process has been allocated 3 frames and has a sequence of page referencing as 1,2,1,3,7,4,5,6,3,1.

What shall be the difference in page faults for the above string using the algorithms of LRU and optimal page replacement for referencing the string?

2

0

1

3

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 66

Software products need adaptive maintenance for which of the following reasons?

To rectify bugs observed while the system is in use

When the customers need the product to run on new platform

To support the new features that users want it to support

To overcome wear and tear caused by the repeated use of the software

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 67

Consider the following C++ function f():

unsigned int f(unsigned int n) {

unsigned int b=0;

while (n) {

b+=n & 1;

n>>1;

}

return b;

}

The function f() returns the int that represents the ____P____ in the binary representation of positive integer n, where P is

number of 0’s

number of bits

number of consecutive 1’s

number of 1’s

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 68

The fault can be easily diagnosed in the micro-program control unit using diagnostic tools by maintaining the contents of

flags and counters

registers and counters

flags and registers

flags, registers and counters

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 69

The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by

page size

physical size of memory

the instruction set architecture

number of processes in memory

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 70

A processor can support a maximum memory of 4 GB where memory is word addressable and a word is 2 bytes. What will be the size of the address bus of the processor?

At least 28 bits

At least 2 bytes

At least 31 bits

Minimum 4 bytes

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 71

Math List-I with List-II:

\(\begin{array}{c} {} & \text{List-I} & {} & \text{List-II} \\ (a) & \text{Greedy best-first} & (i) & \text{Minimal cost } (p)+h(p) \\ (b) & \text{Lowest cost-first} & (ii) & \text{Minimal } h(p) \\ (c) & A^* \text{ algorithm} & (iii) & \text{Minimal cost } (p) \\ \end{array}\)

Choose the correct option from those given below:

\((a) – (i) ; (b) – (ii); (c) – (iii) \)

\((a) – (iii) ; (b) – (ii); (c) – (i) \)

\((a) – (i) ; (b) – (iii); (c) – (ii) \)

\((a) – (ii) ; (b) – (iii); (c) – (i)\)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 72

Which of the following are the primary objectives of risk monitoring in software project tracking?

P: To assess whether predicted risks do, in fact, occur

Q: To ensure that risk aversion steps defined for the risk are being properly applied

R: To collect information that can be used for future risk analysis

Only P and Q

Only P and R

Only Q and R

All of P, Q, R

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 73

Consider the complexity class \(𝐶𝑂−𝑁𝑃\) as the set of languages \(L\) such that \(\overline{L} \in NP\), and the following two statements:

\(S_1: \: P \subseteq CO-NP\)

\(S_2: \: \text{ If } NP \neq CO-NP, \text{ then } P \neq NP\)

Which of the following is/are correct?

Only \(𝑆_1\)

Only \(𝑆_2\)

Both \(𝑆_1\) and \(𝑆_2\)

Neither \(𝑆_1\) nor \(𝑆_2\)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 74

On translating the expression given below into quadruple representation, how many operations are required?

\((i\ast j)+(e+f)\ast(a\ast b+c)\)

5

6

3

7

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 75

Consider the following statements regarding \(2𝐷\) transforms in computer graphics:

\(S1: \: \begin{bmatrix} 1 & 0 \\ 0 & -1 \end{bmatrix}\) is a \(2×2\) matrix that reflects (mirrors) only \(2𝐷\) point about the X-axis.

\(𝑆_2\) : A \(2×2\) matrix which mirrors any \(2𝐷\) point about the \(𝑋\)-axis, is a rotation matrix.

What can you say about the statements \(𝑆_1\) and \(𝑆_2\)?

Both \(𝑆_1\) and \(𝑆_2\) are true

Only \(𝑆_1\) is true

Only \(𝑆_2\) is true

Both \(𝑆_1\) and \(𝑆_2\) are false

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 76

Which of the following UNIX/Linux pipes will count the number of lines in all the files having .c and .h as their extension in the current working directory?

cat ∗⋅ ch ∣ wc −1

cat ∗⋅[ c-h ]∣ wc −1

cat ∗⋅[ ch ]∣ ls −1

cat ∗⋅[ ch ]∣ wc - 1

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 77

The parallel bus arbitration technique uses an external priority encoder and a decoder. Suppose, a parallel arbiter has 5 bus arbiters. What will be the size of priority encoder and decoder respectively?

4×2,2×4

2×4,4×2

3×8,8×3

8×3,3×8

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 78

Which of the following is best running time to sort \(𝑛\) integers in the range \(0\) to \(n^2-1\)?

\(𝑂(lg \ 𝑛) \)

\(𝑂(𝑛) \)

\(𝑂(𝑛 \ lg \ 𝑛) \)

\(𝑂(𝑛^2)\)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 79

Following table has two attributes Employee_id and Manager_id, where Employee_id is a primary key and manager_id is a foreign key referencing Employee_id with on-delete cascade:

\(\begin{array}{|c|c|} \hline \text{Employee_id} & \text{Manager_id} \\ \hline 20 & 40 \\ \hline 25 & 40 \\ \hline 30 & 35 \\ \hline 35 & 20 \\ \hline 40 & 45 \\ \hline 45 & 25 \\ \hline \end{array}\)

On deleting the table (20,40), the set of other tuples that must be deleted to maintain the referential integrity of table is

(30,35) only

(30,35) and (35,20) only

(35,20) only

(40,45) and (25,40) only

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 80

Which of the following is application of depth-first search?

Only topological sort

Only strongly connected components

Both topological sort and strongly connected components

Neither topological sort nor strongly connected components

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 81

Consider the following grammar:

\(𝑆→𝑋𝑌 \\ 𝑋→𝑌𝑎𝑌∣𝑎 \ \ and \ \ 𝑌→𝑏𝑏𝑋\)

Which of the following statements is/are true about the above grammar?

(a) Strings produced by the grammar can have consecutive three \(𝑎’s\).

(b) Every string produced by the grammar have alternate \(a\) and \(b\).

(c) Every string produced by the grammar have at least two \(𝑎’s\).

(d) Every string produced by the grammar have \(𝑏’s\) in multiple of 2.

(a) Only

(b) and (c) Only

(d) Only

(c) and (d) Only

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 82

Consider a raster system with resolution 640 by 480. What size is frame buffer (in bytes) for this system to store 12 bits per pixel?

450 kilobytes

500 kilobytes

350 kilobytes

400 kilobytes

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 83

Using the phong reflectance model, the strength of the specular highlight is determined by the angle between

the view vector and the normal vector

the light vector and the normal vector

the light vector and the reflected vector

the reflected vector and the view vector

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 84

With respect to relational algebra, which of the following operations are included from mathematical set theory?

(a) Join

b() Intersection

(c) Cartisian product

(d) Project

(a) and (d)

(b) and (c)

(c) and (d)

(b) and (d)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 85

How many cards must be selected from a standard deck of 52 cards to guarantee that at least three hearts are present among them?

9

13

17

42

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 86

Which of the following is an example of unsupervised neural network?

Back-propagation network

Hebb network

Associative memory network

Self-organizing feature map

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 87

There are many sorting algorithms based on comparison. The running time of heapsort algorithm is 𝑂(𝑛 lg𝑛). Like 𝑃, but unlike 𝑄, heapsort sorts in place where (𝑃,𝑄) is equal to

Merge sort, Quick sort

Quick sort, insertion sort

Insertion sort, Quick sort

Insertion sort, Merge sort

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 88

You are designing a link layer protocol for a link with bandwidth of 1 Gbps (10⁹ bits/second) over a fiber link with length of 800 km. Assume the speed of light in this medium is 200000 km/second. What is the propagation delay in this link?

1 millisecond

2 milliseconds

3 milliseconds

4 milliseconds

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 89

Consider the following two statements with respect to IPv4 in computer networking:

P: The loopback (IP) address is a member of class B network.

Q: The loopback (IP) address is used to send a packet from host to itself.

What can you say about the statements P and Q?

P – True; Q – False

P – False; Q – True

P – True; Q – True

P – False; Q – False

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 90

The STRIPS representation is

a feature-centric representation

an action-centric representation

a combination of feature-centric and action-centric representations

a hierarchical feature-centric representation

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 91

Which of the following has same expressive power with regard to relational query language?

(a) Rational algebra and domain relational calculus

(b) Relational algebra and tuples relational calculus

(c) Relational algebra and domain relational calculus restricted to safe expression

(d) Relational algebra and tuples relational calculus restricted to safe expression

(a) and (b) Only

(c) and (d) Only

(a) and (c) Only

(b) and (d) Only

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 92

Which of the following statements is/are true?

P : An XML document with correct syntax as specified by W3C is called “Well Formed”.

Q : An XML documented validated against a DTD is both “Well formed” and “valid”.

R : <xml version=”1.0” encoding =”UTF-8”>

is syntactly correct declaration for the version of an XML document.

Select the correct answer from the options given below:

P and Q only

P and R only

Q and R only

All of P, Q and R

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 93

Consider the following pseudo-code fragment in which an invariant for the loop is “ \(m ^*x^k=p^n\) and \(𝑘≥0\) ” (here, \(𝑝\) and \(𝑛\) are integer variable that have been initialized):

/* Pre-conditions : \(p \geq 1 \wedge n \geq 0\) */

/* Assume that overflow never occurs */

int \(𝑥=𝑝;\) int \(𝑘=𝑛\); int \(𝑚=1\);

while \((𝑘<>0\)) {

if (k is odd) then \(𝑚=𝑚∗𝑥\);

\(𝑥=𝑥∗𝑥\);

\(k=\lfloor k/2 \rfloor\); /* floor(\(𝑘/2\)) */

}

Which of the following must be true ar the end of the while loop?

𝑥=𝑝𝑛
𝑚=𝑝𝑛
𝑝=𝑥𝑛
𝑝=𝑚𝑛

\(x=p^n\)

\(m=p^n\)

\(p=x^n\)

\(p=m^n\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 94

The M components in MVC are responsible for

user interface

security of the system

business logic and domain objects

translating between user interface actions/events and operations on the domain objects

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 95

Consider the game tree given below:

Here ◯ and ◻ represents MIN and MAX nodes respectively. The value of the root node of the game tree is

4

7

11

12

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 96

Suppose that a computer program takes 100 seconds of execution time on a computer with multiplication operation responsible for 80 seconds of this time. How much do you have to improve the speed of the multiplication operation if you are asked to execute this program four times faster?

14 times faster

15 times faster

16 times faster

17 times faster

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 97

Which of the following are NOT shared by the threads of the same process?

(a) Stack

(b) Registers

(c) Address space

(d) Message queue

(a) and (d)

(b) and (c)

(a) and (b)

(a), (b) and (c)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 98

Consider the following statements:

\(𝑆_1\): For any integer \(n>1, \: a^{\phi(n)} \equiv 1(mod \: n)\) for all \(a \in Z_n^*\) , where \(𝜙(𝑛)\) is Euler’s phi function.

\(𝑆_2\): If \(𝑝\) is prime, then \(a^p \equiv 1(mod \: p)\) for all \(a \in Z_p^*\).

Which one of the following is/are correct?

Only \(𝑆_1\)

Only \(𝑆_2\)

Both \(𝑆_1\) and \(𝑆_2\)

Neither \(𝑆_1\) nor \(𝑆_2\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 99

You need 500 subnets, each with about 100 usable host address per subnet. What network mask will you assign using a class B network address?

255.255.255.252

255.255.255.128

255.255.255.0

255.255.254.0

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 100

The ability to inject packets into the Internet with a false source address is known as

Man-in-the-middle attack

IP phishing

IP sniffing

IP spoofing

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

UGC NET CSE - June 2019 | PAPER - II