Sometimes it’s difficult to have a birds eye view over an entire site; here’s Baeldung on Computer Science from 10000 feet:
Expand All
-
November 2023
(19)
- 27: ReLU vs. LeakyReLU vs. PReLU (0)
- 26: How to Calculate the VC-Dimension of a Classifier? (0)
- 23: What Are i.i.d. Random Variables? (0)
- 23: Why Does ChatGPT Not Give the Answer All at Once? (0)
- 23: How to Handle Missing Data in Logistic Regression? (0)
- 21: Do 32-bit Apps Run Faster or Slower on 64-bit Operating Systems? (0)
- 21: Shell vs. Kernel vs. API (0)
- 20: Test Scenario vs. Test Case (0)
- 17: How to Compare Two Algorithms Empirically? (0)
- 16: How is a Quantum Computer Faster Than a Regular Computer? (0)
- 13: Why Does TCP/IP Use Big-Endian Encoding? (0)
- 13: Systems Design: Interface Segregation Principle (0)
- 12: Feature Driven Development (0)
- 12: Overleaf Tutorial (0)
- 12: How to Detect Spoofed Packets? (0)
- 05: Wireless Authentication Protocols (0)
- 05: Networking: DHCP vs. NAT (0)
- 05: How to Handle Unbalanced Data With SMOTE? (0)
- 05: SSL Overhead: What It Is and How to Reduce It? (0)
-
October 2023
(26)
- 31: How to Plot Logistic Regression’s Decision Boundary? (0)
- 31: How Does Rolling Code Work? (0)
- 30: Finding the “Visual” Center of a Polygon (0)
- 28: What’s the Difference Between Cross-Entropy and KL Divergence? (0)
- 27: Saturating Non-Linearities (0)
- 26: What Is JSONP? (0)
- 26: Latent and Embedding Space (0)
- 26: Data Access Layer Explained (0)
- 26: What Is A Hopfield Network? (0)
- 23: Euler Circuits and Paths: Fleury’s Algorithm (0)
- 21: Site Reliability Engineering (0)
- 21: Partially Mapped Crossover in Genetic Algorithms (0)
- 20: What Benefit Is Conferred by TCP Timestamp? (0)
- 20: LaTeX vs. Word: Main Differences (0)
- 19: Differences Between Verification and Validation in Software Testing (0)
- 18: Matrix Chain Multiplication Using Dynamic Programming (0)
- 18: What Is Sharding? (0)
- 18: Cryptography: Rail Fence Cipher Technique (0)
- 15: Neural Networks: Strided Convolutions (0)
- 14: What Are the Advantages of Kernel PCA Over Standard PCA? (0)
- 08: What Are Data Pipelines? (1)
- 08: How to Encode a Chess Board State Throughout a Game? (0)
- 07: How Do Multi-Level Page Tables Save Memory Space? (0)
- 07: Differences Between Repository and Service? (0)
- 05: How Do AI Image Generators Work? (0)
- 03: What Is Usability Testing? (0)
-
September 2023
(31)
- 29: What Is TinyML? (0)
- 29: What Are Requirements Traceability Matrixes? (0)
- 29: Vertex Coloring in Graphs (0)
- 26: How to Make a School Timetable? (0)
- 26: Infrastracture as a Code (0)
- 26: Length Extension Attack (0)
- 22: How to Convert Radians to Degrees and Vice Versa? (0)
- 22: Open Source Explained (0)
- 22: Context Switches in Operating Systems (0)
- 22: Confidence Intervals (0)
- 20: GMMs for Clustering (0)
- 20: Converting Light Frequency to RGB (0)
- 20: What is RFID and How Does It Work? (0)
- 20: What Is a Software Build? (0)
- 20: Draw Timeline in LaTeX (0)
- 20: What is the Cost of Many TIME_WAITs on the Server Side? (0)
- 20: CPU and I/O Burst Cycles (0)
- 16: How to Rotate a Two-Dimensional Array (0)
- 14: Avoiding Single Points of Failures in Distributed Systems (0)
- 12: How Attackers Exploit robots.txt? (0)
- 12: How Does Gratuitous ARP Work? (0)
- 12: Popular Authentication Methods for Web Apps (0)
- 12: What Is Bundle Adjustment? (0)
- 10: Introduction to the Student’s t-distribution (0)
- 07: Part-of-Speech Tagging With Hidden Markov Model (0)
- 07: Differences Between Byte-addressed and Word-addressed Memory (0)
- 05: Mobile Device Security (0)
- 05: Data Quality Explained (0)
- 04: Database, Table, and Column Naming Conventions (0)
- 01: Microservices vs. Service-Oriented Architecture (0)
- 01: Differences Between Hackers and Crackers (0)
-
August 2023
(41)
- 31: Software Testing: State Transition (0)
- 30: Networking: Rogue Access Points and Evil Twins (0)
- 29: Differences Between REST and RPC (0)
- 28: Outbox Pattern in Microservices (0)
- 27: Prevent the Vanishing Gradient Problem with LSTM (0)
- 27: How Do ID Tokens Work? (0)
- 26: How Does Chosen Ciphertext Attack Work? (0)
- 25: Single SSL Certificate on Multiple Servers (0)
- 24: Interpolation Search (0)
- 23: The Power and Promise of Explainable AI (0)
- 23: How Does MPEG-4 Compression Work? (0)
- 23: Importance of Statistics in Machine Learning (0)
- 23: Information Security Incident and Event Management (0)
- 22: Unit Digit in Exponentiation: How to Compute It? (0)
- 22: Introduction to Message Queues (0)
- 19: What Are Access and Refresh Tokens? (0)
- 19: Introduction to LyX (0)
- 19: How to Choose a Default Port Number for a New Network Service? (0)
- 19: Encryption: ECDSA vs. RSA Keys (0)
- 18: How to Do Early Stopping? (0)
- 16: Machine Learning vs. Deep Learning (0)
- 16: Methods to Protect Software From Piracy (0)
- 16: How Does Proof of Stake Work? (0)
- 14: Event-Driven Architecture (0)
- 14: What Are the Differences Between DevOps and Site Reliability Engineering? (0)
- 14: An Introduction to Graph Neural Networks (0)
- 14: Differences Between Faking, Mocking and Stubbing (0)
- 14: Software Testing: Decision Table (0)
- 14: Software Testing: Equivalence Partitioning (0)
- 14: Step-By-Step Installation of Lyx on Linux, macOS, and Windows (0)
- 12: Gaussian Mixture Models (0)
- 12: Differences Between Unicode Encodings (0)
- 09: Python for Machine Learning (0)
- 07: Can a Virus Be Inserted in an Image? (0)
- 07: Software Testing: Defect, Bug, Error, and Failure (0)
- 06: Difference Between Full, Complete, and Perfect Tree (0)
- 06: Access to a Site on localhost from Remote (0)
- 06: How to Measure Sortedness? (0)
- 04: Why Is ChatGPT Bad at Math? (0)
- 02: Deauthentication Attacks (0)
- 02: Entry and Exit Criteria in Software Testing (0)
-
July 2023
(34)
- 31: Differences Between an NMS and an EMS (0)
- 31: What Are Cryptojacking Attacks? (0)
- 31: Online Transaction Processing vs. Online Analytical Processing (0)
- 31: Introduction to AI Ethics (0)
- 29: An Introduction to Deepfakes (0)
- 29: What Is Singular Value Decomposition? (0)
- 28: Software Test Life Cycle (0)
- 28: What Is a Direct Mapped Cache? (0)
- 28: What Are Broadcast Storms? (0)
- 25: Bagging, Boosting, and Stacking in Machine Learning (0)
- 24: Introduction to Spiking Neural Networks (0)
- 24: Software Testing: Boundary Value Analysis (0)
- 22: Operating Systems for IoT (0)
- 22: Typed vs. Untyped Languages (0)
- 18: What Is Ethical Hacking? (0)
- 15: Creating a Curriculum Vitae with LaTeX (0)
- 15: Focal Length and Intrinsic Camera Parameters (0)
- 15: What Is Bandwidth Throttling? (0)
- 14: The Drawbacks of K-Means Algorithm (0)
- 14: Difference Between Lock and Latch in Database (0)
- 14: Data Classification (0)
- 14: The Difference Between Type and Class (0)
- 13: From RNNs to Transformers (0)
- 11: Security: a Brief Review of Claims-Based Authentication (0)
- 09: Playfair Cipher (0)
- 09: The Different Types of Computer Graphics (0)
- 09: Advanced Persistent Threats (0)
- 09: DHCP: Why UDP and Not TCP? (0)
- 06: Collision Domain vs. Broadcast Domain (0)
- 02: Procedural Generation of Computer Game Maps (0)
- 02: What Is Data Science? (0)
- 02: How Does ChatGPT Work? (0)
- 02: Understanding the Monte Carlo Simulation (0)
- 02: How to Prevent Session Hijacking? (0)
-
June 2023
(47)
- 30: TCP Socket No Connection Timeout (0)
- 29: System Design: Dependency Inversion Principle (0)
- 26: What Is Zero Trust Security? (0)
- 22: VRF vs. VLAN vs. Subnet (0)
- 22: The Complexity of Binary Search (0)
- 22: What Are Key Derivation Functions? (0)
- 21: What Is Exploratory Testing? (0)
- 20: How Does the Amazon Recommendation System Work? (0)
- 20: Bluetooth vs. Wi-Fi (0)
- 20: Successive Refinement (0)
- 20: Blockchains: What Is Proof of Work? (0)
- 18: Redirection Status Codes: 301, 302, 307, and 308 (0)
- 18: Presenting Research Results in a Paper (0)
- 17: How to Draw Work Breakdown Structures with LaTeX/TikZ (0)
- 17: Load Testing vs. Stress Testing (0)
- 17: How Does Timsort Work? (0)
- 16: Machine Learning: Analytical Learning (0)
- 16: Statistics: Correlation vs. Regression (0)
- 16: Positive and Negative Testing (0)
- 16: The C Parameter in Support Vector Machines (0)
- 14: How to Design Simulation Experiments? (0)
- 13: Software Development and Testing Life Cycles (0)
- 13: An Introduction to Search Engine Optimization (0)
- 13: Introduction to Storage for Data Centers (0)
- 12: Differences Between Multiprotocol Label Switching and Virtual Private LAN Service (0)
- 11: An Introduction to Botnets (0)
- 11: Understanding DevSecOps (0)
- 11: FTPS vs. SFTP vs. SCP (0)
- 11: NLP vs. NLU vs. NLG (1)
- 11: Understanding Text Mining (0)
- 11: How Do QR Codes Work? (0)
- 11: Pre-master Secret vs. Master Secret vs. Private Key vs. Shared Secret (0)
- 10: Multiple Figures With the Same Caption in LaTeX (0)
- 10: Differences Between SQL and NoSQL (0)
- 10: How Does Database Indexing Work? (0)
- 10: Menger’s Theorem (0)
- 09: What Are Functions as a Service? (0)
- 09: Differences Between Servers and Desktops (0)
- 07: Clipping in Computer Graphics (0)
- 06: Artificial Intelligence Agents Explained (0)
- 06: How to Count the Occurrences of a Digit In a Range of Integers? (0)
- 06: Statements and Queries in SQL (0)
- 04: IP Fragmentation and Reassembly (0)
- 04: Finding the Origin of Increased Latency (1)
- 04: How Does Face Recognition Work? (0)
- 04: Flash Memory: NOR vs. NAND (0)
- 02: Software Engineering vs. Data Science (0)
-
May 2023
(60)
- 31: Recursive and Iterative Enumeration of All k-Combinations (0)
- 31: Deterministic vs. Stochastic Policies in Reinforcement Learning (0)
- 31: Disk Scheduling: LOOK and CLOOK Algorithms (0)
- 31: Projection in Computer Graphics (0)
- 31: What Is the K-Core of a Graph? (0)
- 31: Network Flow: Dinic’s Algorithm (0)
- 31: Introduction to Large Language Models (0)
- 30: The Optimal Page Replacement Algorithm (0)
- 29: Error Detection: Hamming Code (0)
- 29: The Readers Writers Problem (0)
- 29: Risk Management (0)
- 29: Binomial Heaps (0)
- 29: Hungarian Notation (0)
- 29: In-Place Sorting With Merge Sort (0)
- 29: Understanding the Randomized Quicksort (0)
- 29: File Sharing: NFS vs SMB vs CIFS (0)
- 27: Constructive Algorithms for Graph Colouring (0)
- 27: What Is and Why Use Temperature in Softmax? (0)
- 26: Why Does RTP Use UDP Instead of TCP? (0)
- 24: What Does TCP DUP ACK Mean? (0)
- 24: The Printer-Spooler Problem (0)
- 22: Different Types of DNS Records (0)
- 21: How Do Self-Organizing Maps Work? (0)
- 21: What Are Impersonation Attacks? (0)
- 21: Linear vs Differential Cryptanalysis (0)
- 21: How to Narrow Down a Research Problem? (0)
- 21: Channelization Protocols Explained (0)
- 21: Tetris Piece Rotation Algorithm (0)
- 21: How to Read Barcodes (0)
- 20: How to Write a Good Literature Review? (1)
- 18: Best Open-Source Mixed Integer Optimization Solver (0)
- 18: Cross-Site Scripting (XSS) Explained (0)
- 17: Priority Inversion (1)
- 16: Data Structures: Randomized Search Trees (RSTs) (0)
- 15: Differences Between POP3 and IMAP Email Protocols (0)
- 12: Spam Explained (0)
- 12: Optical Flow: Lucas-Kanade Method (0)
- 11: What and Where Are the Memory Stack and Heap? (0)
- 11: The Bounded-Buffer Problem (0)
- 11: Regular Expression for Checking if a String Is a Valid URL (0)
- 11: URL Matrix Parameters vs Query Parameters (0)
- 11: Algorithm for Online Outlier Detection in Time Series (0)
- 11: Traveling Salesman Problem: Exact Solutions vs. Heuristic vs. Approximation Algorithms (0)
- 11: OS-Specific Software (0)
- 09: Practical Examples of the Big O Notation (0)
- 09: The Different Types of Backups in Computing (0)
- 08: What is Smoke Testing? (0)
- 08: IPV6: Stateful vs. Stateless (0)
- 08: Security: What Does It Mean to “Burn a Zero-Day”? (0)
- 07: What Is Consistent Hashing? (0)
- 06: Serialization vs. Marshaling (0)
- 05: Controlled Access Protocols: Token Passing (0)
- 05: What Is Gradient Orientation and Gradient Magnitude? (0)
- 05: How to Analyze Loss vs. Epoch Graphs? (0)
- 02: Introduction to Macros in Latex (0)
- 02: What Are Sessions? How Do They Work? (0)
- 02: The Rod Cutting Problem in Computing (0)
- 02: Figuring out Subnet ID and Host ID from an IP Address (0)
- 02: Oligomorphic vs. Polymorphic vs. Metamorphic Viruses (0)
- 01: The Concepts of Dense and Sparse in the Context of Neural Networks (0)
-
April 2023
(75)
- 30: Security: Interruption vs. Interception vs. Modification vs. Fabrication (0)
- 30: Transport Layer: Multiplexing and Demultiplexing (0)
- 30: Virtual Memory: Second Chance Replacement (0)
- 30: Distributed Systems: Thin and Thick Clients (0)
- 30: Microservices vs. Monolithic Architectures (0)
- 27: What Is Ad Hoc Testing? (0)
- 26: What Are Contours in Computer Vision? (0)
- 26: Basics of One-time Passwords (0)
- 26: The Ostrich Algorithm (0)
- 26: Difference Between MTU and MSS (0)
- 26: What Is Mob Programming? (0)
- 23: Software Metrics: Lines of Code (0)
- 23: Real-Time Systems (0)
- 23: Differences Between Raster and Vector Graphics (0)
- 23: What’s a Non-trainable Parameter? (0)
- 23: Federation in Computing (0)
- 23: What Is the Purpose of a Feature Map in a Convolutional Neural Network (0)
- 23: Database Sharding vs. Partitioning (0)
- 23: What Is Demand Paging? (0)
- 21: What Is Human-Machine Integration? (0)
- 21: The Basics of Internet Control Message Protocol (0)
- 21: Scheduling: Highest Response Ratio Next (0)
- 21: UML State Diagrams Explained (0)
- 21: What Are Brute Force Attacks? (0)
- 21: Software Testing: Severity vs. Priority (0)
- 21: How Does a Neural Network Recognize Images? (0)
- 20: What Is an Entity Relationship Diagram? (0)
- 20: Domains of Protection in OS (0)
- 20: What Are Content Management Systems? (0)
- 20: Switches: Managed vs. Unmanaged (0)
- 20: 2D Convolution as a Matrix-Matrix Multiplication (0)
- 20: Lazy vs. Eager Learning (0)
- 20: Classification of Data Mining Systems (0)
- 20: Patience Sort Algorithm (0)
- 18: How Do Artificial Immune Systems Work? (0)
- 15: RSTP and STP Protocols (0)
- 15: Eventual Consistency vs. Strong Eventual Consistency vs. Strong Consistency (0)
- 15: The Spiral Model: An Overview (0)
- 15: The Bresenham’s Line Algorithm (0)
- 15: Wi-Fi 6 Explained (0)
- 14: Regular Expression to Match Text Without a Certain Word (0)
- 14: Ukkonen’s Suffix Tree Algorithm (0)
- 14: Rapid Application Development (0)
- 13: Algorithms for Computing Routes on a Map (0)
- 13: DBSCAN Clustering: How Does It Work? (0)
- 13: Key Differences Between NetFlow and sFlow (0)
- 13: Mobile Networking: Snooping TCP (0)
- 13: Understanding Passkeys (0)
- 13: Epoch or Episode: Understanding Terms in Deep Reinforcement Learning (0)
- 11: How to Create a URL Shortener (0)
- 10: Bitwise Shift Operators (0)
- 10: The Elgamal Cryptography Algorithm (0)
- 10: Q-Learning vs. Deep Q-Learning vs. Deep Q-Network (0)
- 10: How MAC Flooding and Cloning Attacks Work? (0)
- 10: An Introduction to VRRP and HSRP Protocols (0)
- 10: Publisher-Subscriber Model (0)
- 10: Multiple Access with Collision Avoidance (0)
- 09: Introduction to XOR Linked Lists (0)
- 09: What Are Raw Sockets? (2)
- 08: Introduction to Landmark Detection (0)
- 07: An Introduction to Peer-to-Peer Network Model (0)
- 07: What Are Downstream Tasks? (2)
- 07: Finding Strongly Connected Components: Tarjan’s Algorithm (0)
- 07: Image Recognition: One-Shot Learning (1)
- 07: How to Scale Equations in LaTeX Using \resizebox? (0)
- 07: LaTeX: \include vs. \input (0)
- 07: Tournament Sort Algorithm (0)
- 07: JPEG Compression Explained (0)
- 06: Big-O Notation of Stacks, Queues, Deques, and Sets (0)
- 04: Network Flow: Edmonds-Karp Algorithm (0)
- 04: An Introduction to Management Information System (MIS) (0)
- 04: What’s the Difference Between an Ethernet Cable and a UTP Cable? (0)
- 02: What Is Neural Style Transfer? (0)
- 01: Defect Life Cycle in Software Testing (0)
- 01: Differences Between Control, Data, and Management Planes (0)
-
March 2023
(85)
- 31: Binary Synchronous Communications Protocol (0)
- 31: Bandwidth vs. Data Rate vs. Throughput (0)
- 31: What Is Middleware? (0)
- 31: How Does Meet-in-the-Middle Attack Work? (0)
- 30: Finding a Matrix Determinant (0)
- 30: File Access: Sequential vs. Direct vs. Indexed (0)
- 28: Automated Machine Learning Explained (0)
- 28: CORS, CSP, and Their Differences (0)
- 28: Address Binding in Operating Systems (0)
- 28: Image Processing: Graph-based Segmentation (0)
- 28: The Difference Between Connection-Oriented and Connectionless Protocols (0)
- 28: Routing: IGP and EGP Protocols (0)
- 26: Simulated Annealing Explained (0)
- 26: Explaining the Context Design Pattern (0)
- 24: Guide to Splay Trees (0)
- 24: What Is Federated Learning? (0)
- 24: Distributed Systems: The Byzantine Generals Problem (0)
- 24: Different Types of Firewalls (0)
- 23: Introducing Backup Policies (0)
- 23: Understanding Otsu’s Method for Image Segmentation (0)
- 23: Data Storage: What Does CRUD Means? (0)
- 23: What Does Learning Rate Warm-up Mean? (0)
- 23: Including Animations Into LaTeX Beamer Presentations (0)
- 23: What Are Videos Technically? (0)
- 23: What Is Blob Storage? (0)
- 23: Introduction to Quantum Computing (0)
- 23: How Do Merkle Trees Work? (0)
- 23: Finding Top 10 Search Terms (0)
- 23: Telnet vs. SSH (0)
- 23: Differences Between Abstraction and Encapsulation (0)
- 22: What Are Expert Systems? (0)
- 20: What Are Datagram Networks? (0)
- 20: All-Pairs Shortest Paths: Johnson’s Algorithm (0)
- 20: What Is End-to-End Deep Learning? (0)
- 20: What Is Ethernet? (0)
- 20: What Is VoIP? (0)
- 18: Dominating Sets and Domination Numbers in Graph Theory (0)
- 18: Recognizable vs. Co-recognizable vs. Decidable Languages (0)
- 18: How to Make Custom Page Numbering in LaTeX? (0)
- 18: How to Convert LaTeX to Plain Text? (0)
- 18: What Is Software Prototyping? (0)
- 18: What Is Pair Programming? (0)
- 18: Natural Language Processing: Bleu Score (0)
- 18: The Havel-Hakimi Algorithm (0)
- 18: SOAP vs. WSDL (0)
- 18: Introduction to Triplet Loss (0)
- 18: Network Management Principles With SNMP (0)
- 18: Networking: Stop-and-Wait Protocol (0)
- 15: Selective Repeat Protocol (0)
- 15: How Do Siamese Networks Work in Image Recognition? (0)
- 12: The Bat Algorithm (0)
- 12: Boxing and Unboxing (0)
- 12: Mobile Networking: 1G vs. 2G vs. 3G vs. 4G vs. 5G (0)
- 12: Software Engeneering: What Is a Shim? (0)
- 12: Level-order Traversal of Binary Tree (0)
- 11: Software Quality (0)
- 11: Automatic Private IP Addressing Explained (0)
- 11: Factory Method vs. Factory vs. Abstract Factory (0)
- 11: Wireless Disassociation Attacks (0)
- 11: User Thread vs Kernel Threads (0)
- 10: Indexing: Inverted Index (0)
- 10: Infix, Prefix, and Postfix Expressions (0)
- 10: An Efficient Compression Algorithm for Short Text Strings (1)
- 10: Hashing – Separate Chaining (0)
- 09: Cuckoo Hashing (0)
- 08: Switching Techniques in Computer Networks (0)
- 08: Digital Data Communications Protocol (0)
- 07: What Is the Belady’s Anomaly? (0)
- 06: Neural Networks: Pooling Layers (0)
- 04: Introduction to K-D Trees (0)
- 04: What Is LaTeX? (0)
- 04: How to Use Packages in LaTeX? (0)
- 04: Node Degrees (0)
- 04: What Is Reverse Engineering in Computer Science? (0)
- 04: Point-to-Point Protocol (PPP) (0)
- 04: Hit and Miss Ratio in Cache for Content Delivery Networks (0)
- 04: Slime Mould Algorithm (0)
- 04: Graph Theory: What Is Vertex Coloring? (0)
- 04: How Do Eigenfaces Work? (0)
- 03: What Are Multi-way Search Trees? (0)
- 03: Dimensionality of Word Embeddings (0)
- 03: Difference Between Segment Trees, Interval Trees, Range Trees, and Binary Indexed Trees (0)
- 03: What Are Tournament Graphs? (0)
- 03: What Is Cloud Security? (0)
- 03: What Is the Credit Assignment Problem? (0)
-
February 2023
(69)
- 28: Capability Maturity Model (0)
- 28: ADAM Optimizer (0)
- 28: What Does PAC Learning Theory Really Mean? (0)
- 28: What Is XML? (0)
- 28: What Is Round Trip Time? (0)
- 28: Image Processing: Sampling and Quantization (0)
- 28: Computer Vision: Determining the Distance From an Object in a Video (0)
- 28: Differences Between Data and Information in Computing (0)
- 28: Co-occurrence Matrices and Their Uses in NLP (0)
- 26: Genetic Algorithms: Order One Crossover (0)
- 26: Software Engineering: V-Shaped Model (0)
- 25: Sensitivity and Specificity (0)
- 25: What Is Dynamic DNS? (0)
- 24: What Is Cyclomatic Complexity? (0)
- 24: From Recursion to Iteration – Factorial Function Example (0)
- 24: What Are Serialization and Deserialization in Programming? (0)
- 23: What Are Data Flow Diagrams? (0)
- 23: Citation Styles in LaTeX (0)
- 23: Random Access Protocols: Pure ALOHA (0)
- 23: Check if the Sum of Any Two Numbers in an Array Matches a Given Number (0)
- 23: Extreme Programming (0)
- 23: Cuckoo Search Algorithm (0)
- 23: Scheduling: Completion Time vs. Response Time (0)
- 23: Maintainability Killers (0)
- 21: The Stable Marriage Problem (0)
- 21: How Fonts Work in LaTeX? (0)
- 21: What Is an API Endpoint? (0)
- 21: What Is a Peer in Computer Network? (0)
- 21: Understanding MAC Addresses (0)
- 20: What Is Reactive Programming? (0)
- 20: Scheduling: Earliest Deadline First (0)
- 20: How Does AO* Algorithm Work? (0)
- 20: The Sub-Layers of the Data Link Layer (0)
- 19: OOP: Inheritance vs. Aggregation (0)
- 19: The Difference Between Exploit and Payload (0)
- 18: The Ternary Search Tree Data Structure (0)
- 18: Differences Between a Gateway and a Firewall (0)
- 17: What Are Planar Graphs? (0)
- 17: Black Widow Optimization Algorithm (BWO) (0)
- 17: What Is an ORM? How Does It Work? How Should We Use One? (0)
- 17: Representing Max Heap in an Array (0)
- 17: Interfaces vs. Base Classes: the Similarities and Differences (0)
- 14: What Is Software Diversity? (0)
- 14: What Is Functional Decomposition? (0)
- 14: What Is Wardriving? (0)
- 14: Hard vs. Soft Voting Classifiers (0)
- 14: Deep Neural Networks: Padding (0)
- 13: Routing: Distance Vector vs. Link State (0)
- 12: How to Define Variables in LaTeX? (0)
- 11: Difference Between Fundamental Matrix and Essential Matrix (0)
- 11: Finding Strongly Connected Components: Kosaraju’s Algorithm (0)
- 11: XOR Swap (0)
- 11: What Is Fog Computing? (0)
- 09: Differences Between Network-level and Application-level Information Security (0)
- 09: Multithreading vs. Hyperthreading (0)
- 09: Single Shot Detectors (SSDs) (0)
- 08: Modulus Division (0)
- 08: How to Overcome Root Domain CNAME Restrictions? (0)
- 07: How Does External Fragmentation Happen? (0)
- 07: Requirements: Functional vs. Non-functional (0)
- 07: Dependency Injection vs. Service Locator (0)
- 07: What Is State Space Search? (0)
- 05: What Are Regular Languages? (0)
- 04: Differences Between Disaster Recovery and Backup (0)
- 04: What Is the Difference Between Standard VLAN and Extended VLAN? (0)
- 04: Difference Between Reinforcement Learning and Optimal Control (0)
- 03: What Is Referential Transparency? (0)
- 03: Is 0.0.0.0 a Valid IP Address? (0)
- 01: How to Root a Tree? (0)
-
January 2023
(83)
- 31: What Is Independent Component Analysis (ICA)? (0)
- 31: Array Implementation of Stacks (0)
- 31: Introduction to Secure Computation (0)
- 30: Eccentricity, Radius, Diameter, Center, and Periphery (0)
- 30: What Are Bridges in a Graph? (0)
- 30: Threat vs. Vulnerability vs. Risk (0)
- 30: Rearrange an Array to Put the Negative Elements Before the Positive Ones (0)
- 29: What Is Agile Programming? (0)
- 29: Defining Multiobjective Algorithms and Pareto Frontiers (0)
- 29: Best Order to Sign, Encrypt and Compress Content (0)
- 29: Deprecated vs. Depreciated vs. Obsolete in Software Development (0)
- 29: Browser Cookie Domains (0)
- 28: Differences Between a Parametric and Non-parametric Model (0)
- 26: The Ramsey Theory (1)
- 26: What Is Maxout in a Neural Network? (0)
- 26: Maximum Likelihood Estimation (0)
- 26: How to Convert Finite Automata to Regular Expressions? (0)
- 26: How to Check if a Line Segment Intersects a Rectangle? (0)
- 26: Recurrent Neural Networks (0)
- 26: Recursion: Direct vs Indirect (0)
- 25: Graph Attention Networks (0)
- 25: What Are Perfect Graphs? (0)
- 25: What Is an Anti-pattern? (0)
- 25: Software Engineering: SCRUM vs. XP (0)
- 25: Firefly Algorithm (0)
- 25: Understanding Honeypots (0)
- 25: Different Types of System Calls (0)
- 25: Circular Buffer (0)
- 25: Skip List Comparison with Binary Search Tree (0)
- 21: Disjoint Set Union Data Structure (0)
- 20: Enumerators vs. Constants (0)
- 20: What Is the Difference Between Keyword and Reserved Word? (0)
- 20: Isomorphic Trees (0)
- 20: Octet String: What Is It? (0)
- 20: Different Network Topologies Explained (0)
- 19: Sparse Coding Neural Networks (0)
- 19: The Centers of Unweighted Trees (0)
- 19: Conditionals (0)
- 19: What Is Cosine Similarity? (0)
- 17: Front-End vs. Back-End Development (0)
- 17: What Is Quality of Service in Networking ? (0)
- 17: What’s the P99 Latency? (0)
- 17: Hashing – Linear Probing (0)
- 17: Software Engineering: The Waterfall Model (0)
- 17: Differences Between Luong Attention and Bahdanau Attention (0)
- 16: What Are Logic Bombs? (0)
- 15: What Is an Eavesdropping Attack? (0)
- 15: How Does a Blockchain Work? (0)
- 15: Optimization: Gradient-Based Algorithms (0)
- 15: What Are HTTP Flood Attacks? (0)
- 13: Circuit Switching vs. Packet Switching (0)
- 13: Bugs and Debugging in Programming (0)
- 13: How Many Bytes Does One Unicode Character Take? (0)
- 13: What Is the Difference Between GET and POST Methods? (0)
- 13: Quadtrees and Octrees (0)
- 12: Merge Sort: Top-Down vs. Bottom-up (0)
- 11: Introduction to Web Proxies (0)
- 10: What’s IP-Address Ending With Zero Used For? (0)
- 10: Cryptography: Known-Plaintext Attack vs. Chosen-Plaintext Attack (0)
- 10: CPU Scheduling: Arrival, Burst, Completion, Turnaround, Waiting, and Response Time (0)
- 10: Artificial Bee Colony (0)
- 10: Cryptography: Rail Fence Technique (0)
- 08: Verification of SSL Certificates (0)
- 08: Genetic Algorithms: Crossover Probability and Mutation Probability (0)
- 08: KISS Software Design Principle (0)
- 07: Private vs. Protected Access Modifiers (0)
- 07: What Is Edge Computing? (0)
- 06: Off-by-One Error (0)
- 05: What Are Embedding Layers in Neural Networks? (0)
- 04: Web Crawling vs. Web Scraping (0)
- 04: Differences Between Hinge Loss and Logistic Loss (0)
- 04: Machine Learning: How to Format Images for Training (0)
- 04: Differences Between Homography and Affine Transformation (0)
- 04: What Are Low-Code and No-Code Development? (0)
- 04: Unit vs. Integration Testing (0)
- 04: What Are Replay Attacks? (0)
- 03: How Do Filesystems Handle Concurrent Read/Write? (0)
- 03: DRY Software Design Principle (0)
- 03: Builder Pattern vs. Factory Pattern (0)
- 03: State Pattern vs. Strategy Pattern (0)
- 03: Computer Vision: Differences Between Low-Level and High-Level Features (0)
- 03: Remote Code Execution (RCE) and How to Prevent It? (0)
- 03: Retransmission Rules for TCP (0)
-
December 2022
(37)
- 31: Buffer Overflow Attacks (0)
- 31: Cloud: Public vs. Private vs. Hybrid (0)
- 29: Machine Learning: Flexible and Inflexible Models (0)
- 29: Smart Contracts – Blockchain (0)
- 29: How Does 1’s Complement Work in Error Detection? (0)
- 29: What Is Space Carving? (0)
- 24: Class vs. Object in OOP (0)
- 23: Social Engineering (0)
- 23: Granularity: Coarse-Grained vs. Fine-Grained (0)
- 23: What Are Handlers in Programming? (0)
- 23: What Are Coroutines? (0)
- 20: VAE Vs. GAN For Image Generation (0)
- 18: What Is the Difference Between Antivirus and Firewalls (0)
- 18: How Does a Load Balancer Work? (0)
- 18: Differences Between AR, VR, MR, and XR (0)
- 15: Difference Between Goal-based and Utility-based Agents (0)
- 15: What Is Steganography? (0)
- 14: Compiler, Linker, Assembler, and Loader (0)
- 14: Information Theory (0)
- 14: Error Handling (0)
- 14: Explanation of BASE Terminology (0)
- 14: Distributed Systems: Consensus (0)
- 14: Internet vs. Intranet vs. Extranet (0)
- 14: Memory Management: Inverted Paging (0)
- 11: 2-Way and K-Way Merging (0)
- 11: What Are Restricted Boltzmann Machines? (0)
- 11: What Is a Data Lake? (0)
- 10: Shuffling an Array (0)
- 10: What Is Multi-Task Learning? (0)
- 08: Preemptive and Non-Preemptive Scheduling (0)
- 07: The 3Sum Problem (0)
- 07: Introduction to Gibbs Sampling (0)
- 07: Differences Between Cloud, Grid and Cluster (0)
- 07: Software Engineering: White-Box vs. Black-Box Testing (0)
- 05: Should We Deploy Database and Web Server Apart? (0)
- 02: Statistical Independence (0)
- 02: Understanding Piggybacking in Networks (0)
-
November 2022
(44)
- 30: What Is Adware? (0)
- 30: How Do Threads Share Resources? (0)
- 30: Tabu Search (0)
- 30: Continuous Integration vs. Continuous Deployment vs. Continuous Delivery (0)
- 29: Quicksort vs. Timsort (0)
- 29: EIGRP vs OSPF vs BGP (0)
- 28: Differences Between Network Edge and Core (0)
- 28: Bayes’ Theorem (0)
- 28: Introduction to Cryptography (0)
- 28: What Are the Differences Between Static and Dynamic Routing? (0)
- 28: What Is a Keylogger? (0)
- 27: System Call vs. System Interrupt (0)
- 27: The XP’s Commandments of Simple Code (0)
- 27: How Do DMA Controllers Work? (0)
- 24: Differences Between a Data Type and a Data Structure (0)
- 23: The Cyber Kill Chain (0)
- 23: Linear Search With Fewer Comparisons (0)
- 22: One-Hot Encoding Explained (0)
- 22: Introduction to Inception Networks (0)
- 20: What Is Privilege Escalation? (0)
- 18: Application Server vs. Web Server (0)
- 16: What Are Data Warehouses? (0)
- 16: Comb Sort Explained (0)
- 16: Feature Selection in Machine Learning (0)
- 16: Cognitive Computing vs. Artificial Intelligence (0)
- 16: Probability: Joint vs. Marginal vs. Conditional (0)
- 16: Translation Invariance and Equivariance in Computer Vision (0)
- 15: Headless Software (0)
- 15: Lookup Table in Databases (0)
- 13: Underlay Network vs. Overlay Network (0)
- 13: Neural Network and Deep Belief Network (0)
- 12: Combinatorial Optimization (0)
- 12: Decrease-Key Dijkstra’s Algorithm (0)
- 12: Differences Between Transfer Learning and Meta-Learning (0)
- 12: Residual Networks (0)
- 07: Finding the Digital Root (0)
- 07: Differences Between Active and Passive Attacks (0)
- 05: Why Use a Surrogate Loss (0)
- 05: Calculating the Average of a Set of Circular Data (0)
- 05: How to Calculate the Angle from Rotation Matrix (0)
- 05: Optimization: Local vs. Global Optima (0)
- 02: Zombie Processes in Operating Systems (0)
- 02: DLL Hell Problem (0)
- 02: Random Variables (0)
-
October 2022
(53)
- 31: Calculating the Odds of a Team Winning a Sports Match Given Full History (0)
- 31: Differences Between Simulation and Emulation (0)
- 31: Introduction to Optical Flow (0)
- 30: Consensus Algorithms in Distributed Systems (0)
- 28: How to Get Bold Math Symbols in Latex (0)
- 28: Generative Adversarial Networks: Discriminator’s Loss and Generator’s Loss (0)
- 28: Fast R-CNN: What is the Purpose of the ROI Layers? (0)
- 28: What Is a Backdoor? (0)
- 28: Parameters vs. Hyperparameters (0)
- 27: What Is Swarm Intelligence? (0)
- 25: What Are Virtual Private Networks? (0)
- 24: High Availability vs. Fault Tolerance (0)
- 24: Differences Between CPU and GPU (0)
- 22: What Is the No Free Lunch Theorem? (0)
- 21: What Is Software-Defined Networking? (0)
- 21: How Does Particle Swarm Optimization Work? (0)
- 20: Optimization: Objective Functions, Decision Variables and Constraints (0)
- 20: Finding Neighbors of a Matrix Cell (0)
- 18: An Introduction to Computer Vision (0)
- 18: How Do Blurs in Images Work? (0)
- 18: Differences Between Sequential and Random Writes of Memory (0)
- 18: Static vs. Dynamic Linking (0)
- 18: Referencing Subordinate Equations in LaTeX (0)
- 18: Networking: Baseband vs. Broadband (0)
- 17: Phishing Attacks (0)
- 16: Network Management: The FCAPS Model (0)
- 16: Differences Between Firmware and Operating System (0)
- 14: What Does Backbone Mean in Neural Networks? (0)
- 14: Pigeonhole Sort Explained (0)
- 14: The Viola-Jones Algorithm (0)
- 13: Dividing Table Cells in LaTeX (0)
- 12: Vanilla Software and Programming (0)
- 11: Ad-hoc Programming (0)
- 11: Single-Threaded vs Multiple-Threaded Apartments in COM (0)
- 11: How to Describe Network Performance? (0)
- 11: Programming Languages: Lexicon vs. Syntax vs. Semantics (0)
- 09: Differences Between Routing and Forwarding Tables (0)
- 08: Gravity/Bead Sort (0)
- 08: How to Include PDF Files in LaTeX Documents (0)
- 08: What Is a Network File System? (0)
- 06: How Does Pose Estimation Work? (0)
- 05: Webhooks Explained (0)
- 05: How to Determine the Entropy of a Password? (0)
- 05: Big Endian vs. Little Endian (0)
- 03: Wrapping Text in LaTeX Tables (0)
- 03: What’s a Buffer? (0)
- 03: Differences Between Directories and Folders (0)
- 03: Traffic Engineering: Shaping Vs. Policing (0)
- 03: Difference Between API and SDK (0)
- 01: Cryptography: What Is a Trapdoor? (0)
- 01: Differences Between Definition, Declaration, and Initialization (0)
- 01: Spatial Pyramid Pooling (0)
- 01: Routing vs. Forwarding vs. Switching (0)
-
September 2022
(44)
- 30: Word-Count in LaTeX Documents (0)
- 29: Networking: Stateless and Stateful Protocols (0)
- 29: The Direct Linear Transform (0)
- 29: Object Detection: SSD Vs. YOLO (0)
- 29: Stateful vs. Stateless in Programming (0)
- 27: Getting the Closest String Match (0)
- 27: Language Processors Explained (0)
- 27: Understanding Activation Functions (0)
- 27: Network Function Virtualization Explained (0)
- 27: How to Write URLs in LaTeX (0)
- 27: Cache-Friendly Code (0)
- 27: What Is Content-Based Image Retrieval? (0)
- 25: Differences Between Scaling Horizontally and Vertically (0)
- 21: The XOR Operation (0)
- 21: Differences Between an IDS and an IPS (0)
- 21: Vulnerability Assessment and Penetration Testing (0)
- 21: The de Bruijn Sequence (0)
- 19: Differences Between Computer Vision and Image Processing (0)
- 19: Bitonic Sort (0)
- 19: What Is Constrained Optimization? (0)
- 18: Simultaneous Localization and Mapping (0)
- 18: How Does AI Play Chess? (0)
- 18: What Are Channels in Convolutional Networks? (0)
- 18: What Is a Feature Descriptor in Image Processing? (0)
- 18: Differences Between Bias and Error (0)
- 15: Best Data Structure for Dictionaries (0)
- 15: How to Project a 3D Point Onto a 2D Plane? (0)
- 14: Orthogonality in Computer Programming (0)
- 12: Defining Loops in a LaTeX Document (0)
- 12: Practical Applications of Directed Acyclic Graphs (0)
- 12: Port Scanning Explained (0)
- 12: Security: What Is Formjacking? (0)
- 09: How Does Optical Character Recognition Work (0)
- 06: How to Create a Glossary in LaTeX (0)
- 05: Hash Code vs. Checksum (0)
- 04: How to Use SVG Images in LaTeX (0)
- 04: Computer Vision: Stereo 3D Vision (0)
- 04: What Are Image Histograms? (0)
- 04: Computer Vision: Popular Datasets (0)
- 01: Cocktail Sort (0)
- 01: Introduction to GUID (0)
- 01: What Are File Path Transversal Attacks? (0)
- 01: How to Include Images in LaTeX Documents (0)
- 01: Instance Segmentation vs. Semantic Segmentation (0)
-
August 2022
(41)
- 31: How to Handle Large Images to Train CNNs? (0)
- 30: Adding Hyperlinks in LaTeX (0)
- 30: If-Else and Switch (2)
- 30: What Is the Difference Between User Variables and System Variables? (0)
- 30: How Many Threads Is Too Many? (0)
- 29: The Complexity of Shellsort (0)
- 29: Caching and CDNs: What Is the Difference? (0)
- 28: Object Recognition Tasks and Their Differences (0)
- 28: Security: Credential Stuffing vs. Password Spraying (0)
- 28: Positioning Figures in LaTeX (0)
- 27: What Is “Energy” in Image Processing? (0)
- 25: Neurons in Neural Networks (0)
- 25: Using HTTP Tunnel to Traceroute Through a Proxy With Firewall (0)
- 25: Multithreaded Algorithms (0)
- 25: Deep Dive Into Optimization (0)
- 25: Online Learning vs. Offline Learning (0)
- 22: What Is One Class SVM and How Does It Work? (0)
- 22: Caching: Cold Cache vs. Warm Cache (0)
- 21: What Is the Difference Between Signed and Unsigned Variables? (0)
- 19: What Is a Content Delivery Network (CDN)? (0)
- 19: Harris Corner Detection Explained (0)
- 18: Algorithm for Merging Two Max Heaps (0)
- 17: Remote Procedure Calls vs. Local Procedure Calls (0)
- 17: What Is Feature Importance in Machine Learning? (0)
- 16: How to Check If a String Is a Palindrome? (0)
- 15: Why Isn’t Heapsort Stable? (0)
- 15: Deterministic and Stochastic Optimization Methods (0)
- 13: UDP Packet Loss (0)
- 13: Hash vs. Message Authentication Code (0)
- 12: From Postfix Expressions to Expression Trees (0)
- 12: Data Augmentation (0)
- 11: I/O Management (0)
- 10: How to Calculate the Star Rating (0)
- 10: Attention Mechanism in the Transformers Model (0)
- 09: Counting Sort vs. Bucket Sort vs. Radix Sort (0)
- 09: What Is Fine-Tuning in Neural Networks? (0)
- 08: Heuristics vs. Meta-Heuristics vs. Probabilistic Algorithms (0)
- 05: Odd-Even Transposition Sort (0)
- 01: Recursion and Looping (0)
- 01: Firewalls: Stateless vs. Stateful (0)
- 01: Random Forest vs. Extremely Randomized Trees (0)
-
July 2022
(33)
- 31: Finding the nth Element of a Singly Linked List (0)
- 29: Differences Between Stream Cipher and Block Cipher (0)
- 29: How to Use Gabor Filters to Generate Features for Machine Learning (0)
- 28: Differences Between Porter and Lancaster Stemming Algorithms (0)
- 25: Elitism in Evolutionary Algorithms (0)
- 24: Fibonacci Search (0)
- 24: Random Sample Consensus Explained (0)
- 22: Finding the Shortest Cycle in an Undirected Graph (0)
- 22: Computer Boot Process Explained (0)
- 22: Does Code Obfuscation Bring Security Benefits? (0)
- 21: What Does Pre-training a Neural Network Mean? (0)
- 18: Correcting Fisheye Images (0)
- 18: Differences Between Role and Permission-based Access Control (0)
- 17: Message Brokers vs. Enterprise Service Buses (0)
- 16: Differences Between NTFS, FAT32 and exFAT (0)
- 16: Neural Networks: What Is Weight Decay Loss? (0)
- 14: Win Gomoku with Threat Space Search (0)
- 14: Neural Networks: Difference Between Conv and FC Layers (0)
- 13: Type Safety in Programming Languages (0)
- 13: Understanding Heapsort (0)
- 13: Algorithms and Flowcharts: Mapping Process (0)
- 10: Minimum Stack With O(1) Time (0)
- 09: Neural Networks: Binary vs. Discrete vs. Continuous Inputs (0)
- 09: Differences Between Gradient, Stochastic and Mini Batch Gradient Descent (0)
- 07: Scale-Invariant Feature Transform (0)
- 07: What Is a Regressor? (0)
- 06: Private URLs vs. Password-based Authentication (0)
- 05: What Exactly Is an N-Gram? (0)
- 03: Why Is Using Global Variables Considered a Bad Practice? (0)
- 02: The Mahalanobis Distance (0)
- 01: Jump Search Algorithm (0)
- 01: Private Bytes, Virtual Bytes, and Working Set (0)
- 01: Hidden Markov Models vs. Conditional Random Fields (0)
-
June 2022
(35)
- 30: The Curse of Dimensionality (0)
- 29: Fuzzy Search Algorithm for Approximate String Matching (0)
- 29: Multi-Layer Perceptron vs. Deep Neural Network (0)
- 26: Exponential Search (1)
- 26: Security: What Is the CIA Triad? (0)
- 25: The Sleeping Barber Problem (0)
- 24: What Are Zero-Day Attacks? (0)
- 20: Fast Fourier Transform (FFT) (0)
- 20: Data Compression: ZLib vs. GZip vs. Zip (0)
- 18: How to Share a Key in Symmetric Cryptography? (0)
- 18: Machine Learning: What Is Ablation Study? (0)
- 18: Silhouette Plots (0)
- 18: Drawing Shapes with Marching Squares (0)
- 18: Sampling From the Exponential Distribution (0)
- 17: Median of a Matrix With Sorted Rows (0)
- 17: Computer Clusters, Types, Uses and Applications (0)
- 14: Fuzzy Logic Explained (0)
- 12: Differences Between Key, Initialization Vector and Nonce (0)
- 12: What Is CAPTCHA and How Does It Work? (0)
- 12: F-Beta Score (0)
- 12: What’s a Hypothesis Space? (0)
- 11: What Is YOLO Algorithm? (0)
- 11: Node Impurity in Decision Trees (0)
- 10: Model-free vs. Model-based Reinforcement Learning (0)
- 10: 0-1 Loss Function Explained (0)
- 08: Is a Markov Chain the Same as a Finite State Machine? (0)
- 07: The Dining Philosophers (0)
- 07: Differences Between Epoch, Batch, and Mini-batch (0)
- 06: Differences Between Missing Data and Sparse Data (0)
- 06: Converting Floats into Fractions (0)
- 06: Socket vs. RPC (0)
- 06: Public DMZ Network Architecture (0)
- 02: Non-repeating Random Number Generator (0)
- 02: Understanding Fenwick Tree (Binary Indexed Tree) (0)
- 01: Differences Between Backpropagation and Feedforward Networks (0)
-
May 2022
(33)
- 28: Differences Between Scalability and Elasticity (0)
- 27: Which Is Faster – Hash Lookup or Binary Search? (0)
- 26: Disparity Map in Stereo Vision (0)
- 26: How to Find Common Elements in Two Sorted Arrays (0)
- 25: How to Find the Authoritative Name Server for a Domain? (0)
- 25: Difference Between Tree Order and Degree (0)
- 24: Cloud Computing: SaaS vs. PaaS vs. IaaS (0)
- 22: Interpolation and Regression: Similarities and Differences (0)
- 21: How to Redirect DNS to Different Ports (0)
- 21: MapReduce Algorithm (0)
- 21: Cross-Validation: K-Fold vs. Leave-One-Out (0)
- 20: Comparing TLS and DTLS (0)
- 17: How to Compute the Similarity of Colours (0)
- 17: Basic Services of an Operating System (0)
- 15: Introduction to Bloom Filter (0)
- 15: How Do Antiviruses Really Work? (0)
- 12: Off-policy vs. On-policy Reinforcement Learning (0)
- 12: Bias Update in Neural Network Backpropagation (0)
- 12: How Does Ransomware Infect Computers? (0)
- 11: Algorithm for Handwriting Recognition (0)
- 11: Introduction to Resource Description Framework (RDF) (0)
- 10: Precision vs. Average Precision (0)
- 09: How Does a Zip Bomb Work? (0)
- 09: How to Calculate the Runtime Percentage Improvement (0)
- 08: What Are Callback Functions? (0)
- 08: 32-Bit vs. 64-Bit Operating Systems (0)
- 07: How to Convert a Color From HSL to RGB (0)
- 06: Simulating Slow Internet and Network Errors (0)
- 04: Overview of Nature-Inspired Metaheuristic Algorithms (0)
- 03: Sort References by Order of Appearance with LaTeX/BibTeX (0)
- 02: Storing a Tree Structure in a Relational Database (0)
- 02: Man in the Middle (MITM) Attacks Explained (0)
- 01: What Is Markov Chain Monte Carlo? (0)
-
April 2022
(28)
- 28: Comparing Naïve Bayes and SVM for Text Classification (0)
- 28: What Is SQL Injection? (0)
- 28: The Difference Between Pipes and Sockets (0)
- 25: How Do DoS and DDoS Attacks Really Work? (0)
- 25: Recurrent vs. Recursive Neural Networks in Natural Language Processing (0)
- 25: Are We Still Traceable When Using VPN? (0)
- 22: Fast Algorithms for Solving a System of Linear Equations (0)
- 21: Understanding Sparse Tables (0)
- 21: Difference Between Self-Signed CA and Self-Signed Certificate (2)
- 20: Intersection Over Union for Object Detection (0)
- 20: Binary Search Trees vs. AVL Trees: the Complexity of Construction (0)
- 20: Authentication: Multi-Step vs. Multi-Factor (0)
- 20: What Is a URI? (0)
- 19: Efficiently Sorting Linked Lists (0)
- 19: Memory-Mapped vs. Isolated I/O (0)
- 16: What Are “Bottlenecks” in Neural Networks? (0)
- 15: Differences Between APIs and ABIs (0)
- 14: Differences Between Viruses, Worms and Trojans (0)
- 14: Pre-increment vs. Post-increment in a Loop (0)
- 13: How Are DNS Requests Resolved When Using VPN? (0)
- 11: Understanding Hash Tables (0)
- 11: Convolutional Neural Network vs. Regular Neural Network (0)
- 11: Determining the Most Distant Pair of Points (0)
- 09: Ant Lion Optimization (0)
- 08: What Sets the RST Flag? (0)
- 07: RSA SecurID Tokens (0)
- 04: Abstract Methods vs. Virtual Methods (0)
- 01: Differences Between Strong-AI and Weak-AI (0)
-
March 2022
(39)
- 31: Finding the Minimum Number of Jumps to Reach the End of an Array (0)
- 31: How to Find the Minimum Difference Between Elements in an Array (0)
- 30: Differences Between Cloud Computing and Distributed Computing (0)
- 30: Dragonfly Algorithm (0)
- 29: HTTP: 1.0 vs. 1.1 vs 2.0 vs. 3.0 (0)
- 29: Mean Average Precision in Object Detection (0)
- 28: Differences Between a Deep Copy and a Shallow Copy (0)
- 26: The Call Stack (0)
- 26: Lambda Functions (0)
- 23: Memory Allocation (0)
- 23: Proxy Server vs. Reverse Proxy Server (0)
- 23: Algorithm to Find All Subarrays With a Given Sum K (0)
- 23: How to Bind to Any Available Port? (0)
- 23: Find the Kth Smallest Element in a Binary Search Tree (0)
- 22: Public/Private Keys Vs. Certificates (0)
- 21: Hidden Layers in a Neural Network (0)
- 21: How to Calculate Packet Time from Latency and Bandwidth (0)
- 16: Robust Estimators in Robust Statistics (0)
- 16: How to Find the Two Points With the Minimal Manhattan Distance (0)
- 15: Transfer Learning vs Domain Adaptation (0)
- 15: Real-Life Examples of Supervised Learning and Unsupervised Learning (0)
- 15: Antipatterns: Magic Numbers (0)
- 11: Finding the Number of Distinct Subsequences of a String (0)
- 11: What Are Rings in Operating Systems? (0)
- 10: Real-World Uses for Genetic Algorithms (0)
- 10: How to Test if a Number Is a Fibonacci Number (2)
- 10: What Is Depth in a Convolutional Neural Network? (0)
- 10: What Is the Difference Between Markov Chains and Hidden Markov Models? (0)
- 09: The Reparameterization Trick in Variational Autoencoders (0)
- 08: Decision Trees vs. Random Forests (0)
- 07: Hash Table vs. Trie (Prefix Tree) (0)
- 07: Centralized Computing vs. Distributed Computing (0)
- 06: What Is Inductive Bias in Machine Learning? (0)
- 06: What Is the Difference Between Artificial Intelligence, Machine Learning, Statistics, and Data Mining? (0)
- 06: An Introduction to Self-Supervised Learning (0)
- 04: Latent Space in Deep Learning (0)
- 04: How To Find a List of Possible Words From a Letter Matrix (1)
- 03: Autoencoders Explained (0)
- 02: Difference Between SSL & TLS (2)
-
February 2022
(48)
- 28: Difference Between the Cost, Loss, and the Objective Function (0)
- 28: Activation Functions: Sigmoid vs Tanh (0)
- 28: Hash Collision: Weak and Strong Resistance (0)
- 28: Red-Black Tree vs. AVL Tree (0)
- 27: Hill Climbing Algorithm (0)
- 25: An Introduction to Contrastive Learning (0)
- 25: Gradient Boosting Trees vs. Random Forests (0)
- 24: Basic Concepts of Machine Learning (0)
- 24: Intuition Behind Kernels in Machine Learning (0)
- 23: Generating a Crossword Puzzle (0)
- 21: Salp Swarm Algorithm (0)
- 21: Understanding Security by Obscurity (0)
- 21: Algorithms for Image Comparison (0)
- 19: Training and Validation Loss in Deep Learning (0)
- 19: Image Processing: Occlusions (0)
- 19: What Is the Best Sorting Algorithm To Sort an Array of Small Integers (0)
- 18: How To Determine if a Point Is in a 2D Triangle (0)
- 17: Information Gain in Machine Learning (0)
- 17: How to Convert an RGB Image to a Grayscale (0)
- 17: What Is the Difference Between Natural Cubic Spline, Hermite Spline, Bézier Spline and B-Spline? (0)
- 15: Cross-Validation and Decision Trees (0)
- 15: How to Use K-Fold Cross-Validation in a Neural Network? (0)
- 14: Applications of Generative Models (0)
- 13: Supported Memory by 32 and 64-Bit Machines (0)
- 13: Pseudo-Polynomial vs. Polynomial Complexity (0)
- 13: Can TCP and UDP Sockets Use the Same Port? (0)
- 13: Virtual Memory Address (0)
- 13: Valid Characters of a Hostname (0)
- 13: DES vs 3DES vs Blowfish vs AES (0)
- 11: Network: Longest Prefix Matching (0)
- 11: Calculate the Output Size of a Convolutional Layer (0)
- 11: TCP Checksum Errors: Issues and Workarounds (0)
- 09: Binary Tree vs. Binary Search Tree (0)
- 09: Is Selection Sort Stable? (0)
- 09: What Is the Maximum Length of a URL in Different Browsers? (0)
- 07: Making Presentations With LaTeX (1)
- 07: Number of Comparisons in Straight Selection Sort (0)
- 07: Introduction to Curve Fitting (0)
- 07: An Introduction to Generative Adversarial Networks (0)
- 05: K-Means for Classification (0)
- 05: Maximum Packet Size for a TCP Connection (0)
- 05: Vertical and Horizontal Tables in LaTeX (0)
- 04: What Is a Random Walk? (0)
- 03: ML: Train, Validate, and Test (0)
- 02: Determining Network and Broadcast Address Using IP Address and Subnet Mask (0)
- 01: An Introduction to the Hidden Markov Model (0)
- 01: Multi-Verse Optimizer (0)
- 01: Q-Learning vs. SARSA (0)
-
January 2022
(35)
- 31: Differences Between SGD and Backpropagation (0)
- 31: Graph Theory: Path vs. Cycle vs. Circuit (0)
- 31: Linearly Separable Data in Neural Networks (0)
- 29: Master Theorem for Asymptotic Analysis (0)
- 29: The Effects of the Depth and Number of Trees in a Random Forest (0)
- 26: Radix Sort (0)
- 26: Using GANs for Data Augmentation (0)
- 25: Differences Between Bidirectional and Unidirectional LSTM (0)
- 23: The Monty Hall Problem (0)
- 23: Basics of Polynomial Interpolation (0)
- 21: Features, Parameters and Classes in Machine Learning (0)
- 21: Relation Between Learning Rate and Batch Size (0)
- 20: Looking for a CS Technical Editor for Baeldung (not open) (0)
- 19: N-Tier Architecture (0)
- 19: How to Draw Flowcharts With LaTeX (0)
- 19: How to Check String Periodicity (0)
- 19: Binary Insertion Sort (0)
- 18: Concurrency vs Parallelism (0)
- 15: Tabulation vs. Memoization (0)
- 15: MD5 vs. SHA Algorithms (0)
- 14: The Importance of Central Limit Theorem (0)
- 13: Prime Numbers in Cryptography (2)
- 13: Simple Hashing vs. Salted Hashing (0)
- 12: Service Discovery in Microservices (2)
- 11: Graph Adjacency and Incidence (0)
- 11: Tree Edit Distance (0)
- 09: Moth Flame Optimization (0)
- 07: Word2vec Word Embedding Operations: Add, Concatenate or Average Word Vectors? (0)
- 07: Why Are Floating Point Numbers Inaccurate? (0)
- 06: Drift, Anomaly, and Novelty in Machine Learning (0)
- 04: Markov Decision Process: How Does Value Iteration Work? (0)
- 04: Exporting LaTeX TikZ as Image Files (0)
- 03: Fundamentals of Sandboxing (0)
- 03: Non-opinionated vs. Opinionated Design (0)
- 03: Rainbow Table Attacks (0)
-
December 2021
(34)
- 31: What Is Selection Bias and How Can We Prevent It? (0)
- 31: Non-routable IP Address (0)
- 31: Graph Density (0)
- 29: Applications of Red-Black Trees (0)
- 29: Context-Free Languages (0)
- 29: B-tree Data Structure (0)
- 23: Balanced Trees (0)
- 22: Guide to the “Cpu-Bound” and “I/O Bound” Terms (0)
- 22: Ensemble Learning (0)
- 21: What Is the Difference Between Active and Passive FTP? (0)
- 21: Why Can’t Prim’s or Kruskal’s Algorithms Be Used on a Directed Graph? (0)
- 20: Decision Tree vs. Naive Bayes Classifier (0)
- 20: Tree vs Graph Data Structure (0)
- 19: How to Sort Mostly Sorted Arrays (0)
- 19: Encoding vs. Signing in Asymmetric Encryption (0)
- 17: The Skip List Data Structure (0)
- 16: Accuracy vs AUC in Machine Learning (0)
- 15: Bayesian Networks (0)
- 15: Active vs. Passive Connection in TCP (0)
- 11: Biases in Machine Learning (0)
- 11: Unit Testing vs Test-Driven Development (0)
- 09: Induced Subgraphs (0)
- 08: Cache Miss, TLB Miss, Page Fault (0)
- 07: The Difference Between 127.0.0.1 and Localhost (0)
- 07: When Coherence Score Is Good or Bad in Topic Modeling? (0)
- 07: How Do Markov Chain Chatbots Work? (0)
- 07: Weighted vs. Unweighted Graphs (0)
- 06: Prim’s Algorithm (0)
- 05: Stratified Sampling in Machine Learning (0)
- 04: Rank of a Node in a Binary Search Tree (0)
- 04: The Pseudo-Header in TCP (0)
- 03: Outlier Detection and Handling (0)
- 02: Finding the In-Order Successor of a Node (0)
- 01: Data Mining in WEKA (0)
-
November 2021
(35)
- 29: Differences Between Core and CPU (0)
- 29: Types of Operating Systems (0)
- 29: From Lists to Forests (0)
- 26: Backtracking vs. Depth-First Search (0)
- 26: Choosing a Learning Rate (0)
- 26: From Recursive to Iterative Functions (0)
- 23: Messages: Payload, Header, and Overhead (0)
- 22: Streaming Median (0)
- 21: An Introduction to the Voronoi Diagram (0)
- 20: Tail vs. Non-Tail Recursion (0)
- 20: Underfitting and Overfitting in Machine Learning (0)
- 19: The Difference Between a Heuristic and an Algorithm (0)
- 19: Binary Semaphores vs. Counting Semaphores (2)
- 18: Are HTTPS URLs Encrypted? (0)
- 17: Introduction to Transactions (0)
- 17: Circle Line-Segment Collision Detection Algorithm (0)
- 17: Minimax Algorithm (0)
- 15: The Akra-Bazzi Method (0)
- 15: How Do “20 Questions” AI Algorithms Work? (0)
- 14: Generating Permutations with Repetition (0)
- 12: TCP: Differences Between FIN and RST (0)
- 11: Bidirectional Search for Path Finding (0)
- 11: Calculating Total Transmission Time of a Packet (0)
- 10: Calculating the Parity Bit of a Bit Sequence (0)
- 10: How to Calculate the Regularization Parameter in Linear Regression (0)
- 05: How to Get Vector for A Sentence From Word2vec of Tokens (0)
- 05: HTTP: Differences Between PUT and PATCH (0)
- 04: Hashing a Tree Structure (0)
- 04: Q-Learning vs. Dynamic Programming (0)
- 03: How to Solve Constraint Satisfaction Problems (0)
- 03: Languages for Data Structures (1)
- 03: The Difference Between a Framework and a Library (0)
- 02: Feature Selection and Reduction for Text Classification (0)
- 02: File Structures (0)
- 02: Layered Architecture (0)
-
October 2021
(36)
- 31: Imperative and Declarative Programming Paradigms (0)
- 31: Expectimax Search Algorithm (0)
- 31: Internal Fragmentation vs. External Fragmentation in Paging (1)
- 31: How Many Principal Components to Take in PCA? (0)
- 30: Grasshopper Optimization Algorithm (0)
- 29: Statically Typed vs Dynamically Typed Languages (0)
- 28: Real World Examples of Tree Structures (0)
- 28: OSI Model: Packets vs. Frames (0)
- 26: Finding Arrangements of Blocks With L Left Visible Blocks and R Right Visible Blocks (0)
- 24: Dijkstra vs. A* – Pathfinding (0)
- 24: Flow Control vs. Congestion Control in TCP (0)
- 23: Count the Number of Set Bits in an Integer (0)
- 23: High-Level Languages vs. Low-Level Languages (0)
- 23: The Subnets in IPv4 Networks (0)
- 22: Segment Tree and Its Applications (0)
- 21: Fastest Algorithm to Find Prime Numbers (0)
- 20: Depth-First Search vs. Breadth-First Search (0)
- 19: Introduction to SAML (0)
- 18: Graph Search vs. Tree-Like Search (0)
- 18: Multicast vs. Broadcast vs. Anycast vs. Unicast (0)
- 17: Difference Between a SVM and a Perceptron (0)
- 15: Uniform-Cost Search vs. Best-First Search (0)
- 14: Segmented Paging vs. Paged Segmentation (0)
- 13: Understanding Routing Table Entry (0)
- 11: The Informed vs. Uninformed Search Algorithms (0)
- 10: Why Mini-Batch Size Is Better Than One Single “Batch” With All Training Data (0)
- 09: Files and File Systems (0)
- 09: Spinlock vs. Semaphore (0)
- 08: Memory Management (0)
- 08: Calculate Upload/Download Speed Using Ping (0)
- 06: How to Design Deep Convolutional Neural Networks? (0)
- 06: Finding All Tic-Tac-Toe Winning Combinations (0)
- 06: Introduction to Serverless Architecture (1)
- 04: Tracing the Path in DFS, BFS, and Dijkstra’s Algorithm (0)
- 04: Clean Code – Formatting (2)
- 01: Beam Search Algorithm (0)
-
September 2021
(32)
- 29: Intuitive Explanation of the Expectation-Maximization (EM) Technique (0)
- 29: Multiprocessing and Multithreading (0)
- 28: Pattern Recognition in Time Series (0)
- 27: Iterative Deepening vs. Depth-First Search (0)
- 27: An Algorithm for Inflating and Deflating Polygons (0)
- 27: API Gateway vs. Reverse Proxy (0)
- 25: What Is Abstract Data Type? (0)
- 24: How to Create a Smart Chatbot? (0)
- 23: Advanced CPU Designs (0)
- 23: Finding the Largest Balanced Subarray (0)
- 23: Finding the Number of Occurrences of a Subsequence in a String (0)
- 23: Distributed System vs. Distributed Computing? (0)
- 22: Hill Climbing Search vs. Best First Search (0)
- 21: Introduction to Cache Memory (0)
- 19: Find the Majority Element of an Array (0)
- 18: Instructions and Programs (0)
- 18: Complexity Analysis of QuickSelect (0)
- 16: Finding Dates, Times and Addresses in Emails (0)
- 16: Finding the Volume of Water Collected Between Towers (0)
- 15: Candidate Elimination Algorithm (0)
- 15: Extended Euclidean Algorithm (0)
- 15: Docker and Containers vs. Virtual Machines (0)
- 14: Request Timed Out vs. Destination Host Unreachable (0)
- 11: Knight’s Shortest Path on Chessboard (0)
- 11: The Difference Between an Argument and a Parameter (0)
- 09: IPv4 Datagram (0)
- 08: Two-Way Handshake and Three-Way Handshake (0)
- 07: Guide to the CPU (0)
- 06: Edge Relaxation in Dijkstra’s Algorithm (0)
- 04: The REST Architecture (0)
- 03: Choosing the best q and p from ACF and PACF plots in ARMA-type modeling (0)
- 01: Finding the K Smallest Numbers in an Array (0)
-
August 2021
(33)
- 31: An Overview of Evolutionary Algorithms (0)
- 31: Binary Trees vs. Linked Lists vs. Hash Tables (0)
- 31: Protocols Used for PING (0)
- 29: Socket Binding (0)
- 28: Sine Cosine Algorithm (0)
- 27: How Is a Minimum Bottleneck Spanning Tree Different from a Minimum Spanning Tree? (0)
- 27: Open-Source AI Engines (0)
- 26: Whale Optimization Algorithm (0)
- 25: Finding Three Elements in an Array Whose Sum Is Closest to a Given Number (0)
- 25: Algorithms to Generate K-Combinations (0)
- 24: Arithmetic Logic Unit (0)
- 23: Program Counter and Instruction Register (0)
- 23: Greedy vs. Heuristic Algorithm (0)
- 23: Hash Table vs. Balanced Binary Tree (0)
- 22: What Is a Loop Invariant? (0)
- 21: NLP’s word2vec: Negative Sampling Explained (0)
- 20: LL vs. LR Parsing (0)
- 19: Out-of-bag Error in Random Forests (0)
- 15: Introduction to ASCII Code (0)
- 15: External Sorting vs Internal Sorting (0)
- 15: Stack Data Structure (0)
- 15: How to Find an Area of Overlapping Rectangles (0)
- 12: Compiled vs. Interpreted Programming Languages (0)
- 10: Linked List / Double Linked List (0)
- 10: Registers and RAM (0)
- 07: What Does “Busy Waiting” Mean in Operating Systems? (0)
- 05: Introduction to Assembly Language (1)
- 03: Binary Search Tree with Strings (0)
- 02: How to Calculate Receptive Field Size in CNN (0)
- 01: What Is Thrashing? (0)
- 01: When Will the Worst Case of Merge Sort Occur? (0)
- 01: Searching in a Sorted and Rotated Array (0)
- 01: Full, Para, and Hardware-Assisted Virtualization Compared (0)
-
July 2021
(26)
- 31: Runtime vs. Compile Time (0)
- 31: Grey Wolf Optimization Algorithm (0)
- 31: Finding the Only Unpaired Element in the Array (0)
- 31: k-Nearest Neighbors and High Dimensional Data (0)
- 30: Finding Maximum Size Square in a Matrix Filled With Ones (0)
- 29: Sockets: Close vs. Shutdown (0)
- 29: State Machines: Components, Representations, Applications (0)
- 29: Dijkstra vs Floyd-Warshall Algorithms (0)
- 26: Calculate the Number of Binary Search Trees with N Distinct Elements (0)
- 26: The Most Efficient Way to Implement an Integer Based Power Function (0)
- 23: Finding the Next Smaller Element for Each Element in an Array (0)
- 21: Algorithms to Check If a Number Is a Power of 2 (0)
- 21: Merging Two Binary Search Trees (0)
- 21: Job vs. Task vs. Process (0)
- 17: Technical Debt (0)
- 17: OSI Model: Transport Layer vs. Networking Layer (0)
- 16: RISC vs. CISC (0)
- 16: Using a Hard Margin vs. Soft Margin in SVM (0)
- 10: What Is the Difference Between Trap and Interrupt? (0)
- 08: Value Iteration vs. Policy Iteration in Reinforcement Learning (0)
- 06: How To Convert a Text Sequence to a Vector (0)
- 06: Process Scheduling (0)
- 06: Understanding Time Complexity Calculation for Dijkstra Algorithm (0)
- 04: Expression vs. Statement (0)
- 03: Why Are TCP and UDP More Popular Than SCTP? (0)
- 01: Microservices and Cross-Cutting Concerns (0)
-
June 2021
(21)
- 29: Instance vs Batch Normalization (0)
- 28: Number of Nodes in a Binary Tree With Level N (0)
- 27: Intuition Behind Gradient Descent Algorithm (0)
- 27: Code Smells (0)
- 23: The Difference Between Virtual Memory and Swap Space (0)
- 23: Difference Between Access Point, Station, Bridge, and Router (0)
- 22: Compile Time vs. Load Time vs. Execution Time (0)
- 22: Propagation Delay vs Transmission Delay (0)
- 22: Minimum Number of Steps to Reduce Number to One (0)
- 22: Routers vs. Switches vs. Access Points (0)
- 22: Trade-offs Between Accuracy and the Number of Support Vectors in SVMs (0)
- 20: Deadlock: What It Is, How to Detect, Handle and Prevent? (0)
- 18: Priority Queue (2)
- 12: Time Complexity vs. Space Complexity (0)
- 11: Negative Weights Using Dijkstra’s Algorithm (0)
- 10: Symmetric Cryptography vs Asymmetric Cryptography (0)
- 07: Difference between Big-O and Little-o Notations (0)
- 05: Primality Test: Miller-Rabin Method (0)
- 05: Physical vs. Virtual Memory (0)
- 05: Quicksort vs. Heapsort (0)
- 04: Divide and Conquer vs. Dynamic Programming (0)
-
May 2021
(16)
- 31: Process vs. Thread (0)
- 29: Why Do We Need Virtual Memory? (0)
- 29: What Is a Chipset? (0)
- 26: Fermat Primality Test (0)
- 25: Difference Between Cohesion and Coupling (0)
- 22: Which Sorting Algorithm to Use? (0)
- 22: What Is a Heuristic Function? (0)
- 21: Open Source Neural Network Libraries (0)
- 15: BIOS vs. CMOS vs. UEFI (0)
- 15: What’s the Difference Between User and Kernel Modes? (0)
- 14: Database Design in a Microservices Architecture (0)
- 10: Print All Paths With a Given Sum in a Binary Tree (0)
- 10: Refactoring (0)
- 07: Transformer Text Embeddings (0)
- 05: Applications of Binary Trees (0)
- 03: What Is an OS Kernel? (0)
-
April 2021
(17)
- 30: Insertion Sort vs. Bubble Sort Algorithms (0)
- 30: Pairing Socks From a Pile Efficiently (0)
- 28: The Difference Between a Method and a Function (0)
- 28: Deadlock, Livelock and Starvation (0)
- 27: Client vs. Server Terminology (0)
- 19: Difference Between Layers and Tiers (0)
- 19: Saga Pattern in Microservices (0)
- 19: Generative vs. Discriminative Algorithms (0)
- 18: Semantic Similarity of Two Phrases (0)
- 11: Virtual Memory (0)
- 10: API Authentication – Tokens vs Sessions (0)
- 10: Authentication vs Authorization (0)
- 09: Polynomial Addition and Multiplication Using Linked List (0)
- 09: Ackermann Function (0)
- 08: Quicksort vs. Mergesort (0)
- 07: Understanding Complexity of Cryptographic Algorithms (0)
- 02: Difference Between IP Address and Port Number (0)
-
March 2021
(18)
- 24: Why Feature Scaling in SVM? (0)
- 22: Automatic Keyword and Keyphrase Extraction (0)
- 19: Semaphore vs. Mutex (1)
- 18: Generalized Suffix Trees (0)
- 17: Normalization vs Standardization in Linear Regression (0)
- 16: Alternatives of Ten – Binary, Octal, Hexadecimal (0)
- 16: Finding the Shortest Path in a Graph Visiting All Nodes (0)
- 12: Serialize and Deserialize a Binary Tree (0)
- 11: Word Embeddings: CBOW vs Skip-Gram (0)
- 10: SSL vs. SSH (0)
- 10: A Guide to Semantic Versioning (0)
- 08: String Similarity Metrics: Sequence Based (0)
- 07: What Does It Mean to Program to Interfaces? (0)
- 07: Appointment Scheduling Algorithm (0)
- 06: How to Improve Naive Bayes Classification Performance? (0)
- 05: Do Sessions Violate RESTfulness? (0)
- 05: Brewer’s CAP Theorem (0)
- 04: Obtaining the Path in the Uniform Cost Search Algorithm (0)
-
February 2021
(14)
- 28: SYN/ACK in the TCP Protocol (0)
- 24: Ugly Duckling Theorem (0)
- 22: Topic Modeling with Word2Vec (0)
- 17: How to Merge Sort A Linked List (0)
- 17: Normalize Features of a Table (0)
- 16: Bit Stuffing (0)
- 16: Definition of Network Units: Packet, Fragment, Frame, Datagram, and Segment (0)
- 15: Networking: IPv4 vs. IPv6 Addresses (0)
- 11: Understanding BDD (0)
- 09: String Similarity Metrics: Token Methods (0)
- 05: Comparison Between Uniform-Cost Search and Dijkstra’s Algorithm (0)
- 04: The Difference Between a Port and a Socket (2)
- 01: Finding the Lowest Common Ancestor in a Directed Acyclic Graph (0)
- 01: Inter-Process Communication (0)
-
January 2021
(18)
- 30: Gradient Descent Equation in Logistic Regression (0)
- 30: Correlated Features and Classification Accuracy (0)
- 30: Offline Concurrency Control (0)
- 27: Dynamic Linking vs. Dynamic Loading (0)
- 27: Weakly Supervised Learning (0)
- 23: Find Local Minimum in N x N Matrix (0)
- 23: What Is the Time Complexity of Tree Traversal? (0)
- 21: Cross-Origin Resource Sharing and Why We Need Preflight Requests (0)
- 19: Interpretation of Loss and Accuracy for a Machine Learning Model (0)
- 18: Using Min/Max Within an Integer Linear Program (0)
- 17: Guide to Single Sign-On (SSO) (0)
- 14: Splitting a Dataset into Train and Test Sets (0)
- 14: Difference Between REST and HTTP (0)
- 11: Encoder-Decoder Models for Natural Language Processing (0)
- 08: Solving the K-Armed Bandit Problem (0)
- 07: Minimum Cut on a Graph Using a Maximum Flow Algorithm (0)
- 07: Process Lifecycle (0)
- 05: How to Determine if a List of Polygon Points Are in Clockwise Order (0)
-
December 2020
(15)
- 29: Epoch in Neural Networks (0)
- 26: Fundamentals of Distributed Systems (0)
- 24: Flood Fill Algorithm (0)
- 23: Complexity of Inserting N Numbers into a Binary Search Tree (0)
- 18: Epsilon-Greedy Q-learning (0)
- 15: GIT vs. SVN (0)
- 13: Popular Network Protocols (0)
- 13: Haversine Formula (0)
- 12: Time Complexity of Sieve of Eratosthenes Algorithm (0)
- 10: Advanced Data Structures (0)
- 09: Number of Shortest Paths in a Graph (2)
- 08: Object-Oriented vs Functional Programming (2)
- 08: Find Cycle Start Node in a Singly Linked List (0)
- 08: Random Initialization of Weights in a Neural Network (0)
- 01: Sum of Digits in Factorial (0)
-
November 2020
(16)
- 26: Backtracking Algorithms (0)
- 25: OSI Model (0)
- 19: Calculating the Height of a Binary Tree (4)
- 17: Why Is an OPTIONS Request Sent? (0)
- 17: How to Calculate the Number of Different Binary and Binary Search Trees (0)
- 16: The Pigeonhole Principle (0)
- 14: Topic Modeling with Latent Dirichlet Allocation (0)
- 14: String Similarity Metrics – Edit Distance (0)
- 13: REST vs SOAP (0)
- 12: The General Concept of Polymorphism (0)
- 09: Time Complexity of Searching in a Balanced Binary Search Tree (0)
- 08: Time Complexity of Inserting into a Heap (0)
- 08: Algorithm to Generate a Maze (0)
- 06: Algorithms to Check if a Linked List Is a Circular Linked List (0)
- 05: Max-Heapify A Binary Tree (0)
- 01: Traveling Salesman Problem – Dynamic Programming Approach (2)
-
October 2020
(13)
- 29: Batch Normalization in Convolutional Neural Networks (2)
- 17: Calculating the Range of IP Addresses from Subnet Mask (2)
- 17: UDP vs TCP (0)
- 16: CRC Vs Checksum (0)
- 16: Fundamental Difference Between Hashing and Encryption Algorithms (0)
- 14: Clean Code: Naming (0)
- 12: HTTP Status Codes (0)
- 10: Matrix Multiplication Algorithm Time Complexity (0)
- 08: Heap vs Binary Search Tree (2)
- 07: Multiclass Classification Using Support Vector Machines (1)
- 07: Minimum Spanning Tree: The Cut Property (0)
- 06: Counting Inversions in an Array (0)
- 01: Converting a Word to a Vector (0)
-
September 2020
(46)
- 30: Reinforcement Learning with Neural Network (0)
- 30: Time Complexity of Euclid’s Algorithm (0)
- 29: Greedy Algorithm to Find Minimum Number of Coins (0)
- 27: Finding a Cycle in a Singly Linked-List (0)
- 25: Finding the Most Significant Bit (0)
- 25: What Is a Semaphore? (2)
- 24: Complete Binary Tree vs Almost Complete Binary Tree (0)
- 24: Generate All Permutations of an Array (0)
- 24: What Is an Augmenting Path? (0)
- 24: Non-Recursive Merge Sort (0)
- 22: Introduction to Depth First Search Algorithm (DFS) (0)
- 20: Using Leaf Count to Find Total Number of Nodes in a Full K-Ary Tree (0)
- 20: Algorithm for “Nice” Grid Line Intervals on a Graph (0)
- 19: The Difference Between Lower Bound and Tight Bound (0)
- 19: Roulette Selection in Genetic Algorithms (0)
- 17: Merge Two Sorted Arrays Into a Sorted Array (0)
- 17: Efficient Ways to Find the Intersection of Lists (1)
- 16: Height of a Balanced Tree (0)
- 16: Geofencing – Determining Whether a Point Is Inside of a Polygon (0)
- 16: Choosing an Attractive Linear Scale for a Graph’s Y Axis (0)
- 16: Converting a Uniform Distribution to a Normal Distribution (0)
- 16: Gradient Descent vs. Newton’s Gradient Descent (0)
- 15: Remove Duplicates From a Linked List (0)
- 13: How Does the Google “Did You Mean?” Algorithm Work? (0)
- 13: Maximizing Profit for Given Stock Quotes (0)
- 13: Getting a Path From a Root to a Node in a Binary Tree (0)
- 12: Understanding Forecast Accuracy: MAPE, WAPE, WMAPE (0)
- 11: Worst Sorting Algorithms – What to Avoid (1)
- 11: Brute Force Algorithm in Cybersecurity and String Search (0)
- 10: What Is a Dmz in Networking? (0)
- 10: How Does FIFO Page Replacement Work? (0)
- 10: What Is Cross-Entropy? (0)
- 08: What Is an Idempotent Operation? (0)
- 08: Algorithms for Determining Text Sentiment (0)
- 08: Palindromic Substrings in O(n) with Manacher’s Algorithm (0)
- 07: Finding All Overlapping Intervals (0)
- 07: Peak Detection in a Measured Signal (0)
- 07: Advantages and Disadvantages of Neural Networks Against SVMs (0)
- 07: Peak Detection in a 2D Array (0)
- 06: Maximum Single-Sell Profit (0)
- 05: Time and Space Complexity of Adjacency Matrix and List (2)
- 03: Graph Auto-Layout Algorithm (0)
- 03: Find All Simple Paths Between Two Vertices in a Graph (0)
- 02: How to Reverse a Linked List (0)
- 01: Determine Whether Two Nodes in a Graph Are Connected (0)
- 01: Clean Code: Comments (4)
-
August 2020
(45)
- 31: Draw a Chart Using LaTeX (0)
- 30: Top-N Accuracy Metrics (0)
- 30: Draw a Graph Using LaTeX (2)
- 30: Choosing the Subarray That Adds Up to a Target Number (0)
- 30: Generating Dependency Graphs With Text (2)
- 28: Sort Points in Clockwise Order (0)
- 27: Finding the Kth Smallest Element in the Union of Two Sorted Arrays (0)
- 27: Find the Subset of Numbers That Add Closest to Target Number (0)
- 27: Introduction to Firewalls (0)
- 26: Find the Next Higher Number (0)
- 26: How to Calculate the Area of a 2D Polygon? (0)
- 26: Sentiment Analysis Dictionaries (0)
- 24: Graphs: Sparse vs Dense (0)
- 24: Neural Network Architecture: Criteria for Choosing the Number and Size of Hidden Layers (0)
- 23: What’s the Difference Between a Word and a Byte? (0)
- 23: Branch and Bound Algorithm (0)
- 23: Reconstructing a Tree From Its Depth-First Traversals (0)
- 22: How to Validate a Binary Search Tree? (0)
- 22: Training Data for Sentiment Analysis (0)
- 22: Looping in a Spiral (0)
- 22: What the Correlation Coefficient Actually Represents (0)
- 20: Introduction to SSH (0)
- 19: Differences Between Classification and Clustering (0)
- 19: F-1 Score for Multi-Class Classification (0)
- 18: The Difference Between Epoch and Iteration in Neural Networks (0)
- 15: Create Balanced Binary Search Tree From Sorted List (2)
- 14: What Is a Mutex? (0)
- 14: Understanding Randomness (0)
- 13: A* Pathfinding Algorithm (0)
- 13: Overview of Rabin-Karp Algorithm (0)
- 12: How to Prove That a Problem Is NP-Complete? (0)
- 12: Introduction to the Domain Name System (DNS) (0)
- 11: Quicksort Worst Case Time Complexity (6)
- 09: Object-Orientation in the Real World (0)
- 09: Deep Dive into Hashing (0)
- 09: What Is a Policy in Reinforcement Learning? (2)
- 08: What Is the Difference Between Gradient Descent and Gradient Ascent? (0)
- 07: Overview of Dijkstra’s Algorithm (0)
- 06: SVM Vs Neural Network (0)
- 06: How to Check If a Binary Tree Is Symmetric? (0)
- 05: Support Vector Machines (SVM) (0)
- 04: Finding XOR of All Numbers in a Given Range (0)
- 04: Implementing the Decrease-Key Operation for Min-Heaps (0)
- 03: Levenshtein Distance Computation (0)
- 02: When Not to Use Regular Expressions? (0)
-
July 2020
(50)
- 31: Regular Expressions (0)
- 31: Boolean Algebra: Basic Laws (0)
- 31: Introduction to VLAN (0)
- 30: Normalizing Inputs for an Artificial Neural Network (0)
- 30: What Is a Learning Curve in Machine Learning? (1)
- 27: Introduction to Convolutional Neural Networks (0)
- 27: Lowest Common Ancestor of Two Nodes in a Tree (0)
- 27: Introduction to the Classification Model Evaluation (0)
- 27: Dijkstra’s vs Bellman-Ford Algorithm (2)
- 25: Introduction to DHCP (0)
- 25: Introduction to RAID (0)
- 25: Computing Bubble Sort Time Complexity (0)
- 24: Sorting the Elements in a Binary Tree (0)
- 24: Introduction to the Binary Tree Data Structure (1)
- 23: Why Does the Cost Function of Logistic Regression Have a Logarithmic Expression? (3)
- 23: Linear Regression vs. Logistic Regression (0)
- 21: The Complexity of Towers of Hanoi (0)
- 21: Sliding Window Algorithm (0)
- 20: First-Order Logic (0)
- 20: Bias in Neural Networks (2)
- 20: How to Find Total Number of Minimum Spanning Trees in a Graph? (0)
- 16: Self-Balancing Binary Search Trees (0)
- 16: What Is a Race Condition? (1)
- 14: Detecting Cycles in a Directed Graph (4)
- 14: How Compilers Work (0)
- 14: Floyd-Warshall Algorithm: Shortest Path Finding (0)
- 14: How to Compute the Similarity Between Two Text Documents? (0)
- 14: Topological Sort of Directed Acyclic Graph (0)
- 13: Propositional Logic (0)
- 13: Introduction to Graph Theory (1)
- 13: How to Build a Knowledge Graph? (0)
- 12: Virtualization vs Containerization (0)
- 10: The Difference Between Asynchronous and Multi-Threading (1)
- 10: Finding Articulation Points of a Graph (0)
- 09: Introduction to Red-Black Trees (2)
- 08: Difference Between a Feature and a Label (0)
- 08: Differences Between Tree Structures (0)
- 08: Kruskal’s vs Prim’s Algorithm (3)
- 07: Function Parameters: Call by Reference vs Call by Value (0)
- 07: SAT and 3-SAT – Cook-Levin Theorem (0)
- 06: Computing the Diameter of a Network (0)
- 06: The Liskov Substitution Principle (2)
- 04: Big Data vs Data Mining (0)
- 04: Cache Write Policy (0)
- 03: Data Normalization Before or After Splitting a Data Set? (0)
- 02: What Is the Difference Between Labeled and Unlabeled Data? (0)
- 02: Introduction to Emotion Detection in Written Text (0)
- 02: A Simple Explanation of Naive Bayes Classification (0)
- 01: Computer Science Definition of Entropy (0)
- 01: Maximum Value of an Integer: Java vs C vs Python (2)
-
June 2020
(28)
- 30: What Are the Prerequisites for Studying Machine Learning? (0)
- 29: Go-Back-N Protocol (0)
- 28: What Is an Incident Edge? (0)
- 28: Determine Maximum Number of Edges in a Directed Graph (0)
- 28: 0-1 Knapsack: A Problem With NP-Completeness and Solvable in Pseudo-Polynomial Time (2)
- 27: How to Find If a Graph Is Bipartite? (6)
- 27: What Is the Difference Between a Directed and an Undirected Graph (0)
- 26: Advantages and Disadvantages of Neural Networks (0)
- 25: Introduction to Virtualization (0)
- 25: Process Control Block (0)
- 24: Stemming vs Lemmatization (0)
- 23: Euclidean Distance vs Cosine Similarity (1)
- 23: Divide and Conquer Algorithms (1)
- 23: Publicly Available Spam Filter Training Sets (0)
- 22: Types of Queues (2)
- 22: Shortest Path to Certain Nodes in a Graph (0)
- 21: Fibonacci: Top-Down vs Bottom-Up Dynamic Programming (0)
- 17: Constituency Parsing vs Dependency Parsing (0)
- 15: Feature Scaling (0)
- 12: PCA: Principal Component Analysis (0)
- 11: An Introduction to Amortized Analysis (0)
- 10: A Quick Guide to Binary Search Trees (2)
- 10: Determining Whether a Directed or Undirected Graph Is a Tree (0)
- 09: Hamiltonian vs Euler Path (0)
- 08: Bellman Ford Shortest Path Algorithm (2)
- 08: Functional Programming (0)
- 04: Understanding Dimensions in CNNs (1)
- 02: Linear Search vs Binary Search (1)
-
May 2020
(21)
- 31: Finding the Lowest Common Ancestor of Two Nodes in a Binary Tree (0)
- 30: How ReLU and Dropout Layers Work in CNNs (0)
- 29: Nonlinear Activation Functions in a Backpropagation Neural Network (0)
- 29: Finding the Maximum-Minimum Capacity for a Node in a Graph (0)
- 28: Longest Palindromic Subsequence With Dynamic Programming (0)
- 26: Implement Stack Using Two Queues (2)
- 25: Minimum Spanning Tree vs Shortest Path Tree (0)
- 23: The ABA Problem in Concurrency (0)
- 23: Inadequacy of Linear Models: the Road to Nonlinear Functions (0)
- 21: Tries (Prefix Trees) (0)
- 21: Knuth-Morris-Pratt Algorithm (0)
- 20: What Is the Optimal Algorithm for the Game 2048? (0)
- 17: What Is a Monitor in Computer Science? (0)
- 15: Connected Components in a Graph (0)
- 15: The Difference Between B-trees and B+trees (1)
- 13: Difference Between BFS and Dijkstra’s Algorithms (2)
- 12: Difference Between Tree Depth and Height (0)
- 08: Understanding Space Complexity (3)
- 05: Cycles in an Undirected Graph (0)
- 05: Greedy Approach vs Dynamic Programming (1)
- 04: Genetic Algorithms vs Neural Networks (0)
-
April 2020
(7)
- 29: Graph Data Structures (0)
- 27: Solving Binary Gap Using Recursion (3)
- 24: Predicates in Computer Science (0)
- 16: Longest Increasing Subsequence Using Dynamic Programming (0)
- 14: Clustering Into an Unknown Number of Clusters (0)
- 12: Computational Complexity of Fibonacci Sequence (0)
- 07: Methods of Depth First Traversal and Their Applications (0)
- March 2020 (5)
-
February 2020
(1)
- 29: Two’s Complement (0)
- January 2020 (5)