1 MIN READ•
Frequent Pattern Growth (FP-Growth) Algorithm
What is FP-Growth Algorithm?The FP-Growth Algorithm is an advanced data mining technique used to find frequent itemsets without generating candidate sets. It wa
Ashutosh KumarAuthor
Blog
Insights, tutorials, and ideas...
Newest first
All Posts
7 MIN READ•
Data Modelling
Data ModellingData modeling is the process of creating a visual representation (diagram) of a data system that defines the structure, attributes, and relationsh
Ashutosh KumarAuthor
3 MIN READ•
#how a web browser works
🌐 How a Browser Works: A Beginner-Friendly Guide to Browser Internals:👉 What actually happens after I type a URL and press Enter?Most beginners think:“Browser
Abhijeet Singh RajputAuthor
7 MIN READ•
#Git for Begineers
Git for Beginners: Basics and Essential CommandsNow, let’s understand Git and VCS.When I started learning web development, managing my code felt chaotic.Files l
Abhishek SinghAuthor
1 MIN READ•
Tower of hanoi
Tower of hanoi1. Problem ExplanationThe Tower of Hanoi is a classic recursive problem.You are given:Three pegs: A (source), B (auxiliary), C (destination)n disk
Divya SachanAuthor
5 MIN READ•
Markov Decision Process (MDP)
Markov Decision Process (MDP)Date: 06 Oct 2025IntroductionA Markov Decision Process is a mathematical framework used for decision-making problems where outcomes
Ashutosh KumarAuthor
3 MIN READ•
NLP
Natural Language Processing (NLP)NLP and Text ProcessingNLP stands at the intersection of linguistics, computer science, and AI. It enables machines to understa
Abhishek SinghAuthor
2 MIN READ•
Greedy Approach for Algorithm Design
Greedy Approach for Algorithm DesignThe Greedy Approach is a simple and fast algorithm design technique. At every step, it picks the best possible choice at tha
Abhijeet Singh RajputAuthor
2 MIN READ•
Merge Sort
Merge SortMerge Sort is a Divide and Conquer algorithm.Given an array a[1…N], merge sort works as follows:Divide the array into two equal halves.Recursively app
Ashutosh KumarAuthor
3 MIN READ•
Quick Sort
Quick SortIt is a popular sorting method based on the divide-and-conquer approach. Unlike merge sort, where the division is always in the middle, in quicksort t
Abhijeet Singh RajputAuthor
6 MIN READ•
Decision Tree
Decision TreeA decision tree is a tree-shaped diagram used to determine a course of action. Each branch of the tree represents a possible decision, occurrence,
Abhishek SinghAuthor
3 MIN READ•
How Machine Learns?
LearningA computer program/algorithm (system/model) is said to learn from experience 'E' with respect to some class of tasks 'T' and performance measure 'P' if
Divya SachanAuthor