CS and IT GATE 2015 Set-3 Questions with Answer

Ques 14 Computer Network

Consider a network connecting two systems located 8000 kilometers apart. The bandwidth of the network is 500 × 106 bits per second. The propagation speed of the media is 4 × 106 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. Then, the minimum size in bits of he sequence number field has to be ________.

Ques 15 Computer Network

Consider the following statements.

I. TCP connections are full duplex.
II. TCP has no option for selective acknowledgment
III. TCP connections are message streams.

Ques 16 Computer Network

Consider a CSMA/CD network that transmits data at a rate of 100 Mbps (108 bits per second) over a 1 km (kilometre) cable with no repeaters. If the minimum frame size required for this network is 1250 bytes, what is the signal speed (km/sec) in the cable?

Ques 17 Data Structure

Given a hash table T with 25 slots that stores 2000 elements, the load factor α for T is __________

Ques 18 Data Structure

Assume that a mergesort algorithm in the worst case takes 30 seconds for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes?

Ques 19 Data Structure

Consider the following array of elements.

〈89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100〉.

The minimum number of interchanges needed to convert it into a max-heap is

Ques 20 Data Structure

While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is

Ques 21 Data Structure

The result evaluating the postfix expression 10 5 + 60 6 / * 8 – is

Ques 22 DBMS

Consider the relation X(P, Q, R, S, T, U) with the following set of functional dependencies

F = {
        {P, R} → {S,T},
        {P, S, U} → {Q, R}
}

Which of the following is the trivial functional dependency in F⁺ is closure of F?

Ques 23 DBMS

Consider the following relation

Cinema (theater, address, capacity)

Which of the following options will be needed at the end of the SQL query

SELECT P1. address FROM Cinema P1

Such that it always finds the addresses of theaters with maximum capacity?

Ques 24 Discrete Mathematics

The number of 4 digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set {1, 2, 3} is ____.

Ques 25 Discrete Mathematics

In a room there are only two types of people, namely Type 1 and Type 2. Type 1 people always tell the truth and Type 2 people always lie. You give a fair coin to a person in that room, without knowing which type he is from and tell him to toss it and hide the result from you till you ask for it. Upon asking, the person replies the following:

“The result of the toss is head if and only if I am telling the truth.”

Which of the following options is correct?

Ques 26 Discrete Mathematics

Suppose U is the power set of the set S = {1,2,3,4,5,6}. For any T ∈ U, let |T| denote the number of elements in T and T′ denote the complement of T. For any T, R ∈ U, let TR be the set of all elements in T which are not in R. Which one of the following is true?