An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an IP packet of size 4404 bytes with an IP header… Read More

Classless Inter-domain Routing (CIDR) receives a packet with address 131.23.151.76. The router’s routing table has the following entries: Prefix Output Interface Identifier 131.16.0.0/12 3 131.28.0.0/14… Read More

Consider a main memory system that consists of 8 memory modules attached to the system bus, which is one word wide. When a write request… Read More

A cycle on n vertices is isomorphic to its complement. The value of n is _____. (A) 2 (B) 4 (C) 6 (D) 5 Answer:… Read More

Consider the below program, what operation is performed below: C++ void fun(int arr[], int n) {           if (n == 1)         return;       int count… Read More

Let L1 = {w ∈ {0,1}∗ | w has at least as many occurrences of (110)’s as (011)’s}. Let L2 = { ∈ {0,1}∗ | w… Read More

For a C program accessing X[i][j][k], the following intermediate code is generated by a compiler. Assume that the size of an integer is 32 bits… Read More

Three processes A, B and C each execute a loop of 100 iterations. In each iteration of the loop, a process performs a single computation… Read More

Suppose n and p are unsigned int variables in a C program. We wish to set p to nC3. If n is large, which of… Read More

The security system at an IT office is composed of 10 computers of which exactly four are working. To check whether the system is functional,… Read More

Who ___________ was coming to see us this evening? (A) you said (B) did you say (C) did you say that (D) had you Answer:… Read More

An ordered n-tuple (d1, d2, … , dn) with d1 >= d2 >= ⋯ >= dn is called graphic if there exists a simple undirected… Read More

Consider an undirected graph G where self-loops are not allowed. The vertex set of G is {(i, j): 1 <= i <= 12, 1 <=… Read More

Consider the following pseudo code. What is the total number of multiplications to be performed? D = 2 for i = 1 to n do… Read More