Which one of the following correctly determines the solution of the recurrence relation with T(1) = 1? T(1) = 2T (n/2) +

Suppose P, Q, R, S, T are sorted sequences having lengths 20, 24, 30, 35, 50 respectively. They are to be merged into a

Consider two strings A = “qpqrr” and B = “pqprqrp”. Let x be the length of the longest common subsequence (not necessari

The number of distinct minimum spanning trees for the weighted graph below is ________

A priority queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is: 1

Consider the grammar defined by the following production rules, with two operators * and + $$\eqalign{ & S \to T*P

For a C program accessing X[ i ] [ j ] [ k ], the following intermediate code is generated by a compiler. Assume that th

In the diagram shown below, L1 is an Ethernet LAN and L2 is a Token-Ring LAN. An IP packet originates from sender S and

Consider the store and forward packet switched network given below. Assume that the bandwidth of each link is 106 bytes/

An IP machine Q has a path to another IP machine H via three IP routers R1, R2, and R3. Q—R1—R2—R3—H H acts as an HTTP

Which one of the following is TRUE about the interior gateway routing protocols – Routing Information Protocol (RIP) and

Which one of the following socket API functions converts an unconnected active TCP socket into a passive socket?

A graphical HTML browser resident at a network client machine Q accesses a static HTML webpage from a HTTP server S. The

The value of a float type variable is represented using the single-precision $$32$$-bit floating point format of $$IEEE-

A $$4$$-way set-associative cache memory unit with a capacity of $$16KB$$ is built using a block size of $$8$$ words. Th

In designing a computer’s cache system, the cache block (or cache line) size is an important parameter. Which one of the

If the associativity of a processor cache is doubled while keeping the capacity and block size unchanged, which one of t

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

Suppose a stack implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in ad

Consider the expression tree shown. Each leaf represents a numerical value, which can either be 0 or 1. Over all possibl

Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T

Given an instance of the STUDENTS relation as shown below: For (StudentName, StudentAge) to be a key for this instance

The maximum number of superkeys for the relation schema $$R(E, F, G, H)$$ with $$E$$ as key is ______.

SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins.

Consider a join (relation algebra) between relations r(R)and s(S) using the nested loop method. There are 3 buffers each

Consider the following schedule S of transactions T1, T2, T3, T4:

Consider the equation $${\left( {123} \right)_5} = {\left( {x8} \right)_y}$$ with $$x$$ and $$y$$ as unknown. The number

The dual of a Boolean function $$F\left( {{x_1},{x_2},\,....,\,{x_n},\, + , \cdot ,'} \right),$$ written as $${F^D}$$, i

Let $$k = {2^n}.$$ A circuit is built by giving the output of an ݊$$n$$-bit binary counter as input to an $$n$$-to-$${2

Each of the nine words in the sentence "The Quick brown fox jumps over the lazy dog" is written on a separate piece of p

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

The probability that a given positive integer lying between 1 and 100 (both inclusive) is NOT divisible by 2, 3 or 5 is

Which one of the following Boolean expressions is NOT A tautology?

Consider the following relation on subsets of the set S integers between 1 and 2014. For two distinct subsets U and V of

If the matrix A is such that $$$A = \left[ {\matrix{ 2 \cr { - 4} \cr 7 \cr } } \right]\,\,\left[ {\ma

The number of distinct positive integral factors of 2014 is _______ .

A cycle on $$n$$ vertices is isomorphic to its complement. The value of $$n$$ is __________.

The product of the non-zero eigenvalues of the matrix $$\left[ {\matrix{ 1 & 0 & 0 & 0 & 1 \cr

Three processes $$A, B$$ and $$C$$ each execute a loop of $$100$$ iterations. In each iteration of the loop, a process p

A computer has twenty physical page frames which contain pages numbered $$101$$ through $$120.$$ Now a program accesses

A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is $$4$$ b

Consider the procedure below for the Producer-Consumer problem which uses semaphores: semaphore n = 0; semaphore s = 1;

Consider the function func shown below: int func(int num) {          int

Suppose n and p are unsigned int variables in a C program. We wish to set p to $${}^n{C_3}$$. If n is large, which one o

Which one of the following is NOT performed during compilation?

Consider the following function double f (double x) { if ( abs (x * x – 3) < 0. 01) return x; else return f (

Consider the C function given below. int f(int j) { static int i = 50; int k; if (i == j) { prin

Which one of the following is TRUE?

If $${L_1} = \left\{ {{a^n}\left| {n \ge \left. 0 \right\}} \right.} \right.$$ and $${L_2} = \left\{ {{b^n}\left| {n \ge

Let $${L_1} = \left\{ {w \in \left\{ {0,1} \right\}{}^ * \left| w \right.} \right.$$ has at least as many occurrences o

Let $${L_1} = \left\{ {w \in \left\{ {0,1} \right\}{}^ * \left| w \right.} \right.$$ has at least as many occurrences o

Let $$A\,\,{ \le _m}\,\,B$$ denotes that language $$A$$ is mapping reducible (also known as many-to-one reducible) to la

Let $$ < M > $$ be the encoding of a Turing machine as a string over $$\sum { = \left\{ {0,1} \right\}.} $$ Let $