## Real-time application of Data Structures

A data structure is a particular way of organizing data in a computer so that it can be used effectively. In this article, the real-time… Read More »

A data structure is a particular way of organizing data in a computer so that it can be used effectively. In this article, the real-time… Read More »

Parenthesis Theorem is used in DFS of graph. It states that the descendants in a depth-first-search tree have an interesting property. If v is a… Read More »

Tree:- A connected graph without any circuit is called a Tree. In other words, a tree is an undirected graph G that satisfies any of… Read More »

A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are… Read More »

Given the number of vertices in a Cycle Graph. The task is to find the Degree and the number of Edges of the cycle graph.… Read More »

Wheel Graph: A Wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle. Properties:- Wheel graphs are… Read More »

In graph theory, Vizing’s theorem states that every simple undirected graph may be edge colored using a number of colors that is at most one… Read More »

Given a directed graph having n nodes. For each node, delete all the outgoing edges except the outgoing edge with minimum weight. Apply this deletion… Read More »

Given an undirected graph G with V vertices and E edges, the sum of the degrees of all vertices is (A) E (B) 2E (C)… Read More »

Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is 1/2. What is the… Read More »

Which of the following statements is/are TRUE for an undirected graph? P: Number of odd degree vertices is even Q: Sum of degrees of all… Read More »

How many undirected graphs (not necessarily connected) can be constructed out of a given set V= {V 1, V 2,…V n} of n vertices ?… Read More »

Consider an undirected unweighted graph G. Let a breadth-first traversal of G be done starting from a node r. Let d(r, u) and d(r, v)… Read More »

The most efficient algorithm for finding the number of connected components in an undirected graph on n vertices and m edges has time complexity. (A)… Read More »

The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be: (A) O(n) (B)… Read More »