Register

UGC NET CSE | December 2007 | Part 2 | Question: 30

• retagged by
1,240 views

1 Answer

0 votes
0 votes
Option A

Distance vector routing, Path vector routing and link state routing are adaptive routing algorithm.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
go_editor asked Mar 28, 2020
567 views
UGC NET CSE | December 2007 | Part 2 | Question: 4
Let e : B^m → B^n is a group code. The minimum distance of ‘e’ is equal to : the maximum weight of a non zero code word the minimum weight of a non zero code word m n
Let e : B^m → B^n is a group code. The minimum distance of ‘e’ is equal to :the maximum weight of a non zero code wordthe minimum weight of a non zero code wordmn
User Avatar
0 votes
0 votes
3 answers
2
go_editor asked Mar 28, 2020
1,199 views
UGC NET CSE | December 2007 | Part 2 | Question: 26
The best known example of a MAN is : Ethernet Cable Television FDDI IEEE $802.3$
The best known example of a MAN is :EthernetCable TelevisionFDDIIEEE $802.3$
User Avatar
0 votes
0 votes
1 answer
3
go_editor asked Mar 28, 2020
614 views
UGC NET CSE | December 2007 | Part 2 | Question: 27
In a broadcast network, a layer that is often thin or non-existent is : network layer transport layer presentation layer application layer
In a broadcast network, a layer that is often thin or non-existent is :network layertransport layerpresentation layerapplication layer
User Avatar
0 votes
0 votes
1 answer
4
go_editor asked Mar 28, 2020
2,074 views
UGC NET CSE | December 2007 | Part 2 | Question: 28
The maximum data rate of binary signals on a noiseless $3\:KHz$ channel is : $3000$ bps. $6000$ bps. $9000$ bps. $12,000$ bps.
The maximum data rate of binary signals on a noiseless $3\:KHz$ channel is :$3000$ bps.$6000$ bps.$9000$ bps.$12,000$ bps.
User Avatar
Link Copied!