<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>ADA Hub — Algorithm Articles</title><description>Latest articles on Analysis and Design of Algorithms, VTU BCSL40A lab programs, and CS concepts.</description><link>https://ada-lab.vercel.app/</link><language>en-us</language><item><title>Backtracking Algorithms — N-Queens and Subset Sum Explained</title><link>https://ada-lab.vercel.app/blog/backtracking-guide/</link><guid isPermaLink="true">https://ada-lab.vercel.app/blog/backtracking-guide/</guid><description>Learn backtracking algorithms with complete C examples. Master N-Queens and Subset Sum problems with state space trees, pruning strategies, and viva Q&amp;A for VTU ADA lab.</description><pubDate>Sun, 15 Dec 2024 00:00:00 GMT</pubDate><category>backtracking</category><category>N-Queens</category><category>subset sum</category><category>algorithms</category><category>ADA</category><category>VTU</category><author>Rajath Kiran A</author></item><item><title>Divide and Conquer — Complete Guide with C Examples</title><link>https://ada-lab.vercel.app/blog/divide-and-conquer/</link><guid isPermaLink="true">https://ada-lab.vercel.app/blog/divide-and-conquer/</guid><description>Master Divide and Conquer with Merge Sort and Quick Sort in C. Learn the paradigm, recurrence relations, Master Theorem, and when to use D&amp;C vs DP or Greedy.</description><pubDate>Thu, 12 Dec 2024 00:00:00 GMT</pubDate><category>divide and conquer</category><category>merge sort</category><category>quick sort</category><category>sorting</category><category>ADA</category><category>algorithms</category><author>Rajath Kiran A</author></item><item><title>How to Prepare for VTU ADA Lab Exams — Complete Guide</title><link>https://ada-lab.vercel.app/blog/ada-lab-exam-guide/</link><guid isPermaLink="true">https://ada-lab.vercel.app/blog/ada-lab-exam-guide/</guid><description>Step-by-step guide to ace VTU BCSL40A ADA lab exams. Learn what to study, how to answer viva questions, common mistakes to avoid, and exam-day tips.</description><pubDate>Tue, 10 Dec 2024 00:00:00 GMT</pubDate><category>VTU</category><category>ADA lab</category><category>exam preparation</category><category>BCSL40A</category><category>tips</category><author>Rajath Kiran A</author></item><item><title>Dynamic Programming Tutorial — From Zero to Hero</title><link>https://ada-lab.vercel.app/blog/dynamic-programming-tutorial/</link><guid isPermaLink="true">https://ada-lab.vercel.app/blog/dynamic-programming-tutorial/</guid><description>A complete beginner-friendly tutorial on Dynamic Programming with examples from VTU ADA Lab: Floyd-Warshall, Warshall&apos;s, and 0/1 Knapsack with C code.</description><pubDate>Sun, 08 Dec 2024 00:00:00 GMT</pubDate><category>dynamic programming</category><category>Floyd</category><category>Warshall</category><category>knapsack</category><category>ADA</category><category>VTU</category><author>Rajath Kiran A</author></item><item><title>Greedy Algorithms — A Complete Guide for ADA Students</title><link>https://ada-lab.vercel.app/blog/greedy-algorithms-guide/</link><guid isPermaLink="true">https://ada-lab.vercel.app/blog/greedy-algorithms-guide/</guid><description>Master greedy algorithms with real examples from VTU BCSL40A: Kruskal&apos;s, Prim&apos;s, Dijkstra&apos;s, and Fractional Knapsack. Learn when greedy works and when it doesn&apos;t.</description><pubDate>Thu, 05 Dec 2024 00:00:00 GMT</pubDate><category>greedy</category><category>Kruskal</category><category>Prim</category><category>Dijkstra</category><category>algorithms</category><category>ADA</category><author>Rajath Kiran A</author></item><item><title>Big O Notation Explained — A Simple Guide for ADA Students</title><link>https://ada-lab.vercel.app/blog/big-o-notation/</link><guid isPermaLink="true">https://ada-lab.vercel.app/blog/big-o-notation/</guid><description>Master Big O notation with clear examples. Understand O(1), O(log n), O(n), O(n log n), O(n²), and O(2ⁿ) with real algorithm examples from the VTU ADA lab.</description><pubDate>Tue, 03 Dec 2024 00:00:00 GMT</pubDate><category>Big O</category><category>complexity</category><category>time complexity</category><category>algorithms</category><category>ADA</category><author>Rajath Kiran A</author></item><item><title>What is Analysis and Design of Algorithms?</title><link>https://ada-lab.vercel.app/blog/what-is-ada/</link><guid isPermaLink="true">https://ada-lab.vercel.app/blog/what-is-ada/</guid><description>A complete introduction to ADA — what it is, why it matters, the types of algorithms studied, and how to approach the VTU BCSL40A lab course.</description><pubDate>Sun, 01 Dec 2024 00:00:00 GMT</pubDate><category>ADA</category><category>introduction</category><category>VTU</category><category>algorithms</category><category>BCSL40A</category><author>Rajath Kiran A</author></item></channel></rss>