Turing Prep | Previous Year Questions | UGC NET CSE - December 2018

Question : 1

In mathematical logic, which of the following are statements?

(i) There will be snow in January.

(ii) What is the time now?

(iii) Today is Sunday.

(iv) You must study Discrete mathematics

Choose the correct answer from the code given below:

(i) and (iii)

(i) and (ii)

(ii) and (iv)

(iii) and (iv)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 2

Match List-I with List-II and choose the correct answer from the code given below :

\(\begin{array}{cccc} & \textbf{List I} & & \textbf{List II} \\ (a) & Equivalence & (i) & p \Rightarrow q \\ (b) & Contrapositive & (ii) & p \Rightarrow q; q \Rightarrow p \\ (c ) & Converse & (iii) & p \Rightarrow q: \sim q \Rightarrow \sim p \\ (d) & Implication & (iv) & p \Leftrightarrow q \\ \end{array}\)

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 3

A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the probability that two of the selected balls will be red and two will be in green?

\(1 \over 14\)

\(3 \over 7\)

\(1 \over 35\)

\(1 \over 9\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 4

A survey has been conducted on methods of commuter travel. Each respondent was asked to check Bus, Train and Automobile as a major method of travelling to work. More than one answer was permitted. The results reported were as follows :

Bus 30 people; Train 35 people; Automobile 100 people; Bus and Train 15 people; Bus and Automobile 15 people; Train and Automobile 20 people; and all the three methods 5 people. How many people completed the survey form?

120

165

160

115

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 5

Which of the following statements are true ?

(i) Every logic network is equivalent to one using just NAND gates or just NOR gates.

(ii) Boolean expressions and logic networks correspond to labelled acyclic diagraphs.

(iii) No two Boolean algebras with n atoms are isomorphic.

(iv) Non-zero elements of finite Boolean algebras are not uniquely expressible as joins of atoms

Choose the correct answer from the code given below :

(i) and (iv) Only

(i), (ii) and (iii) Only

(i) and (ii) Only

(ii), (iii) and (iv) Only

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 6

The relation ≤ and > on a boolean algebra are defined as:

𝑥≤𝑦 if and only if 𝑥∨𝑦=𝑦

𝑥<𝑦 means 𝑥≤𝑦 but 𝑥≠𝑦

𝑥≥𝑦 means 𝑦≤𝑥 and

𝑥>𝑦 means 𝑦<𝑥

Considering the above definitions, which of the following is not true in the boolean algebra?

(i) If 𝑥≤𝑦 and 𝑦≤𝑧, then 𝑥≤𝑧

(ii) If 𝑥≤𝑦 and 𝑦≤𝑥, then 𝑥=𝑦

(iii) If 𝑥<𝑦 and 𝑦<𝑧, then 𝑥≤𝑦

(iv) If 𝑥<𝑦 and 𝑦<𝑧, then 𝑥<𝑦

Choose the correct answer from the code given below:

(i) and (ii) Only

(ii) and (iii) Only

(iii) Only

(iv) Only

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 7

The boolean expression \(\overline{A} \cdot B + A \cdot \overline{B}+ A \cdot B\) is equivalenet to

\(\overline{A} \cdot B\)

\(\overline{A+B}\)

\(A \cdot B\)

\(A+B\)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 8

In PERT/CPM, the merge event represents _____ of two or more events.

completion

beginning

splitting

joining

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 9

Use Dual Simplex Method to solve the following problem:

\(\begin{array} \text{Maximize} & z=-2x_1-3x_2 \\ \text{subject to:} & \\ & x_1+x_2 \geq 2 \\ & 2x_1 +x_2 \leq10 \\ & x_2 +x_2 \leq 8 \\ & x_1,x_2 \geq 0 \end{array}\)

\(x_1=2, x_2=0, \text{ and } z=-4\)

\(x_1=2, x_2=6, \text{ and } z=-22\)

\(x_1=0, x_2=2, \text{ and } z=-6\)

\(x_1=6, x_2=2, \text{ and } z=-18\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 10

In computers, subtraction is generally carried out by

9’s complement

1’s complement

10’s complement

2’s complement

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 11

Consider the following boolean equations:

\((i) (w \overline{x}(y+x \overline{z})+ \overline{w} \overline{x})y= \overline{x}y \\ (ii) (w \overline{x}(y+x \overline{z})+ \overline{w} \overline{x})y= \overline{x}y\)

What can you say about the above equations ?

(i) is true and (ii) is false

(i) is false and (ii) is true

Both (i) and (ii) are true

Both (i) and (ii) are false

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 12

Consider the graph shown below:

Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is

17

14

16

13

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 13

Consider the following statements :

(i) Auto increment addressing mode is useful in creating self-relocating code.

(ii) If auto increment addressing mode is included in an instruction set architecture, then an additional ALU is required for effective address calculation.

(iii) In auto incrementing addressing mode, the amount of increment depends on the size of the data item accessed.

Which of the above statements is/are true?

(i) and (ii) only

(ii) and (iii) only

(iii) only

(ii) only

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 14

A computer uses a memory unit with 256 K words of 32 bits each. A binary instruction code is stored in one word of memory. The instruction has four parts: an indirect bit, an operation code and a register code part to specify one of 64 registers and an address part. How many bits are there in the operation code, the register code part and the address part?

7,6,18

6,7,18

7,7,18

18,7,7

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 15

Consider the following x86 – assembly language instructions:

MOV AL, 153

NEG AL

The contents of the destination register 𝐴𝐿 (in 8-bit binary notation), th status of Carry Flag (𝐶𝐹) and Sign Flag (𝑆𝐹) after the execution of above instructions, are

𝐴𝐿=01100110;𝐶𝐹=0;𝑆𝐹=0

𝐴𝐿=01100111;𝐶𝐹=0;𝑆𝐹=1

𝐴𝐿=01100110;𝐶𝐹=1;𝑆𝐹=1

𝐴𝐿=01100111;𝐶𝐹=1;𝑆𝐹=0

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 16

The decimal floating point number −40.1 represented using IEEE-754 32-bit representation and written in hexadecimal form is

0x𝐶2206666

0x𝐶2206000

0x𝐶2006666

0x𝐶2006000

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 17

Find the boolean expression for the logic circuit shown below:

\(A \overline{B}\)

\(\overline{A} B\)

\(AB\)

\(\overline{A} \overline{B}\)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 18

Consider a disk pack with 32 surfaces, 64 tracks and 512 sectors per pack. 256 bytes of data are stored in a bit serial manner in a sector. The number of bits required to specify a particular sector in the disk is

18

19

20

22

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 19

Consider a system with 2 level cache. Access times of Level 1 cache, Level 2 cache and main memory are 0.5 ns, 5 ns and 100 ns respectively. The hit rates of Level 1 and Level 2 caches are 0.7 and 0.8 respectively. What is the average access time of the system ignoring the search time within the cache?

35.20 ns

7.55 ns

20.75 ns

24.35 ns

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 20

If a graph (G) has no loops or parallel edges, and if the number of vertices (n) the graph is \(𝑛≥3\), then graph G is Hamiltonian if

(i) \(\text{deg(v)} \geq \frac{n}{3} \text{ for each vertex v}\)

(ii) \(\text{deg(v)} + \text{deg(w)} \geq n \text{ whenever v and w are not connected by an edge}\)

(iii) \(E(G) \geq \frac{1}{3} (n-1)(n-2)+2\)

Choose the correct answer from the code given below:

(i) and (iii) only

(ii) only

(ii) and (iii) only

(iii) only

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 21

The solution of the recurrence relation \(T(m) = T(3m/4)+1\) is

\(\Theta (\lg \: m)\)

\(\Theta (m)\)

\(\Theta (m\lg m)\)

\(\Theta (\lg\lg m)\)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 22

The elements 42,25,30,40,22,35,26 are inserted one by one in the given order into a max-heap. The resultant max-heap is sorted in an array implementation as

<42,40,35,25,22,30,26>

<42,35,40,22,25,30,26>

<42,40,35,25,22,26,30>

<42,35,40,22,25,26,30>

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 23

Consider two sequences X and Y:

X = <0, 1, 2, 1, 3, 0, 1>

y = <1, 3, 2, 0, 1, 0>

The length of longest common subsequence between X and Y is

2

3

4

5

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 24

Consider the following postfix expression with single digit operands :

\(6 \; 2 \: 3 \: ^* \: / \: 4 \: 2 \: ^* \; + \: 6 \: 8 \: ^* \: -\)

The top two elements of the stack after the second ∗ is evaluated, are :

8,2

8,1

6,2

6,3

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 25

A binary search tree is constructed by inserting the following numbers in order :

60,25,72,15,30,68,101,13,18,47,70,34

The number of nodes in the left subtree is

5

6

7

3

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 26

In a ternary tree, the number of internal nodes of degree 1,2, and 3 is 4,3, and 3 respectively. The number of leaf nodes in the ternary tree is

9

10

11

12

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 27

Match List I with List II and choose the correct answer from the code given below.

\(\begin{array} {clcl} & \textbf{List I} & & \textbf{List II} \\ & \textbf{(Graph Algorithm)} & & \textbf{(Time Complexity)} \\ \text{(a)} & \text{Dijkstra’s algorithm} & \text{(i)}& O(E \: lg \: E) \\ \text{(b)}& \text{Kruskal’s algorithm} & \text{(ii)}& \Theta(V^3) \\ \text{(c)} & \text{Floyd-Warshall algorithm} & \text{(iii)} & O(V^2) \\ \text{(d)} & \text{Topological sorting} & \text{(iv)}& \Theta(V+E) \\ \end{array}\)

where \(𝑉\) and \(𝐸\) are the number of vertices and edged in graph respectively.

\(\textbf{Code :}\)

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

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

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

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

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 28

In K-coloring of an undirected graph \(𝐺=(𝑉,𝐸)\) is a function.

\(𝑐:𝑉→\{0,1,…,𝐾−1\}\) such that \(𝑐(𝑢)≠𝑐(𝑣)\) for every edge \((𝑢,𝑣)∈𝐸\).

Which of the following is not correct?

\(G\) is bipartite

\(G\) is 2-colorable

\(G\) has cycles of odd length

\(G\) has no cycles of odd length

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 29

Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node 𝑎, pointer to this node is \(𝑞\), from the list?

\(O(n \lg \: n)\)

\(O(n)\)

\(O(\lg \: n)\)

\(O(1)\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 30

The second smallest of 𝑛 elements can be found with ____ comparisons in the worst case.

\(n-1\)

\(\lg \: n\)

\(n + ceil(\lg \: n)-2\)

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

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 31

Let \(r=a(a+b)^*, \: s=aa^*b\) and \(t=a^*b\) be three regular expressions.

Consider the following :

(i) \(L(s) \subseteq L(r )\text{ and } L(s) \subseteq L(t)\)

(ii) \(L(r ) \subseteq L(s) \text{ and } L(s) \subseteq L(t)\)

Choose the correct answer from the code given below :

Only (i) is correct

Only (ii) is correct

Both (i) and (ii) are correct

Neither (i) nor (ii) is correct

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 32

Consider the language \(L\) given by

\(L=\{ 2^{nk} \mid k >0, \text{ and n is non-negative integer number } \}\)

The minimum number of states of finite automaton which accepts the language \(L\) is

\(n\)

\(n + 1 \)

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

\(2^n\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 33

The number of substrings that can be formed from string given by

\(a \: d \: e \: f \: b \: g \: h \: n \: m \: p\)

is

10

45

55

56

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 34

Consider the following two languages :

\(L_1 = \{ x \mid \text{ for some y with } \mid y \mid = 2^{\mid x \mid} , xy \in \text{ L and L is regular language} \}\)

\(L_2=\{ x \mid \text{ for some y such that } \mid x \mid = \mid y \mid , xy \in \text{ L and L is regular language}\}\)

Which one of the following is correct ?

Only \(𝐿_1\) is regular language

Only \(𝐿_2\) is regular language

Both \(𝐿_1\) and \(𝐿_2\) are regular languages

Both \(𝐿_1\) and \(𝐿_2\) are not regular languages

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 35

Consider the following languages:

\(L_1 = \{ a^{n+m} b^n a^m \mid n, m \geq 0 \} \\ L_2 = \{ a^{n+m} b^{n+m} a^{n+m} \mid n, m \geq 0\} \)

Which of the following is correct ?

\(Code:\)

Only \(𝐿_1\) is context free language

Only \(𝐿_2\) is context free language

Both \(𝐿_1\) and \(𝐿_2\) are context free languages

Both \(𝐿_1\) and \(𝐿_2\) are not context free languages

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 36

Consider \(𝑅\) to be any regular language and \(𝐿_1\), \(𝐿_2\) be any two context-free languages.

Which of the following is correct?

\(\overline{L_1}\) is context free

\(\overline{(L_1 \cup L_2)} – R\) is context free

\(L_1 \cap L_2\) is context free

\(L_1 – R\) is context free

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 37

Consider the following problems :

(i) Whether a finite state automaton halts on all inputs?

(ii) Whether a given context free language is regular?

(iii) Whether a Turing machine computes the product of two numbers?

Which one of the following is correct?

Only (i) and (iii) are undecidable problems

Only (ii) and (iii) are undecidable problems

Only (i) and (ii) are undecidable problems

(i), (ii) and (iii) are undecidable problems

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 38

Which one of the following problems is decidable for recursive languages \((𝐿)\) ?

Is \(𝐿=𝜙\) ?

Is \(𝑤∈𝐿\), where 𝑤 is a string ?

Is \(𝐿=Σ^∗\) ?

Is \(𝐿=𝑅\), where \(𝑅\) is a given regular set ?

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 39

Consider the following grammar \(𝐺\):

\(𝑆→𝐴∣𝐵 \\ 𝐴→𝑎∣𝑐 \\ 𝐵→𝑏∣𝑐\)

where \(\{𝑆,𝐴,𝐵\}\) is the set of non-terminals, \(\{𝑎,𝑏,𝑐\}\) is the set of terminals.

Which of the following statement(s) is/are correct?

\(𝑆_1\): \(𝐿𝑅(1)\) can parse all strings that are generated using grammar \(𝐺\).

\(𝑆_2\): \(𝐿𝐿(1)\) can parse all strings that are generated using grammar \(𝐺\).

Choose the correct answer from the code given below:

Only \(𝑆_1\)

Only \(𝑆_2\)

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 40

The grammar \(S \rightarrow (S) \mid SS \mid \epsilon\) is not suitable for predictive parsing because the grammar is

Right recursive

Left recursive

Ambiguous

An operator grammar

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 41

If the frame buffer has 10-bits per pixel and 8-bits are allocated for each of the \(𝑅,𝐺\), and \(𝐵\) components, then what would be the size of the color lookup table (LUT)?

\((2^8+2^9)\) bytes

\((2^{10}+2^8)\) bytes

\((2^{10}+2^{24})\) bytes

\((2^{10}+2^{11})\) bytes

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 42

Which homogeneous 2D matrix transforms the figure (a) on the left side to the figure (b) on the right ?

\(\begin{pmatrix} 1 & -2 & 6 \\ 1 & 0 & 2 \\ 0 & 0 & 1 \end{pmatrix}\)

\(\begin{pmatrix} 0 & 2 & 6 \\ 1 & 0 & 1 \\ 0 & 0 & 1 \end{pmatrix}\)

\(\begin{pmatrix} 0 & -2 & 6 \\ 1 & 0 & 1 \\ 0 & 0 & 1 \end{pmatrix}\)

\(\begin{pmatrix} 0 & 2 & -6 \\ 2 & 0 & 1 \\ 0 & 0 & 1 \end{pmatrix}\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 43

Consider the midpoint (or Bresenham) algorithm for rasterizing lines given below:

(1) Input \((x_1, y_1)\) and \((𝑥_2,𝑦_2)\)

(2) \(𝑦=𝑦_1\)

(3) \(d=f(x_1+1, y_1+1/2)\) //f is the implicit form of a line

(4) for \(x=x_1\) to \(x_2\)

(5) do

(6) plot\((x,y)\)

(7) if \((𝑑<0)\)

(8) then

(9) \( 𝑦=𝑦+1\)

(10) \(d=d+(y_1-y_2)+(x_2-x_1)\)

(11) else

(12) \(d=d+(y_1-y_2)\)

(13) end

(14) end

Which statements are true?

P: For a line with slope \(𝑚>1\), we should change the outer loop in line (4) to be over \(𝑦\)

Q: Lines (10) and (12) update the decision variable \(𝑑\) through an incremental evaluation of the line equation \(𝑓\)

R: The algorithm fails if \(𝑑\) is over 0

Choose the correct answer from the code given below:

P only

P and Q only

Q and R only

P, Q and R

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 44

In 3𝐷 Graphics, which of the following statements about perspective and parallel projection is/are true?

P : In a perspective projection, the farthest an object is from the center of projection, the smaller it appears

Q : Parallel projection is equivalent to a perspective projection where the viewer is standing infinitely far away

R : Perspective projections do not preserve straight lines.

Choose the correct answer from the code given below:

\(𝐶𝑜𝑑𝑒:\)

P and Q only

P and R only

Q and R only

P, Q and R

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 45

In 3𝐷 Graphics, which of the following statements is/are true?

P: Back-face culling is an example of image-precision visible-surface determination procedure.

Q: Z- buffer is a 16-bit, 32-bit, or 64 bit field associated with each pixel in a frame buffer that can be used to determine the visible surfaces at each pixel

Choose the correct answer from the code 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 : 46

Consider the following pseudo-code fragment, where 𝑚 is a non-negative integer that has been initialized:

𝑝 = 0

𝑘 = 0

while (𝑘 < 𝑚)

𝑝 = 𝑝 + 2^𝑘

𝑘 = 𝑘 + 1

end while

Which of the following is a loop invariant for the while statement?

(Note: a loop invariant for a while statement is an assertion that is true each time the guard is evaluated during the execution of the while statement).

𝑝 = 2^𝑘−1 and 0 ≤ 𝑘 < 𝑚

𝑝 = 2^𝑘+1−1 and 0 ≤ 𝑘 < 𝑚

𝑝 =2^𝑘−1 and 0 ≤ 𝑘 ≤ 𝑚

𝑝 = 2^𝑘+1−1 and 0 ≤ 𝑘 ≤ 𝑚

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 47

Consider the following two C++ programs P₁ and P₂ and two statements S₁ and S₂ about the programs :


S₁ : P₁ prints out 3

S₂ : P₂ prints out 4:2

What can you say about the statement S₁ and S₂ ?

Only S₁ is true

Only S₂ is true

Both S₁ and S₂ are true

Neither S₁ nor S₂ is true

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 48

Consider the following recursive Java function 𝑓 that takes two long arguments and returns a float value :

public static float f(long m, long n)

{

float result = (float) m / (float) n;

if (m<0 || n <0)

return 0.0f;

else

result +=f(m*2, n*3);

return result;

}

Which of the following integers best approximates the value of 𝑓(2,3)?

0

1

2

3

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 49

What does the following Java function perform? (Assume int occupies four bytes of storage)

public static int f(int a)

{ // Pre-conditions : a > 0 and no oveflow/underflow occurs

int b=0;

for (int i=0; i<32; i++)

{

b = b<<1;

b=b | ( a & 1);

a=a >>>1; // This is a logical shift

}

return b;

}

Returns the int that has the binary representation of integer a.

Return the int that has reversed binary representation of integer a.

Return the int that represents the number of 1’s in the binary representation of integer a.

Return the int that represents the number of 0’s in the binary representation of integer a.

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 50

Which of the following HTML5 codes will affect the horizontal as well as vertical alignment of the table content ?

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 51

Consider the 𝐶/𝐶++ function 𝑓() given below:

void f(char w[])

{

int x=strlen(w); //length of a string

char c;

for (int i=0; i<x; i++)

{

c=w[i];

w[i]=w[x-i-1];

w[x-i-1] =c;

}

Which of the following is the purpose of 𝑓() ?

It outputs the contents of the array in reverse order

It outputs the contents of the array in the original order

It outputs the contents of the array with the characters shifted over by one position

It outputs the contents of the array with the characters rearranged so they are no longer recognized as the words in the original phrase

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 52

The Software Requirement Specification (𝑆𝑅𝑆) is said to be _____ if and only if no subset of individual requirements described in it conflict with each other.

Correct

Consistent

Unambiguous

Verifiable

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 53

Software products need perfective 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 platforms

To support new features that users want it to support

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

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 54

Match each UML diagram in List I to its appropriate description in List II.

\(\begin{array}{clcl} & \textbf{List I} && \textbf{List II} \\ \text{(a)} & \text{State} & \text{(i)} & \text{Describes how the external entities (people, devices) can}\\& \text{Diagram}&& \text{interect with the System} \\ \text{(b)} & \text{Use Case} & \text{(ii)} & \text{Used to describe the static or structural view of a system}\\& \text{Diagram}&& \text{} \\ \text{(c)} & \text{Class} & \text{(iii)} & \text{Used to show the flow of a business process, the steps}\\& \text{Diagram}&& \text{of a use-case or the logic of an object behaviour} \\ \text{(d)} & \text{Activity} & \text{(iv)} & \text{Used to describe the dynamic behaviour of objects and}\\& \text{Diagram}&& \text{could also be used to describe the entire system behaviour} \\ \end{array}\)

\(Code:\)

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 55

Which of the following statements is/are 𝑓𝑎𝑙𝑠𝑒 ?

𝑃 : The clean-room strategy to software engineering is based on the incremental software process model.

𝑄 : The clean-room strategy to software engineering is one of the ways to overcome “unconscious” copying of copyrighted code.

Choose the correct answer from the code given below:

\(𝐶𝑜𝑑𝑒:\)

𝑃 only

𝑄 only

Both 𝑃 and 𝑄

Neither 𝑃 nor 𝑄

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 56

Consider the following method:

int f(int m, int n, boolean x, boolean y)

{

int res=0;

if (m<0) {res=n-m;}

else if (x || y)

{

res=-1;

if(n==m){res=1;}

}

else {res=n;}

return res;

} /*end of f */

If 𝑃 is the minimum number of tests to achieve full statement coverage for 𝑓(), and 𝑄 is the minimum number of tests to achieve full branch coverage for 𝑓(), then (𝑃,𝑄) =

(3,4)

(4,3)

(2,3)

(3,2)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 57

A legacy software system has 940 modules. The latest release required that 90 of these modules be changed. In addition, 40 new modules were added and 12 old modules were removed. Compute the software maturity index for the system.

0.849

0.524

0.725

0.923

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 58

Which of the following statements is/are true ?

𝑃 : Software Reengineering is preferable for software products having high failure rates, having poor design and/or having poor code structure.

𝑄 : Software Reverse Engineering is the process of analyzing software with the objective of recovering its design and requirement specification.

Choose the correct answer from the code given below :

𝑃 only

𝑄 only

Both 𝑃 and 𝑄

Neither 𝑃 nor 𝑄

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 59

Which of the following is not one of the principles of agile software development method?

Customer involvement

Embrace change

Incremental delivery

Following the plan

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 60

Software coupling involves dependencies among pieces of software called modules. Which of the following are correct statements with respect to module coupling ?

P : Common coupling occurs when two modules share the same global data

Q : Control coupling occurs when modules share a composite data structure and use only parts of it

R : Content coupling occurs when one module modifies or relies on the internal working of another module

Choose the correct answer from the code given below :

𝐶𝑜𝑑𝑒:

P and Q only

P and R only

Q and R only

All of P, Q and R

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 61

Match the following Secret Key Algorithms (list I) with Corresponding Key Lengths (List II) and choose the correct answer from the code given below:

\(\begin{array} { } & \text{List I} & { } & \text{List II} \\ (a) & \text{Blowfish} & (i) & \text{128 – 256 bits} \\ (b) & \text{DES} & (ii) & \text{128 bits} \\ (c ) & \text{IDEA} & (iii) & \text{1-448 bits} \\ (d) & \text{RC5} & (iv) & \text{ 56 bits} \end{array}\)

\(Code:\)

(a) – (iv), (b)-(ii), (c ) -(ii) , d-(i)

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

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

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

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 62

The four byte IP address consists of

Network Address

Host Address

Both Network and Host Addresses

Neither Network nor Host Addresses

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 63

Consider 𝐼𝑆𝑂−𝑂𝑆𝐼 network architecture reference model. Session layer of this model offers dialog control, token management and ______ as services.

Syncronization

Asyncronization

Flow control

Errors

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 64

Suppose a cloud contains software stack such as Operating systems, Application softwares, etc. This model is referred as ____ model

𝑆𝑎𝑎𝑆

𝑃𝑎𝑎𝑆

𝐼𝑎𝑎𝑆

𝑀𝑎𝑎𝑆

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 65

The Third Generation mobile phones are digital and based on

𝐴𝑀𝑃𝑆

𝐷−𝐴𝑀𝑃𝑆

𝐶𝐷𝑀𝐴

Broadband 𝐶𝐷𝑀𝐴

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 66

Which of the following statement/s is/are true?

(i) Firewalls can screen traffic going into or out of an organization.

(ii) Virtual private networks can stimulate an old leased network to provide certain desirable properties.

Choose the correct answer from the code given below:

(i) only

(ii) only

Both (i) and (ii)

Neither (i) nor (ii)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 67

Which of the following statements/s is/are 𝑡𝑟𝑢𝑒 ?

(i) Windows XP supports both peer-peer and client-server networks.

(ii) Windows XP implements Transport protocols as drivers that can be loaded and unloaded from the system given dynamically.

Choose the correct answer from the code given below:

𝐶𝑜𝑑𝑒:

(i) only

(ii) only

Neither (i) nor (ii)

Both (i) and (ii)

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 68

In Linux operating system environment ____ command is used to print a file.

print

ptr

pr

lpr

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 69

To overcome difficulties in Readers-Writers problem, which of the following statement/s is/are true?

(i) Writers are given exclusive access to shared objects.

(ii) Readers are given exclusive access to shared objects.

(iii) Both Readers and Writers are given exclusive access to shared objects.

Choose the correct answer from the code given below :

𝐶𝑜𝑑𝑒:

(i) only

(ii) only

(iii) only

Both (ii) and (iii)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 70

Suppose a system has 12 instances of some resource with 𝑛 processes competing for that resource. Each process may require 4 instances of the resources. The maximum value of 𝑛 for which the system never enters into deadlock is

3

4

5

6

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 71

Dirty bit is used to show the

wrong page

page with corrupted data

page with low frequency occurrence

page that is modified after being loaded into cache memory

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 72

Suppose for a process 𝑃, reference to pages in order are 1,2,4,5,2,1,2,4. Assume that main memory can accomodate 3 pages and the main memory has already 1 and 2 in the order 1 – first, 2 – second. At this moment, assume FIFO Page Replacement Algorithm is used then the number of page faults that occur to complete the execution of process 𝑃 is

4

3

5

6

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 73

Consider the following set of processes and the length of CPU burst time given in milliseconds :

\(\begin{array}{|c|c|} \hline \text{Process} & \text{CPU Burst time (ms)} \\ \hline P_1 & 5 \\ \hline P_2 & 7 \\ \hline P_3 & 6 \\ \hline P_4 & 4 \\ \hline \end{array}\)

Assume that processes being scheduled with Round-Robin Scheduling Algorithm with time quantum 4 ms. Then the waiting time for 𝑃4 is ______ ms

0

4

12

6

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 74

Suppose 𝑃,𝑄 and 𝑅 are co-operating processes satisfying Mutual Exclusion condition. Then, if the process 𝑄 is executing in its critical section then

Both ‘𝑃′ and ‘𝑅′ execute in critical section

Neither ‘𝑃′ nor ‘𝑅′ executes in their critical section

‘𝑃′ executes in critical section

‘𝑅′ executes in critical section

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 75

A process residing in Main Memory and Ready and Waiting for execution, is kept on

Execution Queue

Job Queue

Ready Queue

Wait Queue

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 76

______ system call creates new process in Unix.

create

create new

fork

fork new

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 77

An attribute 𝐴 of datatype varchar(20) has the value ‘𝑥𝑦𝑧′, and the attribute 𝐵 of datatype char(20) has the value “𝑙𝑚𝑛𝑜𝑝”, then the attribute 𝐴 has _____ spaces and attribute 𝐵 has ____ spaces.

3,5

20,20

3,20

20,5

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 78

Data warehouse contains _____ data that is never found in operational environment.

Summary

Encoded

Encrypted

Scripted

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 79

_______ command is used to remove a relation from SQL database.

Drop table

Delete table

Remove table

Update table

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 80

Which of the following statement/s is/are true ?

(i) Facebook has the world’s largest Hadoop Cluster.

(ii) Hadoop 2.0 allows live stream processing of Real time data.

Choose the correct answer from the code given below :

𝐶𝑜𝑑𝑒:

(i) only

(ii) only

Both (i) and (ii)

Neither (i) nor (ii)

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 81

Data scrubbing is

A process to reject data from the data warehouse and to create the necessary indexes.

A process to load the data in the data warehouse and to create the necessary indexes.

A process to upgrade the quality of data after it is moved into a data warehouse

A process to upgrade the quality of data before it is moved into a data warehouse

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 82

Consider a relation schema 𝑅=(𝐴,𝐵,𝐶,𝐷,𝐸,𝐹) on which the following functional dependencies hold :

𝐴→𝐵
𝐵,𝐶→𝐷
𝐸→𝐶
𝐷→𝐴

What are the candidate keys of 𝑅 ?

𝐴𝐸 and 𝐵𝐸

𝐴𝐸,𝐵𝐸 and 𝐷𝐸

𝐴𝐸𝐹,𝐵𝐸𝐹 and 𝐵𝐶𝐹

𝐴𝐸𝐹,𝐵𝐸𝐹 and 𝐷𝐸𝐹

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 83

Consider the following sequence of two transactions on a bank account (𝐴) with initial balance 20,000 that transfers 5,000 to another account (𝐵) and then apply 10% interest.

(i) T1 start

(ii) T1 A old=20,000 new 15,000

(iii) T1 B old = 12,000 new = 17,000

(iv) T1 commit

(v) T2 start

(vi) T2 A old = 15,000 new = 16,500

(vii) T2 commit

Suppose the database system crashes just before log record (vii) is written. When the system is restarted, which one statement is true of the recovery process?

We must redo log record (vi) to set 𝐴 to 16,500

We must redo log record (vi) to set 𝐴 to 16,500 and then redo log records (ii) and (iii)

We need not redo log records (ii) and (iii) because transaction 𝑇1 is committed

We can apply redo and undo operations in arbitrary order because they are idempotent

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 84

Consider the following tables (relations):

Primary keys in the tables are shown using underline. Now, consider the following query:

SELECT S.Name, Sum (P.Marks) FROM Students, Performance P WHERE S.Roll-No=P.Roll-No

GROUP BY S.Name

The number of rows returned by the above query is

0

1

2

3

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 85

A clustering index is defined on the fields which are of type

non-key and ordering

non-key and non-ordering

key and ordering

key and non-ordering

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 86

A host is connected to a department network which is part of a university network. The university network, in turn, is part of the Internet. The largest network, in which the Ethernet address of the host is unique, is

the Internet

the university network

the department network

the subnet to which the host belongs

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 87

An Internet Service Provider (𝐼𝑆𝑃) has following chunk of 𝐶𝐼𝐷𝑅−based 𝐼𝑃 addresses available with it :245.248.128.0/20. The 𝐼𝑆𝑃 wants to give half of this chunk addresses to organization 𝐴 and a quarter to organization 𝐵 while retaining the remaining with itself. Which of the following is a valid allocation of addresses to 𝐴 and 𝐵?

245.248.136.0/21 and 245.248.128.0/22

245.248.128.0/21 and 245.248.128.0/22

245.248.132.0/22 and 245.248.132.0/21

245.248.136.0/24 and 245.248.132.0/21

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 88

Consider the following two statements:

S1 : TCP handles both congestion and flow control

S2 : UDP handles congestion but not flow control

Which of the following options is correct with respect to the above statements (S1) and (S2)?

Choose the correct answer from the code given below:

Neither S1 nor S2 is correct

S1 is not correct but S2 is correct

S1 is correct but S2 is not correct

Both, S1 and S2 are correct

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 89

Identify the correct sequence in which the following packets are transmitted on the network by a host when a browser requests a webpage from a remote server, assuming that the host has just been restarted.

HTTP GET request, DNS query, TCP SYN

DNS query, HTTP GET request, TCP SYN

TCP SYN, DNS query, HTTP GET request

DNS query, TCP SYN, HTTP GET request

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 90

Suppose that everyone in a group of \(𝑁\) people wants to communicate secretly with \((𝑁−1)\) other people using symmetric key cryptographic system. The communication between any two persons should not be decodable by the others in the group. The number of keys required in the system as a whole to satisfy the confidentiality requirement is

\(N(N - 1)\)

\(N(N-1)/2\)

\(2N\)

\((N-1)^2\)

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 91

An agent can improve its performance by

Perceiving

Responding

Learning

Observing

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 92

Which of the following is true for semi-dynamic environment?

The environment may change while the agent is deliberating

The environment itself does not change with the passage of time but the agent’s performance score does

Even if the environment changes with the passage of time while deliberating, the performance score does not change.

Environment and performance score, both change simultaneously

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 93

Consider the following terminology and match List I with List II and choose the correct answer from the code given below.

b= branching factor

d = depth of the shallowest solution

m= maximum depth of the search tree

l=depth limit

\(\begin{array} \textbf{List I} & \textbf{(Algorithms)} & \textbf{List II} & \textbf{(Space Complexity)} \\ (a) & \text{BFS search} & (i) & O(bd) \\ (b) & \text{DFS search} & (ii) & O(b^d) \\ (c ) & \text{Depth-limited search} & (iii) & O(bm) \\ (d) & \text{Iterative deepening search} & (iv) & O(bl) \end{array}\)

Code:

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

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

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

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

Correct Answer : B

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 94

Match List I with List II and choose the correct answer from the code given below.

List I		List II
(a)	Greedy Best-First Search	(i)	Selects a node for expansion if optimal path to that node has been found
(b)	A* Search	(ii)	Avoids substantial overhead associated with keeping the sorted queue of nodes
(c)	Recursive Best-First Search	(iii)	Suffers from excessive node generation
(d)	Iterative-deepening A* Search	(iv)	Time complexity depends on the quality of heuristic

Code:

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

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

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

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

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 95

Consider the following statements :

S1: A heuristic is admissible if it never overestimates the cost to reach the goal.

S2: A heuristic is monotonous if it follows triangle inequality property.

Which of the following is true referencing the above statements ?

Choose the correct answer from the code given below :

𝐶𝑜𝑑𝑒:

Neither of the statements S1 and S2 are true

Statement S1 is false but statement S2 is true

Statement S1 is true but statement S2 is false

Both the statements S1 and S2 are true

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 96

Consider the following statements related to 𝐴𝑁𝐷−𝑂𝑅 Search algorithm.

S1 : A solution is a subtree that has a goal node at every leaf.

S2 : 𝑂𝑅 nodes are analogous to the branching in a deterministic environment.

S3 : 𝐴𝑁𝐷 nodes are analogous to the branching in a non-deterministic environment.

Which of the following is true referencing the above statements ?

Choose the correct answer from the code given below :

𝐶𝑜𝑑𝑒:

𝑆1–𝐹𝑎𝑙𝑠𝑒,𝑆2–𝑇𝑟𝑢𝑒,𝑆3–𝑇𝑟𝑢𝑒

𝑆1–𝑇𝑟𝑢𝑒,𝑆2–𝑇𝑟𝑢𝑒,𝑆3–𝐹𝑎𝑙𝑠𝑒

𝑆1–𝑇𝑟𝑢𝑒,𝑆2–𝑇𝑟𝑢𝑒,𝑆3–𝑇𝑟𝑢𝑒

𝑆1–𝐹𝑎𝑙𝑠𝑒,𝑆2–𝑇𝑟𝑢𝑒,𝑆3–𝐹𝑎𝑙𝑠𝑒

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 97

Consider the following minimax game tree search

What will be the value probagated at the root?

3

4

5

6

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 98

Consider a vocabulary with only four propositions A, B, C and D. How many models are there for the following sentence?

\(¬𝐴∨¬𝐵∨¬𝐶∨¬𝐷\)

7

8

15

16

Correct Answer : C

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 99

Consider the sentence below:

“There is a country that borders both India and Nepal”

Which of the following represents the above sentence correctly?

\(∃𝑐 Country(𝑐)∧Border(𝑐,India)∧𝐵𝑜𝑟𝑑𝑒𝑟(𝑐,Nepal) \)

\(∃𝑐 Country(𝑐)⇒[Border(𝑐,India)∧𝐵𝑜𝑟𝑑𝑒𝑟(𝑐,Nepal)] \)

\([∃𝑐 Country(𝑐)]⇒[Border(𝑐,India)∧𝐵𝑜𝑟𝑑𝑒𝑟(𝑐,Nepal)] \)

\(∃𝑐 Border(Country(𝑐),India∧Nepal)\)

Correct Answer : A

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

Question : 100

A full joint distribution for the Toothache, Cavity and Catch is given in the table below

What is the probability of Cavity, given evidence of Toothache?

⟨0.2,0.8⟩

⟨0.4,0.8⟩

⟨0.6,0.8⟩

⟨0.6,0.4⟩

Correct Answer : D

Question Type : MCQ

Max Marks : 2

Negative Marks : 0

UGC NET CSE - December 2018 | PAPER - II