Skip to content

Tag Archives: Complexity-analysis

How does deleting a node in Singly Linked List work? To delete a node from a linked list we need to break the link between… Read More
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
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
What is Stack? Stack is a linear data structure that follows a particular order in which the elements are inserted and deleted. A stack follows… 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
What is Queue? Queue is a linear data structure that follows FIFO approach (First In First Out). One can imagine a queue as a line… 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, Sparse Graph, Independent Set Problem: Given graph G = (V, E) and two integers a and b. A set of a… Read More
An array is a linear data structure. In an array, the operation to fetch a value takes constant time i.e., O(1).  Let us see why… Read More
Sorting algorithms are the means to sort a given set of data in an order according to the requirement of the user. They are primarily… Read More

Start Your Coding Journey Now!