Programming Index

📙 Programming Index

📚 11 Posts
🕒 Last Updated: Mon Aug 17 2026

This folder contains Programming-related posts.

#	Blog Link	Date	Excerpt	Tags
1	Programming Index	Mon Aug 17 2026	📙 Index of Programming posts
2	🧱 Data Structures: Arrays, Stacks, Queues, Heaps, Hash Tables, Tries & Graphs	Fri Feb 20 2026	Data structures from the ground up — why arrays and linked lists trade off access vs insertion, real Java examples for arrays/lists/stacks/queues, a Binary Heap stored with no pointers at all, how a hash table actually resolves collisions, tries for prefix matching, graph representations, and a practical guide to choosing the right structure.	Data Structures Arrays Linked Lists Stacks Queues Heaps Hash Tables Tries Graphs Big O Study Notes
3	🌲 Trees Deep Dive: BST, AVL Rotations, Red-Black Trees, B-Trees & B+ Trees	Fri Feb 20 2026	The tree family from the ground up — Binary Tree and BST fundamentals, DFS/BFS traversal, why an unbalanced BST degrades to O(n), all four AVL rotation cases worked through step by step, Red-Black Tree's five properties with search and insert, B-Trees and B+ Trees for database indexing, plus hash tables and tries.	Data Structures Trees BST AVL Tree Red-Black Tree B-Tree Hash Tables Tries Big O Study Notes
4	🕸️ Graph Data Structures: Adjacency List vs Matrix, BFS & DFS	Fri Feb 20 2026	Graphs from the ground up — vertices and edges, why there's no single Big O for a graph, adjacency list vs adjacency matrix tradeoffs, and why BFS and DFS traversal cost is the foundation every graph algorithm builds on.	Data Structures Graphs BFS DFS Big O Study Notes
5	🔢 Algorithmic Complexity: Big O From First Principles	Fri Feb 20 2026	Asymptotic notation from the ground up — deriving Big O from a growth formula, a real timing table showing what each complexity class actually costs at n = 1,000,000, and every major growth order (constant, logarithmic, linearithmic, polynomial, exponential, factorial) with real code examples.	Algorithms Big O Complexity Asymptotic Notation Study Notes
6	Searching Algorithm & Their Complexity Complexity 🔎	Fri Feb 20 2026	Best, average, and worst case complexity for linear search, binary search, hashing, and balanced-tree based search — quick revision notes with when to use each.	Algorithms Searching Big O Complexity Study Notes
7	⚡ Sorting Algorithm Complexity 📖	Fri Feb 20 2026	Best, average, and worst case complexity and stability for Quick Sort, Merge Sort, Timsort, Heap Sort, and every other major sorting algorithm — quick revision notes.	Algorithms Sorting Big O Complexity Study Notes
8	🗄️ Database Comparison 📖	Fri Feb 20 2026	A quick-reference comparison of database paradigms — key-value, wide column, document, relational, graph, search index, and multi-model — with key features and typical use cases.	Databases DBMS NoSQL SQL Study Notes
9	Ansible: Agentless Configuration Management	Wed Jul 29 2026	Ansible from the ground up — agentless push architecture, inventory, playbooks, modules, roles, idempotency, Ansible Vault, a real GPU-node provisioning example, Ansible vs Terraform, and a set of interview questions with answers.	Ansible Configuration Management IaC DevOps Automation Cloud
10	CI/CD Pipelines: From Commit to Production	Wed Jul 29 2026	CI/CD from the ground up — Continuous Integration vs Delivery vs Deployment, pipeline stages, GitHub Actions and Jenkins pipelines, push-based CD vs GitOps with ArgoCD, a real GPU inference deployment pipeline, and a set of interview questions with answers.	CI/CD DevOps GitOps ArgoCD GitHub Actions Jenkins Automation Cloud
11	Unix Internals: Processes, File Descriptors, and Syscalls	Thu Jul 30 2026	The Unix fundamentals underneath every container and Kubernetes pod — the fork/exec/wait process model, file descriptors and the everything-is-a-file philosophy, the syscall boundary between user space and the kernel, signals, pipes, process memory layout, and the permission model.	Unix Linux Operating Systems Processes Syscalls File Descriptors Signals DevOps