Brainscape's Knowledge GenomeTM

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


See full index

DATA COMMS > Part 3 > Flashcards

Part 3 Flashcards

1
Q

These are set of rules and regulations governing the orderly exchange of data within the network or a portion of the network.

A

Data Communications Protocol

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

It is data communications protocol in which a logical connection is established between the endpoints prior to the transmission of. the data, and it was designed to provide a high degree of reliability for data moving through the network.

A

Connection Oriented Protocol

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

A protocol where a connection process known as a handshake occurs between two stations before data are actually transmitted

A

Connection Oriented Protocol

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

These protocols require some means of acknowledging the data as they are being transmitted (protocols that use acknowledgement procedures provide a high level of network reliability).

A

Connection Oriented Protocol

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

It is a data communications protocol in which the data exchanged in an unplanned manner without prior coordination between endpoints, thus it offers a significant advantage in transmission speed.

A

Connectionless Protocol

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

They send data with a source and destination address without a handshake to ensure that the destination is ready to receive the data.

A

Connectionless Protocol

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

They are used because they are often more efficient, as the data being transmitted usually do not justify the extra overhead required connection oriented protocols.

A

Connectionless Protocol

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

Refers to the structure or format of the data within the message, which includes the sequence in which the data are sent.

A

Syntax

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

Refers to the meaning of each section of data.

A

Semantics

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

Is a character or group of characters generated at the receiving device to indicate to the sending device that information has been received either correctly or incorrectly.

A

Acknowledgement

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

These are set of rules implementing and governing an orderly exchange of data between two layer devices; it includes line discipline, flow control, and error control

A

Data Link Protocol

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

It coordinates hop-to-hop data delivery where a hop may be a computer, a network controller, or some type of network- connecting device.
It also determines which device is transmitting and which is receiving at any point in time.

A

Line Discipline

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

It is a frame, block, or packet of data, which identifies the receiving station.

A

Enquiry (ENQ)

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

It is the response of the destination station when it is ready to receive.

A

Positive Acknowledgement (ACK)

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

It is the response of the destination station when it is not ready to receive.

A

Negative Acknowledgement (NAK)

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

It is a solicitation sent from the primary station to a secondary station to determine if the secondary station has data to transmit.

A

Poll

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

It is the regulation of the rate of transmission of data frames. It coordinates the rate which data are transported over a link and
generally provides an acknowledgement mechanism.

A

Flow Control

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

It is a set of procedures that tells the transmitting station how much data it can send before it must stop transmitting and wait for an acknowledgment from the destination station.

A

Flow Control

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

The transmitting station sends one message frame and then waits for an acknowledgement before sending the next message frame; after it receives an acknowledgement, it transmits the next frame.

A

Stop-and Wait Flow Control

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

The source station can transmit several frames in succession before receiving an acknowledgement; there is only one acknowledgement for several transmitted frames, reduced acknowledgement.

A

Sliding Window Flow Control

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

The process of monitoring the received data and determining when a transmission error has occurred (i.e., it specifies means of detecting and correcting transmission errors).

A

Error Detection

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

A form of error detection by duplicating each data unit for the purpose of detecting errors. If the same character is not received twice, in succession, then a transmission has occurred.

A

Redundancy Checking

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

It has 50% error detection, and also the simplest error detection scheme used for data communications systems and is used with both VRC and HRC. A single bit (parity bit) is added to each character to force the total number of 1s in the character, including the parity bit, to be either an odd number (odd parity) or an even number (even parity).

A

Parity

24
Q

It is another form of redundancy error checking where each character has a numerical value assigned to it. The characters within a message are combined together to produce an error-checking character, which can be as simple as the arithmetic sum of the numerical values of all the characters in the message.

A

Checksum

25
Q

It is also known as character parity. It is an error detection scheme that uses parity to determine if a transmission error has occurred within a character.

A

Vertical Redundancy Check (VRC)

26
Q

Is the result of XORing the bits within a single character. It has a de facto standard of using odd parity.

A

VRC

27
Q

It is also known as message parity or LRC (longitudinal redundancy check). It is an error detection scheme that uses parity to determine if an error has occurred in a message.

A

Horizontal Redundancy Check (HRC)

28
Q

Is the result of XORing the character that make up a message and only even parity is used. The bit sequence of this error detection scheme is known as the BCS (block check sequence).

A

HRC

29
Q

It is probably the most reliable scheme for error detection. Approximately 99.999% of all transmission errors are detected. It is an error-detecting method in which the binary number corresponding to the group of bits to be checked is divided by a predetermined binary number.

A

Cyclic Redundancy Check (CRC)

30
Q

An error detection scheme that involves a polynomial, and the ____ character is the remainder of a division process using an XOR operation. If no transmission error occurred, the remainder will be zero.

A

CRC

31
Q

It is an error detection scheme in which if the data that is returned (reflected) from the receiver is the same with the data that is transmitted, then there is no error.

A

Echoplex

32
Q

Is an error detection scheme wherein the data that is transmitted has a count accompanying it. The number of 1s in each character is the same to determine if a transmission error has occurred.

A

Exact-Count Encoding

33
Q

It is an error correction scheme in which unique symbols are substituted for characters with errors.

A

Symbol Substitution

34
Q

It is an error correction scheme in which the receiving terminal automatically calls for retransmission of the entire message when it is received in error.

A

Retransmission/ARQ (automatic request for retransmission).

35
Q

It is an error correction scheme in which redundant bits are added to the message prior to transmission. When an error is detected, the redundant bits are used to determine which bit is in error. The purpose of FEC code is to eliminate the time wasted for retransmission

A

Forward Error Correction (FEC)

36
Q

It is the only error correction scheme that actually detects and corrects transmission error at the receive end without calling for retransmission of the entire message.

A

Forward Error Correction (FEC)

37
Q

It is an error-correcting code used for correcting transmission errors in synchronous data streams, however, it will correct only single bit errors, it cannot correct multiple errors or burst errors, and it cannot identify errors that occurs in the ________ bits themselves.

A

Hamming Code, hamming

38
Q

The ________ bits are inserted into a character at random locations (the combination of the data bits and the _________ bits is known as the _________ code).

A

Hamming

39
Q

Are errors with only one bit within a given a given string is in error.

A

Single bit errors

40
Q

Are errors with two or more non-consecutive bits within a message.

A

Multiple bit errors

41
Q

Are errors when two or more consecutive bits within a given data string are in error. It can affect one or more characters within a message.

A

Burst errors

42
Q

It can be a lost or a damaged message.

A

Error messages

43
Q

An error message that never arrives at the destination or one that is damaged to the extent that it is unrecognizable.

A

Lost messages

44
Q

An error message that is recognized at the destination but contains one or more transmission errors.

A

Damaged messages

45
Q

It interprets a frame of data as a group of successive bits combined into predefined patterns of fixed length, usually eight bits each (each group of bits represent a unique character).

A

Character (Byte) Oriented Protocol

46
Q

It is a discipline for serial by bit information transfer over a data communications channel.
It is a communications protocol that sees the transmitted data as an opaque stream of bits with no semantics, or meaning

A

Bit Oriented Protocol

47
Q

It was developed by Ward Christiansen, and was the first file transfer protocol designed to facilitate transferring data between two personal computers over the PSTN (it can also be used between a PC and a mainframe or host computer).

A

X-Modem Protocol

48
Q

It is similar to x-modem except that the information field has a minimum capacity 1024 bytes.

A

Y-Modem Protocol

49
Q

It was developed by Chuck Forsberg, which provides faster data transfer rates and error detection than x-modem.
It also supports enormous block sizes and following a communication failure allows transfers to resume from where they stopped.

A

Z-Modem Protocol

50
Q

It organizes data into 128-byte blocks and employs a CRC (cyclic redundancy check) for excellent error control.

A

Kermit

51
Q

Like x-modem, it was a communication protocol designed for file transfer over an asynchronous communication ports and dial-up modems that achieved some popularity during late 1980s.

A

Blocked Asynchronous Transmission (BLAST)

52
Q

It is a bit-oriented protocol developed by IBM in 1970 for use in SNA (system network architecture), and was the first link-layer protocol based on synchronous, bit-oriented operation.

A

Synchronous Data Link Control (SDLC)

53
Q

It is a bit-oriented protocol developed by ISO for communication over point-to-point and multipoint links, and it implements ARQ(Automatic Repeat Request) mechanism

A

High Level Data Link Control (HDLC)

54
Q

It is a modified high-level data link control protocol by ITU-T.

A

Link Access Procedure (LAP)

55
Q

Is the addition of extra bits to a data block to avoid the accidental generation of a flag pattern.

A

Bit stuffing

56
Q

Is a bit or sequence of bits that indicates the beginning or end of a certain packet.

A

Flag

DATA COMMS (6 decks)

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