ComputingNotes

Algorithm Analysis

by ComputingNotes
Resources: What is Algorithm? Asymptotic Notation In computer science, Asymptotic Notation is a mathematical language used to describe the efficiency of an algorithm as the input size (usually called $n$) grows toward infinity. It allows us to ignore hardware-specific details (like processor speed) and focus purely on how the time or space requirements of a ... Read More

Quantum Federated Learning with Qiskit

by ComputingNotes
Resources: What is Quantum Federated Learning? Quantum Federated Learning (QFL) is a decentralized machine learning framework where multiple clients collaboratively train a global quantum model without sharing their private, local data. In this framework, clients perform local training on their own datasets and then share only their updated model weights with a central server for ... Read More

Qiskit Machine Learning

by ComputingNotes
Resources: What is Qiskit Machine Learning? Qiskit Machine Learning is an open-source library built on top of the core Qiskit framework that integrates quantum computing with classical machine learning. It acts as a bridge, allowing researchers and developers to use quantum algorithms for tasks like classification, regression, and clustering. Instead of manually building every gate, ... Read More

Data Structure and Algorithms – Queues

by ComputingNotes
Resources: Queues are one of the most intuitive and widely used data structures in computer science. If you’ve ever waited in line at a coffee shop, ticket counter, or printer, you’ve already experienced a queue in real life! What is a Queue? A queue is an abstract data type that follows the FIFO principle – ... Read More

Calculus – Natural Logarithms

by ComputingNotes
Resources: What is Natural Logarithm? In calculus, the natural logarithm is the logarithm to the base e, where e is an irrational and transcendental constant approximately equal to 2.71828. Unlike base-10 logarithms (common logs), the natural logarithm, denoted as $ln(x)$, is preferred in calculus because it simplifies the differentiation and integration of exponential functions. 1. ... Read More

Euler’s Number $e$

by ComputingNotes
Resources: What is Euler’s Number? Euler’s number (e≈2.71828e is approximately equal to 2.71828) was first discovered by Swiss mathematician in Jacob Bernoulli in1683 while studying compound interest. However, it is named after Leonhard Euler, who popularized the constant, discovered its connection to calculus, calculated its value to 23 decimal places, and used the letter 𝑒 ... Read More

Calculus – Inverse Functions

by ComputingNotes
Resources: What is Inverse Function in Calculus? In calculus, an inverse function is a function that “undoes” the action of another function. If a function $f$ takes an input $x$ and gives an output y, its inverse $f^{−1}$ takes $y$ and brings you back to $x$. Mathematically: $f(x) = y \iff f^{-1}(y) = x$ 1. ... Read More

Data Structure and Algorithms – Stacks

by ComputingNotes
Resources: 1. What is Stack? A Stack is one of the most fundamental linear data structures in computer science. If you’ve ever piled up a stack of cafeteria trays or used the “Undo” button in a text editor, you’ve already interacted with a stack in the real world. A stack is a linear data structure ... Read More

Covert Communication

by ComputingNotes
References: What is Covert Communication? Covert communication, or Low Probability of Detection (LPD) communication, is a security technique designed to hide the very existence of a transmission. Unlike standard encryption, which hides the content of a message, covert communication hides the act of communicating from an observant adversary, often referred to as a “warden” (Willie). ... Read More
error: