Q. Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the following carrier-sense based medium access protocol. A node that receives a packet to transmit will carrier-sense the medium for 5 units of time. If the node does not […]
Q. Consider an IP packet with a length of 4,500 bytes that includes a 20-byte IPv4 header and a 40-byte TCP header. The packet is forwarded to an IPv4 router that supports a Maximum Transmission Unit (MTU) of 600 bytes. Assume that the length of the IP header in all the outgoing fragments of this
Q. Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3), 200 cylinders (numbered as 0, 1, … , 199), and 256 sectors per track (numbered as 0, 1, … , 255). The following 6 disk requests of the form [sector number, cylinder number, platter number] are received by the disk
Q. Given a language 𝐿, define 𝐿𝑖 as follows: 𝐿0 = {𝜀} 𝐿𝑖 = 𝐿𝑖−1 ⋅ 𝐿 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑖 > 0 The order of a language L is defined as the smallest k such that 𝐿𝑘 = 𝐿𝑘+1. Consider the language L1 (over alphabet 0) accepted by the following automaton. The order of L1
Q. A processor has 16 integer registers (R0, R1, .. , R15) and 64 floating point registers (F0, F1,… , F63). It uses a 2-byte instruction format. There are four categories of instructions: Type-1, Type-2, Type-3, and Type-4. Type-1 category consists of four instructions, each with 3 integer register operands (3Rs). Type-2 category consists of
Q. The instruction pipeline of a RISC processor has the following stages: Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Writeback (WB). The IF, ID, OF and WB stages take 1 clock cycle each for every instruction. Consider a sequence of 100 instructions. In the PO stage, 40 instructions take
The instruction pipeline of a RISC processor has the following stages Read More »
Q. Consider the minterm list form of a Boolean function 𝐹 given below. 𝐹(𝑃, 𝑄, 𝑅, 𝑆) = ∑ 𝑚(0, 2, 5, 7, 9, 11) + 𝑑(3, 8, 10, 12, 14) Here, 𝑚 denotes a minterm and 𝑑 denotes a don’t care term. The number of essential prime implicants of the function 𝐹 is_______. Ans:
Consider the minterm list form of a Boolean function 𝐹 given below Read More »
Q. Consider the weights and values of items listed below. Note that there is only one unit of each item. Item number Weight (in Kgs) Value (in Rupees) 1 10 60 2 7 28 3 4 20 4 2 24 The task is to pick a subset of these items such that their total weight
Consider the weights and values of items listed below Read More »
Q. Consider the following undirected graph G: Choose a value for x that will maximize the number of minimum weight spanning trees (MWSTs) of G. The number of MWSTs of G for this value of x is Ans: 4 Sol: To maximize the number of minimum weight spanning trees of G, the value of x
Q. The number of possible min-heaps containing each value from {1, 2, 3, 4, 5, 6, 7}exactly once is Ans: 80 Sol: Set minimum element as root (i.e 1), now 6 are remaining and left subtree will have 3 elements, each left subtree combination can be permuted in 2! ways. Total ways to design min-heap with 7-elements = ^6C_3 *2! * 2! = 20*2*2 = 80
