Network Topologies Quiz

A network topology where each device is directly connected to every other device.

A network topology where each device is connected to a central hub or switch.

A network topology where devices are connected in a linear fashion, with a single cable running through each device.

A network topology where devices are connected in a hierarchical tree-like structure.

A network topology where each device is connected to one or two other devices, forming a chain.

A network topology where each device has a dedicated connection to another device.

A square matrix where each entry represents the presence or absence of a connection between two specific nodes in a network.

A matrix where each entry represents the shortest distance between two nodes in a network.

Addition in GF(2)[x] is performed by adding the coefficients of corresponding powers of x using bitwise XOR.

Multiplication in GF(2)[x] involves a standard polynomial multiplication followed by a modulo operation with a reduction polynomial r(x) to ensure the degree of the result stays within the bounds of the field.

The reduction polynomial (r(x)) used in multiplication in GF(2)[x] is chosen to have a degree equal to the desired size of the field (n).

A polynomial is irreducible if it cannot be factored into two polynomials of strictly lower degree.

In GF(2)[x], the modulo operation with a reduction polynomial r(x) involves polynomial division, where the remainder is the result.

A finite field where the elements are polynomials with coefficients from GF(2), i.e., binary coefficients.

A field containing a finite number of elements.

A field where multiplication is defined by a modulo operation with respect to a reduction polynomial.

Addresses on layer 2 are used to uniquely identify devices within a local area network (LAN), allowing them to communicate directly without routing.

A special address that sends data to all devices in a local area network (LAN).

Addresses that target specific groups of devices within a LAN, allowing for efficient data delivery to a subset of recipients.

A unique identifier assigned to a network interface card (NIC), enabling devices to communicate on a LAN.

The portion of a MAC address that identifies the manufacturer of the network card.

A specific portion of a MAC address that differentiates one device from another within a network.

A flag in a MAC address indicating whether a specific device is intended to be globally unique or locally administered.

A special type of MAC address used to send targeted messages to specific groups of devices within a network.

A method for accessing a shared communication channel where stations listen before transmitting. If the medium is idle, they transmit. If the medium is busy, they wait a random amount of time and then try again.

An extension of CSMA that includes collision detection. Stations listen for collisions during transmission and if one occurs, they abort the transmission and send a jam signal. They then wait a random amount of time before trying to transmit again.

A variation of CSMA that is used in wireless networks. It works by detecting the presence of other stations wanting to transmit. If a station detects another station wanting to transmit, it will wait a random amount of time before trying again.

The minimum size of a message needed for collision detection in CSMA/CD. This ensures that a transmitting station can detect a collision before it has finished transmitting the entire message.

When a collision occurs in CSMA/CD, both stations involved in the collision stop transmitting and send a jam signal. This ensures that other stations are aware of the collision and can avoid transmitting until the medium becomes idle again.

The process of transmitting a message multiple times in CSMA/CD after a collision occurs. This is done to ensure that the message is successfully received by the destination.

WLAN uses acknowledgements on layer 2 because the transmission medium is unreliable. This ensures higher layer protocols can operate effectively, as it addresses the inherent unreliability of the wireless environment.

The sequence number in a WLAN frame helps identify missing frames and organize incoming frames for proper processing.

The 2-bit Version field indicates the version of the 802.11 standard used for the frame. Currently, versions 0 and 1 are defined in the 802.11 standard.

The "Type" field categorizes the frame, specifying whether it's a management frame, a data frame, or a control frame. This helps devices quickly recognize the frame's purpose.

The "SubType" field distinguishes frames within the same type. For example, within data frames, it indicates whether it's a data frame, a QoS data frame, or a null data frame.

The process of dividing a polynomial m'(x) by a reduction polynomial r(x) and obtaining the remainder c(x). This remainder is the checksum, which is used to detect errors in the transmitted data.

The polynomial used in CRC to compute the checksum. It determines the length of the checksum and the types of errors that can be detected.

A message m(x) that has been appended with n zeros to the right (m(x) * xn) before being used in CRC. This appending creates a space for the checksum.

A polynomial representation of data bits in a CRC system. Code words are used when calculating and verifying the checksum.

The checksum calculated in CRC represents potential errors detected during transmission. This is the remainder obtained from the modular division of m'(x) by r(x).

A common way to choose the reduction polynomial in CRC. It is a product of a polynomial p(x) and (x + 1), resulting in a non-irreducible polynomial. This allows detection of all odd-numbered bit errors in the data.

A standard CRC algorithm that has a reduction polynomial with 32 terms (coefficients). Used in Ethernet for error detection in data communication.