Q. Consider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of 𝐾 instances. Resource instances can be requested and released only one at a time. The largest value of 𝐾 that will always avoid deadlock is . Ans: 2 Sol: Given,Number of processes […]
Consider a system with 3 processes that share 4 instances of the same resource type Read More »
Q. A 32-bit wide main memory unit with a capacity of 1 GB is built using 256M × 4-bit DRAM chips. The number of rows of memory cells in the DRAM chip is 214. The time taken to perform one refresh operation is 50 nanoseconds. The refresh period is 2 milliseconds. The percentage (rounded to
Q. Consider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered D flip-flops. The number of states in the state transition diagram of this circuit that have a transition back to the same state on some value of “in” is . Ans: 2
Q. The postorder traversal of a binary tree is 8,9,6,7,4,5,2,3,1. The inorder traversal of the same tree is 8,6,9,4,7,2,5,1,3. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is . Ans: 4 Sol: Given, post-order – 8, 9, 6,
Q. Let G be a finite group on 84 elements. The size of a largest possible proper subgroup of G is . Ans: 42 According to Lagrange’s theorem, states that for any finite group G, the order (number of elements) of every subgroup H of G divides the order of G. Therefore, possible subgroups of group on
Q. The chromatic number of the following graph is Ans: 3 Sol: Chromatic number of given graph is 3. Note that graph is Planar so Chromatic number should be less than or equal to 4 and can not be less than 3 because of odd length cycle. In other words if a graph is planar and
Q. Two people, P and Q, decide to independently roll two identical dice, each with 6 faces, numbered 1 to 6. The person with the lower number wins. In case of a tie, they roll the dice repeatedly until there is no tie. Define a trial as a throw of the dice by P and
Q. Consider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note that cwnd stands for the TCP congestion window and MSS denotes the Maximum Segment Size. i. The cwnd increases by 2 MSS on every successful acknowledgment. ii. The cwnd approximately doubles on every successful acknowledgement. iii. The cwnd
Q. In an Entity-Relationship (ER) model, suppose 𝑅 is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in 𝑅 and that the cardinality of E1 is greater than the cardinality of E2. Which one of the following is true about 𝑅? A. Every entity in
Q. Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is M units if the corresponding memory page is available in memory, and D units if the memory access causes a page fault. It has been experimentally measured that the average time
Consider a process executing on an operating system that uses demand paging Read More »
