business data communications and Networking Quiz

8/17/2019 business data communications and Networking Quiz

1/22

Chap-1 Question 1

49.998 out of 50 points

Match the terms on the left side with the best description on the right side.

Question Correct Match elected Match

!is"#ragmentation

$.%nused space within a cluster&bloc"& trac" or other unit ofph'sical storage.

$.%nused space within a cluster&bloc"& trac" or other unit ofph'sical storage.

(ransfer (ime ).

The amount of time for theread/write head to read the requireddata into memory.

).

The amount of time for theread/write head to read the requireddata into memory.

ee" (ime *.The time required to move theaccess arm of a disk drive to thecorrect track on a disk.

*.The time required to move theaccess arm of a disk drive to thecorrect track on a disk.

Zoned BitRecording

+.A method for organizing sectors onthe surface of a disk that allocates

sectors into areas where moresectors are created on the outeredges of the disk than on the inneredges.

+.A method for organizing sectors onthe surface of a disk that allocates

sectors into areas where moresectors are created on the outeredges of the disk than on the inneredges.

,erpendicularecording

.Organizing the its on the surfaceof a magnetic disk vertically inorder to use less s!ace.

.Organizing the its on the surfaceof a magnetic disk vertically inorder to use less s!ace.

"irect Access#torage "evice

$"A#"%

#./ secondar' storage de ice thatallows access to a speci c sectoror bloc" without rst ha ing toread the bloc"s or sectors thatprecede it.

#./ secondar' storage de ice thatallows access to a speci c sectoror bloc" without rst ha ing toread the bloc"s or sectors thatprecede it.

Track !.The set of ytes on a single surfaceof a disk than can e accessedwithout moving the read/write

!.The set of ytes on a single surfaceof a disk than can e accessedwithout moving the read/write


2/22

heads. heads.

ector 2. (he 3ed-si ed& pie-shaped databloc"s that ma"e up the trac"s onsome dis" dri es.

2. (he 3ed-si ed& pie-shaped databloc"s that ma"e up the trac"s onsome dis" dri es.

Rotational"elay

C.The time it takes for the disk to s!inso the desired sector is under theread/write head.

C.The time it takes for the disk to s!inso the desired sector is under theread/write head.

&'tent /.One or more ad(acent clustersallocated as !art $or all% of a file.

/.One or more ad(acent clustersallocated as !art $or all% of a file.

Cluster ./ group of multiple contiguoussectors.

./ group of multiple contiguoussectors.

#olid statedevice

6.7on olatile& remo able storagemedium that utili ing integratedcircuits rather than magnetic oroptical media.

6.7on olatile& remo able storagemedium that utili ing integratedcircuits rather than magnetic oroptical media.

/ll /nswer Choices

/.One or more ad(acent clusters allocated as !art $or all% of a file.

+.

A method for organizing sectors on the surface of a disk that allocates sectors into areaswhere more sectors are created on the outer edges of the disk than on the inner edges.

C.The time it takes for the disk to s!in so the desired sector is under the read/write head.

!.The set of ytes on a single surface of a disk than can e accessed without moving theread/write heads.

).The amount of time for the read/write head to read the required data into memory.

#.

/ secondar' storage de ice that allows access to a speci c sector or bloc" without rstha ing to read the bloc"s or sectors that precede it.

./ group of multiple contiguous sectors.

*.The time required to move the access arm of a disk drive to the correct track on a disk.

6.


3/22

7on olatile& remo able storage medium that utili ing integrated circuits rather thanmagnetic or optical media.

2. (he 3ed-si ed& pie-shaped data bloc"s that ma"e up the trac"s on some dis" dri es.

.Organizing the its on the surface of a magnetic disk vertically in order to use less s!ace.

$.%nused space within a cluster& bloc"& trac" or other unit of ph'sical storage.

Question 2. 5 out of . 5 points

%sing the "e'word: alue format when storing elds can handle missing data

elected /nswer; (rue

/nswers; (rue#alse

Question 3. 5 out of . 5 points

#or a 3ed-lenght record we can either choose to 3 the elds as well or use ariable-length elds

elected /nswer; (rue/nswers; (rue

#alse Question 4

0 out of . 5 points

#ile tructures is about how to store data& for e3ample& in araibles& arra's& obe


4/22


5/22

5. ,erpendicular ecording- Ergani ing the bits on the surface of a magneticdis" erticall' in order to use less space.

. !irect /ccess torage !e ice F!/ !G- / secondar' storage de ice that allowsaccess to a speci c sector or bloc" without rst ha ing to read the bloc"s orsectors that precede it.

H. (rac"- (he set of b'tes on a single surface of a dis" than can be accessedwithout mo ing the readBwrite heads.

8. ector- (he 3ed-si ed& pie-shaped data bloc"s that ma"e up the trac"s onsome dis" dri es.

9. otational !ela'- (he time it ta"es for the dis" to spin so the desired sector isunder the readBwrite head.

10.)3tent- Ene or more ad


6/22

Chapter- Question 1

5 out of 5 points

elect the best answer; electi e inde3es are usefulelected /nswer;

6f 'our secondar' "e' onl' has a few distinct alues/nswers; 6f the inde3 le doesnIt t t into main memor'

6f 'our secondar' "e' onl' has a few distinct alues

6f 'our secondar' "e' has man' distinct alues Question 2

5 out of 5 points

)3ternal sorting algorithms were de eloped to enable sorting of big les that donIt t intomain memor'.


#alse Question 3

5 out of 5 points

/ +-(ree can be used if a simple inde3 does not t in memor' an'more.


#alse Question 4

0 out of 5 points

@ith a simple3 inde3 'our data le needs to be "ept in order& sorted on the primar' "e'alue.


#alse Question 5

5 out of 5 points

orting algorithms such as +ubblesort& Asort& shellsort assume all data ts into main


7/22

memor'.


#alse Question 6

5 out of 5 points

J efer to slide H in 'our presentation !irect /ccess with 6nde3es ; 6f weinclude the new "e' / into the binar' search tree& is it a left or rightchildKJ

elected /nswer; $eft Child

/nswers; $eft Child

ight Child Question 7

0 out of 5 points

*ow man' comparisons need to be done if we are searching the "e' 14 in the followingarra' of "e's Fincluding the comparison when correct "e' is foundG;

elected /nswer;

4/nswers; 1

4

5


8/22

Question 85 out of 5 points

/ simple inde3 rst reAuires the identi cation of a primar' "e'.


#alse Question 9

5 out of 5 points

6f a new record is entered into the data le& the inde3 does not need to be updated.

elected /nswer; #alse/nswers; (rue

#alse Question 1

5 out of 5 points

(he +-tree diLers from the binar' tree in that itelected /nswer;

grows from the bottom up/nswers; is loaded from a sorted le

has long search chains

grows from the bottom up

ta"es less space

is not a practical techniAue


9/22

Chapter- Question 1

.5 out of .5 points

*ori ontal partitioning refers to the process of combining se eral smallerrelations into a larger table.


#alse Question 2

.5 out of .5 points

/ contiguous section of dis" storage space is called aFnG;elected /nswer;

e3tent./nswers; sector.

e3tent.

trac".

tablespace. Question 3

.5 out of .5 points

%sing an inde3 for attributes referenced in E !) + and E%, +clauses has no signi cant impact upon database performance.


#alse Question 4

.5 out of .5 points

6n a seAuential le& the records are stored in seAuence according toprimar' "e'.elected /nswer; (rue

/nswers; (rue#alse

Question 5.5 out of .5 points


10/22

/FnG NNNNNNNN is a routine that con erts a primar' "e' alue into a relati erecord number.

elected /nswer; hashing algorithm

/nswers; pointing algorithm

record inde3 calculator

hashing algorithm

inde3 pointer program Question 6

.5 out of .5 points

#ast data retrie al is one factor to consider when choosing a leorgani ation for a particular database le.elected /nswer; (rue

/nswers; (rue#alse


Ene decision in the ph'sical design process is selecting structures.elected /nswer; (rue

/nswers; (rue#alse


/n ad antage of partitioning is;elected /nswer;

eOcienc'./nswers; remote optimi ation.

eOcienc'.

e3tra space and update time.

both / and +. Question 9

.5 out of .5 points


11/22

@hich t'pe of le is most eOcient with storage spaceKelected /nswer;

eAuential/nswers;

eAuential*ashed

6nde3ed

Clustered Question 1

.5 out of .5 points

!enormali ation almost alwa's leads to more storage space for raw data.elected /nswer; (rue

/nswers; (rue#alse


A local area network $)A*% connects other )A*s and B*s located in different areas to each other andto wide area networks in a s!an from + to +, miles.


#alse

Question 12 .5 out of .5 points

-hich of the following is not a !ro!erty of a -A*

elected/nswer;

connects a grou! of com!uters in a small geogra!hic area such as room floor

uilding or cam!us

/nswers; connects ack one networks and A*#

s!ans hundreds or thousands of miles

!rovides data transmission s!eeds from 012 !s to 3,4 !s

connects a grou! of com!uters in a small geogra!hic area such as room floor

uilding or cam!us


-hich is not a function of the !hysical layer


12/22

elected/nswer;

!roviding error5free transmission of data

/nswers; transmission of its

defining the rules y which one and zeroes are transmitted

!roviding error5free transmission of data

!roviding the !hysical connection etween sender and receiver

s!ecifying the ty!e of connection and ty!e of signals waves or !ulses that !assthough it


(he networ" la'er is responsible for routing messages from the source computerto the destination computer.


#alse Question 15

.5 out of .5 points

The 666666666666 layer of the O#7 model is res!onsi le for data format translation

elected /nswer; presentation

/nswers; session

presentation

ph'sical

application Question 16

.5 out of .5 points

)thernet is an e3ample of a networ" la'er protocol.elected /nswer; #alse

/nswers; (rue

#alse


13/22


7n which layer of the 7nternet model would the 8TT9 standard e used:

elected /nswer; application

/nswers; ph'sical

transport

networ"

application Question 18

.5 out of .5 points

/t the transport la'er in the 6nternet model& (C, is responsible for brea"ing largeles recei ed from the application la'er into smaller pac"ets and opening a

connection to a ser er for transferring the pac"ets.elected /nswer; (rue

/nswers; (rue#alse


6n the E 6 model& the application la'er is the end userIs access to the networ".elected /nswer; (rue

/nswers; (rue#alse


7etwor"s that are designed to connect similar computers that share data andsoftware with each other are called;

elected /nswer; peer-to-peer networ"s

/nswers; clientBser er networ"s

peer-to-peer networ"s


14/22

host networ"s

client networ"s

local area networ"s

Chapter-4 Question 1

4.1 H out of 4.1 H points

Match the term to the correct de nition.

Question Correct Match elected Match

imple3 lin" !.Enl' one 3ed direction at alltimes

!.Enl' one 3ed direction at alltimes

*alf-duple3lin"

C.+oth directions& but not at thesame time

C.+oth directions& but not at thesame time

#ull-duple3 lin" /.%sed for transmission in bothdirections at once

/.%sed for transmission in bothdirections at once

,oint-to-,ointcon guration

).!edicated circuit that is usedwhen computers generate enoughdata to ll the capacit' of thecircuit

).!edicated circuit that is usedwhen computers generate enoughdata to ll the capacit' of thecircuit

MultipointCon guration

+.Man' computers who areconnected on the same circuit

+.Man' computers who areconnected on the same circuit

/ll /nswer Choices

/.%sed for transmission in both directions at once

+.Man' computers who are connected on the same circuit

C.+oth directions& but not at the same time

!.Enl' one 3ed direction at all times


15/22

).!edicated circuit that is used when computers generate enough data to ll the capacit'of the circuit

Question 2


!igital technologies are based on discrete& binar' wa eforms with two states ; one orero


#alse Question 3

0 out of 4.1 H points

#reAuenc' shifting means changing the amplitude Fthe height of the wa esG.


#alse Question 4


(ransmission !ela' is the time to push all bits on the phs'ical medium.


#alse Question 5


6n b'te stuOng& occurrences of Pags in the data must be stuLed FescapedG.


#alse Question 6


(he $in" $a'er is responsible for

elected/nswer;

message delineationg& error control and networ" medium access control


16/22


17/22

/ hop in a routing calculation is de ned as one lin" or circuit.


#alse

Question 114.1 H out of 4.1 H points

(he NNNNNNNNNNNNN is used b' a computer to determine how messages will tra el throughthe networ".

elected /nswer; routing table

/nswers; lin"ing loader

routing table

bus header assignment listle allocation table

Question 124.1 H out of 4.1 H points

/FnG NNNNNNNN refers to a group of computers that are logicall' grouped together b' 6,number.

elected /nswer; subnet

/nswers; 6, group

subnet

(C, group

application net


18/22

Chapter-5 Question 1

5 out of 5 points

Connectionless routing sets up a (C, connection& or irtual circuit between a sender andrecei er.


#alse


(he source port identi er in the (C, header tells the (C, software on the destinationcomputer& which application on the destination it should pass the pac"et to.


#alse Question 3

5 out of 5 points

6n the three-tier architecture& the software on the client computer is responsible for thepresentation logic& an application ser er is responsible for the application logic and aseparate database ser er is responsible for the data access logic and data storage.


#alse


19/22


/ reAuest header for an *((, reAuest starts with a command& such as )(& and ends withthe *((, ersion number that the browser understands.


#alse Question 5

5 out of 5 points

(o use the @eb& each client computer reAuires a data lin" la'er software pac"age called a@eb browser.

elected /nswer; #alse

/nswers; (rue #alse


(he standard port number for M(, is 5 .


#alse Question 7

5 out of 5 points

+ecause there is a limit on the length of a frame that the data lin" la'er can transmitfrom node to node& the transport la'er brea"s up the message from the application la'erinto se eral smaller segments.


#alse Question 8

5 out of 5 points

(he transport la'er sits directl' between the application la'er and the data lin" la'er inthe 6nternet e-la'er networ" model.


#alse


20/22


!omain 7ame er ers pro ide the eAui alent of director' assistance for application la'eraddresses.


#alse Question 1

5 out of 5 points

(he four general functions of an' application program are; data storage& data accesslogic& application logic and presentation logic.

elected /nswer; (rue

/nswers; (rue#alse


(he application architecture called the distributed computing model uses the Rthic"Sclient approach.


#alse Question 12

5 out of 5 points

+ecause there is a limit on the length of a frame that the data lin" la'er can transmitfrom node to node& the transport la'er brea"s up the message from the application la'erinto se eral smaller segments.


#alse Question 13

5 out of 5 points

(he transport la'er routes messages thought the networ" selecting the best path fromthe source to the destination station.



21/22


22/22

Documents

business data communications and Networking Quiz