GATE (Graduate Aptitude Test in Engineering) Computer Science: Questions 1986 - 1988 of 2080

Access detailed explanations (illustrated with images and videos) to 2080 questions. Access all new questions- tracking exam pattern and syllabus. View the complete topic-wise distribution of questions. Unlimited Access, Unlimited Time, on Unlimited Devices!

View Sample Explanation or View Features.

Rs. 550.00 -OR-

How to register? Already Subscribed?

Question 1986

Appeared in Year: 2015

Question

MCQ▾

Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements are False with respect to the TCP connection?

1. If the sequence number of a segment is m, then the sequence number of the subsequent segment is always .

2. If the estimated round-trip time at any given point of time is sec, the value of the retransmission timeout is always set to greater than or equal to sec.

3. The size of the advertised window never changes during the TCP connection.

4. The number of unacknowledged bytes at the sender is always less than or equal to the advertised window

Choices

Choice (4)Response

a.

3 only

b.

1 and 3 only

c.

1 and 4 only

d.

2 and 4 only

Question 1987

Appeared in Year: 2015

Question

MCQ▾

Let represent the number of bit strings of length n containing two consecutive 1՚s. What is the recurrence relation for an?

Choices

Choice (4)Response

a.

b.

c.

d.

Question 1988

Appeared in Year: 2015

Question

MCQ▾

An algorithm performs find operations, N insert operations, delete operations, and decrease-key operations on a set of data items with keys drawn from a linearly ordered set. For a delete operation, a pointer is provided to the record that must be deleted. For the decrease-key operation, a pointer is provided to the record that has its key decreased. Which one of the following data structures is the most suited for the algorithm to use, if the goal is to achieve the best total asymptotic complexity considering all the operations?

Choices

Choice (4)Response

a.

Sorted doubly linked list

b.

Unsorted array

c.

Sorted array

d.

Min-heap

Developed by: