Network Layer Delivery, Forwarding, Routing MCQs

In this section of Data Communication and Networking – Network Layer Delivery, Forwarding, Routing MCQ (Multiple Choice) Based Questions and Answers,it cover the below lists of topics, All the Multiple Choice Questions and Answers (MCQs) have been compiled from the book of Data Communication and Networking by The well known author behrouz forouzan.

This Section covers below lists of topics.

Transport-layer protocols,UDP and TCP MCQs.
Transmission Control Protocol (TCP) MCQs.

PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE

1. In _______ delivery, both the deliverer of the IP packet and the destination are on the same network.

a connectionless
a direct
an indirect
none of the above

2. In _______ delivery, the deliverer of the IP packet and the destination are on different networks

a connection-oriented
a direct
an indirect
none of the above

3. In _______ forwarding, the full IP address of a destination is given in the routing table.

next-hop
network-specific
host-specific
default

4. In _______ forwarding, the mask and destination addresses are both 0.0.0.0 in the routing table

next-hop
network-specific
host-specific
default

5. In _______ forwarding, the destination address is a network address in the routing table

next-hop
network-specific
host-specific
default

6. In _______ forwarding, the routing table holds the address of just the next hop instead of complete route information.

next-hop
network-specific
host-specific
default

7. The idea of address aggregation was designed to alleviate the increase in routing table entries when using ________

classful addressing
classless addressing
both a and b
none of the above

8. The principle of ________ states that the routing table is sorted from the longest mask to the shortest mask

first mask matching
shortest mask matching
longest mask matching
none of the above

9. The use of hierarchy in routing tables can ________ the size of the routing tables

reduce
increase
both a and b
none of the above

10. _______ deals with the issues of creating and maintaining routing tables.

Forwarding
Routing
Directing
None of the above

11. A _______ routing table contains information entered manually.

static
dynamic
hierarchical
none of the above

12. A _______ routing table is updated periodically using one of the dynamic routing protocols

static
dynamic
hierarchical
none of the above

13. The input and output ports of a router perform the ________ layer functions of the router.

physical and data link
network
transport
none of the above

14. The routing processor of a router performs the ________ layer functions of the router

physical and data link
network
transport
none of the above

15. The task of moving the packet from the input queue to the output queue in a router is done by _________

input and output ports
routing processor
switching fabrics
none of the above

16. A static table is one _______

with manual entries
which is updated automatically
either a or b
none of the above

17. A dynamic table is one _______

with manual entries
which is updated automatically
either a or b
none of the above

18. For purposes of routing, the Internet is divided into ___________

wide area networks
autonomous networks
autonomous systems
none of the above

19. ____________ is a group of networks and routers under the authority of a single administration.

An autonomous system
An area
a and b
none of the above

20. Routing inside an autonomous system is referred to as _______________

interdomain routing
intradomain routing
both a and b
none of the above

21. Routing between autonomous systems is referred to as ____________

interdomain routing
intradomain routing
both a and b
none of the above

22. In _______ routing, the least cost route between any two nodes is the route with the minimum distance.

path vector
distance vector
link state
none of the above

23. In ________, each node maintains a vector (table) of minimum distances to every node.

path vector
distance vector
link state
none of the above

24. In distance vector routing, each node periodically shares its routing table with _________ and whenever there is a change.

every other node
its immediate neighbors
one neighbor
none of the above

25. The Routing Information Protocol (RIP) is an intradomain routing based on _________ routing

distance vector
link state
path vector
none of the above

26. The metric used by _______ is the hop count

OSPF
RIP
BGP
none of the above

27. The _________ routing uses the Dijkstra algorithm to build a routing table.

distance vector
link state
path vector
none of the above

28. The Open Shortest Path First (OSPF) protocol is an intradomain routing protocol based on _______ routing

distance vector
link state
path vector
none of the above

29. The _______ protocol allows the administrator to assign a cost, called the metric, to each route

OSPF
RIP
BGP
none of the above

30. In OSPF, a ________ link connects two routers without any other host or router in between

point-to-point
transient
stub
none of the above

31. In OSPF, a _______ link is a network with several routers attached to it.

point-to-point
transient
stub
none of the above

32. In OSPF, a ________ link is a network is connected to only one router.

point-to-point
transient
stub
none of the above

33. In OSPF, when the link between two routers is broken, the administration may create a _________ link between them using a longer path that probably goes through several routers

point-to-point
transient
stub
none of the above

34. In ________ routing, we assume that there is one node (or more) in each autonomous system that acts on behalf of the entire autonomous system

distant vector
path vector
link state
none of the above

35. ______ is an interdomain routing protocol using path vector routing

BGP
RIP
OSPF
none of the above

36. To create a neighborhood relationship, a router running BGP sends an ________ message

open
update
keepalive
none of the above

37. An area is _______

part of an AS
composed of at least two ASs
another term for an AS
none of the above

38. A one-to-all communication between one source and all hosts on a network is classified as a _______ communication.

unicast
multicast
broadcast
none of the above

39. A one-to-many communication between one source and a specific group of hosts is classified as a _______ communication.

unicast
multicast
broadcast
none of the above

40. A one-to-one communication between one source and one destination is classified as a _______ communication.

unicast
multicast
broadcast
none of the above

41. In ______, the router forwards the received packet through only one of its interfaces.

unicasting
multicasting
broadcasting
none of the above

42. In _______, the router may forward the received packet through several of its interfaces

unicasting
multicasting
broadcasting
none of the above

43. Emulation of through ___ is not efficient and may create long delays.

unicasting; multiple unicasting
multicasting; multiple unicasting
broadcasting; multicasting
none of the above

44. In unicast routing, each router in the domain has a table that defines a ______ path tree to possible destinations

average
longest
shortest
none of the above

45. In multicast routing, each involved router needs to construct a ________ path tree for each group.

average
longest
shortest
none of the above

46. In the _______ tree approach, each router needs to have one shortest path tree for each group.

group-shared
source-based
a or b
none of the above

47. In the group-shared tree approach, _________ involved in multicasting

only the core router is
all routers are
only some routers are
none of the above

48. Multicast link state routing uses the _______ tree approach

source-based
group-shared
a or b
none of the above

49. The Multicast Open Shortest Path First (MOSPF) protocol is an extension of the OSPF protocol that uses multicast routing to create source-based trees. The protocol is based on _______ routing

distance vector
link state
path vector
none of the above

50. MOSPF is a _______ protocol

data-driven
command-driven
both a and b
none of the above

51. _________ broadcasts packets, but creates loops in the systems.

Forwarding
Flooding
Backwarding
none of the above

52. In RPF, a router forwards only the copy that has traveled the _______ path from the source to the router.

shortest
longest
average
none of the above

53. RPF eliminates the ________ in the flooding process

forwarding
backwarding
flooding
none of the above

54. RPF guarantees that each network receives only ____ of the multicast packet.

one copy
two copies
a or b
none of the above

55. RPB creates a shortest path _______ tree from the source to each destination

unicast
multicast
broadcast
none of the above

56. RPB guarantees that each destination receives _________ of the packet

one copy
no copies
multiple copies
none of the above

57. In ________, the multicast packet must reach only those networks that have active members for that particular group.

RPF
RPB
RPM
none of the above

58. adds pruning and grafting to _ to create a multicast shortest path tree that supports dynamic membership changes

RPM; RPB
RPB; RPM
RPF: RPM
none of the above

59. _________ is an implementation of multicast distance vector routing. It is a source-based routing protocol, based on RIP.

MOSPF
DVMRP
CBT
none of the above

60. DVMRP is a ________routing protocol, based on RIP

source-based
group-shared
both a and b
none of the above

61. Pruning and grafting are strategies used in _______

RPF
RPB
RPM
none of the above

62. A _______ message tells an upstream router to stop sending multicast messages for a specific group through a specific router.

weed
graft
prune
none of the above

63. A _______ message tells an upstream router to start sending multicast messages for a specific group through a specific router.

weed
graft
prune
none of the above

64. CBT is a ________ protocol that uses a core as the root of the tree

source-based
group-shared
a or b
none of the above

65. PIM-DM is used in a _______ multicast environment, such as a LAN.

dense
sparse
a or b
none of the above

66. PIM-SM is used in a _______multicast environment such as a WAN.

dense
sparse
a or b
none of the above

67. In _______, a logical tunnel is established by encapsulating the multicast packet inside a unicast packet.

UNIBONE
MULTBONE
MBONE
none of the above

Data Communication and Networking – Network Layer: Delivery, Forwarding and Routing MCQs