https://sites.google.com/view/connected-components/home
]]>enMathematicsAmCan Techhttps://d3wo5wojvuv7l.cloudfront.net/t_rss_itunes_square_1400/images.spreaker.com/original/ad9396e0e90c1a108c6db116664c6a4f.jpghttps://sites.google.com/view/connected-components/homeFri, 17 Jul 2026 08:35:19 +0000AmCan TechAmCan Techpod@unitmeasure.xyzA podcast where logic meets lunacy, and graphs guide the way through the madness! Join us as we explore the beautiful intersections of mathematical logic, graph theory, discrete math, computer science, and the quirky chaos of everyday life. From...
]]>falsetrueepisodichttps://www.spreaker.com/episode/intro-to-compiler-theory-part-1--70212220
Visit our website here: https://sites.google.com/view/connected-components/home

This episode includes AI-generated content.]]>https://api.spreaker.com/episode/70212220Sun, 22 Feb 2026 14:14:27 +0000trueAmCan TechThis is a comprehensive introduction to compiler theory and the systematic process of translating high-level programming languages into machine-executable code. We outline the modular architecture of a compiler, divided into a frontend for source...
Visit our website here: https://sites.google.com/view/connected-components/home

This episode includes AI-generated content.]]>1145compiler,compilers,computers,connectedcomponents,cs,engineering,parsing,regex,science,stemfalse31fullhttps://www.spreaker.com/episode/eigenvalues-and-eigenvectors-the-secret-sauce-of-modern-tech-from-graphics-to-google--67357577
Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/67357577Sun, 17 Aug 2025 17:20:07 +0000AmCan TechThis episode outlines Eigenvalues and Eigenvectors in Linear Algebra. We highlight the practical uses of these abstract topics. 
Visit our website here: https://sites.google.com/view/connected-components/home]]>1086computerscience,eigenvectors,linearalgebra,math,science,stemfalse210fullhttps://www.spreaker.com/episode/decoding-language-the-power-of-context-free-grammars-in-computing--67357275
Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/67357275Thu, 14 Aug 2025 13:35:08 +0000AmCan TechThis bonus episode explores what context-free grammars are in automata theorem. 
Visit our website here: https://sites.google.com/view/connected-components/home]]>1027automata,computation,computerscience,engineering,grammars,math,recursionfalse29bonushttps://www.spreaker.com/episode/demystifying-automata-theory-from-finite-machines-to-regular-languages--67357432
Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/67357432Wed, 13 Aug 2025 16:55:07 +0000AmCan TechThis deep dive offers comprehensive overview of automata theory and formal languages. They begin by introducing finite automata (FA), including Deterministic Finite Automata (DFA) and Non-deterministic Finite Automata (NFA), alongside fundamental...
Visit our website here: https://sites.google.com/view/connected-components/home]]>3816automata,computation,computerscience,engineering,grammars,languages,math,recursionfalse28fullhttps://www.spreaker.com/episode/secrets-hidden-in-pdf-pages--66168472
Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/66168472Tue, 20 May 2025 10:57:52 +0000AmCan TechIn this episode, we explore a novel method for distributed steganography using PDF files. The technique involves splitting a secret message using secret sharing algorithms and embedding the parts into PDFs by manipulating their internal...
Visit our website here: https://sites.google.com/view/connected-components/home]]>1070cryptography,cybersecurity,datahiding,digitalprivacy,pdfsecurity,secretsharing,steganographyfalse27fullhttps://www.spreaker.com/episode/finite-automata-what-you-need-to-know--65310126
Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/65310126Wed, 02 Apr 2025 11:27:55 +0000AmCan TechAutomata theory: it's a computational model study, focusing on finite automata (DFA and NFA) and push-down automata (PDA). The course explores regular languages, their properties and proofs of non-regularity using concepts like the pumping lemma and...
Visit our website here: https://sites.google.com/view/connected-components/home]]>1573automata,computational,computers,dfa,engineering,languages,nfafalse26fullhttps://www.spreaker.com/episode/shamir-s-secret-a-paypal-near-disaster--64144672



Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/64144672Sat, 29 Mar 2025 12:10:07 +0000AmCan TechThis account recounts a nightmarish incident at PayPal where a flawed implementation of Shamir Secret Sharing, a cryptographic technique for distributing a secret key among multiple parties, nearly caused a catastrophic system failure. The author, a...



Visit our website here: https://sites.google.com/view/connected-components/home]]>501cryptography,encryption,paypal,shamirfalse25fullhttps://www.spreaker.com/episode/slap-and-flop-apple-silicon-speculative-execution-attacks--63971801



Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/63971801Tue, 18 Mar 2025 18:50:07 +0000AmCan TechSLAP and FLOP are two new speculative execution attacks targeting Apple's M-series chips. SLAP exploits the Load Address Predictor (LAP) to leak data by predicting incorrect memory addresses, while FLOP leverages the Load Value Predictor (LVP) to...



Visit our website here: https://sites.google.com/view/connected-components/home]]>933apple,computers,cybersecurity,iphone,m1,macbook,slopfalse24fullhttps://www.spreaker.com/episode/subaru-starlink-security-flaw--63971789








Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/63971789Wed, 12 Mar 2025 14:15:07 +0000AmCan TechSecurity researchers discovered and exploited a vulnerability in Subaru's Starlink connected car system. This flaw allowed unauthorized access to sensitive data, including vehicle location history, and control over features like door locks. The...








Visit our website here: https://sites.google.com/view/connected-components/home]]>651cybersecurity,starlink,subarufalse23fullhttps://www.spreaker.com/episode/hash-tables-theory-implementation-and-universal-hashing--64286621



Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/64286621Sun, 16 Feb 2025 11:40:07 +0000AmCan TechIn this episode, we explore hash tables, a data structure designed for efficient insertion, deletion, and searching of data using keys. The document contrasts direct addressing with hashing, highlighting the space efficiency of hash tables when...



Visit our website here: https://sites.google.com/view/connected-components/home]]>974computerscience,datastructures,hashing,hashtables,openaddressing,probing,slots,softwareengineer,stemfalse22fullhttps://www.spreaker.com/episode/suffix-trees-construction-properties-and-applications--64286345









Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/64286345Fri, 14 Feb 2025 13:30:07 +0000AmCan TechToday, we are exploring suffix trees, a data structure used for solving string problems.We begin with basic definitions related to strings and alphabets, then introduces suffix trees as compressed tries containing all suffixes of a given text....









Visit our website here: https://sites.google.com/view/connected-components/home]]>593computerscience,datastructure,engineering,math,science,software,stem,suffixtrees,triesfalse21fullhttps://www.spreaker.com/episode/disjoint-sets-data-structures-and-algorithms--64286284
Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/64286284Tue, 11 Feb 2025 13:30:08 +0000AmCan TechWe discuss disjoint sets, also known as union-find data structures. Disjoint sets maintain collections of elements partitioned into non-overlapping sets, each with a representative element. Key operations include Make-Set (creating a new set),...
Visit our website here: https://sites.google.com/view/connected-components/home]]>729computerscience,disjointsets,graphs,makeset,softwareengineering,stem,unionfalse110fullhttps://www.spreaker.com/episode/b-tree-data-structure-search-insertion-and-deletion--64286238
Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/64286238Sun, 09 Feb 2025 19:35:27 +0000AmCan TechJump in and discover the B-tree data structure, a fundamental tool for processing queries on one-dimensional data stored on disk. We explain how B-trees efficiently support range reporting, successor/predecessor searches, insertion, and deletion...
Visit our website here: https://sites.google.com/view/connected-components/home]]>1073btree,computerscience,databases,datastructures,harddrives,softwareengineering,treesfalse19fullhttps://www.spreaker.com/episode/tries-data-structures-for-string-processing--63752342
Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/63752342Sat, 25 Jan 2025 16:55:06 +0000AmCan TechA Trie, also known as a prefix tree, is a specialized tree-based data structure primarily used for efficiently storing and retrieving strings. Unlike traditional search trees where a node stores the entire key, each node in a trie represents a prefix...
Visit our website here: https://sites.google.com/view/connected-components/home]]>945autocomplete,computers,prefix,stem,trees,triesfalse18fullhttps://www.spreaker.com/episode/topological-sort-and-strongly-connected-components--63752227
Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/63752227Sun, 19 Jan 2025 15:47:16 +0000AmCan TechThis podcast reviews key concepts related to Depth First Search (DFS) algorithm and its application in topological sorting and finding strongly connected components in graphs. 
Visit our website here: https://sites.google.com/view/connected-components/home]]>844dfs,graph,sorting,topologicalfalse17fullhttps://www.spreaker.com/episode/quicksort-and-order-selection--63329729









Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/63329729Fri, 20 Dec 2024 21:00:07 +0000AmCan TechThis episode focuses on QuickSort, a divide-and-conquer sorting algorithm, comparing it to MergeSort, and analyzing its average and worst-case time complexities. It then explains the order selection problem, which involves finding the kth smallest...









Visit our website here: https://sites.google.com/view/connected-components/home]]>848algorithms,computer,math,quicksortfalse16fullhttps://www.spreaker.com/episode/recurrence-equations-and-asymptotic-notation--63329680









Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/63329680Sun, 15 Dec 2024 19:49:38 +0000AmCan TechThis episodes presents methods for solving recurrence equations, which are crucial for analyzing the time complexity of recursive algorithms. It introduces asymptotic notations (Big O, Big Omega, Big Theta, little o, little omega) to describe the...









Visit our website here: https://sites.google.com/view/connected-components/home]]>1170algorithms,datastructures,reccurencefalse15fullhttps://www.spreaker.com/episode/physics-and-computer-science--63009598
Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/63009598Sat, 30 Nov 2024 07:45:06 +0000AmCan TechThe 2024 Nobel Prize in Physics was awarded to John Hopfield and Geoffrey Hinton for their foundational work on artificial neural networks (ANNs). The award citation highlights their contributions to machine learning, linking ANNs to concepts in...
Visit our website here: https://sites.google.com/view/connected-components/home]]>751neural networks,nobel prize in physics,physicsfalse14fullhttps://www.spreaker.com/episode/combinatorics-counting-and-permutations--63009526
Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/63009526Tue, 26 Nov 2024 06:25:14 +0000AmCan TechThis episode focuses on fundamental counting principles. It covers the product rule, sum rule, and subtraction rule for counting the number of ways to perform tasks that can be broken down into subtasks. Additionally, it explores the pigeonhole...
Visit our website here: https://sites.google.com/view/connected-components/home]]>1242combinatorics,counting,permutationsfalse13fullhttps://www.spreaker.com/episode/unlocking-the-secrets-of-sentential-logic--62959062
Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/62959062Thu, 21 Nov 2024 20:03:03 +0000AmCan TechDive into the fascinating world of sentential logic! In this episode, we explore the foundations of propositional logic, the art of constructing truth tables, and how logical connectives like "and," "or," and "not" shape our reasoning. Whether you're...
Visit our website here: https://sites.google.com/view/connected-components/home]]>818logic,mathematics,sententialfalse12fullhttps://www.spreaker.com/episode/introduction-to-graph-theory--62890697
Visit our website here: https://sites.google.com/view/connected-components/home]]>https://api.spreaker.com/episode/62890697Wed, 20 Nov 2024 18:31:19 +0000AmCan TechThis episode explores key concepts in graph theory, starting with fundamental definitions of graphs, vertices, and edges. The text then examines the handshake lemma and related theorems that deal with the relationship between vertex degrees and the...
Visit our website here: https://sites.google.com/view/connected-components/home]]>1184directedgraphs,graph,graphtheory,mathfalse11full