UNIT 4&5 MCQ

____ is the process of introducing external routers into an OSPF network. *

Route recreation
Route summarization
Route reintroducing
Route redistribution

On point-to-point networks, updates use the IP multicast address

__________. *
224.0.1.5
224.0.114.5
224.225.0.5
224.0.0.5

Pick the correct answer for Dynamic Source Routing (DSR): 1. DSR protocol
is composed of the two main mechanisms of "Route Discovery" and "Route
Maintenance". 2. intermediate nodes do not need to maintain up to date
routing information in order to route the packets they forward. 3. Power-
Aware Routing Metrics 4. Fisheye state routing. *
3 and 4
1 and 3
4 and 3
1 and 2

Which routing protocol has the smallest default administrative distance? *

(if external or internal eigrp is not mentioned then choose OSPF)
EIGRP
RIP
OSPF
IBGP

Which of the following is not the category of dynamic routing algorithm? *

Distance vector protocols
Link state protocols
Hybrid protocols
Automatic state protocols

An efficient link state packet forwarding mechanism is called __________? *

point-to-point relaying
multifocus relaying
singlepoint relaying
multipoint relaying
 The one thing in common between IGRP and EIGRP is the _____________ *
nslookups
composite metric
ns2lookup
nslookingup

Which statements are true about AODV protocol: 1. Route discovery cycle
used for route finding 2. Maintenance of active routes 3. Sequence numbers
used for loop prevention and as route freshness criteria 4. Provides unicast
and multicast communication on the interface *
2,3,4
1,3,4
1,2,3,4
1, 2, 3

When node S wants to send a packet to node D, but does not know a route
to D, node S initiates a _______ *
way discovery
route detection
course finding
route discovery

RIPv2 has been extended for use with IPv6 addressing known as _________ *
RIPng
RIPngl2
RIPngl
RIPngg

_______ is used to flood the network with routing information. *

link state booting
link state routing
link state data
link state advertisements

_____ allow the exchange of summary information between autonomous

systems. *
Interior Gateway Protocol(IGP)
Dynamic Gateway Protocol(DGP)
Exterior Gateway Protocol(EGP)
Border Gateway Protocol(BGP)
__________ is an on-demand protocol designed to restrict the bandwidth
consumed by control packets in ad hoc wireless *
link state booting (LSB)
link state data (LSD)
link state routing (LSR)
Dynamic source routing protocol (DSR)

IGRP runs directly over IP with protocol type field set to ________ *
12
10
9
8

________ identifies the EIGRP domain *

Autonomous system number
broadband unit
saturation unit
Data unit

Extra time window is referred to as _______ *

plotting table
garbage collection
hash table
routing table

If a link or an interface card is likely to fail, RIPv1 faces serious transient

issues including possibly creating_________. *
red hole routes
white hole routes
Brown hole routes
black hole routes

CGSR routing involves cluster routing, whereby a node is required to find

the best route over cluster heads from the________. *
Individual-member table
Cluster-member table
Team-member table
Group-member table
ECMP stands for __________ *
equal-cost multipath
equalent-cost multipath
equivalent-cost multipath
equal-cost multicast
___ allows EIGRP to attain faster convergence. *
FGP
BGP
DUAL
FTP

UNIT 2&3 MCQ

1.The two fundamental tasks of a router is ----------------- and ---------------------

a.routing and packet forwarding
b.error detection and correction
c.fragmentation and packetizing
d.route control and congestion control
Ans: a

2. The scheduling algorithm is managed by the ------------

a. traffic manager
b. queue manager
c. buffer manager
d.target manager
Ans : a

3.Routing table is maintained by the --------------------

a.packet forwarding process
b.route control process.
c.Data control process
d.Link control process
Ans : b

4.The forwarding information stored b the forwarding table is known as ------

---------
a.address look up
b.next hop information
c.IP address space
d.Router information
Ans : b

5.The alternate name off longest matching prefix is ------------

a.best matching prefix
b.disjoint prefix
c.binary trie
d.multibit trie
Ans:a
6.All the nodes at the same level have the same stride size is called --------------
-
a. fixed stride multibit trie
b. variable stride multibit trie
c. samelevel multibit trie
d. prefix expansion
Ans : a

7.---------------- is used by service providers for interconnecting a few thousand

small networks
a. core router
b. edge router
c. enterprise router
d. access router
Ans:a

8. ------------is responsible to decide and choose the network interface to

forward the incoming packets
a. forwarding engines
b.queue manager
c. traffic manager
d.backplane
Ans : a

9.----------------- serves as a backplane for transferring packets from the ingress

line card to egress line card.
a. Route processor cards
b. Switch fabric cards
c. Port cards
d. Line cards
Ans : b

10.Header processing and forwarding can be classifies as -----------------

a.discreter taks
b. continuous tasks
c. time critical tasks
d.non time critical tasks
Ans : c

11. The --------------table at a node provides a lookup entry for each

destination by identifying an outgoing link
A. Forwarding Table
B. Routing Table
C. Static Table
D. Route Pinning Table
Ans: B

12. The complexity of Dijkstra's algorithm to find the shortest paths to all
destinations
A. O(N2)
B. O(N)
C. O(N3)
D. O(LN)
Ans: A

13. In a routing table, if a last node points back to the original node is
A. Convergence
B. Routing loops
C. Loop nodes
D. Router loops
Ans: B

14.Bellman ford algorithm computes the shortest path to

A. All destinations at different time
B. All destinations at a time
C. One destination at a time
D. More than one destination at a time
Ans: C

15. The Algorithm used for determining paths beyond the shortest paths are
A. Bellman ford Algorithm
B. Dijkstra's algorithm
C. K-Shortest Paths Algorithm
D. Widest Paths Algorithm
Ans: C

16. The list of possible paths in a networking environment is determined

ahead of time is
A. Candidate Path List
B. Path Caching
C. Path Vector
D. Path Compression
Ans: A

17. The minimum time interval between the two consecutive updates are
known as
A. Jitter
B. Holddown timer
C. Periodic update timer
D. Update timer
Ans: B

18. The overall distance of a path is computed by adding a cost of a link to

the cost of the next link along a path until all links for the path are
considered is known as
A. Non additive property
B. Additive property
C. Commutative property
D. Convergence property
Ans: B
19. The Computational Complexity of Bellman ford algorithm is
A. O(N2)
B. O(L+N)
C. O(N3)
D. O(LN)
Ans: D

20. If a node stores the pointer to point only to the next node for its
destinations is called
A. Route Pinning
B. Path caching
C. Neighbor Node
D. Convergence
Ans: A

UNIT 1 MCQ
A one to all communication between one source and all hosts on a network is
classified as a _____
Unicast
Multicast
Broadcast
Point to point
ANS : C

Cross points in the internet are termed as ______

Links
Switches
Routers
Port
Ans : C

The forwarding information stored by the forwarding table is known as ______

Address lookup
Next-hop information
IP address space
Router Information
Ans : B

______Address supports Multicasting

Class C
Class D
Class E
Class F
Ans :B

_______ is not an application layer protocol

ICMP
BGP
POP3
SNMP
Ans:A,B

______protocol suite is the conceptual framework of the Internet

TCP/IP
IP
ISO/OSI
UDP
Ans : A

The global Addressing Scheme used by PSTN is ______

E.162
E.164
E.180
E.260
Ans : B
______is concerned with various ways to improve the operational performance
of a network and identifies procedures (or) controls to obtain good network
performance.
Traffic Engineering
Traffic Shaping
Scheduling
Prioritization
Ans : A

Traffic manager uses the mechanism for controlling the traffic is called ______
Routing
Traffic Shaping
Traffic Engineering
Forwarding
Ans : B

The Length of the IPV6 address is _____

32 bits
64 bits
128 bits
256 bits
Ans :C

______ is used to capture packets from live networks

Routing Protocol
Network Protocol Analyzer
Forwarding Table
Data Planes
Ans : B

Scheduling Algorithm is managed by _____

Queue manager
Traffic Manager
Buffer Memory
Forwarding Engine
Ans : A

The table maintained by the Route control processor is ______

Forwarding Table
Routing Table
Lookup Table
Forwarding Information Base
Ans : B

The key for the forwarding Table is ________

Destination Address
Source Address
Next hop address
IP Address
Ans : A

The connection oriented reliable service is supported by ______

TCP
UDP
IP
BGP
Ans : A

The finite amount of temporary space maintained by the router is known as

_____
Cache
Packet
Buffer
Memory
Ans : C

The unreliable transport layer protocol is _____

User Datagram protocol
Simple Mail Transfer Protocol
Transmission control protocol
Post office protocol
Ans : A

Net-id in the IP address is also termed as _____

IP Prefix
Subnet id
Subnet mask
IP address
Ans : A

The internet is the example of ____

All switched network
Circuit switched network
Packet switched network
Message switched network
Ans : A

In _____ routing the mask and the destination address are mentioned as 0.0.0.0
in the routing table
Next hop
Network specific
Host specific
Default
And : D

Find the total number of subnets and the total numbers of hosts per subnet
are available in the following Class C IP address 192.168.10.44/29 (Assume all
subnets and all hosts are used)
8 subnets, 32 hosts
29 subnets, 44 hosts
16 subnets, 32 hosts
32 subnets, 16 hosts
Ans: A& D

Identify the WRONG statement

Router works in Transport Layer
Router is used in LAN and MAN
Router Compatible with NAT
Router follows duplex mode of transmission
Ans:A

Match the following

1. Private IP A. 191.10.0.3
Address
2. Loop back B.
address 193.255.255.255
3. Class B Address C. 192.168.10.3
4. Reserved IP D. 127.0.0.1
Address
5. Network Address E. 193.0.0.0
1-A, 2-D, 3-B, 4-E, 5-C
1-C, 2-D, 3-A, 4-E, 5-B
1-E, 2-B, 3-A, 4-D, 5-C
1-D, 2-C, 3-E, 4-A, 5-B
1-C, 2-D, 3-A, 4-B, 5-E
Ans: D

The Default size of an IP header is

16 bytes
20 bytes
24 bytes
50 bytes
Ans : B
Which table is used to store the best route identified by the “route processing
function” of a router.
Routing table
Forwarding table
Packet processing table
Buffering table
Ans: B