MCQ's
|
Questions
|
Answer
|
|
1Q)
In link state routing, after the construction of link state
packets new routes are computed using .....................
(A)
Bellman Ford algorithm (B) DES algorithm
(C) Dijkstra's
algorithm (D) Leaky bucket algorithm |
C
|
|
2Q)
Count-to-Infinity problem occurs in .....................
(A)
distance vector routing (B) short path
first
(C) link state
routing (D) hierarchical routing |
A
|
|
3Q)
In distance vector routing the delay metric is ...................
(A)
number of hops (B)
geographical distance
(C) number of
neighbours (D) queue length |
D
|
|
4Q)
In which routing method do all the routers have a common database?
(A)
Distance Vector (B) Link
Vector
(C) Shortest
path D) Link State
|
D
|
|
5Q)
SSL divides data into blocks of
(A)
2*6 (B) 2*14 (C) 2*20
(D) 2*24
|
B
|
|
6Q)
We also don't want our undeliverable packets to hop around
forever. What feature/flag limits the life of an IP packet on the
network?
(A)
Time to Live counter (B)Subnet Mask
(C)
Header Checksum (D) Wackamole
Field |
A
|
|
7Q).
Pretty good privacy (PGP) is used in (A) Browser security (B) Email security (C) FTP security (D) None |
B
|
|
8Q)
IPSec is designed to provide the security at the (A) Transport layer (B) Network layer (C) Application layer (D) Session layer |
B
|
