U.G.C. NET Exam. December 2022 Paper-II (COMPUTER SCIENCE) and Applications.

71. Match List I with List II

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

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

Solution:

72. Match List I with List II

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

Correct Answer: (c) A-IV; B-I; C-II; D-III

Solution:

73. Match List I with List II

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

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

Solution:

74. Match List I with List II

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

Correct Answer: (c) A-III; B-I; C-II; D-IV

Solution:

75. Match List I with List II

(a) A-I; B-II; C-I; D-II
(b) A-II; B-II; C-I; D-II
(c) A-I; B-II; C-II; D-I
(d) A-II; B-II; C-II; D-I

Correct Answer: (b) A-II; B-II; C-I; D-II

Solution:

76. Let G be a simple undirected graph with n(n>0) vertices and 'k' connected components. What is the minimum possible number of edges of 'G'?

(a) k(n–1)
(b) n(k–1)
(c) n+k–2
(d) n–k

Correct Answer: (d) n–k

Solution:

The minimum possible number of edges in a simple undirected graph G with n vertices and 'k' connected components is n-k.
So correct Answer is option (d)

77. The sequence of events that happen during a typical fetch operation is/are :

A. Memory B. MBR C. MAR
D. PC E. IR
Choose the correct order from the options given below :

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

Correct Answer: (b) D, C, A, B, E

Solution:

78. Arrange the following search and sort algorithms in ascending order of their worstcase complexities.

A. Merge sort B. Linear Search
C. Bubble Sort D. Binary Search
Choose the correct answer from the options given below :

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

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

Solution:

Here are the search and sort algorithms arranged in ascending order of their worst-case complexities.
B. Linear search - worst-cost complexity : O(n)
D. Binary search - worst - case complexity : O(log n)
A. Merge sort - worst - case complexity : O (log n)
C. Bubble sort - worst - case complexity : O (n2 )
So option (b) is correct.