Posts
All the articles I've posted.
CS3016/04. Implement approximate algorithms on various variants of Travelling Salesman Problem (TSP).
Updated: 3.5 hours readUnderstand and implement approximation algorithms for classical and metric variants of the Travelling Salesman Problem (TSP), including MST-based and Christofides' heuristic.
CS3016/05. Demonstrate randomness by implementing Quicksort algorithm.
Published: 2 hours readUnderstand the concept of algorithmic randomness through randomized quicksort implementation. Analyze performance, visualize sorting, and compare with deterministic behavior.
CS3016/06. Demonstrate randomness by implementing Min-Cut algorithm.
Published: 2.5 hours readImplement and explore the randomized Min-Cut algorithm to understand the role of randomness in algorithms and graph partitioning.
CS3016/07. Demonstrate with a Program the Markov Property and Stationary Markov Chains
Published: 2.5 hours readUnderstand and simulate the Markov property and stationary distributions in Markov chains using Python. Gain insights into stochastic systems with memoryless transitions.
CS3016/08. Implementing the Viterbi algorithm for Hidden Markov Models (HMMs)
Published: 3 hours readUnderstand and implement the Viterbi algorithm, a dynamic programming method for decoding the most likely state sequence in Hidden Markov Models.
CS3016/09. Implementing the Forward Algorithm
Published: 2.5 hours readUnderstand and implement the Forward Algorithm, a dynamic programming technique used to compute sequence probabilities in Hidden Markov Models (HMMs).
CS3016/10. Implementing algorithms from geometry problems and large data sets
Published: 3.5 hours readExplore and implement classic algorithms from computational geometry and data-intensive problems. Emphasis on real-world applications and scalable solutions.
Mapping of GECA's academic resources
Updated: 5 hours readThis post mean't to index all the links, resources, labs, and notes made for GECA's academics. Here are all the links, categorized subject wise.
CS3016/03. Implement approximate algorithm techniques for Vertex Cover and Steiner Tree problems.
Updated: 3 hours readLearn and implement approximation algorithms for NP-hard problems like Vertex Cover and Steiner Tree. Understand their practical importance, strategies, and performance guarantees.
CS3014/01. Introduction | Application Development Tools
Updated: 2 hours readIntroduction to ASP.NET Web Framework, a web framework for building modern web apps and services with .NET.