A stack operates on a Last In, First Out (LIFO) principle, meaning the last element added is the first one to be removed.

Arrays allow random access to elements using indices, which is a key characteristic.

AVL trees maintain a height of log(n) for n nodes, ensuring efficient operations.

BFS uses a queue to explore nodes level by level.

DFS can be implemented using recursion, which allows it to explore as far as possible along each branch before backtracking.

Dijkstra's algorithm can be used for both directed and undirected graphs, provided that all edge weights are non-negative.

Dynamic programming is characterized by storing the results of subproblems to avoid redundant calculations, which improves efficiency.

Fiber optic cables have a higher bandwidth than copper cables, allowing for faster data transmission over longer distances.

Heap Sort is an in-place sorting algorithm, meaning it does not require additional storage proportional to the input size.

Hierarchical clustering can produce a dendrogram, which is a tree-like diagram that shows the arrangement of the clusters.

HTTP/2 introduces multiplexing of streams, allowing multiple requests and responses to be sent simultaneously over a single connection.

HTTP/2 introduces multiplexing, allowing multiple requests and responses to be sent simultaneously over a single connection.

HTTP is a stateless protocol, meaning each request from a client to a server is treated as an independent transaction.

K-means clustering partitions data into non-overlapping clusters, assigning each data point to the nearest centroid.

LL(1) parsing is a top-down parsing method that does not require backtracking and cannot handle left recursion.

Merge Sort divides the array into halves recursively before merging them back together.

Neural networks can learn complex patterns through multiple layers of interconnected nodes, making them versatile.

Quick Sort is an in-place sorting algorithm.

In Red-Black Trees, every node is colored either red or black, and there are specific properties that maintain balance, including that no two red nodes can be adjacent.

SVM can handle multi-class classification problems using strategies like one-vs-one or one-vs-all.

TCP (Transmission Control Protocol) is a connection-oriented protocol that provides reliable data transfer and error recovery.

HTTP is a stateless protocol, meaning each request from a client to a server is treated as an independent transaction.

Merge Sort divides the array into halves recursively until it reaches individual elements, then merges them back together.

The OSI model is a theoretical framework that standardizes the functions of a telecommunication or computing system into seven abstraction layers.

Quick Sort uses a pivot element to partition the array into subarrays.

TCP (Transmission Control Protocol) is a connection-oriented protocol that ensures ordered delivery of packets.

Unsupervised learning aims to find hidden patterns or intrinsic structures in input data without the need for labeled outputs.

192.168.1.1 is a Class C IP address, which ranges from 192.0.0.0 to 223.255.255.255.

Classifying emails as spam or not spam is a classification problem, as it involves categorizing data into discrete classes.

ReLU (Rectified Linear Unit) is a common activation function used in CNNs due to its simplicity and effectiveness in training deep networks.