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


Java Programming Code Examples

Java > Date Time Code Examples

GetTheCurrentTime





C Concats Two Strings without Use Library - We have to accept '2 Strings' from user using gets and we have to 'Concatenate' these two strings without using library functions. Inside the concate function we are firstly calculating

Calculate Sum and Difference of Matrices - C Program calculates the sum & difference of the matrices. Code first reads 2 matrices and then performs both addition and subtraction of matrices. Sum of elements of matrix A and

Program Sample Displays Prime Numbers - If a number passed to checkPrimeNumber() is a Prime Number, this function returns true, if not the Function returns false. If enters larger number first, 'code' will not work as intended.

C Binary Equivalent of input Hexadecimal - Program to display Binary equivalent of an input Hexadecimal Number (Hex to Binary Converter). Number will be accepted if you press Ctrl-Z & then ENTER after inputting...

C realloc() Allocates size bytes of Memory - If ptr is null, realloc() allocates size bytes of memory and returns a pointer. If size is zero, the memory pointed to by ptr is freed. There is an error give message: Allocation Error...

Find the Frequency of Substring in Strings - Take a string and a substring as input. Store it in the arrays 'str[] & str1[]' respectively. Using For Loop to 'compare' str1[] with the str[]. Do step2 until the end of main string. During the

Finds out the Roots of Quadratic Equation - C Program calculates the roots of a quadratic equation. First it finds Discriminant using the Formula: Disc = 'y*y-4*x*z'. There are 3 types of roots. They are complex, distinct and equal

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