GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

523.

Consider three IP networks A, B and C. Host HA in networks A sends messages each containing 180 bytes of application data to a host HC in network C. The TCP layer prefixes a 20 byte header to the message. This passes through an intermediate network
B. the maximum packet size, including 20 byte IP header, in each network is:
A : 1000 bytes
B : 100 bytes
C : 1000 bytes
The network A and B are connected through a 1 Mbps link, while B and C are connected by a 512 Kbps link (bps = bits per second).

[1]	Assuming that the packets are correctly delivered, how many bytes, including headers, are delivered to the IP layer at the destination for one application message, in the best case? Consider only data packets. [2 marks] (a) 200 (b) 220 (c) 240 (d) 260

[2]	What is the rate at which application data is transferred to host H_C? Ignore errors, acknowledgements, and other overheads. [2 marks] (a) 325.5 Kbps (b) 354.5 Kbps (c) 409.6 Kbps (d) 512.0 Kbps

asked in Computer Science And Engineering, 2004

View Comments [0 Reply]

524.

The routing table of a router is shown below:

Destination Subnet Mask Interface

128.75.43.0 255.255.255.0 Eth0

128.75.43.0 255.255.255.128 Eth1

192.12.17.5 255.255.255.255 Eth3

Default Eth2

On which interface will the router forward packets addressed to destinations 128.75.43.16 and 192.12.17.10 respectively? [2 marks]
(a) Eth1 and Eth2
(b) Eth0 and Eth2
(c) Eth0 and Eth3
(d) Eth1 and Eth3

asked in Computer Science And Engineering, 2004

View Comments [0 Reply]
525.

A and B are the only two stations on an Ethernet. Each has a steady queue of frames to send. Both A and B attempt to transmit a frame, collide, and A wins the first backoff race. At the end of this successful transmission by A, both A and B attempt to transmit and collide. The probability that A wins the second backoff race is [2 marks]
(a) 0.5
(b) 0.625
(c) 0.75
(d) 1.0

asked in Computer Science And Engineering, 2004

View Comments [0 Reply]
526.

The employee information in a company is stored in the relation
Employee (name, sex, salary, deptName)
Consider the following SQL query
Select deptName
From Employee
Where sex = ‘M’
Group by deptName
Having avg(salary) >
(select avg (salary) from Employee)
It returns the names of the department in which [2 marks]
(a) the average salary is more than the average salary in the company
(b) the average salary of male employees is more than the average salary of all male employees in the company
(c) the average salary of male employees is more than the average salary of employees in the same department.
(d) the average salary of male employees is more than the average salary in the company

asked in Computer Science And Engineering, 2004

View Comments [0 Reply]
527.

The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node? [2 marks]
(a) 24
(b) 25
(c) 26
(d) 27

asked in Computer Science And Engineering, 2004

View Comments [0 Reply]
528.

The relation scheme Student Performance (name, courseNo, rollNo, grade) has the following functional dependencies:
name, courseNo, -> grade
rollNo, courseNo -> grade
name -> rollNo
rollNo -> name
The highest normal form of this relation scheme is [2 marks]
(a) 2 NF
(b) 3 NF
(c) BCNF
(d) 4 NF

asked in Computer Science And Engineering, 2004

View Comments [0 Reply]

801 1 ...‹‹86 8788 89 90 ›› ... 134

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now