forum_image

Discussion Forum

Interative Forum for discussing any query literally to UGC-NET Computer Science, GATE Computer Science and Computer Sciene and Technology in general.

ugc_net image

UGC-NET Computer Science

Correspondence Courses and Test Series to prepare for UGC-NET computer science and applications

GATE image

GATE

MCQs, Lecture Notes, Ebooks for GATE preparation

freestuff image
jobs image

Jobs Newsfeed

Timely information of various Recruitments.

NextPrev

Answer Key and Solved Questions Paper-3 UGC-NET Computer Science December 2015

11. A network with bandwidth of 10 Mbps can pass only an average of 15,000 frames per minute with each frame carrying an average of 8,000 bits. What is the throughput of this network ?
A.2 Mbps
B.60 Mbps
C.120 Mbps
D.10 Mbps
View/Hide Ans
Explanation
12.Consider a subnet with 720 routers. If a three level hierarchy is choosen with 8 clusters, each containing9 regions of 10 routers,then total number of entries in the routing table is-----------------
A.25
B.27
C.53
D.72
View/Hide Ans
Explanation
13.In a classful addressing the IP address with 0(zero) as network number:
A.refers to the current network
B.refers to broadcast on the local network
C.refers to the broadcast on a distant network
D.refers to loopback testing
View/Hide Ans
Explanation
14.In electronic mail, which of the following protocols allows the transfer of multimedia messages /
A.IMAP
B.SMTP
C.POP 3
D.MIME
View/Hide Ans
Explanation
15.A device is sending out data at the rate of 2000 bps.How long does it take to send of file of 1,00,000 characters.
A.50
B.200
C.400
D.800
View/Hide Ans
Explanation
16.In Activity-Selection problem, each activity i has a start time si and a finish time fi where si?fi. Activities i and j are compatible if:
A.si?fj
B.sj?fi
C.si?fj or sj?fi
D.si?fj and sj?fi
View/Hide Ans
Explanation
17.Given two sequences X and Y:
X = Y =
The longest common subsequence of X and Y is:
A.
B.
C.
D.
View/Hide Ans
Explanation
18.If there are n integers to sort, each integer has d digits and each digit is in the set {1,2, ..., k}, radix sort can sort the numbers in:
A.O(d n k)
B.O(d nk)
C. O((d+n)k)
D.O(d(n+k))
View/Hide Ans
Explanation
19. The solution of the recurrence relation

is :
A.O(lg n)
B.O(n)
C.O(n lg n)
D.None of the above
View/Hide Ans
Explanation
20.Floyd-Warshall algorithm utilizes ............... to solve the all-pairs shortest paths problem on a directed graph in ................ time.
A.Greedy algorithm, ?(V3)
B.Greedy algorithm, ?(V2 lgn)
C.Dynamic programming, ?(V3)
D.Dynamic programming, ?(V2 lgn)
View/Hide Ans
Explanation


Author Does Not claim of any answer these answers are as per expert opinion


Pages: 1 2 3 4 5 6 7 8