Computer Sciences > Gate 2015 Set-3 > TCP/IP
Consider the following statements.

I. TCP connections are full duplex.
II. TCP has no option for selective acknowledgment
III. TCP connections are message streams.
A
Only I is correct
B
Only I and II are correct
C
Only II and III are correct
D
All of I, II and III are correct

Explanation

Correct : TCP/IP

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science