<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://sreejithmvarma.in</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/blog</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/projects</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/blog/mixture-of-experts-explained-how-sparse-models-work</loc>
<lastmod>2026-08-30T00:00:00.000Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/blog/what-are-dark-patterns-india-just-fined-zepto-bookmyshow-and-more-for-using-them</loc>
<lastmod>2026-08-18T00:00:00.000Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/concepts/asymptotic-notations</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/concepts/expression-evaluation</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/syllabus</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/data-structures</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/data-abstraction</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/abstract-data-type</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/algorithm</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/performance-analysis</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/time-complexity</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/best-average-worst-case</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/space-complexity</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/asymptotic-notations</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/polynomial-representation</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/sparse-matrix</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/stack</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/multi-stack</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/queue</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/circular-queue</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/deque</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/expression-evaluation</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/infix-to-postfix</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-1/postfix-evaluation</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-2/syllabus</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-2/linked-list</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-2/singly-linked-list-operations</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-2/stack-queue-linked-list</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-2/polynomial-linked-list</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-2/doubly-linked-list</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-2/circular-linked-list</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-2/memory-allocation</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-2/garbage-collection-compaction</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-3/syllabus</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-3/tree-terminology</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-3/tree-representation</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-3/binary-tree-types</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-3/tree-traversals</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-3/expression-trees</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-3/binary-search-tree</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-3/bst-deletion</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-3/binary-heap</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-3/priority-queue</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-3/graph-representation</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-3/graph-traversal</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-4/syllabus</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-4/selection-sort</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-4/insertion-sort</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-4/quick-sort</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-4/merge-sort</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-4/heap-sort</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-4/radix-sort</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-4/linear-search</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-4/binary-search</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-4/hashing</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/module-4/collision-resolution</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
<url>
<loc>https://sreejithmvarma.in/learn/ktu/2024/s3/cse/ktu-2024-pccst303/most-expected-questions/most-expected-questions</loc>
<lastmod>2026-10-16T21:23:43.961Z</lastmod>
</url>
</urlset>
