CS 610 Solved MCQS 100% Correct

• CS610 Solved MCQS 100% Correct
• ________ of TCP/IP layering model, corresponds to basic network hardware.
• · Physical Layer
• · Network Interface ayer
• · Internet ayer
• · Transport ayer
• _______ protocols of TCP/IP layering model specify how to ens!re reliable transfer.
• · Physical ayer
• · Network Interface ayer
• · Internet ayer
• · Transport Layer
• ________is called an end"to"end protocol beca!se it pro#ide a connection directly from an application on one
comp!ter to an application on a remote comp!ter.
• · IP
• · UDP
• · TCP
• · None of the gi#en
• ____________ !ses distance #ector approach to define ro!ting
• · $%P
• · &'P(
• · RIP
• · None of the gi#en
• _______ is ideal in a sit!ation where the gro!p is small and all members are attached to contig!o!s ocal )rea
Networks.
• · lood!and !Pr"ne
• · Config!ration"and "T!nneling
• · Core"$ased *isco#ery
• · None of the gi#en
• +o!ter that decrements TT to __ sends IC,P time e-ceeded message, with ro!ter s address as so!rce
address
• · .
• · /
• · 0
• · 0
• Protocol addresses are abstractions pro#ided by ___________.
• · hardware
• · so#t$are
• ·
• · internet
• )ltho!gh message e-change can be !sed to bind addresses, sending a re1!est for each binding is hopelessly
inefficient.
• · Tr"e
• · (alse
• )+P is almost always !sed to bind a ___"bit IP address to a ___"bit 2thernet address.
• · %&' ()
• · /3, ./
• · ./, 43
• · ./, 0/5
• In the 0678s large organi9ations began to ac1!ire m!ltiple networks. 2ach network in the organi9ation formed
island. 2mployees needed to choose a comp!ter appropriate for each task. 'o they needed m!ltiple screens,
keyboards and comp!ters.
• · (alse
• · Tr"e
• In which method of )ddress +esol!tion Protocol the protocol address is determined by hardware address:
;ere <T< stands for Table look!p, <C< for Closed"form Comp!tation and <*< for *ata 2-change:
• · T
• · *
• · C
• · T, C
• ;hich method of )ddress +esol!tion Protocol is !sef!l with any hardware:
• ;ere <T< stands for Table look!p, <C< for Closed"form Comp!tation and <*< for *ata 2-change:
• · T
• · C
• · *
• · C, *
• In which method of )ddress +esol!tion Protocol the implimentation is more diffic!lt:
• ;ere <T< stands for Table look!p, <C< for Closed"form Comp!tation and <*< for *ata 2-change:
• · T, C
• · T
• · C
• · D
• ;hich method of )ddress +esol!tion Protocol resol!tion with minim!m delay:
• ;ere <T< stands for Table look!p, <C< for Closed"form Comp!tation and <*< for *ata 2-change:
• · T, *
• · c
• · T
• · T' C
• The general form of an IP datagram is with a header followed by data. The header contains information that
controls where and how the datagram is to be sent.
• · Tr"e
• · (alse
• To sa#e traffic, an 2%P does not s!mmeri9e ro!ting information from the a!tonomo!s system before passing it
to another a!tonomo!s system.
• · Tr!e
• · alse
• """"""""""""" was especially concerned abo!t the lack of high powered comp!ters.
• · I222
• · )P+) =wrong spelling>
• · 2I)
• · *one
• ,issing eot indicates sending comp!ter crashed in frame format.
• · Tr"e
• · (alse
• The """""""""""""term refers to the general concept of a small block of data.
• · Pac+ets
• · *ata
• · (rame
• · None of gi#en
• C+C can detect more errors than a simple checks!m.
• · Tr"e
• · (alse
• The network that !ses a """"""""""""", !s!ally consist of a single long cable to which comp!ter attach.
• · 'tar topology
• · ,"s topolo-y
• · +ing topology
• · None of the gi#en
• )N that !se )T, technology ha#e a """""""""""""
• · 'tar topology
• · $!s topology
• · +ing topology
• · *one o# the -iven
• ) bridge !ses """"""""""""""" to determine which comp!ter is connected to which segment, and !ses the
""""""""""""""" to determine whether to forward a copy of frame.
• ·
• ·
• ·
• ·
• """"""""""""""" has a ?itter 9ero
• · @irt!al Pri#ate Network
• · Isochrono"s *et$or+
• · )synchrono!s Network
• · None of the gi#en
• The network with Thro!ghp!t T and *elay * has a total """"""""""""""" bits in transit at a time.
• · * A T
• · * B T
• · D . T
• · * / T
• &ne repeater """"""""""""""", two repeaters """"""""""""""" the ma-im!m cable length limitation.
• · Do"/le' triple
• · *o!ble, 3 time
• · half, triple
• · *o!ble, half
• 2nd"to"end deli#ery ser#ice is connection oriented.
• · Tr!e
• · alse
• ) single networking technology is best for all needs.
• · Tr!e
• · alse
• Twice N)T allows a site to r!n ser#ers.
• · Tr"e
• · (alse
• ________ de#ice is !sed for m!lticasting.
• · C!b
• · 'witch
• · Ro"ter
• · none of the gi#en
• ___________ does not depend on any partic!lar !nicast ro!ting protocol.
• · PI,"*,
• · PIM!SM
• · PI,"),
• · none of the gi#en
• ) ro!ting table contains_______
• · The destination network I*
• · The hop co!nt to reach the network
• · The ro"ter ID o# the ne0t hop
• · )ll of the gi#en
• _______ can be !sed to propagate information abo!t remote networks.
• · Dyna1ic ro"tin-
• · 'tatic ro!ting
• · )ddress resol!tion
• · None of the gi#en
• ________ protocol is designed to !se within an organi9ation.
• · &'P(
• · ,2&'P(
• · M2SP
• · none of the gi#en
• N)PT stands for ________________
• · Network )ddress and Protocol Translation
• · *et$or+ 3ddress and Port Translation
• · Network )ddress and Packet Translation
• · None of the gi#en
• In dynamic ro!ting, the ro!ting table is initiali9ed when system boots.
• · Tr"e
• · (alse
• &'P( incl!des ________ address mask with each address.
• · .8$it
• · %&,it
• · .3$it
• · none of the gi#en
• Twice N)T fails if an application !ses the IP addresses instead of *omain Name.
• · Tr"e
• · (alse
• _________ !ses window mechanism to control the flow of data.
• · IP
• · D*P
• · TCP
• · none of the gi#en
• TCP !ses _______ mechanism to control the flow of data.
• · door
• · $indo$
• · acknowledgment
• · retransmission
• I%Ps stand for _________
• · Internal %ateway Protocols
• · Interior 4ate$ay Protocols
• · Intermediate %ateway Protocols
• · None of the gi#en
• ________ protocol !ses distance #ector algorithm.
• · I%P
• · $%P
• · RIP
• · none of the gi#en
• __________meas!res distance in network hops, where each network between the so!rce and destination
co!nts as single hop.
• · $%P
• · &'P(
• · RIP
• · Non of these
• Network )ddress Translation =N)T> re1!ires de#ice to perform packet translation.
• · Tr"e
• · (alse
• ;e !se the term _______ to refer to a meas!re of the path that ro!ting software !se when choosing a ro!te.
• · ro!ting path
• · ro"tin- 1etric
• · ro!ting
• · switching
• Part of the ."way handshake !sed to create a connection, re1!ires each end to generate a random _____
se1!ence n!mber.
• · %& /it
• · 04 bit
• · 5 bit
• · 43 bit
• +econstr!ction of original datagram is called reassembly.
• · Tr"e
• · (alse
• +eliability is the responsibility of the ______ layer.
• · Transport
• · Network
• · Physical
• · Internet
• _______ is ideal in a sit!ation where the gro!p is small and all members are attached to contig!o!s ocal )rea
Networks.
• · lood!and !Pr"ne
• · Config!ration"and "T!nneling
• · Core"$ased *isco#ery
• · None of the gi#en
• In *irect point to point comm!nication adding the Nth comp!ter re1!ires"""""""""""" new connections.
• · None of the gi#en
• · N
&
• · *!1
• · =N
&
BN>//
• The n!mber of connections needed for N comp!ter in direct point to point comm!nication is e1!al toE
• · 5*
&
!*67&
• · N=N"0>
• · N
&
• · None of the gi#en
• Cardware that calc!lates a C+C !ses two simple components.
• · )N* !nit and F&+ !nit
• · Shi#t re-ister and .2R "nit
• · 'hift register and )N* !nit
• · None of the gi#en
• The %igabit 2thernet hardware operates at a rate of """"""""
• · 08 ,bps
• · 088 ,bps
• · 1000 M/ps
• · None of the gi#en
• ________ comp!tes shortest paths in a graph by !sing weights on edges as a meas!re of distance.
• · %reedy algorithm
• · *istance #ector algorithm
• · Di8+sta9s al-orith1
• · Non of the gi#en
• $asic )N technologies s!ch as 2thernet, Token +ing, and (**I !se a _____.
• · Connectionless service paradi-1
• · Connection"oriented ser#ice paradigm
• · $oth Connectionless and Connection"oriented ser#ice paradigm
• · None of the gi#en
• )n Internet )ddress =IP address> is a !ni1!e __________ binary n!mber assigned to a host and !sed for all
comm!nication with host
• · 35"bit
• · %&!/it
• · /3"bit
• · None of the gi#en
• The address __________ identifies the physical network to which the comp!ter is attached, while the _______
identifies an indi#id!al comp!ter on that network.
• · pre#i0 ' s"##i0
• · s!ffi- , prefi-
• · s!ffi- , s!ffi-
• · None of the gi#en
• ___________ places the bo!ndary between the first and second octets
• · Class 3
• · Class $
• · Class C
• · Class *
• ___________ places the bo!ndary between the second and third octets.
• · Class )
• · Class ,
• · Class C
• · Class *
• ___________ places the bo!ndary between the third and fo!rth octets.
• · Class )
• · Class $
• · Class C
• · Class *
• ________ (ield of header indicates whether a datagram is a fragment or a complete datagram.
• · L34S
• · ()%,2NT &(('2T
• · I*2NTI(IC)TI&N
• · None of the gi#en
• ______ pro#ides connectionless ser#ice.
• · TCP
• · UDP
• · IP
• · None of the gi#en
• D*P and TCP are both_________ layer protocols
• · Physical
• · *ata link
• · Network
• · Transport
• ________identifies which application program on recei#ing comp!ter sho!ld recei#e the data
• ogical address
• · 'o!rce port
• · So"rce port
• · *estination Port
• · None of the gi#en
• ________ identifies the application program that sent the data.
• · *estination Port
• · So"rce port
• · ogical address
• · None of the gi#en
• The $order %ateway Protocol =$%P> !ses_________ for all comm!nication
• · D*P
• · TCP
• · $oth D*P and TCP
• · None of the gi#en
• ;hich of the following protocols allows the sender and recei#er to enforce polices.
• · +IP
• · &'P(
• · ,4P
• · +IP and &'P(
• IC,P message transport is acted !pon by getting IC,P encrypted in IP.
• · Tr!e
• · alse
• These IC,P message transport is acted !pon ________ as frames on ______
• · Intranet, )N
• · Internet, ;)N
• · Intranet, ;)N
• · Internet' L3*
• )ddress mask defines how many bits of address are in s!ffi-:
• · Tr!e
• · alse
• ) comp!ter attached to a gi#en network can only comm!nicate with other comp!ters attached to the same
network. Is this a problem with m!ltiple networks:
• · Tr"e
• · (alse
• The term self"identifying is !sed for Classf!l IP addresses beca!se the class of the address can be comp!ted
from the address__________.
• · itsel#
• · prefi-
• · s!ffi-
• · mask
• (ind the class of the addressE
• 00008800 08800800 00000800 88880000
• · )
• · C
• · :
• · $
• There are three standard implementations to impro#e comp!tational efficiencyE Cashing, *irect Inde-ing and
Indirect
• Inde-ing
alse
) _____________ address"binding table is !sed for each physical network.
New
'imilar
Separate
&ld
______ layer Pro#ides reliable deli#ery of datagram.
•
Network
Transport
*atalink
none of the gi#en
*!e to re#ol!tionali9ation of IP"@4 the speed has increased from _______
;1& to 1 4,
•
________ encaps!lates IP datagram as data area in hardware frame.
•
*et$or+ Inter#ace Layer
*atalink ayer
Network ayer
none of the gi#en
•
_______ (ield of header indicates whether a datagram is a fragment or a complete datagram.
R34M:*T 2S:T
as the Internet grew, the original Classf!l addressing scheme became a limitation. The IP address space was
being e-ha!sted beca!se all networks had to choose one of fo!r possible si9es.
•
alse
•
)s the Internet grew, the original Classf!l addressing scheme became a limitation. The IP address space was
being e-ha!sted beca!se all networks had to choose one of ________ possible si9es.
Three
•
Ceader contains all information needed to deli#er datagram to the destination comp!ter. $!t which one of the
following is not incl!dedE
Recti#ier
______ contains all information needed to deli#er datagram to the destination.
<eader
one of the parameters, which moti#ated IP for change is address space. The _____________ address space
allows for o#er a million networks. $!t most networks are class C and too small for many organi9ations.
•
%&!/it
•
Class ) mask is /GG.8.8.8 which is !sed for ______
•
S"/ nettin-
•
Postfi- defines how m!ch of address !sed to identify network.
• alse
________ field is !sed to identify a specific path thro!gh the network
•
L2= L3,:L
•
_______ is a techni1!e !sed to imit datagram si9e to small ,TD of any network
•
ra-1entation
Cashing is the transformation of a string of characters into a !s!ally shorter fi-ed"length #al!e or a key that
represents the original string.
•
Tr"e
•
In ______________, the protocol address assigned to a comp!ter is chosen caref!lly so that comp!terHs
hardware address can be comp!ted from the protocol address !sing basic $oolean and arithmetic operations.
•
Closed!#or1 Co1p"tation
•
+o!ters !se _______ to forward datagram along prearranged path.
•
lo$ la/el
•
,apping between a protocol address and a hardware address is called )ddress +esol!tion.
•
Tr"e
Preliminary #ersion of IP was called _________.
•
IP ! *e0t 4eneration 5IPn-6
_______ 'o!rce is responsible for fragmentation.
•
IP>6
2nd to 2nd deli#ery 'er#ice of IP datagram is _____
Connectionless
2#ery hardware technology specification incl!des the definition of the ma-im!m si9e of the frame data area,
which is called the ____________ Transmission Dnit.
Ma0i1"1
IP@4 addresses are _____ bits.
1&)
,TD 'tands for _______
Ma0i1"1 trans1ission "nit
_______ shows senders preference for low latency, high +eliability.
•
S:R>IC: T?P:
•
N2FT C2)*2+ field in the base header defines type of header it appears at the end of fi-ed"si9e base header.
•
Tr"e
•
There are two standard implementations to impro#e comp!tational efficiencyE Cashing and direct inde-ing
•
Tr"e
•
) datagram cannot be larger than ________ of a network o#er which it is sent.
•
IP header
•
The protocol address of the ne-t hop m!st be _____________ to an e1!i#alent hardware address before a
packet can be sent.
•
Translated
• The physical addressing in a ;)N is similar as in )N in the way................
• The data is transmitted in packets e1!i#alent to frames.
• 2ach packet has a format with header.
• The packet header incl!des destination and so!rce addresses.
• 3ll o# the a/ove
• In )synchrono!s Transfer ,ode @PI/@CI fields identify the cells""""""""""""""
• ;hich one of the following is a method for comp!ting ro!ting table information:
• ,an!al entry
• $oot time ro!ting
• Static ro"tin-
• None of the abo#e
• )ll destinations on same switch ha#e same
• +o!ter
• Information
• *e0t hop
• None of the abo#e
• ;hich of the following statement is wrong regarding )T,:
• It is a single technology for #oice, #ideo and data
• It has low ?itter and high capacity.
• It !ses fi-ed si9e, small cells, and 35 octetHs data
• *one o# the a/ove
• ;hich one of the following is the responsibility of *?ikstraH algorithm:
• To co1p"te the shortest path /et$een t$o nodes
• To e-tract ne-t hop information from path information
• To insert ne-t hop information into ro!ting table
• )ll of the abo#e
• ;hich of the following statement is tr!e regarding ink"state ro!ting:
• Network topology is separated from ro!te comp!tation.
• 2ach switch b!ilds its own ro!ting tables.
• ink"state ro!ting !ses *?ikstraHs algorithm.
• 3ll o# the a/ove
• Iitter is significance for """"""""""""""""""
• @oice
• @ideo
• *ata
• 3ll o# a/ove
• The ro!ting table contains information abo!t the JJJJJJimmediately aro!nd it.
• Topology of the network
• Destination
• $oth of the abo#e
• None of the abo#e
• There are three types of C!bs that e-ist. ;hich of the following options correctly describes these three:
• Passi#e, dormant, special
• )cti#e , dormant , passi#e
• Passi#e, )cti#e, T!rbo
• Passive' 3ctive' Intelli-ent
• ) n!mber of different factors determine the cost of a C!b. ;hich of the following is among these factors:
• Speed ratin-
• *!rability
• $rand
• Class
• ;hich of the following network topologies among the list below is incorrect:
• 'tar
• Internet
• +ing
• $!s
• ;hich of the following is not a feat!re of $ase band Coa-ial Cable:
• $i"directional
• (ew Kilometer range
• Proton /ased
• 2thernet=basis for 58/..> at 08 ,bps
• ;hich of the following is not a f!nction of a repeater:
• Dses I!mper 'ettings
• Transmits data in both directions
• No $!ffering
• @oins t$o 5&6 se-1ents o# ca/les
• ;hich le#el of the TCP/IP reference model ro!tes data/information across a network channel:
• )pplication layer
• *ata ink ayer
• Transport ayer
• *et$or+ Layer
• The f!nction of a modem is to con#ert signals. Identify the correct signals it con#erts.
• 3nalo-"e to Di-ital
• )nalog!e to $a!d rate
• $a!d rate to )nalog!e
• *igital to $inary
• ;hich of the following is not a )N B )rchitect!re:.
o Protocol architect!re
• Media access control
• ogical Protocol
• ogical ink Control
• Identify the statement which best describes TCP and D*P.
• TCP is a connection oriented Protocol $hiles UDP is a data-ra1 service
• TCP is a protocol for the Network ayer of the &'I
• D*P and TCP co!ld be !sed interchangeably
• TCP is an ad#anced protocol whiles D*P is a single protocol
• ;hich of the following characteristics best describes a frame:
• Data lin+ layer5<eader' Trailer' Data6
• Network ayer=Ceader, Trailer, *ata>
• Transport ayer=Ceader, Trailer, *ata>
• Physical ayer=Ceader, Trailer, *ata>
• ;hat does the terminology I'*N mean:
• Internal *igital 'er#ices Network
• Integrated 'ystems *igital Network
• Integrated 'er#ices *igital Naming 'ystem
• Inte-rated Services Di-ital *et$or+
• ;hat does the terminology )T, mean:
• )!tomatic transfer mode
• )!tomatic translation mode
• 3synchrono"s trans#er 1ode
• )synchrono!s transformation mode
• ) simple )rchitect!re for (ile Transfer is made !p of E
• (ile transfer applicationL Comm!nications ser#ice mod!leL Network access mod!le
• (ile transfer applicationL transport layerL Network access mod!le
• Network access layerL Transport layerL )pplication layer
• 3pplication layerA *et$or+ layerA Session layer
• ;hich of the following statements is tr!e abo!t standards:
• 'tandards create additional cost
• Standards help individ"als9 "sers to increase e##ectiveness
• 'tandards allow prod!cts from m!ltiple #endors to comm!nicate
• 'tandards cannot free9e technology
• ;hich of the following statement is tr!e abo!t (&; C&NT+&:
• lo$ control is a #"nction per#or1ed /y a receivin- entity to li1it the a1o"nt or rate o# data on a
net$or+B
• (low control ad?!sts the weights on a network
• (low control is a f!nction performed by the ,&*2,
• (low control is an ad#anced form of network management
• Identify the most s!itable description for 2++&+ C&NT+&:
• :rror control is an activity that 1ana-es deadloc+B
• 2rror control is an ad#anced form of parity bit
• 2rror control is a s!b"f!nction of a modem and C!b
• 2rror control is needed to g!ard against loss or damage of data
• ;hat is the f!ll meaning of the terminology ',TP:
• 'tate ,ail Transfer Protocol
• 'imple ,ail Tailor Protocol
• 'imple ,anagement Transfer Protocol
• Si1ple Mail Trans#er Protocol
• 'e#eral Comp!ters connected together is calledE
• Client"ser#er
• Client
• Co1p"ter net$or+
• C!b
• In which of the following networks does the client s!bmit a task to the ser#er, then the ser#er e-ec!tes and
ret!rns the res!lt for the re1!esting client station:
• Peer"to"Peer
• Client"'er#er
• 'er#er"$ased
• 3ll o# the a/ove
• In which network topology are all workstations connected in cascade form:
• 'tar
• +ing
• Mesh
• $!s
• ;hich network topology !ses a C!b:
• Star
• $!s
• ,esh
• +ing
• ;hich of the following topologies is !sed for 2thernet:
• 'tar
• $!s
• +ing
• 3ll o# the a/ove
• Comp!ters on a !ni#ersity camp!s are connected by a/anE
• ,)N
• ;)N
• L3*
• INT2+N2T
• The primary f!nction of the network layer isE
• 2rror detection
• 'et !p a session
• Ro"tin-
• 2ncryption
• ;hich of the following standards apply to logical link control:
• I222 58/..
• I::: )0&B&
• I222 58/.G
• I222 58/.3
• ;hich organi9ation defines standards for telecomm!nication:
• ITD
• I:::
• 2I)
• I'&
• ;hich of the following statements is a tr!e description of fibre &ptic Cable:
• (iber optic cables transfer data in a mesh
• i/er optic ca/les trans#er data in li-ht #or1
• (iber optic cables are similar to coa-ial cables
• Non of the abo#e
• ;hich of the following is not tr!e of switching technology:
• Packet 'witching
• ink 'witching
• Pac+ets are s$itched in the #or1 o# data-ra1
• Circ!it switching techni1!es
• ;hich of the following is a tr!e description of ,!lti"stage 'witching:
• ,ore simple control
• Increased n"1/er o# crossed points
• ,ore comple- control
• +ed!ced +eliability
• (looding in networks and data comm!nication has certain properties. ;hich of the options below is a property
of flooding:
• )ll possible ro!tes are tried
• 3ll paths are loaded
• )ll nodes are linked
• Can not be !sed to set !p #irt!al circ!it
• Identify any of the following statements which tr!ly describe a #irt!al circ!it.
• Packets are forwarded more 1!ickly and no ro!ting decisions
• More relia/le in #"nctionality
• Call set !p phases are present
• Packets are centrali9ed at random and more ro!ting decisions are made
• ;hich of the following operating systems software is most s!itable for wide area network:
• *&'
• &'//
• ;IN*&;' NT
• *2>:LL *:T=3R:
• $inding is an important f!nction in establishing comm!nication between a Client and a 'er#er. ;hich of the
following statements tr!ly describes binding in protocols:
• ,indin- protocols to net$or+ inter#aces speci#ies that the selected protocol can /e sent and received
thro"-h the selected L3* inter#ace cardB
• $inding is a f!nction of the Network &perating 'ystems 'oftware
• $inding is a config!ration process in mail ser#er management.
• $inding ser#es as a sec!rity layer in operating systems.
• =.4> In config!ring ;indows NT 3.8 for Network )ccess. There are se#en =7> areas to be addressed. Identify
from the options below the area that sho!ld not be addressed.
• Protocols
• $indings
• IP )ddress
• 3"toe0ec Mana-e1ent
• ;hich of the following is not a network adapter:
• . com P III
• . com 2ther link III I')
• . com 2ther link II )dapter
• % co1 %C;0) IS3 16 ,IT
• ;hich of the following statement is tr!e abo!t an IP address:
• IP address is /ased on yo"r co1p"ter net$or+ card
• IP address is iss!ed by a comp!ter #endor
• IP address is a Transport Protocol
• IP address is not !sed on the internet
• ;hich of the following is not associated with the session layer:
• Control of dialog!e between applications
• *ialog!e discipline
• Data co1pression
• 'ynchroni9ation