To understand this let’s take a binary tree Binary tree If we conduct BFS in this tree: In level 0 there is one node in… Read More

# Category Archives: Analysis

BFS and DFS are two algorithms that we use for graph traversal. In both the algorithms we start from a node and iterate over the… Read More

What is Amortization? Consider that you are a company owner and that you require a vehicle. The automobile is priced at €10, 000. You’ll have… Read More

Prerequisites: NP-Completeness, NP Class, Max2SAT, 3SAT Problem: Given a 2-CNF (Conjunctive Normal Form) Boolean expression (with m clauses, n variables) and an integer k, Decide… Read More

Prerequisite: NP-Completeness, NP Class, SAT Problem– The Almost-SAT problem which is built on top of SAT(Boolean Satisfiability Problem) problem takes a boolean formula in conjunctive… Read More

Why do we check up to the square root of a number to determine if that number is prime? Prime numbers are natural numbers greater… Read More

Prerequisite: NP-Completeness, NP Class, Clique Problem: Given an undirected graph G = (V, E) and an integer K, determine if there is a kite subgraph… Read More

Prerequisite: NP-Completeness, NP Class, SAT Problem: The MAX-SAT problem which is built on top of SAT(Boolean Satisfiability Problem) problem takes a boolean formula in conjunctive… Read More

What is a logarithm? The power to which a base needs to be raised to reach a given number is called the logarithm of that… Read More

Stack is a linear data structure that follows the LIFO (last in first out) order i.e., the data are entered from one end and while… Read More

Prerequisite: NP-Completeness, NP Class, Clique, Independent Set Problem: Given an undirected graph G = (V, E) and an integer K, determine if a clique of… Read More

Prerequisites: NP-Completeness, NP Class, Dense Subgraph Problem: Given graph G = (V, E) and two integers a and b. A set of a number of… Read More

In computer science, there exist some problems whose solutions are not yet found, the problems are divided into classes known as Complexity Classes. In complexity… Read More

Given two integers N and K, The task is to find the count of all possible arrays of size N with maximum sum & bitwise… Read More