CS and IT GATE 2014 Set-2 Questions with Answer

Ques 14 Computer Networks

A graphical HTML browser resident at a network client machine Q accesses a static HTML webpage from a HTTP server S. The static HTML page has exactly one static embedded image which is also at S. Assuming no caching, which one of the following is correct about the HTML webpage loading (including the embedded image)?

Q needs to send at least 2 HTTP requests to S, each necessarily in a separate TCP connection to server S

Q needs to send at least 2 HTTP requests to S, but a single TCP connection to server S is sufficient

A single HTTP request from Q to S is sufficient, and a single TCP connection between Q and S is necessary for this

A single HTTP request from Q to S is sufficient, and this is possible without any TCP connection between Q and S

Ques 15 Computer Organization and Architecture

A 4-way set-associative cache memory unit with a capacity of 16 KB is built using a block size of 8 words. The word length is 32 bits. The size of the physical address space is 4 GB. The number of bits for the TAG field is _______.

Ques 16 Computer Organization and Architecture

In designing a computer's cache system, the cache block (or cache line) size is an important parameter. Which one of the following statements is correct in this context?

A smaller block size implies better spatial locality.

A smaller block size implies a smaller cache tag and hence lower cache tag overhead.

A smaller block size implies a larger cache tag and hence lower cache hit time.

A smaller block size incurs a lower cache miss penalty.

Ques 17 Computer Organization and Architecture

If the associativity of a processor cache is doubled while keeping the capacity and block size unchanged, which one of the following is guaranteed to be NOT affected?

Width of tag comparator

Width of set index decoder

Width of way selection multiplexor

Width of processor to main memory data bus

Ques 18 Computer Organization and Architecture

The value of a float type variable is represented using the single-precision 32-bit floating point format of IEEE-754 standard that uses 1 bit for sign, 8 bits for biased exponent and 23 bits for mantissa. A float type variable X is assigned the decimal value of -14.25. The representation of X in hexadecimal notation is

C1640000H

416C0000H

41640000H

C16C0000H

Ques 19 Computer Organization and Architecture

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 is made, the bus is occupied for 100 nanoseconds (ns) by the data, address, and control signals. During the same 100 ns, and for 500 ns thereafter, the addressed memory module executes one cycle accepting and storing the data. The (internal) operation of different memory modules may overlap in time, but only one request can be on the bus at any time. The maximum number of stores (of one word each) that can be initiated in 1 millisecond is _______.

Ques 20 Data Structures and Algorithms

Suppose a stack implementation supports an instruction REVERSE, which reverses the order of elements on the stack, in addition to the PUSH and POP instructions. Which one of the following statements is TRUE with respect to this modified stack?

A queue cannot be implemented using this stack.

A queue can be implemented where ENQUEUE takes a single instruction and DEQUEUE takes a sequence of two instructions.

A queue can be implemented where ENQUEUE takes a sequence of three instructions and DEQUEUE takes a single instruction.

A queue can be implemented where both ENQUEUE and DEQUEUE take a single instruction each.

Ques 21 Data Structures and Algorithms

The number of distinct minimum spanning trees for the weighted graph below is _______.
[Image of a weighted graph]

Ques 22 Databases

SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below:
SELECT * FROM R WHERE a IN (SELECT S.a FROM S)

SELECT R.* FROM R, S WHERE R.a = S.a

SELECT DISTINCT R.* FROM R, S WHERE R.a = S.a

SELECT R.* FROM R, (SELECT DISTINCT a FROM S) AS S1 WHERE R.a = S1.a

SELECT R.* FROM R, S WHERE R.a = S.a AND a IS UNIQUE R

Ques 23 Databases

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

Which one of the following statements is CORRECT?

S is conflict-serializable but not recoverable

S is not conflict-serializable but is recoverable

S is both conflict-serializable and recoverable

S is neither conflict-serializable nor is it recoverable

Ques 24 Databases

Consider a join (relation algebra) between relations r(R) and s(S) using the nested loop method. There are 3 buffers each of size equal to disk block size, out of which one buffer is reserved for intermediate results. Assuming size(r(R)) < size(s(S)), the join will have fewer number of disk block accesses if

relation r(R) is in the outer loop.

relation s(S) is in the outer loop.

join selection factor between r(R) and s(S) is more than 0.5.

join selection factor between r(R) and s(S) is less than 0.5.

Ques 25 Digital Logic

The dual of a Boolean function F(x₁, x₂,..., x_n, +,., ') written as F^D is the same expression as that of F with + and. swapped. F is said to be self-dual if F = F^D. The number of self-dual functions with n Boolean variables is

2ⁿ

2^(n-1)

2^(2ⁿ)

2^{(2^(n-1))}

Ques 26 Digital Logic

Let k = 2ⁿ. A circuit is built by giving the output of an n-bit binary counter as input to an n-to-2ⁿ bit decoder. This circuit is equivalent to a

k-bit binary up counter.

k-bit binary down counter.

k-bit ring counter.

k-bit Johnson counter.

1 2 3 4 5

Total Unique Visitors

Loading......

CS/IT Gate Yearwise

CS and IT GATE 2014 Set-2 Questions with Answer