Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

ldce data network > Network Elements, Routing > Flashcards

Network Elements, Routing Flashcards

1
Q

The factors that determine the nature of a LAN are
1) Topology
2) Transmission medium
3) Medium access control technique

A

All of them

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

LAN relates to ______ w.r.t ISO model
1) higher layer protocols
2) lower layer protocols

A

2) lower layer protocols
(higher layer protocols are independent of network architecture)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

The functions associated with providing service to the LAN users comprise
1) LLC
2) MAC
3) both
4) none

A

both
MAC: Medium Access Control
LLC: Logical Link Control

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

A special type of tree topology
1) star
2) bus
3) ring

A

bus
tree can be considered as multiple interconnected bus networks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

To implement ring network topology, one uses
1) FDDI
2) SONET
3) Token Ring

A

All of them
FDDI: Fiber Distributed Data Interface
SONET: Synchronous Optical Network

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

In _________ topolgy, medium access control is needed to determine when each station may insert frames
1) star
2) bus
3) ring
4) tree

A

ring

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

The two alternatives for the operation of the central node in star topology
1) to operate in broadcast fashion
2) ________

A

to act as a frame switching device

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

The two alternatives for the operation of the central node in star topology
1) ________
2) to act as a frame switching device

A

to operate in broadcast fashion

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

MAC (Medium Access Control) can be implemented in
1) centralized fashion
2) distributed fashion

A

both

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Round robin is
1) centralized fashion
2) distributed fashion

A

may be centralized or distributed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Polling is an example of
1) centralized fashion
2) distributed fashion

A

centralized fashion

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Reservation is
1) centralized fashion
2) distributed fashion

A

may be centralized or distributed

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

For bursty traffic, an appropriate MAC technique is
1) round robin
2) reservation
3) contention

A

contention

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

The MAC frame includes
1) LLC PDU
2) CRC

A

both
LLC: Logical Link Control
CRC : The cyclic redundancy check field ( also known as the frame check
sequence, FCS, field)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

MAC and LLC stand for

A

MAC: Medium Access Control
LLC: Logical Link Control

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

The ________ layer is responsible for detecting errors and discarding any frames that are in error
1) MAC
2) LLC

A

MAC layer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

The ____ layer optionally keeps track of which frames have been successfully
received and retransmits unsuccessful frames
1) MAC
2) LLC

A

LLC layer

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Ethernet access method
1) CDMA
2) CSMA
3) CSMA/CD

A

3) CSMA/CD
Carrier Sense Multiple Access/Collision Detect
IEEE 802.3 Medium Access Control

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

_______ include a repeater function
1) Passive hubs
2) active hubs

A

active hubs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Advantages of the newer 10 BaseT hubs are
1) Each port has exclusive access to its bandwidth (no CSMA/ CD)
2) Hubs may be cascaded to add additional ports
3) include an SNMP (Simple Network Management Protocol) agent
4) used to connect workgroup hubs to form a larger network

A

1,2,3
4 is for switch

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

SNMP stands for

A

Simple Network Management Protocol

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

They establish logical connections between ports based on MAC
addresses
1) layer-2 switches
2) layer-3 switches

A

layer-2 switches
?? (layer-2 switches: network address)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

Use ______ switches for segmenting existing network into smaller collision domains to improve performance
1) layer-2 switches
2) layer-3 switches

A

layer-2 switches

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

____ are based on routing
technologies
1) layer-2 switches
2) layer-3 switches

A

layer-3 switches
(layer-2 switches are based on bridging technologies)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

____ are based on bridging
technologies
1) layer-2 switches
2) layer-3 switches

A

layer-2 switches
(layer-3 switches are based on routing technologies)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
26
Q

They establish logical connections between ports based on network
addresses
1) layer-2 switches
2) layer-3 switches

A

layer-3 switches
(layer-2: MAC address)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
27
Q

The IEEE ______ specification is the
standard for bridges.
1) 802.1A
2) 802.1B
3) 802.1C
4) 802.1D

A

802.1D

28
Q

________ interconnect Ethernet segments.
1) Hubs
2) Bridges
3) Switches

A

Bridges

29
Q

it is _________ (possible/not possible) to interconnect different segments which use different MAC protocols

A

possible

30
Q

bridges work at the MAC layer
layer-2
layer-3

A

layer-2
MAC layer

31
Q

Bridges work at the _____________ of the OSI model.
1) Physical
2) Data Link
3) Network
4) Transport

A

Data Link layer

32
Q

bridges use _______ addresses to create routing table
1) source
2) destination

A

source addresses

33
Q

If a bridge knows the location of the destination node, it forwards the packet to it. If it does not know the destination,
1) it blocks the packet
2) it forwards the packet to all segments.

A

it forwards the packet to all segments.

34
Q

small delays can be introduced using bridges (T/F)

A

T

35
Q

Routers work at the _____________ of the OSI model.
1) Physical
2) Data Link
3) Network
4) Transport

A

Network (or higher)

36
Q

The routing table maintained by a bridge contains _____ for each node
1) Media Access Control sublayer addresses
2) network numbers

A

Media Access Control sublayer addresses

37
Q

The routing table maintained by a router contains
1) Media Access Control sublayer addresses
2) network numbers

A

network numbers
(router works at network layer or higher)

38
Q

Routers _________ broadcast messages
1) forward
2) don’t forward

A

don’t forward
(broadcast storms can be isolated)

39
Q

a router _______ (can/cannot) route a packet from a TCP/IP Ethernet network to a server on a TCP/IP Token Ring Network

A

can route
(As packets are passed from router to router, Data Link layer source and
destination addresses are stripped off and then recreated)

40
Q

Routers look at
1) destination node address
2) network address
3) both

A

network address only

41
Q

which of the following protocols are non-routable
1) XNS
2) LAT
3) IPX
4) NetBEUI

A

all of them

42
Q

remote administration and configuration via
1) HSL
2) SNMP
3) OSPF

A

1) SNMP

43
Q

In routing, the ________ the metric, the better is the path
1) smaller
2) higher

A

smaller

44
Q

__________ cost router are faster routes
1) lower
2) higher

A

lower

45
Q

Routing through links with greater
bandwidth _____ provide the best routes
T/F

A

F
does not always. If high-speed link is busy, low-speed link might be faster at that time.

46
Q

distance vector routing and link state routing are
1) static routing algorithms
2) dynamic routing algorithms

A

dynamic routing algorithms

47
Q

IP RIP is an example of
1) distance vector routing
2) link state routing

A

distance vector routing

48
Q

________do not take line bandwidth into account when choosing the routes
1) distance vector routing
2) link state routing

A

distance vector routing

49
Q

routers with _______ routing has no knowledge of distant routers and how they interconnect
1) distance vector routing
2) link state routing

A

distance vector routing

50
Q

_____algorithm maintain a complex database of topology information
1) distance vector routing
2) link state routing

A

ink state routing
(also known as shortest path first (SPF)

51
Q

shortest path first (SPF) refers to
1) distance vector routing
2) link state routing

A

link state routing

52
Q

Examples of link state routing protocols
1) OSPF
2) RIP
3) NLSP
4) IS-IS

A

1,3,4 (IRP is distance vector)
OSPF: Open shortest path first
NLSP: NetWare Link Services Protocol
IS-IS: Intermediate System-to-Intermediate System

53
Q

In link state routing _______ are passed from one router to neighboring router
1) copies of routing tables
2) link state packets

A

link state packets

54
Q

In distance vector routing, _______ are passed from one router to neighboring router
1) copies of routing tables
2) link state packets

A

copies of routing tables

55
Q

______ has faster convergence
1) distance vector routing
2) link state routing

A

link state routing

56
Q

Interior routing protocols
1) OSPF
2) RIP
3) BGP

A

OSPF and RIP
(Routing Information Protocol)
(BGP is exterior routing)

57
Q

Exterior routing protocols
1) OSPF
2) RIP
3) BGP

A

BGP

58
Q

In routing, the ________ the hop count, the better is the path
1) lower
2) higher

A

lower

59
Q

A conglomeration of variables that change with
internetwork conditions, delay is common and useful metric

A

T

60
Q

distributed Bellman-Ford routing algorithm and the Ford-Fulkerson algorithm are the names of
1) distance vector routing
2) link state routing

A

distance vector routing algorithm

61
Q

It was the original ARPANET routing algorithm and was also used in the Internet under the name RIP
1) distance vector routing
2) link state routing

A

distance vector routing

62
Q

___ do not take line bandwidth into account when choosing the routes
1) distance vector routing
2) link state routing

A

distance vector routing

63
Q

Updates are triggered by events. Results in
faster convergence
1) distance vector routing
2) link state routing

A

link state routing

64
Q

Periodic & Frequent Updates results in
slow convergence
1) distance vector routing
2) link state routing

A

Distance vector routing

65
Q

____ is of concern to service providers and other large or complex networks
1) Interior Routing
2) Exterior Routing

A

Exterior Routing

ldce data network (6 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions