CS and IT GATE 2014 Set-1 Questions with Answer

Ques 14 Computer Networks

Consider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links.
[S1] The computational overhead in link state protocols is higher than in distance vector protocols.
[S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol.
[S3] After a topology change, a link state protocol will converge faster than a distance vector protocol.
Which one of the following is correct about S1, S2, and S3?

S1, S2, and S3 are all true.

S1 and S2 are true, but S3 is false.

S1, S2, and S3 are all false.

S1 and S3 are true, but S2 is false.

Ques 15 Computer Networks

Identify the correct order in which the following actions take place in an interaction between a web browser and a web server.
1. The web browser requests a webpage to the web server.
2. The web browser establishes a TCP connection with the web server.
3. The web server sends the requested webpage using HTTP.
4. The web browser resolves the domain name using DNS.

4, 2, 1, 3

1, 2, 4, 3

4, 1, 2, 3

2, 4, 1, 3

Ques 16 Computer Networks

Consider a token ring network with a length of 2 km having 10 stations including a monitoring station. The propagation speed of the signal is 2 x 10⁸ m/s and the token transmission time is ignored. If each station is allowed to hold the token for 2 μsec, the minimum time for which the monitoring station should wait (in μsec) before assuming that the token is lost is _______.

Ques 17 Computer Networks

Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round trip time of the connection is 100 msec and the maximum segment size used is 2 KB. The time taken (in msec) by the TCP connection to get back to 32 KB congestion window is _______.

Ques 18 Computer Networks

Consider a selective repeat sliding window protocol that uses a frame size of 1 KB to send data on a 1.5 Mbps link with a one-way latency of 50 msec. To achieve a link utilization of 60%, the minimum number of bits required to represent the sequence number field is _______.

Ques 19 Computer Organization and Architecture

Consider a 6-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is executing on this 6-stage pipeline, the speedup achieved with respect to non-pipelined execution if 25% of the instructions incur 2 pipeline stall cycles is _______.

Ques 20 Computer Organization and Architecture

An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by k. What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ k exercising least-recently-used replacement policy?

n/N

1/N

1/A

k/n

Ques 21 Computer Organization and Architecture

Consider two processors P₁ and P₂ executing the same instruction set. Assume that under identical conditions, for the same input, a program running on P₂ takes 25% less time but incurs 20% more CPI (clock cycles per instruction) as compared to the program running on P₁. If the clock frequency of P₁ is 1GHz, then the clock frequency of P₂ (in GHz) is _______.

Ques 22 Data Structure

Consider a rooted Binary tree represented using pointers. The best upper bound on the time required to determine the number of subtrees having having exactly 4 nodes O(n^a Logn^b). Then the value of a + 10b is ________

a is the correct answer.

Ques 23 Data Structure

Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time on Depth First Search of G?
Assume that the graph is represented using adjacency matrix.

θ (n)

θ (n+m)

θ(n²)

θ(m²)

Ques 24 Data Structure

Let G=(V,E) be a directed graph where V is the set of vertices and E the set of edges. Then which one of the following graphs has the same strongly connected components as G ?

G₁ = (V,E₁) where E₁={(u,v)∣(u,v)∉E}

G₂ = (V,E₂) where E₂={(u,v)∣(v,u)∈E}

G₃ = (V,E₃) where E₃={(u,v)∣ there is a path of length ≤2 from u to v in E}

G₄= (V₄,E) where V₄ is the set of vertices in G which are not isolated

Ques 25 Data Structures and Algorithms

The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is _______.

Ques 26 Data Structures and Algorithms

Consider a hash table with 9 slots. The hash function is h(k) = k mod 9. The collisions are resolved by chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum, minimum, and average chain lengths in the hash table, respectively, are

3, 0, and 1

3, 3, and 3

4, 0, and 1

3, 0, and 2

1 2 3 4 5

Total Unique Visitors

Loading......

CS/IT Gate Yearwise

CS and IT GATE 2014 Set-1 Questions with Answer