UGC NET Computer Science June 2019 -II | Question 1 (Shift-I)

Question 1

---

1. Consider the poset ({3,5,9,15,24,45},|).
Which of the following is correct for the given poset?

1. (1) There exists a greatest element and a least element
2. (2) There exists a greatest element but not a least element
3. (3) There exists a least element but not a greatest element
4. (4) There does not exist a greatest element and a least element

Answer : (4) There does not exist a greatest element and a least element

Explanation Question 1

The division symbol ‘|’ is a partial ordering on the set {3,5,9,15,24,45}.
Lets draw Hasse Diagram for the given partially ordered set, or poset.

Hasse Diagram for given poset ({3,5,9,15,24,45},|)

For given poset, We can not choose greatest element because there are two maximal elements 24 and 45.

Similarly, We can not choose here least element because there are two minimal elements 5 and 3 at same level in Hasse diagram.

So, there is no possibility of greatest and least element.

So, option (4) is correct answer

Reference : Partial Orderings - partially ordered set / poset

Reference : Greatest element of a subset S of a partially ordered set (poset)

Previous	Next
UGC NET CS 2019 June - II	UGC NET CS 2019 June - II Question 2

UGC NET PAPER 2 June 2019 Question 53 (Shift-I)

53. 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

A R only

B Q only

C P and Q only

D Q and R only

ANS. A

Previous	Next
UGC NET CS 2018 July - II Question 52	UGC NET CS 2018 July - II Question 54

UGC NET PAPER 2 June 2019 Question 83 (Shift-I)

Question 83

---

83. You are designed a link layer protocol for a link with bandwidth of 1 Gbps (109 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. 1. 1 millisecond
2. 2. 2 millisecond
3. 3. 3 millisecond
4. 4. 4 millisecond

Answer : 4. 4 millisecond

Explanation Question 83

Given data:
Fiber link length = distance = 800 km.
Speed of light in this medium = velocity = 200000 km/second
and we know that 1 sec is equel to 1000 milliseconds

Solution:
Propagation delay : Time taken by the first bit to travel from sender to receiver end of the link.

Propagation delay = distance/transmission speed
Propagation delay
= 800km / ( 200000km /sec)
= ( 800 / 200000) sec
= ( 800 / 200 ) milliseconds
= 4 ms

So, option 4 is correct answer

Previous	Next
UGC NET CS 2018 July - II Question 82	UGC NET CS 2018 July - II Question 84

UGC NET PAPER 2 June 2019 Question 85 (Shift-I)

Question 85

---

85. 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?

1. 1. P-True: Q-False
2. 2. P-False; Q-True
3. 3. P-True; Q-True
4. 4. P-False; Q-false

Answer : 2. P-False; Q-True

Explanation Question 85

• P: The loopback(IP) address is a member of class B network. Statement P is Flase.
  Explanation: The loopback(IP) address is a member of class A network. Any address between the range 127 . 0. 0. 0 to 127.255.255.255 can be used a loopback address but we can’t use 127 . 0. 0. 0 and 127.255.255.255 as loopback addresses.
• Q: The loopback(IP) address is used to send a packet from host to itself. Statement Q is True.
  Explanation: IPv4 network standards reserve the entire address block 127.0.0.0/8 (more than 16 million addresses) for loopback purposes. That means any packet sent to any of those addresses is looped back. A loopback address is a special IP address, 127.0.0.1, reserved by InterNIC for use in testing network cards.It also allows information technology professionals to test IP software without worrying about broken or corrupted drivers or hardware.

So, option 2 is correct answer

Reference : localhost - loopback(IP) address

Reference 2 : What is a loopback address?

Previous	Next
UGC NET CS 2018 July - II Question 84	UGC NET CS 2018 July - II Question 86

UGC NET PAPER 2 June 2019 Question 78 (Shift-I)

Question 78

---

78. Consider the following grammar:
S→ XY
X→ YaY | a and Y → bbX
Which of the following statements is/are true about the above grammar?
(a) Strings produced by the grammar can have consecutive three a's
(b) Every string produced by the grammar have alternate a and b
(c) Every string produced by the grammar have at least two a's
(d) Every string produced by the grammar have b's in multiple of 2.

1. 1. (a) only
2. 2. (b) and (c) only
3. 3. (d) only
4. 4. (c) and (d) only

Answer : 4. (c) and (d) only

Explanation Question 78

Given grammar generates strings which contains "b" in multiple of 2 and number of "a" at least 2.

This grammar generate a string set of this form, L = { abba, bbaabbabba, abbbbaabba, . . . . . . . . . . . . . }

• Statement (a) is not true because the grammar can generate two consecutive a’s but not three consecutive a’s.
• Statement (b) is not true because every string produced by the grammar do not have alternate a and b. The grammar can generate two b’s together it means that every string do not have alternate "a" and "b".
• Statement (c) is true because every string produced by the grammar have at least two a's.
• Statement (d) is true because every string produced by the grammar have b's in multiple of 2.

This is satisfied by statements c and d. But statements a and b are not satisfied.
Hence statements c and d is right.

So, option 4 is correct answer

Previous	Next
UGC NET CS 2018 July - II Question 77	UGC NET CS 2018 July - II Question 79

UGC NET PAPER 2 June 2019 Question 100 (Shift-I)

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

A Markov decision processes, objects

B Hidden states, objects

C Markov decision processes, states

D Objects, states

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 99	UGC NET CS 2018 July - II Question 101

UGC NET PAPER 2 June 2019 Question 99 (Shift-I)

99. The value of the derivative of the sigmoid function given by
f(x)= 1 / (1+e(-2x)) at x=0 is
A) 0
B) 1/2
C) 1/4
D) ∞

A

B

C

D

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 98	UGC NET CS 2018 July - II Question 100

UGC NET PAPER 2 June 2019 Question 98 (Shift-I)

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

A Back propagation network

B Hebb network

C Associative memory network

D Self-organizing feature map

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 97	UGC NET CS 2018 July - II Question 99

UGC NET PAPER 2 June 2019 Question 97 (Shift-I)

97. Consider the following:
(a) Evolution
(b) Selection
(c) reproduction
(d) Mutation
Which of the following are found in genetic algorithms?

A (b),(c) and (d) only

B (b) and (d) only

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

D (a),(b) and (d) only

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 96	UGC NET CS 2018 July - II Question 98

UGC NET PAPER 2 June 2019 Question 96 (Shift-I)

96. Consider the following methods:
M ₁ : mean of maximum
M ₂: Centre of area
M ₃: Height method
Which of the following is/are defuzzification method(s)?

A) Only M1

B) Only M 1 and M2

C) Only M 2 and M3

D) M 1 , M2 and M3

A

B

C

D

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 95	UGC NET CS 2018 July - II Question 97

UGC NET PAPER 2 June 2019 Question 95 (Shift-I)

95. Let A_α0 denotes the α-cut of a fuzzy set A at α₀. If α₁ < α₂ , then

A Aα1 ⊇ Aα2

B Aα1 ⊃ Aα2

C Aα1 ⊆ Aα2

D Aα1 ⊂ Aα2

ANS. A

Previous	Next
UGC NET CS 2018 July - II Question 94	UGC NET CS 2018 July - II Question 96

UGC NET PAPER 2 June 2019 Question 94 (Shift-I)

94. A fuzzy conjunction operator denoted as t(x,y) and fuzzy disjunction operator denoted as s(x,Y) form dual pair if they satisfy the condition:

A t(x,y) = 1-s(x,y)

B t(x,y) = s(1-x,1-y)

C t(x,y) = 1-s(1-x,1-y)

D t(x,y) = s(1+x,1+y)

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 93	UGC NET CS 2018 July - II Question 95

UGC NET PAPER 2 June 2019 Question 93 (Shift-I)

93. The STRIPS representation is

A a feature-centric representation

B an action-centric representation

C a combination of feature-centric and action-centric representation

D a hierarchical feature-centric representation

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 92	UGC NET CS 2018 July - II Question 94

UGC NET PAPER 2 June 2019 Question 92 (Shift-I)

92. Match List-I with List-II:

List-I	List-II
(a) Greedy best-first	(i) Minimal cost (p)+h(p)
(b) Lowest cost-firs	(ii) Minimal h(p)
(c) A* algorithm	(iii) Minimal cost (p)

Choose the correct option from those given below:

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

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

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

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

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 91	UGC NET CS 2018 July - II Question 93

UGC NET PAPER 2 June 2019 Question 91 (Shift-I)

91. 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

A 4

B 7

C 11

D 12

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 90	UGC NET CS 2018 July - II Question 92

UGC NET PAPER 2 June 2019 Question 90 (Shift-I)

90. 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

A Intrusion detection systems

B Digital signatures

C Data Compression

D Certification

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 89	UGC NET CS 2018 July - II Question 91

UGC NET PAPER 2 June 2019 Question 89 (Shift-I)

89. The ability to inject packets into the internet with false source address is known as :

A Man-in-the-Middle attack

B IP phishing

C IP sniffing

D IP Spoofing

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 88	UGC NET CS 2018 July - II Question 90

UGC NET PAPER 2 June 2019 Question 88 (Shift-I)

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

A 12.5%

B 25%

C 37.5%

D 50%

ANS. A

Previous	Next
UGC NET CS 2018 July - II Question 87	UGC NET CS 2018 July - II Question 89

UGC NET PAPER 2 June 2019 Question 87 (Shift-I)

87. 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

A P only

B Q only

C P and Q

D Neither P nor Q

ANS. A

Previous	Next
UGC NET CS 2018 July - II Question 86	UGC NET CS 2018 July - II Question 88

UGC NET PAPER 2 June 2019 Question 86 (Shift-I)

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

A data link

B network

C Transport

D Application

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 85	UGC NET CS 2018 July - II Question 87

UGC NET PAPER 2 June 2019 Question 84 (Shift-I)

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

A 255.255.255.252

B 255.255.255.128

C 255.255.255.0

D 255.255.254.0

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 83	UGC NET CS 2018 July - II Question 85

UGC NET PAPER 2 June 2019 Question 82 (Shift-I)

Question 82

---

82. 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?

Options:

1. 1. ARP
2. 2. DNS
3. 3. RARP
4. 4. ICMP

Answer : 3 RARP

Explanation Question 82

Reverse Address Resolution Protocol

It is used to get IP address with the help of Physical address(MAC Address).

RARP was used by old diskless workstations. These old hosts don’t have a disk so there is nothing to store an IP address on. They do have a hardcoded MAC address though. When the workstation starts, it broadcasts a RARP request with its own MAC address.

On the same network as the hosts, we have a RARP server listening to the RARP requests. This server has a table that contains a combination of MAC and IP addresses. When it receives a RARP request, it checks its table to find the matching IP address for the MAC address in the RARP request packet. The RARP server then replies with a RARP reply to the host. When the host receives the RARP reply, it knows its IP address.

Reference : RARP (Reverse Address Resolution Protocol - Reverse ARP)

Reference 2 : Reverse Address Resolution Protocol

Previous	Next
UGC NET CS 2018 July - II Question 81	UGC NET CS 2018 July - II Question 83

UGC NET PAPER 2 June 2019 Question 80 (Shift-I)

80. For a statement
A language L ⊆ Σ ^* is recursive if there exists some Turing machine M Which of the following conditions is satisfied for any string w?
A) If w ∈ L, then m accepts w and M will not halt
B) If w ∉ L, then M accepts w and M will halt by reaching at final state
C) If w ∉ L, then M halts without reaching to acceptable state
D) If w ∈ L, then M halts without reaching to an acceptable state

A

B

C

D

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 79	UGC NET CS 2018 July - II Question 81

UGC NET PAPER 2 June 2019 Question 81 (Shift-I)

81. 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 n nodes, the number of direct links as a function of n can be expressed as

A n(n+1)/2

B (n+1)/2

C n/2

C n(n-1)/2

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 80	UGC NET CS 2018 July - II Question 82

UGC NET PAPER 2 June 2019 Question 79 (Shift-I)

79. Which of the following problems is/are decidable problem(s) (recursively enumerable) on a Turing machine M?
(a) G is a CFG with L(G)=∅
(b) There exist two TMs M ₁ and M₂ such that L(M) ⊆ {L(M₁)UL(M₂)}= language of all TMs
(c) M is a TM that accepts w using a most 2^|w| cells of tape

A (a) and (b) only

B (a) only

C (a), (b) and (c)

D (c) only

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 78	UGC NET CS 2018 July - II Question 80

UGC NET PAPER 2 June 2019 Question 77 (Shift-I)

77. How can the decision algorithm be constructed for deciding whether context-free language L is finite?
(a) By Constructing redundant CFG in CNF generating language L
(b) By constructing non-redundant CFG G in CNF generating language L
(c) By constructing non-redundant CFG in CNF generating language L-{∧} (∧ stands for null)
Which of the following is correct?

A (a) only

B (b) only

C (c) only

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

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 76	UGC NET CS 2018 July - II Question 78

UGC NET PAPER 2 June 2019 Question 76 (Shift-I)

76. Match List-I with List-II:
Where L1 : Regular language
L2 : Context-free language
L3 : Recursive language
L4 : Recursively enumerable language

List-I	List-2
(a) L'3 ∪ L4	(i) Context-free language
(b) L'2 ∪ L3	(ii) Recursively enumerable language
(c) L1* ∩ L2	(iii) Recursive language

Choose the correct from those given below:

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

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

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

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

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 75	UGC NET CS 2018 July - II Question 77

UGC NET PAPER 2 June 2019 Question 75 (Shift-I)

75. How many states are there in a minimum state automata equivalent to regular expression given below?
regular expression is a*b(a+b)

A 1

B 2

C 3

D 4

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 74	UGC NET CS 2018 July - II Question 76

UGC NET PAPER 2 June 2019 Question 74 (Shift-I)

74. Shift-reduce parser consists of
(a) input buffer
(b) stack
(c) parse table
choose the correct option from those given below:

A (a) and (b) only

B (a) and (c) only

C (c) only

D (a), (b) and (c)

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 73	UGC NET CS 2018 July - II Question 75

UGC NET PAPER 2 June 2019 Question 73 (Shift-I)

73. Replacing the expression 4*2.14 by 8.56 is known as

A Constant folding

B Induction variable

C Strength reduction

D Code reduction

ANS. A

Previous	Next
UGC NET CS 2018 July - II Question 72	UGC NET CS 2018 July - II Question 74

UGC NET PAPER 2 June 2019 Question 72 (Shift-I)

72. On translating the expression given below into quadruple representation, how many operations are required? (i*j)+(e+f)*(a*b+c)

A 5

B 6

C 3

D 7

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 71	UGC NET CS 2018 July - II Question 73

UGC NET PAPER 2 June 2019 Question 71 (Shift-I)

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

A Binary tree

B link list

C Symbol table

D Parse table

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 70	UGC NET CS 2018 July - II Question 72

UGC NET PAPER 2 June 2019 Question 70 (Shift-I)

70. Consider the following statements: S1 : For any integer n>1, a Φ(n) = 1(mod n) for all a ∈ Z*n, where Φ(n) is euler’s phi function.
S2 : If p is prime, then ap = 1(mod p) for all a ∈ Z*p
Which one of the following is are correct:

A Only S1

B Only S2

C Both S1 and S2

D Neither S1 nor S2

ANS. A

Previous	Next
UGC NET CS 2018 July - II Question 69	UGC NET CS 2018 July - II Question 71

UGC NET PAPER 2 June 2019 Question 69 (Shift-I)

69. Consider the following properties with respect to a flow network G=(V,E) in which a flow is a real-valued function f : V x V → R
P1 : For all u,v ∈ V, f(u,v) = -f(v,u)
P2 : Σ v ∈ V f(u,v) = 0 for all u ∈ V
Which one of the following is/are correct?

A Only P1

B Only P1

C Both P1 and 2

D Neither P1 nor P2

ANS. A

Previous	Next
UGC NET CS 2018 July - II Question 68	UGC NET CS 2018 July - II Question 70

UGC NET PAPER 2 June 2019 Question 68 (Shift-I)

68. Consider the following steps:
S​1​ : Characterize the structure of an optimal solution
S2​ : Computer the value of an optimal solution in bottom-up fashion
Which of the step(s) is/are common to both dynamic programming and greedy algorithms?

A Only S​1

B Only S​2

C both S​1​ and S​2

D neither S​1​ nor S​2

ANS. A

Previous	Next
UGC NET CS 2018 July - II Question 67	UGC NET CS 2018 July - II Question 69

UGC NET PAPER 2 June 2019 Question 67 (Shift-I)

Question 67

---

Consider the complexity class CO-NP as the set of languages L such that L’ ε NP, and the following two statements:
S1 : P ⊆ CO-NP
S2 : If NP ≠ CO-NP, then P ≠ NP
Which of the following is/are correct?

1. 1. Only S1
2. 2. Only S2
3. 3. Both S1 and S2
4. 4. D Neither S1 nor S2

ANS. 3

Previous	Next
UGC NET CS 2018 July - II Question 66	UGC NET CS 2018 July - II Question 68

UGC NET PAPER 2 June 2019 Question 66 (Shift-I)

66. Consider double hashing of the form
h(k,i)=(h​_1​ (k)+ih​_2​ (k)) mod m
Where h​_1​(k) = k mod m
h_2​(k)=1+(k mod n)
Where n=m-1and m=701
for k=123456, what is the difference between first and second probes in terms of slots?

A 255

B 256

C 257

D 258

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 65	UGC NET CS 2018 July - II Question 67

UGC NET PAPER 2 June 2019 Question 65 (Shift-I)

65. Which of the following is an application of depth-first search?

A Only topological sort

B Only strongly connected components

C Both topological sort and strongly connected components

D Neither topological sort not strongly connected components

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 64	UGC NET CS 2018 July - II Question 66

UGC NET PAPER 2 June 2019 Question 64 (Shift-I)

64. Which of the following is best running time to sort n integers in the range 0 to n2-1

A O(log n)

B O(n)

C O(n log n)

D O(n2)

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 63	UGC NET CS 2018 July - II Question 65

UGC NET PAPER 2 June 2019 Question 63 (Shift-I)

63. Consider Euler's Φ function given by
Φ(n) = n π_p|n(1-(1/p))
Where p runs over all the primes dividing n. What is the value of Φ(45)?

A 3

B 12

C 6

D 24

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 62	UGC NET CS 2018 July - II Question 64

UGC NET PAPER 2 June 2019 Question 62 (Shift-I)

62. There are many sorting algorithms based on comparison. The running time of heap sort algorithm is O(nlogn). Let P, but unlike Q, heapsort sorts in place where (P,Q) is equal to

A Merge sort, Quick sort

B Quick sort, Insertion sort

C Insertion sort, Quick sort

D insertion sort, Merge sort

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 61	UGC NET CS 2018 July - II Question 63

UGC NET PAPER 2 June 2019 Question 61 (Shift-I)

61. Match List-I with List-II:

List-I	List-II
(a) Prims's algorithm	(i)O(V3 logV)
(b) Dijkstra's algorithm	(ii) O(VE2)
(c) Faster all pairs shortest path	(iii) O(ElogV)
(d) Edmonds-karp algorithm	(iv) O(V2)

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

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

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

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

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 60	UGC NET CS 2018 July - II Question 62

UGC NET PAPER 2 June 2019 Question 60 (Shift-I)

60. Software validation mainly checks for inconsistencies between

A Use cases and user requirements

B Implementation and system design blueprints

C Detailed specifications and user requirements

D Function specifications and use cases

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 59	UGC NET CS 2018 July - II Question 61

UGC NET PAPER 2 June 2019 Question 59 (Shift-I)

59. 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

A Only P and Q

B Only P and R

C Only Q and R

D All the P,Q,R

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 58	UGC NET CS 2018 July - II Question 60

UGC NET PAPER 2 June 2019 Question 58 (Shift-I)

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

A To rectify bugs observed while the system is in use.

B When the customers need the product to run on new platforms

C To support the new features that users want it to support

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

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 57	UGC NET CS 2018 July - II Question 59

UGC NET PAPER 2 June 2019 Question 57 (Shift-I)

57. Match List-I with List-II:

List-I	List-II
(Software process Models)	(Software System)
(a) Waterfall model	(i) e-business that starts with only the basic functionality and then moves on to more advanced features.
(b) Incremental development	(ii) An inventory control system for a supermarket to be developed in a highway
(c) Prototyping	(iii) A virtual reality system for simulating vehicle navigation in a highway.
(d) RAD	(iv) Automate the manual system for student record maintenance in a school

Choose the correct option:

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

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

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

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

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 56	UGC NET CS 2018 July - II Question 58

UGC NET PAPER 2 June 2019 Question 56 (Shift-I)

56. A web application and its support environment has not been fully fortified against attack. Web engineers estimate that the likelihood of repelihood 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?

A 0.625

B 0.725

C 0.775

D 0.825

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 55	UGC NET CS 2018 July - II Question 57

UGC NET PAPER 2 June 2019 Question 54 (Shift-I)

54. Software Reuse is

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

B The process of existing software artifacts and knowledge to build new software

C Concerned with reimplementing legacy system to make them more maintainable

D 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

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 53	UGC NET CS 2018 July - II Question 55

UGC NET PAPER 2 June 2019 Question 52 (Shift-I)

52. The component in MVC is responsible for

A User interface

B Security of the system

C Business logic and domain objects

D Translating between user interface actions/events and operation on the domain objects

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 51	UGC NET CS 2018 July - II Question 53

UGC NET PAPER 2 June 2019 Question 51 (Shift-I)

51. 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:

A P only

B Q only

C P and Q

D Neither P nor Q

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 50	UGC NET CS 2018 July - II Question 52

UGC NET PAPER 2 June 2019 Question 50 (Shift-I)

50. 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?

A cat *.ch | wc -l

B cat *.[c-h] | wc -l

C cat *.[ch] | ls -l

D cat *.[ch] | wc -l

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 49	UGC NET CS 2018 July - II Question 51

UGC NET PAPER 2 June 2019 Question 49 (Shift-I)

49. 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?

A At least 28 bits

B At least 2 bytes

C At least 31 bits

D Minimum 4 bytes

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 48	UGC NET CS 2018 July - II Question 50

UGC NET PAPER 2 June 2019 Question 48 (Shift-I)

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

A 5

B 4

C 3

D 6

ANS. A

Previous	Next
UGC NET CS 2018 July - II Question 47	UGC NET CS 2018 July - II Question 49

UGC NET PAPER 2 June 2019 Question 47 (Shift-I)

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

A Page size

B Physical size of memory

C The instruction set architecture

D Number of processes in memory

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 46	UGC NET CS 2018 July - II Question 48

UGC NET PAPER 2 June 2019 Question 46 (Shift-I)

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

A28

B 12

C 2

D 42

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 45	UGC NET CS 2018 July - II Question 47

UGC NET PAPER 2 June 2019 Question 45 (Shift-I)

45. Consider three intensive processes, which requires 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 ad at the end

A4

B 2

C 3

D 1

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 44	UGC NET CS 2018 July - II Question 46

UGC NET PAPER 2 June 2019 Question 44 (Shift-I)

44. 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 (a) and (d)

B (b) and (c)

C (a) and (b)

D (a), (b) and (c)

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 43	UGC NET CS 2018 July - II Question 45

UGC NET PAPER 2 June 2019 Question 43 (Shift-I)

43. Consider that a process has been allocated 3 frames and has a sequence of page referencing 1,2,1,3,7,4,5,6,3,1
What shall be the difference i page faults for the above string using the algorithm of LRU and Optimal page replacement for referencing the string?

A 2

B 0

C 1

D 3

ANS. A

Previous	Next
UGC NET CS 2018 July - II Question 42	UGC NET CS 2018 July - II Question 44

UGC NET PAPER 2 June 2019 Question 42 (Shift-I)

42. Match List-I with List-II

List-I	List-II
(a) Disk	(i) Thread
(b) CPU	(ii) Signal
(c) Memory	(iii) File System
(d) Interrupt	(iv) Virtual address

Choose the correct option:

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

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

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

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

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 41	UGC NET CS 2018 July - II Question 43

UGC NET PAPER 2 June 2019 Question 41 (Shift-I)

41. Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence:
4,34,10,7,19,73,2,15,6,20
Assuming that the head is current at cylinder 50, what is the time taken to satisfy all requests if it takes 1ms to move from the cylinder to adjacent one and the shortest seek time first policy is used?

A 357 ms

B 238 ms

C 276 ms

D 119 ms

ANS. D

Previous	Next
UGC NET CS 2018 July - II Question 40	UGC NET CS 2018 July - II Question 42

UGC NET PAPER 2 June 2019 Question 40 (Shift-I)

40. K-mean clustering algorithm has clustered the given 8 observations into 3 clusters after 1st iteration as follows:
C1 : {(3,3), (5,5), (7,7)}
C2 : {(0,6), (6,0), (3,0)}
C3 : {(8,8),(4,4)}
What will be the Manhattan distance for observation (4,4) from cluster centroid C1 in second iteration?
A) 2
B) √2
C) 0
D) 18

A

B

C

D

ANS. A

Previous	Next
UGC NET CS 2018 July - II Question 39	UGC NET CS 2018 July - II Question 41

UGC NET PAPER 2 June 2019 Question 39 (Shift-I)

39. 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:

Employee_id	Manager_id
20	40
25	40
30	35
35	20
40	45
45	25

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

A (30,35) only

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

C (35,20) only

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

ANS. B

Previous	Next
UGC NET CS 2018 July - II Question 38	UGC NET CS 2018 July - II Question 40

UGC NET PAPER 2 June 2019 Question 38 (Shift-I)

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

A MySQl, Google API and Map reduce

B Map reduce, Scala and hummer

C Map reduce, H base and Hive

D Map reduce, hummer and Heron

ANS. C

Previous	Next
UGC NET CS 2018 July - II Question 37	UGC NET CS 2018 July - II Question 39