Visvesvaraya Technological University (VTU) 2009 M.Tech Computer Science Part-time - Question Paper

a. User described packet
b. Universal data protocol
c. User datagram protocol
d. None of the above

33.DNS stands for
a. dynamic name server
b. dynamic name system
c. domain name server
d. domain name software
e.
34. TCP is ------------ protocol
Connectionless
Connection oriented
Not both
Its not a protocol
35. UDP port field is
a. 6bytes long
b. 16bytes long
c. 16bits long
d. 53 bytes long

36. Flow control involves_________
Keeping a fast sender from overrunning a slow receiver
Keeping a slow sender from overrunning a slow receiver
Keeping a fast sender from overrunning a fast receiver
Keeping a slow sender from overrunning a fast receiver
37. Which of the subsequent is a resource allocation mechanism
Router centric versus host centric
Window based versus rate based
Reservation based versus feedback based
All the above
38. Power of a network is provided by the ratio__________
Power=Throughput/Delay
Power=Delay/Throughput
Power=Throughput/voltage
Power= Voltage /Throughput
39. The queuing algorithm can be thought of as allocating____________
Bandwidth
Buffer space
Both a and b
None of the Above
40. WFQ means_____________
Weighted fair queuing
Weighted fare queuing
Window fair queuing
Window fare queuing
41. Routers that implement multiple FIFO queues transmits___________.
Packets out of the lowest-priority queue if that queue is nonempty before moving on the next priority queue
Packets out of the highest-priority queue if that queue is empty before moving on the next priority queue.
Packets out of the highest-priority queue if that queue is nonempty after moving on the next priority queue.
Packets out of the highest-priority queue if that queue is nonempty before moving on the next priority queue
42. Raj Jain's fairness index to flows is provided by____________
f(x1,x2,….,xn)=(?n i=1 xi)3/n?n i=1 xi2
f(x1,x2,….,xn)=(?n i=1 xi)2/n?n i=1 xi2
f(x1,x2,….,xn)=(?n i=1 xi)/n?n i=1 xi
f(x1,x2,….,xn)=(?n i=2 xi)2/n?n i=1 xi2
43. For every flow we can compute Fi for every packet that arrives using __________
Fi=max(Fi-1, Ai)+Pi
Fi=max(Fi-2, Ai)+Pi
Fi=min(Fi-1, Ai)+Pi
Fi=min(Fi-2, Ai)+Pi
44. -------- Operation , when applied to a particular variable ID returns the value of that
Variable plus the ID of the next variable.

Earning:   Approval pending.