NTA UGC NET 2019 June - II

Question 31

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

Question 32

Which of the following statements is/are true? P: In a scripting language like javaScript, types are typically associated with values, not variables. Q: It is not possible to show images on a web page without the tag of HTML Select the correct answer from the given below:

• P only
• Q only
• Both P and Q
• Neither P nor Q

Question 33

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) – (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)

Question 34

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

• 1

• 3

• 4

• 2

• 1

• 3

• 4

• 2

Question 35

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

• 10,4

• 16,16

• 14,16

• 4,16

Question 36

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?

• Only S1

• Only S2

• Both S1 and S2

•  Neither S1 nor S2

Question 37

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 U L4                      (i) Context-free language

(b) L'2 U L3                      (ii) Recursively enumerable language

(c) L1* ∩ L2                      (iii) Recursive language

Choose the correct 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)

Question 38

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

• n(n+1)/2
  

• (n+1)/2
  

• n/2

• n(n−1)/2
  

Question 39

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

• RAM

•  ROM

• Content addressable memory

• Secondary memory

Question 40

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

• 5

• 10

• 15

• 20