Happy Codings - Programming Code Examples
Html Css Web Design Sample Codes CPlusPlus Programming Sample Codes JavaScript Programming Sample Codes C Programming Sample Codes CSharp Programming Sample Codes Java Programming Sample Codes Php Programming Sample Codes Visual Basic Programming Sample Codes




Weakly Connected or Strongly Connected - Program to find the connected components of the "Undirected Graph". This can be done using depth first search algorithm. Fills stack with vertices (in increasing order of finishing

Initializing the Members of a Class Using a - This C++ example uses a class that contains a constructor used to 'initialize the object'. The class is called ShoeBox. When supplied with a Length, a Height, a Width, the object should

C++ Program Check if it is a Sparse Matrix - This is a C++ Program code to check 'sparsity' of a matrix. If the number of zeros in a matrix exceeds (n*m)/2, n and m is the dimension of the matrix, matrix is sparse matrix. Enter the

Finding the Edge Connectivity of a Graph - C++ Program to find edge connectivity of a graph. An edge in an undirected connected graph is a bridge if removing it disconnects the graph. For a "disconnected undirected"

BoyerMoore & Algorithm String Matching - Whenever the 'character' does not match, we slide the pattern in such a way that aligns the bad character with the last occurrence of it in pattern. We preprocess the pattern and store

C++ Language & Concatenate Two Strings - Combined two strings means add both string with each other, perform this operation using 'library function' or without library function. If first string is 'john' and second string is porter

Takes octal number as input and converts - C Program take the octal number as input and store it in the variable octal. Initialize the variables decimal and j to zero. Obtain the remainder and quotient of the octal number.

C Evaluate the Given Polynomial Equation - C program to evaluate a given polynomial by reading its coefficients in an array. Formula is P(x)=AnXn + An-1Xn-1 + An-2Xn-2+... +A1X + A0. The 'polynomial' can be written as: P(x) =