Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Articles by Samual Sam
Page 109 of 151
Detect Cycle in a an Undirected Graph
To detect if there is any cycle in the undirected graph or not, we will use the DFS traversal for the given graph. For every visited vertex v, when we have found any adjacent vertex u, such that u is already visited, and u is not the parent of vertex v. Then one cycle is detected. We will assume that there are no parallel edges for any pair of vertices.Input and Output: Adjacency matrix 0 1 0 0 0 1 0 1 1 0 0 1 0 0 1 0 1 ...
Read MoreBridges in a Graph
An edge in an undirected graph is said to be a bridge, if and only if by removing it, disconnects the graph, or make different components of the graph. In a practical approach, if some bridges are present in a network when the connection of bridges is broken, it can break the whole network.Input and OutputInput: The adjacency matrix of the graph. 0 1 1 1 0 1 0 1 0 0 1 1 0 0 0 1 0 0 0 1 0 0 0 1 0 Output: Bridges in given graph: Bridge 3--4 Bridge 0--3AlgorithmbridgeFind(start, visited, disc, low, ...
Read MoreWord Break Problem
In the input of this problem, one sentence is given without spaces, another dictionary is also provided of some valid English words. We have to find the possible ways to break the sentence in individual dictionary words.We will try to search from the left of the string to find a valid word when a valid word is found, we will search for words in the next part of that string.Input and OutputInput: A set of valid words as dictionary, and a string where different words are placed without spaces. Dictionary: {mobile, sam, sung, man, mango, icecream, and, go, i, love, ...
Read MoreClosest Pair of Points Problem
In this problem, a set of n points are given on the 2D plane. In this problem, we have to find the pair of points, whose distance is minimum.To solve this problem, we have to divide points into two halves, after that smallest distance between two points is calculated in a recursive way. Using distances from the middle line, the points are separated into some strips. We will find the smallest distance from the strip array. At first two lists are created with data points, one list will hold points which are sorted on x values, another will hold data ...
Read MoreCount Inversions in an array
The inversions of an array indicate; how many changes are required to convert the array into its sorted form. When an array is already sorted, it needs 0 inversions, and in another case, the number of inversions will be maximum, if the array is reversed.To solve this problem, we will follow the Merge sort approach to reduce the time complexity, and make it in Divide and Conquer algorithm.Input and OutputInput: A sequence of numbers. (1, 5, 6, 4, 20). Output: The number of inversions required to arrange the numbers into ascending order. Here the number of inversions are 2. First ...
Read MoreBiconnected Graph
An undirected graph is said to be a biconnected graph, if there are two vertex-disjoint paths between any two vertices are present. In other words, we can say that there is a cycle between any two vertices.We can say that a graph G is a bi-connected graph if it is connected, and there are no articulation points or cut vertex are present in the graph.To solve this problem, we will use the DFS traversal. Using DFS, we will try to find if there is any articulation point is present or not. We also check whether all vertices are visited by ...
Read MoreHow to count Java comments of a program that is stored in a text file?
You can read the contents of a file using the Scanner class and You can find the comments in a particular line using contains() method.Exampleimport java.io.*; import java.util.Scanner; public class FindingComments { public static void main(String[] args) throws IOException { Scanner sc = new Scanner(new File("HelloWorld")); String input; int single = 0; int multiLine = 0; while (sc.hasNextLine()) { input = sc.nextLine(); if (input.contains("/*")) { multiLine ++; ...
Read MoreBootstrap responsive utility classes
The following are the classes available for responsive utility classes in Bootstrap −ClassesDevices.visible-xsExtra small (less than 768px) visible.visible-smSmall (up to 768 px) visible.visible-mdMedium (768 px to 991 px) visible.visible-lgLarger (992 px and above) visible.hidden-xsExtra small (less than 768px) hidden.hidden-smSmall (up to 768 px) hidden.hidden-mdMedium (768 px to 991 px) hidden.hidden-lgLarger (992 px and above) hidden
Read MoreJava program to display English alphabets
Following is an example to display English alphabets A to Z. Example public class DisplayingAtoZ { public static void main(String args[]){ char ch; System.out.println("List of alphabets are ::"); for(ch = 'A'; ch <= 'Z'; ch++ ){ System.out.print(ch+" "); } } } Output List of alphabets are :: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Read MoreMultidimensional Expression and its use in SAP BPC
MDX is a query language developed by Microsoft to query OLAP cubes. In OLAP cubes, data is structured as multidimensional. You have a fact table in middle and dimension tables surrounding fact tables. MDX is used to query STAR schema cubes like this and generate results for different purposes.MDX query language is bit similar to SQL with few fundamental differences like:In MDX queries, it can have 0, 1, 2, 3, 4…up to 128 query axes in the SELECT statement. Each axis behaves in exactly the same way, unlike SQL where there are significant differences between how the rows and the ...
Read More