Computer Networks Questions & Answers – Packet Forwarding and Routing
1. Term is used to place packet in
its route to its destination is called
a) Delayed
b) Urgent
c) Forwarding
d) Delivering
a) Delayed
b) Urgent
c) Forwarding
d) Delivering
Answer: c
Explanation: It is for transforming the message from source to destination with forward technique.
Explanation: It is for transforming the message from source to destination with forward technique.
2. A second technique to reduce
routing table and simplify searching process is called
a) Network-Specific Method
b) Network-Specific Motion
c) Network-Specific Maintaining
d) Network-Specific Membership
a) Network-Specific Method
b) Network-Specific Motion
c) Network-Specific Maintaining
d) Network-Specific Membership
Answer: a
Explanation: It is the before method of the packet switching.
Explanation: It is the before method of the packet switching.
3. Next-Hop Method is used to reduce
contents of a
a) Revolving table
b) Rotating Table
c) Routing Table
d) Re-allocate table
a) Revolving table
b) Rotating Table
c) Routing Table
d) Re-allocate table
Answer: c
Explanation: This method is for creating the shortest distances.
Explanation: This method is for creating the shortest distances.
4. Several techniques can make size
of routing table manageable and also handle issues such as
a) Maturity
b) Error reporting
c) Tunneling
d) Security
a) Maturity
b) Error reporting
c) Tunneling
d) Security
Answer: d
Explanation: To visible only accessing sub networks.
Explanation: To visible only accessing sub networks.
5. Host-specific routing is used for
purposes such as checking route or providing
a) Network Measures
b) Security Measures
c) Routing Measures
d) Delivery Measures
a) Network Measures
b) Security Measures
c) Routing Measures
d) Delivery Measures
Answer: b
Explanation: Security measures.
Explanation: Security measures.
6. In Unicast routing, if
instability is between three nodes, stability cannot be
a) Stable
b) Reversed
c) Guaranteed
d) Forward
a) Stable
b) Reversed
c) Guaranteed
d) Forward
Answer: c
Explanation: It is only for unidirectional.
Explanation: It is only for unidirectional.
7. In Unicast Routing, Dijkstra
algorithm creates a shortest path tree from a
a) Graph
b) Tree
c) Network
d) Link
a) Graph
b) Tree
c) Network
d) Link
Answer: a
Explanation: Graph technique is used for best node finding technic with shortest path algorithms.
Explanation: Graph technique is used for best node finding technic with shortest path algorithms.
8. In Multicast Routing Protocol,
flooding is used to broadcast packets but it creates
a) Gaps
b) Loops
c) Holes
d) Links
a) Gaps
b) Loops
c) Holes
d) Links
Answer: b
Explanation: Loops is for multicast routing.
Explanation: Loops is for multicast routing.
9. RPF stands for
a) Reverse Path Forwarding
b) Reverse Path Failure
c) Reverse Packet Forwarding
d) Reverse Protocol Failure
a) Reverse Path Forwarding
b) Reverse Path Failure
c) Reverse Packet Forwarding
d) Reverse Protocol Failure
Answer: a
Explanation: Reverse Path Forwarding.
Explanation: Reverse Path Forwarding.
10. LSP stands for
a) Link Stable Packet
b) Link State Packet
c) Link State Protocol
d) Link State Path
a) Link Stable Packet
b) Link State Packet
c) Link State Protocol
d) Link State Path
ليست هناك تعليقات:
إرسال تعليق