Fibonacci Algorithms and Networking Concepts

Computer Power

• The capacity and capability of a computer system to perform tasks efficiently and effectively is referred to as computer power.
• Moore's Law states that the number of transistors on a computer chip doubles approximately every 18 months.
• Improvements in computer technology, such as multicore processors, result in faster, smaller, and more efficient computers.

Network Bandwidth

• Network bandwidth measures the maximum amount of data transferrable through a network connection per given time period.
• Data transfer rate is typically measured in bits per second (bps), kilobits per second (kbps), megabits per second (Mbps), or gigabits per second (Gbps).
• Nielsen's Law describes how user bandwidth doubles approximately every two years.
• 5G technology promises extremely high bandwidth (10 Gbps).

Connectivity Value

• Perceived or actual benefits and advantages resulting from network connectivity are refered to as Connectivity value.
• Metcalfe's Law states that the value of a network is proportional to the square of the number of users. A greater number of users generally increases the value of the network.

Algorithms

• An algorithm is a set of step-by-step instructions that produces a desired result.
• The Eratosthenes' sieve is an algorithm used to find all prime numbers up to a specified whole number.
• Artificial neural networks are computing systems inspired by biological neural networks that constitute animal brains. Their goal is to "learn" to perform tasks through various examples, often without any explicit programming rules involved.

Big Data

• Big data refers to exceptionally large, intricate, and varied datasets that are difficult to manage and analyze conventionally.
• Data is structured according to a certain format, otherwise it can be unstructured or semi-structured, depending on the case.
• The main characteristic features are described using the 3 V's model to assess the volume, velocity, and variety.
• The characteristics include Volume, Variety, Velocity, and Value.

Fibonacci Sequence

• The Fibonacci sequence is based on a series of numbers beginning with 0 and 1, in which each subsequent number is the sum of the two preceding ones.
• Fibonacci sequence examples can be found in nature, art, and certain patterns.

Big Data - 3+n V's

• Volume: size of data that is difficult to manage.
• Variety: different types of data, structured, semi-structured, and/or unstructured.
• Velocity: rate of data generation (how fast data is created).
• Value: insights and potential advantages to be derived from this data.
• Veracity: accuracy, authenticity, trustworthiness, and consistency of data.
• Variability: data flows that can fluctuate and have periodic peaks.
• Visualization: presenting data in a visual format suitable for our perception.

Algorithm Fibonacci 2

• An algorithm for calculating Fibonacci numbers using a recursive approach.
• It is less efficient than Algorithm Fibonacci 3, particularly when computing a large number of Fibonacci numbers.

Algorithm Fibonacci 3

• An algorithm for calculating Fibonacci numbers using memoization (dynamic programming).
• This approach results in significantly improved efficiency, compared to the recursive method.

Algorithm for Big O Notation

• Analysis of how the running time of a program/algorithm scales with the input size.
• Ignore lower order terms and constants.

Algorithm for K-means

• An iterative algorithm used for clustering data points into k groups.
• The algorithm will calculate the centroids and reassign the data points to the closest cluster until it converges.

Hashing

• A technique to convert values of any length into small indices, used to quickly find entries in very large datasets.
• Hash Tables use a hash function to map keys to array indices.
• Separate chaining: storing values with same hash index in a linked list.
• Open addressing: finding the next empty index if the hash index is already set.

Recommender Systems

• A filter that selects items relevant to a user’s tastes.
• Personalized recommender systems use user profiles and context to suggest items.
• Collaborative filtering relies on the preferences of other users with similar tastes.
• Content-based recommender systems suggest items with similar content.

Social Networks

• A network representation of relationships among individuals or entities.
• Measures such as diameter and clustering coefficients are used to evaluate the characteristics of a social network.

Introduction to Cybersecurity Attacks

• Cybersecurity attacks include backdoors, denial of service (DoS) attacks, distributed denial-of-service (DDoS) attacks, and direct access attacks as well as eavesdropping, tampering, and social engineering attacks.
• These attacks focus on gaining unauthorized access, stealing data, disrupting services, or causing damage to systems.

Cryptography

• The process of converting readable data (plaintext) into an unreadable format (ciphertext) to keep the data safe and secure during transmission.
• Symmetric cryptography uses one key for both encryption and decryption, while public-key cryptography uses two separate keys—one for encryption and one for decryption.

Digital Signatures

• A unique message digest is produced for every message, this is then encrypted by the sender's private key.
• The resulting encryption is the digital signature.
• The receiver can use the sender's public key to decrypt the signature and recreate the message digest.
• The message received can be verified if there is a match in the original message's digest in order to confirm the integrity.

Federated Learning

• A collaborative machine learning approach that trains models on decentralized data.
• Training occurs on multiple devices (Clients) without transferring raw data to a central server.
• The central server only receives processed data (Updates).

Bitcoin and Blockchain

• A decentralized cryptocurrency that uses blockchain technology for transactions.
• Blocks containing transactions are linked together in a blockchain.
• Processes such as “mining” are used to validate and confirm transactions.

Clustering

• A technique used to group similar data points together into clusters.
• Different methods (e.g. hierarchical clustering, K-means) are used to identify and build clusters.
• Distance metrics are used to measure the similarity between data points.

This quiz covers Fibonacci algorithms, specifically accuracy and efficiency, as well as networking concepts like Moore's and Nielsen's Laws. Participants will answer questions on algorithm calculations, terms and their definitions, and the significance of network bandwidth. Test your knowledge on these critical topics in computer science and telecommunications.