UGC Net Computer Science Paper 1 December 12 , Page 3-Solved

25. ALU stands for
(A) American Logic Unit
(B) Alternate Local Unit
(C) Alternating Logic Unit
(D) Arithmetic Logic Unit
Answer : D

26. A Personal Computer uses a number of chips mounted on a circuit board called

(A) Microprocessor

(B) System Board

(C) Daughter Board

(D) Mother Board

Answer : A

UGC Net Computer Science December-12 Paper 3 Page 3 Solved

UGC Net Computer Science December-12 Paper 3 Page 3 Solved

21. How many solutions do the following equation have

x1 + x2 + x3 = 11

where x1 ≥ 1, x2 ≥ 2, x3 ≥ 3

(A) C(7, 11)

(B) C(11, 3)

(C) C(14, 11)

(D) C(7, 5)

Answer D

Explanation :-

we can solve this problem by combinition with repetition.

so we need to put 11 similar balls into  x1,x2,x3 types of boxes.

different number of boxes are 3=n

x1≥1, x2≥2, x3≥3 now allocate 1,2,3 from 11 directly . so remaining  ball = 11-(1+2+3) = 5 =k

(n+k-1)Ck  = (3+5-1)C5 =7C5

January 2016 M2-R4: INTERNET TECHNOLOGY AND WEB DESIGN

January 2016 M2-R4: INTERNET TECHNOLOGY AND WEB DESIGN (Solved)

PART ONE

(Answer all the questions)

1. Each question below gives a multiple choice of answers. Choose the most appropriate one and enter in the “OMR” answer sheet supplied with the question paper, following instructions therein. (1x10)

1.1 Protocols are

A) Agreements on how communication components and DTE's are to communicate

B) Logical communication channels for transferring data

C) Physical communication channels sued for transferring data

D) None of the above

View Answer

1.2 Which data communication method is used to transmit the data over a serial communication

link?

A) Simplex

B) Half-duplex

C) Full duplex

D) All of the above

View Answer

UGC Net Computer Science December-12 Paper 3 Page 2

UGC Net Computer Science December-12 Paper 3 Page 2 Solved

11. The time complexities of some standard graph algorithms are given.Match each algorithm with its time complexity ? (n and m are no. of nodes and edges respectively)

a. Bellman Ford algorithm                         1. O (m log n)

b. Kruskals algorithm                                 2. O (n3)       

c. Floyd Warshall algorithm                       3. O(mn)

d. Topological sorting                                4. O(n + m)

Codes :

       a b c d

(A) 3 1 2 4

(B) 2 4 3 1

(C) 3 4 1 2

(D) 2 1 3 4

Answer A