PGT Computer Science (Level-3), (HTET Practice MCQs) (Part-V)Total Questions: 10011. 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 MbpsB. 60 MbpsC. 120 MbpsD. 10 MbpsCorrect Answer: A. 2 Mbps12. Consider a subnet with 720 routers. If a three-level hierarchy is choosen with eight clusters, each containing 9 regions of 10 routers, then total number of entries in the routing table is .................... .A. 25B. 27C. 53D. 72Correct Answer: A. 2513. In a classful addressing, the IP addresses with 0 (zero) as network number:A. refers to the current networkB. refers to broadcast on the local networkC. refers to broadcast on a distant networkD. refers to loopback testingCorrect Answer: A. refers to the current network14. In electronic mail, which of the following protocols allows the transfer of multimedia messages?A. IMAРB. SMTРC. POP 3D. MIMЕCorrect Answer: D. MIMЕ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?A. 50B. 200C. 400D. 800Correct Answer: C. 40016. In Activity - Selection problem, each activity i has a start time sᵢ and a finish time fᵢ where sᵢ≤fᵢ. Activities i and j are compatible if:A. sᵢ ≥ fⱼB. sⱼ ≥ fᵢC. sᵢ ≥ fⱼ or sⱼ ≥ fᵢD. sᵢ ≥ fⱼ and sⱼ ≥ fᵢCorrect Answer: C. sᵢ ≥ fⱼ or sⱼ ≥ fᵢ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:A. (b, c, a)B. (c, a, b)C. (b, c, a, a)D. (b, c, b, a)Correct Answer: D. (b, c, b, a)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ᵏ)B. O(d n)C. O((d+ n)k)D. O(d(n + k))Correct Answer: D. O(d(n + k))19. The solution of the recurrence relationA. O(lg n)B. O (n)C. O(n lg n)D. None of theseCorrect Answer: D. None of these20. Floyd-Warshall algorithm utilizes ................. to solve the all-pairs shortest paths problem on a directed graph in ..................... time.A. Greedy algorithm, θ (V³)B. Greedy algorithm, θ (V² lg n)C. Dynamic programming, θ (V³)D. Dynamic programming, θ (V² lg n)Correct Answer: C. Dynamic programming, θ (V³)Submit Quiz« Previous12345678910Next »