Question # 1

________ computes shortest paths in a graph by using weights on edges as a measure of distance.

Choose an answer

Greedy algorithm

Distance vector algorithm

Non of the given

Dijksta’s algorithm

Router that decrements TTL to __ sends ICMP time exceeded message, with router’s address as source address

Choose an answer

3

21

1

0

A Bridge forwards or filters a frame by comparing the information in its address table to the frame’s_________

Choose an answer

Layer 2 source address

Source node’s physical address

Layer 2 Destination Adress

Layer 3 destination address

________ identifies the application program that sent the data.

Choose an answer

Destination Port

Source port

Logical address

None of the given

A system with redundant bridges might have a problem with_______ in the system.

Choose an answer

Loop

Filters

Spanning Trees

All given choices

Which of the following protocols allows the sender and receiver to enforce polices.

Choose an answer

RIP

OSPF

BGP

RIP and OSPF

Which of the following is a connecting device?

Choose an answer

Bridge

Repeater

Hub

All of the above

The process of using a routing table to select a next hop for a given datagram is called_________

Choose an answer

Encapsulation

Reassembling

Routing or forwarding

The product of delay and throughput measures the _____ of data that can be present on the network

Choose an answer

Area

Volume

Length

All given choices

The term----- ------- refers to the general concept of a small block of data

Choose an answer

Packtet

Frame

Data

None of the given

Most LANs that employ ring topology use an access mechanism known as-------

Choose an answer

CSMA/CD

CSMA/CA

TOKEN PASSING

None of the given

More Classes

Other Links

CS-610 Final Term Exams Preparation Virtual University MCQs With Answers

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer

Choose an answer