Q. Consider that 15 machines need to be connected in a LAN using 8-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum number of switches needed is. Solution: You need at leastΒ 3Β switches of Ethernet are required to connect 15 computers.
Q. Let Ξ£ be the set of all bijections from {1, β¦ , 5} to {1, β¦ , 5}, where ππ denotes the identity function, i.e. ππ(π) = π, βπ.Β Β Let β denote composition on functions.Β Β For a string π₯ =π₯1 π₯2 β― π₯π β Ξ£π, π β₯ 0 , let π(π₯) = π₯1 β π₯2
Q. Suppose π is distributed uniformly in the open interval (1,6). The probability that the polynomial 3π₯2 + 6π₯π + 3π + 6 has only real roots is (rounded off to 1 decimal place) Solution: For a quadratic polynomial ax2 + bx + c = 0. There are three condition: b2 – 4ac > 0
Q. Let π be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves π and π of π are chosen uniformly and independently at random. The expected value of the distance between π and π in π (i.e., the number of edges in the unique path
Q. A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60-MHz clock. To service a cache miss, the memory controller first takes 1 cycle to accept the starting address of the block, it then takes 3 cycles to
Q. The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers. The disk block size is 4 kB, and the disk block address is 32-bits long. The maximum possible file size is (rounded off to 1 decimal place) ____________GB. Solution: No. of Disk block pointers = 4kB/32bits
Q. Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below: Process P1 P2 P3 P4 Arrival time 0 1 3 4 CPU burst time 3 1 3 Z These processes are run on a single processor using preemptive Shortest Remaining Time First scheduling
Q. Consider the following statements: Which of the above statements are TRUE? (A) I, II and III (B) I, II and IV (C) I, III and IV (D) II, III and IV Ans: I, II and III
Q. Let πΊ be any connected, weighted, undirected graph. Which of the above two statements is/are TRUE? (A) I only (B) II only (C) Both I and II (D) Neither I nor II Ans: Β Both I and II
Let πΊ be any connected, weighted, undirected graph. Read More Β»
Q. There are n unsorted arrays: A1, A2, β¦, An. Assume that n is odd. Each of A1, A2, β¦, An contains n distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of A1, A2, β¦, An is (A) O(n) (B) O(n
