Skip to content

Tag Archives: GATE-GATE-CS-2004

Consider a multiplexer with X and Y as data inputs and Z as control input. Z = 0 selects input X, and Z = 1… Read More
Which are the essential prime implicants of the following Boolean function? f(a, b, c) = a’c + ac’ + b’c (A) a’c and ac’ (B)… Read More
A circuit outputs a digit in the form of 4 bits. 0 is represented by 0000, 1 by 0001, …, 9 by 1001. A combinational… Read More
Consider three IP networks A, B and C. Host HA in network A sends messages each containing 180 bytes of application data to a host… Read More
Consider three IP networks A, B and C. Host HA in network A sends messages each containing 180 bytes of application data to a host… Read More
The routing table of a router is shown below: Destination Sub net mask Interface 128.75.43.0 255.255.255.0 Eth0 128.75.43.0 255.255.255.128 Eth1 192.12.17.5 255.255.255.255 Eth3 default Eth2… Read More
A and B are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both A and B attempt… Read More
The employee information in a company is stored in the relation Employee (name, sex, salary, deptName) Consider the following SQL query select deptName from Employee… Read More
The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child pointer… Read More
Consider the relation Student (name, sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least one… Read More
The relation scheme Student Performance (name, courseNo, rollNo, grade) has the following functional dependencies: name, courseNo → grade rollNo, courseNo → grade name → rollNo… Read More
A Unix-style i-node has 10 direct pointers and one single, one double and one triple indirect pointers. Disk block size is 1 Kbyte, disk block… Read More
Consider two processes P1 and P2 accessing the shared variables X and Y protected by two binary semaphores SX and SY respectively, both initialized to… Read More
Consider a system with a two-level paging scheme in which a regular memory access takes 150 nanoseconds, and servicing a page fault takes 8 milliseconds.… Read More
Consider the following set of processes, with the arrival times and the CPU-burst times given in milliseconds Process Arrival Time Burst Time P1 0 5… Read More