U.G.C. NET Exam. June, 2020 Paper II (COMPUTER SCIENCE & APPLICATIONS)

Total Questions: 100

71. Match List I with List II

(a) A-II, B-III, C-I
(b) A-III,B-I, C-II
(c) A-I, B-II, C-III
(d) A-II, B-I, C-III

Correct Answer: (c) A-I, B-II, C-III

Solution:

72. Match List I with List II

(a) A-I, B-II, C-III, D-IV
(b) A-III, B-IV, C-II, D-I
(c) A-II, B-III, C-IV, D-I
(d) A-III, B-I, C-IV, D-II

Correct Answer: (b) A-III, B-IV, C-II, D-I

Solution:

Serial line Internet protocol is a
Data link layer Simple protocol that work with TCP/IP for communication over serial ports and routers.
Border Gateway Protocol is a Network layer used to exchange routing information for the internet and is the protocol used b/w ISP which are different ASes.
User data gram protocol is a Transport layer protocol. UDP is a part of the Internet protocol suite referred to as UDP/IP suite.
SNMP is an application layer protocol that uses UDP port number 161-162. SNMP is used to monitor the network, detect network faults and sometimes even used to configure remote devices.

73. Match List I with List II

(a) A-II, B-IV, C-I, D-III
(b) A-III, B-II, C-IV, D-I
(c) A-II, B-III, C-I, D-IV
(d) A-III, B-IV, C-II, D-I

Correct Answer: (a) A-II, B-IV, C-I, D-III

Solution:

• Greedy best first search algorithm always selects the path which appears best at that moment.
• A* is optimal and complete but time complexity and space complexity too high. it require more computation.
• Recursive best first search ...... more memory knowledge but used only O(bd) memory.
• Memory simplified bound A+ such as A* optimal if you can jet optimal solution otherwise as it is memory bound.

74. Find the lexicographic ordering of the bit string given below based on the ordering 0 < 1.

(A) 001 (B) 010
(C) 011 (D) 0001
(E) 0001
Choose the correct answer form the options given below:

(a) 001 < 010 < 011 < 0001 < 0101
(b) 0001 < 001 < 010 < 0101 < 011
(c) 0001 < 0101 < 001 < 010 < 011
(d) 001 < 010 < 0001 < 0101 < 011

Correct Answer: (b) 0001 < 001 < 010 < 0101 < 011

Solution:

Lexicographic order is nothing but dictionary order.
To determine the order of strings we need to compare each bit of all the strings one by one.
For Ex. Take 001 and 010, hence the second bits of the strings are 0, 1 respectively since 0 < 1 as per the given question 001 < 010
Similarly (0001 < 0001 < 010 < 0101 < 011)

75. Arrange the following types of machine is descending order of complexity:

(A) SISD
(B) MIMD
(C) SIMD
Choose the correct answer form the options given below:

(a) A, B, C
(b) C, B, A
(c) B, C, A
(d) C, A, B

Correct Answer: (c) B, C, A

Solution:

• MIMD (Multiple Instructions Stream Multiple Data Stream) This includes machines with multiple processing units that can apply multiple instruction to different data at the same time.
• SIMD (Single Instruction stream Multiple Data Stream )This means that a single Instruction is applied to several data sets at the same time.
• SISD (Single Instruction stream Single Data Stream) This is the von Neumann principle of serial computer architecture, which only executes one instruction at a time.

76. Given below are different properties of 3D projections from A-D. Identify the correct order on the basis of property true of (i) a perspective projection only, (ii) an orthographic projection only, (iii) both orthographic and projective transformation and (iv) neither orthographic nor projective transformation respectively.

(A) Straight lines are mapped to straight lines.
(B) Distance and angles are (in general) preserved.
(C) Far away object appear the same size as closer ones.
(D) Requires homogeneous coordinates in order for it to be encoded into a linear transformation.
Choose the correct answer form the oprions given below:

(a) D, C, B, A
(b) B, C, D, A
(c) D, C,A, B
(d) C, D, B, A

Correct Answer: (c) D, C,A, B

Solution:

77. Arrange the following types of Cohesion form the to worst type.

(A) Logical Cohesion
(B) Sequential Cohesion
(C) Communication Cohesion
(D) Temporal Cohesion
(E) procedural Cohesio
Choose the correct answer from the given below:

(a) A → D → E → C → B
(b) A → E → D → C → B
(c) B → E → C → D → A
(d) B → C → E → D → A

Correct Answer: (d) B → C → E → D → A

Solution:

78. Consider the undirected graph below :

(a) (a, b), (a, h), (g, h), (f, g), (c, f), (c, i), (c, d), (d, e)
(b) (a, b), (b, h), (g, h), (g, i), (c, i), (c, f), (c, d), (d, e)
(c) (a, b), (b, c), (c, i), (c, f), (f, g), (g, h), (c, d), (d, e)
(d) (a, b), (g, h), (g, f), (c, f), (c, i), (f, e), (b, c), (d, e)
(e) (a & c)

Correct Answer: (e) (a & c)

Solution:

A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edge (V – 1) of a connected, edge weighted undirected graph G(V, E) that connects all the vertices together, without any cycle and with the minimum possible total edge
weight.

So, there are two sequence (a, b), (b, c), (c, i), (c, f),(f, g), (g, h), (c, d), (d, e) with a cost 37. Another sequence is (a, b), (a, h), (g, h), (f, g), (c, f), (c, i), (c, d), (d, e) with a cost is 37.

79. Consider the following regular expressions:

(a) r = a (b + a)*
(b) s = a (a + b)+
(C) t = aa*b
Choose the correct answer form the options given below based on the relation between the language generated by the regular expressions above:

(a) L(r) ⊆ L(s) ⊆ (t)
(b) L(r) ⊇ L(s) ⊇ (t)
(c) L(r) ⊇ L(t) ⊇ (s)
(d) L(s) ⊇ L(t) ⊇ (r)

Correct Answer: (b) L(r) ⊇ L(s) ⊇ (t)

Solution:

L(r) = {a, aa, ab, aaa, aab, .........}This is a set of all strings starting with 'a'.
L(s) = {aa. ab. aaa. aab, ......} This is a set of all strings starting with 'aa' or 'ab'
. L(t) = {ab. aab. aaab. aaaab. .......} This is a set of all strings starting with 'a' ending with 'b' and contains any number of 'a's in between them.
L(r) ⊇ L(s) ⊇ (t)
Note :- Represent o or more number of symbols. Represent 1 or more number of symbols.