1) The ......... provides two well-defined classes of services, namely connectionless and connection oriented services to the numerous nodes or hosts communicating through subnet.
A. physical layer
B. data link layer
C. network layer
D. transport layer
2) In computer networking the term .......... refers to selecting paths in a computer network along which to send data.
A. routing
B. inter-networking
C. internal organization
D. congestion control
3) ............ Routing algorithms do not base their routing decisions on measurements or estimates of the current traffic and topology.
A. Static or Non-adaptive
B. Static or adaptive
C. Dynamic or Non-adaptive
D. Dynamic or adaptive
4) ............. Routing algorithm in contrast change their routing decisions to reflect changes in topology and usually the traffic as well.
A. Static or Non-adaptive
B. Static or adaptive
C. Dynamic or Non-adaptive
D. Dynamic or adaptive
5) ........... is also a static algorithm in which every incoming packet is sent out on every outgoing line except the one it arrives on.
A. Shortest Path Algorithm
B. Flooding
C. Distance Vector Routing
D. Hierarchical Routing
6) .......... is basically a vector that keeps track of best known distance to each destination and which line to use to get there.
A. Shortest Path Algorithm
B. Flooding
C. Distance Vector Routing
D. Hierarchical Routing
7) In addresses for .......... networks, the first 16 bits specify a particular network, and the last 16 bits specify a particular host.
A. class A
B. class C
C. class B
D. class D
8) In .......... , the routers are divided into regions. Each router knows all details about how to route packets to destinations within its own region.
A. Shortest Path Algorithm
B. Link state Routing
C. Distance Vector Routing
D. Hierarchical Routing
9) In .......... , each node uses as its fundamental data a map of the network in the form of a graph.
A. Shortest Path Algorithm
B. Link state Routing
C. Distance Vector Routing
D. Hierarchical Routing
10) ......... protocols are simple and efficient in small networks, and require little, if any management.
A. Shortest Path Algorithm
B. Link state Routing
C. Distance Vector Routing
D. Hierarchical Routing
11) In ........... routing algorithm, each router knows all details about how to route packets to destinations within its own region. But does not have any idea about internal structure of other regions.
A. Shortest Path Algorithm
B. Link state Routing
C. Distance Vector Routing
D. Hierarchical Routing
12) The set of optimal routers from source to a given destination from a tree rooted at the destination called a ........ tree.
A. sink
B. optimal
C. rooted
D. routing
13) .......... is a simple mathematical computation used to check for bit-level errors in the IPV4 header.
A. Identification
B. Protocol
C. Checksum
D. Time-to-Live(TTL)
14) The number of network segments on which the datagram is allowed to travel before a router should discard it is called .......
A. Identification
B. Protocol
C. Checksum
D. Time-to-Live(TTL)
15) .......... is an identifier of the upper-layer protocol to which the IPV4 payload must be passed.
A. Identification
B. Protocol
C. Checksum
D. Time-to-Live(TTL)
16) The IPV4 address of the intermediate or final destination of the IPV4 packet is called .......
A. Source IP Address
B. Destination IP Address
C. Identification
D. Checksum
17) .......... type of IPV4 address is assigned to all network interfaces located on a subnet, used for one-to-everyone on a subnet communication.
A. Unicast
B. Multicast
C. Broadcast
D. Anycast
18) The ......... header field of IPV6 indicates the number of likes on which the packet is allowed to travel before being discarded by a router.
A. Source Address
B. Destination Address
C. Next Header
D. Hop Limit
19) ......... is an identifier for either the IPV6 extension header immediately following the IPV6 header or an upper layer protocol, such as ICMPv6, TCP or UDP.
A. Source Address
B. Destination Address
C. Next Header
D. Hop Limit
20) The internet addresses are ......... bits in length in IPV4 addressing scheme.
A. 16
B. 64
C. 32
D. 48
Answers:
1) C. network layer
2) A. routing
3) A. Static or Non-adaptive
4) D. Dynamic or adaptive
5) B. Flooding
6) C. Distance Vector Routing
7) C. class B
8) D. Hierarchical Routing
9) B. Link state Routing
10) C. Distance Vector Routing
11) D. Hierarchical Routing
12) A. sink
13) C. Checksum
14) D. Time-to-Live(TTL)
15) B. Protocol
16) B. Destination IP Address
17) C. Broadcast
18) D. Hop Limit
19) C. Next Header
20) C. 32
Related Posts:
Solved MCQ of Computer networking set-1
MCQ of Computer Networking with answer set-2
Solved MCQ of Computer networking set-3
Solved MCQ on Routing protocol in computer networks set-1
Solved MCQ on Routing algorithm in computer networks set-2
Objective Questions on Routing protocol in computer networks set-3
Solved MCQ on TCP/IP and UDP in Computer Networks set-1
Interview Questions on TCP/IP and UDP in Computer Networks set-2
Solved MCQ on Physical Layer in OSI Reference Model set-1
Solved MCQ on Network Layer in Computer Networks set-1