UGC NET CS 2015 Dec – III

Question 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?

• 2 Mbps
• 60 Mbps
• 120 Mbps
• 10 Mbps

Question 12

Consider a subnet with 720 routers. If a three-level hierarchy is chosen with eight clusters, each containing 9 regions of 10 routers, then total number of entries in the routing table is __________.

• 25
• 27
• 53
• 72

Question 13

In a classful addressing, the IP addresses with 0 (zero) as network number :

• refers to the current network
• refers to broadcast on the local network
• refers to broadcast on a distant network
• refers to loopback testing

Question 14

In electronic mail, which of the following protocols allows the transfer of multimedia messages?

• IMAP
• SMTP
• POP 3
• MIME

Question 15

A device is sending out data at the rate of 2000 bps. How long does it take to send a file of 1,00,000 characters ?

• 50
• 200
• 400
• 800

Question 16

In Activity - Selection problem, each activity i has a start time s_i and a finish time f_i where s_i ≤ f_i. Activities i and j are compatible if:

• s_i ≥ f_j
• s_j ≥ f_i
• s_i ≥ f_j or s_j ≥ f_i
• s_i ≥ f_j and s_j ≥ f_i or

Question 17

Given two sequences X and Y : X = < a, b, c, b, d, a, b > Y = < b, d, c, a, b, a > . The longest common subsequence of X and Y is :

• < b, c, a>

• < c, a, b>

• < b, c, a, a>

• < b, c, b, a>

Question 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 :

• O(d n k)
• O(d n^k)
• O((d +n) k)
• O(d (n + k))

Question 19

The solution of the recurrence relation T(n) ≤ { θ(1) if n ≤ 80 T(n) ≤ { T(n / s) + T((7n / 10) + 6) + O(n) if n ≥ 80 is :

• O(lg n)
• O(n)
• O(n lg n)
• None of the above

Question 20

Floyd-Warshall algorithm utilizes __________ to solve the all-pairs shortest paths problem on a directed graph in __________ time.

• Greedy algorithm, θ (V³)

• Greedy algorithm, θ (V² lgn)

• Dynamic programming, θ (V³)

• Dynamic programming, θ (V² lgn)