Visit: The New Homepage

Visit: The New Homepage
Kindly click the image for the updated Notes Online

Sunday, February 3, 2013

Multiple Access - MCQs Answers

0 comments Posted by Anonymous at 4:00 PM
Hits:
Answers key in Multiple Access
Below are the answers key for the Multiple Choice Questions (Quiz) of Multiple Access.
  1. TDMA
  2. CSMA
  3. token passing
  4. CDMA
  5. CSMA/CD
  6. 1-persistent
  7. reservation
  8. token passing
  9. the same as
  10. token passing: token
  11. 18.4
  12. FDMA
  13. random access
  14. nonpersistent
  15. FDMA
  16. p-persistent
  17. CSMA/CA
  18. TDMA
  19. polling
  20. TDMA
  21. three
  22. polling
  23. three
  24. slotted ALOHA
  25. controlled access
  26. pure ALOHA
  27. CDMA
  28. CSMA/CA
  29. reservation
  30. two times
  31. 36.8
  32. Channelization
  33. CSMA
  34. three
  35. controlled access
  36.  the same as
  37. CSMA/CD
  38. CDMA

Back to Homepage


credit: Behrouz A. Forouzan©2013 www.FroydWess.com

Read More »

Multiple Access - MCQs

0 comments Posted by Anonymous at 3:57 PM
Hits:
Multiple choice questions in Multiple Access
In this particular topic you have learned Multiple Access. At this point, we can say that Data link layer divided into two functionality-oriented sublayers. The upper sublayer is responsible for data link control, and the lower sublayer is responsible for resolving access to the shared media. If you skip the summary visit Multiple Access .

Begin and Good luck!
  1. In _______, the stations share the bandwidth of the channel in time.
  2. In ______, the chance of collision can be reduced if a station senses the medium before trying to use it.
    • A)   CSMA
    • B)   MA
    • C)   CDMA
    • D)   FDMA
  3. In the _______ method, the stations in a network are organized in a logical ring.
    • A)   polling
    • B)   token passing
    • C)   reservation
    • D)   none of the above
  4. In _______, the sequences are generated using orthogonal codes such the Walsh tables.
    • A)   TDMA
    • B)   CDMA
    • C)   FDMA
    • D)   none of the above
  5. __________ augments the CSMA algorithm to detect collision.
    • A)   CSMA/CD
    • B)   CSMA/CA
    • C)   either (a) or (b)
    • D)   both (a) and (b)
  6. In the _________ method, after the station finds the line idle, it sends its frame immediately. If the line is not idle, it continuously senses the line until it finds it idle.
    • A)   p-persistent
    • B)   nonpersistent
    • C)   1-persistent
    • D)   none of the above
  7. In the _____ method, time is divided into intervals. In each interval, a reservation frame precedes the data frames sent in that interval.
    • A)   token passing
    • B)   reservation
    • C)   polling
    • D)   none of the above
  8. In the _______ method, each station has a predecessor and a successor.
    • A)   token passing
    • B)   polling
    • C)   reservation
    • D)   none of the above
  9. The vulnerable time for CSMA is the ________propagation time.
    • A)   three times
    • B)   two times
    • C)   the same as
    • D)   none of the above
  10. In the _________ method, a special packet called a ______ circulates through the ring.
    • A)   polling: poll request
    • B)   token passing: token
    • C)   reservation: control frame
    • D)   none of the above
  11. The maximum throughput for pure ALOHA is ________ per cent.
    • A)   36.8
    • B)   18.4
    • C)   12.2
    • D)   none of the above
  12. In ________, the available bandwidth is divided into frequency bands.
    • A)   TDMA
    • B)   CDMA
    • C)   FDMA
    • D)   none of the above
  13. In ___________ methods, no station is superior to another station and none is assigned the control over another.
    • A)   controlled access
    • B)   random access
    • C)   channelization
    • D)   none of the above
  14. In the ________method, a station that has a frame to send senses the line. If the line is idle, it sends immediately. If the line is not idle, it waits a random amount of time and then senses the line again.
    • A)   1-persistent
    • B)   nonpersistent
    • C)   p-persistent
    • D)   none of the above
  15. In ______, each station is allocated a band to send its data. In other words, each band is reserved for a specific station, and it belongs to the station all the time.
    • A)   CDMA
    • B)   FDMA
    • C)   TDMA
    • D)   none of the above
  16. In the _______method, after the station finds the line idle it sends or refrain from sending based on the outcome of a random number generator. If the line is busy, it tries again.
    • A)   p-persistent
    • B)   nonpersistent
    • C)   1-persistent
    • D)   none of the above
  17. To avoid collisions on wireless networks, ________was invented.
    • A)   CSMA/CD
    • B)   CSMA/CA
    • C)   either (a) or (b)
    • D)   both (a) and (b)
  18. In _____, each station is allocated a time slot during which it can send data. Each station transmits its data in its assigned time slot.
    • A)   TDMA
    • B)   CDMA
    • C)   FDMA
    • D)   none of the above
  19. In the _______ method, the primary device controls the link; the secondary devices follow its instructions.
    • A)   token passing
    • B)   reservation
    • C)   polling
    • D)   none of the above
  20. In _____, each station transmits its data in its assigned time slot.
    • A)   TDMA
    • B)   CDMA
    • C)   FDMA
    • D)   none of the above
  21. We discussed ________ channelization protocols.
    • A)   four
    • B)   three
    • C)   two
    • D)   none of the above
  22. In the ______ method, all data exchanges must be made through the primary device even when the ultimate destination is a secondary device.
    • A)   polling
    • B)   token passing
    • C)   reservation
    • D)   none of the above
  23. We discussed ______ popular controlled-access methods.
    • A)   four
    • B)   three
    • C)   two
    • D)   none of the above
  24. In __________, each station is forced to send only at the beginning of the time slot.
    • A)   pure ALOHA
    • B)   slotted ALOHA
    • C)   both (a) and (b)
    • D)   neither (a) nor (b)
  25. In _______ methods, the stations consult one another to find which station has the right to send.
    • A)   channelization
    • B)   random access
    • C)   controlled access
    • D)   none of the above
  26. In ________ each station sends a frame whenever it has a frame to send.
    • A)   slotted ALOHA
    • B)   pure ALOHA
    • C)   both (a) and (b)
    • D)   neither (a) nor (b)
  27. In ______, the stations use different codes to achieve multiple access.
    • A)   CDMA
    • B)   TDMA
    • C)   FDMA
    • D)   none of the above
  28. In _______, collisions are avoided through the use of three strategies: the interframe space, the contention window, and acknowledgments.
    • A)   CSMA/CD
    • B)   CSMA/CA
    • C)   either (a) or (b)
    • D)   both (a) and (b)
  29. In the ________ method, a station needs to make a reservation before sending data. Time is divided into intervals.
    • A)   token passing
    • B)   polling
    • C)   reservation
    • D)   none of the above
  30. In pure ALOHA, the vulnerable time is ______ the frame transmission time.
    • A)   two times
    • B)   three times
    • C)   the same as
    • D)   none of the above
  31. The maximum throughput for slotted ALOHA is ________ per cent.
    • A)   36.8
    • B)   18.4
    • C)   12.2
    • D)   none of the above
  32. _________ is a multiple-access method in which the available bandwidth of a link is shared in time, frequency, or through code, between different stations.
    • A)   Controlled access
    • B)   Channelization
    • C)   Random access
    • D)   none of the above
  33. ________ requires that each station first listen to the medium before sending.
    • A)   FDMA
    • B)   CDMA
    • C)   MA
    • D)   CSMA
  34. We have categorized access methods into _______ groups.
    • A)   five
    • B)   three
    • C)   four
    • D)   two
  35. In _______ methods, a station cannot send unless it has been authorized by other stations.
    • A)   controlled access
    • B)   channelization
    • C)   random access
    • D)   none of the above
  36. In slotted ALOHA, the vulnerable time is ______ the frame transmission time.
    • A)   two times
    • B)   three times
    • C)   the same as
    • D)   none of the above
  37. In ________, a station monitors the medium after it sends a frame to see if the transmission was successful. If so, the station is finished. If, however, there is a collision, the frame is sent again.
    • A)   CSMA/CD
    • B)   CSMA/CA
    • C)   either (a) or (b)
    • D)   both (a) and (b)
  38. _______ is based on coding theory and uses sequences of numbers called chips.
    • A)   TDMA
    • B)   CDMA
    • C)   FDMA
    • D)   none of the above

Back to Homepage

Note: Check your works. Multiple Access - MCQs Answers

credit: Behrouz A. Forouzan©2013 www.FroydWess.com

Read More »

Saturday, February 2, 2013

Multiple Access

0 comments Posted by Anonymous at 12:09 PM
Hits:
Review in Multiple Access

Definition of Terms

  • We can consider the data link layer as two sublayers. The upper sublayer is responsible for data link control, and the lower sublayer is responsible for resolving access to the shared media.
  • Many formal protocols have been devised to handle access to a shared link. We categorize them into three groups: random access protocols, controlled access protocols, and channelization protocols.
  • In random access or contention methods, no station is superior to another station and none is assigned the control over another.
  • ALOHA allows multiple access (MA) to the shared medium. There are potential collisions in this arrangement. When a station sends data, another station may attempt to do so at the same time. The data from the two stations collide and become garbled.
  • To minimize the chance of collision and, therefore, increase the performance, the CSMA method was developed. The chance of collision can be reduced if a station senses the medium before trying to use it. Carrier sense multiple access (CSMA) requires that each station first listen to the medium before sending. Three methods have been devised for carrier sensing: I-persistent, nonpersistent, and p-persistent.
  • Carrier sense multiple access with collision detection (CSMA/CD) augments the CSMA algorithm to handle collision. In this method, a station monitors the medium after it sends a frame to see if the transmission was successful. If so, the station is finished. If, however, there is a collision, the frame is sent again.
  • To avoid collisions on wireless networks, carrier sense multiple access with collision avoidance (CSMA/CA) was invented. Collisions are avoided through the use three strategies: the interframe space, the contention window, and acknowledgments. 
  • In CSMA/CA, the IFS can also be used to define the priority of a station or a frame.
  • In CSMA/CA, if the station finds the channel busy, it does not restart the timer of the contention window; it stops the timer and restarts it when the channel becomes idle.
  • In controlled access, the stations consult one another to find which station has the right to send. A station cannot send unless it has been authorized by other stations. We discussed three popular controlled-access methods: reservation, polling, and token passing.
  • In the reservation access method, a station needs to make a reservation before sending data. Time is divided into intervals. In each interval, a reservation frame precedes the data frames sent in that interval.
  • In the polling method, all data exchanges must be made through the primary device even when the ultimate destination is a secondary device. The primary device controls the link; the secondary devices follow its instructions.
  • In the token-passing method, the stations in a network are organized in a logical ring. Each station has a predecessor and a successor. A special packet called a token circulates through the ring.
  • Channelization is a multiple-access method in which the available bandwidth of a link is shared in time, frequency, or through code, between different stations. We discussed three channelization protocols: FDMA, TDMA, and CDMA.
  • In frequency-division multiple access (FDMA), the available bandwidth is divided into frequency bands. Each station is allocated a band to send its data. In other words, each band is reserved for a specific station, and it belongs to the station all the time.
  • In FDMA, the available bandwidth of the common channel is divided into bands that are separated by guard bands.
  • In time-division multiple access (TDMA), the stations share the bandwidth of the channel in time. Each station is allocated a time slot during which it can send data. Each station transmits its data in its assigned time slot.
  • In TDMA, the bandwidth is just one channel that is timeshared between different stations.
  • In code-division multiple access (CDMA), the stations use different codes to achieve multiple access. CDMA is based on coding theory and uses sequences of numbers called chips. The sequences are generated using orthogonal codes such the Walsh tables.
  • In CDMA, one channel carries all transmissions simultaneously.
  • The Point-to-Point Protocol (PPP) was designed to provide a dedicated line for users who need Internet access via a telephone line or a cable TV connection.
  • A PPP connection goes through these phases: idle, establishing, authenticating (optional), networking, and terminating. 
  • At the data link layer, PPP employs a version of HDLC.
  • The Link Control Protocol (LCP) is responsible for establishing, maintaining, configuring, and terminating links. 
  • Password Authentication Protocol (PAP) and Challenge Handshake Authentication Protocol (CHAP) are two protocols used for authentication in PPP.
  • PAP is a two-step process. The user sends authentication identification and a password. The system determines the validity of the information sent.
  • CHAP is a three-step process. The system sends a value to the user. The user manipulates the value and sends its result. The system verifies the result.
  • Network Control Protocol (NCP) is a set of protocols to allow the encapsulation of data coming from network layer protocols; each set is specific for a network layer protocol that requires the services of PPP.
  • Internetwork Protocol Control Protocol (IPCP), an NCP protocol, establishes and terminates a network layer connection for IP packets.    

Data link layer divided into two functionality-oriented sublayers

Two layers of Data link

Three Categories of Multiple Access Protocols

  • Random access method- the stations consult one another to find which station has the right to send. A station cannot send unless it has been authorized by other stations.
  • Controlled access method - there is no access control (as there is in controlled access methods) and there is no predefined channels (as in channelization). Each station can transmit when it desires. This liberty may create collision. The whole available bandwidth belongs to the station that wins the contention; the other stations needs to wait.
  • Channelization - the available bandwidth is divided between the stations. If a station does not have data to send, the allocated channel remains idle.

Taxonomy of multiple-access protocols discussed in this chapter

multiple-access protocols

Formula: The throughput for pure ALOHA

The throughput for pure ALOHA

Formula: The throughput for slotted ALOHA

The throughput for slotted ALOHA

Flow diagram for three persistence methods

Flow diagram for three persistence methods

Flow diagram for the CSMA/CD

Flow diagram for the CSMA/CD

The number of sequences in a Walsh table

The number of sequences in a Walsh table

Note: You can proceed to take the multiple choice exam regarding this topic. Multiple Access - Set 1 MCQs

credit: Behrouz A. Forouzan©2013 www.FroydWess.com

Read More »

Friday, February 1, 2013

Data Link Control - MCQs Answers

0 comments Posted by Anonymous at 10:42 PM
Hits:
Answers key in Data Link Control MCQs
Below are the answers key for the Multiple Choice Questions (Quiz) of Data Link Control.
  1. 1
  2. 7
  3. noisy
  4. Stop-and-Wait ARQ; Stop-and-Wait
  5. LCP
  6. High-level data link control
  7. 16
  8. 31
  9. modulo-2
  10. 16
  11. Flow
  12. modulo-256
  13. Error
  14. 0 to 63
  15. sliding window
  16. ABM
  17. flag
  18. Simplest
  19. byte-oriented
  20. exactly 10
  21. Variable-size
  22. Flow
  23. character-oriented
  24. fixed-size
  25. Selective-Repeat ARQ and Go-Back-N ARQ
  26. NRM
  27. bit-oriented
  28. variable-size
  29. bit-oriented
  30. flag
  31. Go-Back-N ARQ
  32. noiseless
  33. Stop-and-Wait
  34. modulo-2
  35. Simplest
  36. Error
  37. CHAP
  38. PAP
  39. Selective-Repeat ARQ
  40. bit-oriented; bit stuffing
  41. Stop-and-Wait
  42. 1
  43. Automatic repeat request
  44. Framing
  45. node-to-node
  46. character-oriented; byte stuffing

Back to Homepage


credit: Behrouz A. Forouzan©2013 www.FroydWess.com
Read More »

Data Link Control - MCQs

0 comments Posted by Anonymous at 10:39 PM
Hits:
Multiple choice questions in Data Link Control
In this particular topic you have learned Data link control that deals with the design and procedures for communication between two adjacent nodes: node-to-node communication. Data link control functions include framing, flow and error control, and software-implemented protocols that provide smooth and reliable transmission of frames between nodes. If you skip the summary visit Data Link Control .

Begin and Good luck!
  1. In Go-Back-N ARQ, if 5 is the number of bits for the sequence number, then the maximum size of the receive window must be _____.
    • A)   1
    • B)   15
    • C)   16
    • D)   31
  2. In Go-Back-N ARQ, if frames 4, 5, and 6 are received successfully, the receiver may send an ACK _______ to the sender.
    • A)   6
    • B)   7
    • C)   5
    • D)   any of the above
  3. The Stop-And-Wait ARQ, Go-Back-N ARQ, and the Selective Repeat ARQ are for ______ channels.
    • A)   noiseless
    • B)   noisy
    • C)   either (a) or (b)
    • D)   neither (a) nor (b)
  4. The _________Protocol, adds a simple error control mechanism to the _______Protocol.
    • A)   Selective Repeat ARQ; Go-Back-N ARQ
    • B)   Go-Back-N ARQ; Stop-and-Wait
    • C)   Stop-and-Wait ARQ; Stop-and-Wait
    • D)   none of the above
  5. In PPP, the ________ is responsible for establishing, maintaining, configuring, and terminating links.
    • A)   PAP
    • B)   CHAP
    • C)   LCP
    • D)   NCP
  6. HDLC is an acronym for _______.
    • A)   Half-duplex digital link combination
    • B)   Host double-level circuit
    • C)   High-duplex line communication
    • D)   High-level data link control
  7. In Selective Repeat ARQ, if 5 is the number of bits for the sequence number, then the maximum size of the receive window must be _____.
    • A)   1
    • B)   15
    • C)   16
    • D)   31
  8. In Go-Back-N ARQ, if 5 is the number of bits for the sequence number, then the maximum size of the send window must be _____.
    • A)   1
    • B)   15
    • C)   16
    • D)   31
  9. In Stop-and-Wait ARQ, the acknowledgment number always announces in ______ arithmetic the sequence number of the next frame expected.
    • A)   modulo-m
    • B)   modulo-2
    • C)   modulo-4
    • D)   none of the above
  10. In Selective Repeat ARQ, if 5 is the number of bits for the sequence number, then the maximum size of the send window must be _____.
    • A)   1
    • B)   15
    • C)   16
    • D)   31
  11. _______ control refers to a set of procedures used to restrict the amount of data that the sender can send before waiting for acknowledgment.
    • A)   Flow
    • B)   Error
    • C)   Transmission
    • D)   none of the above
  12. In the Go-Back-N Protocol, if the size of the sequence number field is 8, the sequence numbers are in ________ arithmetic,
    • A)   modulo-256
    • B)   modulo- 8
    • C)   modulo-2
    • D)   none of the above
  13. ______ control refers to methods of error detection and correction.
    • A)   Flow
    • B)   Error
    • C)   Transmission
    • D)   none of the above
  14. In a Go-Back-N ARQ, if the window size is 63, what is the range of sequence numbers?
    • A)   1 to 63
    • B)   1 to 64
    • C)   0 to 63
    • D)   0 to 64
  15. Both Go-Back-N and Selective-Repeat Protocols use a _________.
    • A)   sliding window
    • B)   sliding frame
    • C)   sliding packet
    • D)   none of the above
  16. In _________, the configuration is balanced. The link is point-to-point, and each station can function as a primary and a secondary.
    • A)   ARM
    • B)   ABM
    • C)   NBM
    • D)   NRM
  17. Byte stuffing means adding a special byte to the data section of the frame when there is a character with the same pattern as the ______.
    • A)   trailer
    • B)   flag
    • C)   header
    • D)   none of the above
  18. The ______ Protocol has neither flow nor error control.
    • A)   Selective-Repeat ARQ
    • B)   Go-Back-N ARQ
    • C)   Stop-and-Wait
    • D)   Simplest
  19. The most common protocol for point-to-point access is the Point-to-Point Protocol (PPP), which is a _________protocol.
    • A)   byte-oriented
    • B)   bit-oriented
    • C)   character-oriented
    • D)   none of the above
  20. For Stop-and-Wait ARQ, for 10 data packets sent, _______ acknowledgments are needed.
    • A)   less than 10
    • B)   more than 10
    • C)   exactly 10
    • D)   none of the above
  21. _________framing uses two categories of protocols: character-oriented and bit-oriented.
    • A)   Standard
    • B)   Fixed-size
    • C)   Variable-size
    • D)   None of the above
  22. _______ control refers to a set of procedures used to restrict the amount of data that the sender can send before waiting for acknowledgment.
    • A)   Flow
    • B)   Error
    • C)   Transmission
    • D)   none of the above
  23. In a ________ protocol, the data section of a frame is a sequence of characters.
    • A)   bit-oriented
    • B)   character-oriented
    • C)   either (a) or (b)
    • D)   none of the above
  24. In _______ framing, there is no need for defining the boundaries of frames.
    • A)   standard
    • B)   fixed-size
    • C)   variable-size
    • D)   none of the above
  25. The _______Protocol has both flow control and error control.
    • A)   Stop-and-Wait
    • B)   Selective-Repeat ARQ
    • C)   Go-Back-N ARQ
    • D)   both (b) and (c)
  26. In _________, the station configuration is unbalanced. We have one primary station and multiple secondary stations.
    • A)   ARM
    • B)   NBM
    • C)   NRM
    • D)   ABM
  27. In a _________ protocol, the data section of a frame is a sequence of bits.
    • A)   bit-oriented
    • B)   byte-oriented
    • C)   either (a) or (b)
    • D)   none of the above
  28. In ________ framing, we need a delimiter (flag) to define the boundary of two frames.
    • A)   standard
    • B)   fixed-size
    • C)   variable-size
    • D)   none of the above
  29. High-level Data Link Control (HDLC) is a _______ protocol for communication over point-to-point and multipoint links.
    • A)   byte-oriented
    • B)   bit-oriented
    • C)   character-oriented
    • D)   none of the above
  30. Bit stuffing means adding an extra 0 to the data section of the frame when there is a sequence of bits with the same pattern as the ________.
    • A)   trailer
    • B)   flag
    • C)   header
    • D)   none of the above
  31. In the _________Protocol, if no acknowledgment for a frame has arrived, we resend all outstanding frames.
    • A)   Go-Back-N ARQ
    • B)   Selective-Repeat ARQ
    • C)   Stop-and-Wait ARQ
    • D)   none of the above
  32. The Simplest Protocol and the Stop-and-Wait Protocol are for ______ channels.
    • A)   noiseless
    • B)   noisy
    • C)   either (a) or (b)
    • D)   neither (a) nor (b)
  33. The _______Protocol has flow control, but not error control.
    • A)   Selective-Repeat ARQ
    • B)   Stop-and-Wait
    • C)   Simplest
    • D)   Go-Back-N ARQ
  34. In Stop-and-Wait ARQ, we use sequence numbers to number the frames. The sequence numbers are based on __________arithmetic.
    • A)   modulo-m
    • B)   modulo-2
    • C)   modulo-4
    • D)   none of the above
  35. In the _____ Protocol, the sender sends its frames one after another with no regard to the receiver.
    • A)   Simplest
    • B)   Selective-Repeat ARQ
    • C)   Stop-and-Wait
    • D)   Go-Back-N ARQ
  36. _________control in the data link layer is based on automatic repeat request, which is the retransmission of data.
    • A)   Flow
    • B)   Error
    • C)   Transmission
    • D)   none of the above
  37. In PPP, _______ is a three-way hand-shaking authentication protocol in which the password is kept secret; it is never sent online.
    • A)   PAP
    • B)   LCP
    • C)   NCP
    • D)   CHAP
  38. In PPP, ________ is a simple authentication procedure with a two-step process:
    • A)   CHAP
    • B)   PAP
    • C)   LCP
    • D)   NCP
  39. In the _________ protocol we avoid unnecessary transmission by sending only frames that are corrupted.
    • A)   Selective-Repeat ARQ
    • B)   Stop-and-Wait ARQ
    • C)   Go-Back-N ARQ
    • D)   none of the above
  40. In ________ protocols, we use ________.
    • A)   byte-oriented; bit stuffing
    • B)   bit-oriented; bit stuffing
    • C)   character-oriented; bit stuffing
    • D)   none of the above
  41. In the _____ Protocol, the sender sends one frame, stops until it receives confirmation from the receiver, and then sends the next frame.
    • A)   Simplest
    • B)   Stop-and-Wait
    • C)   Selective-Repeat ARQ
    • D)   Go-Back-N ARQ
  42. Stop-and-Wait ARQ is a special case of Go-Back-N ARQ in which the size of the send window is ___.
    • A)   1
    • B)   2
    • C)   8
    • D)   none of the above
  43. ARQ stands for _______.
    • A)   Acknowledge repeat request
    • B)   Automatic retransmission request
    • C)   Automatic repeat quantization
    • D)   Automatic repeat request
  44. _______ in the data link layer separates a message from one source to a destination, or from other messages going from other sources to other destinations.
    • A)   Controlling
    • B)   Framing
    • C)   Digitizing
    • D)   none of the above
  45. Data link control deals with the design and procedures for ______ communication.
    • A)   node-to-node
    • B)   process-to-process
    • C)   host-to-host
    • D)   none of the above
  46. In _________ protocols, we use ________.
    • A)   bit-oriented; character stuffing
    • B)   character-oriented; bit stuffing
    • C)   character-oriented; byte stuffing
    • D)   none of the above

Back to Homepage

Note: Check your works. Data Link Control - MCQs Answers

credit: Behrouz A. Forouzan©2013 www.FroydWess.com

Read More »
 

© 2013 - 2014. All Rights Reserved | Online Notes and Lectures | Customized by MovieOnMovie

Home | | | Top ▲