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 > Learning Code Examples

Type Casting





Implement Hash Tables by Linear Probing - Insert Element at a key. Search Element at a key. Remove Element at a key. Enter element to be inserted. Enter key at which element to be inserted. And Enter key of the element to

Convert a Given Number of Days in Terms - C language program take the number of days as input. For the number of years, divide the input by 365 and obtain its quotient. For the number of weeks, divide the input by 365 and

Implement Hash Tables Quadratic Probing - Returns whether n is "prime" or not. Find next prime size of the table. Function To Generate Hash. Function to Initialize Table. Function to "Find Element" at a key. Insert Element into a

Program to Accept Paragraph using scanf - Here scanf will accept characters entered with spaces. It also accepts the Words, new line characters. Represent that all characters are accepted except tab(t), whenever t will

Partition of a Number in all Possible Ways - C++ Program to get all the unique partitions of an integer such that addition of a partition results an integer. An integer n, generate all "possible unique" ways to represent n as sum

Addition Operation use Bitwise Operators - C++ Program perform addition using bitwise operators. Using "AND" and "XOR" operators addition can be done, where carry is given by "AND" between two operands and result can

Program code to Find the Size of a Union - C Define the union named sample. Declare three variables m, n and ch of different data types. Use the keyword sizeof() to find the size of a union and print the same. Initialize

C++ Checking if a Given Graph is Bipartite - Bipartite Graph is a graph in which the set of 'vertices' can be divided into 2 sets such that all vertex should be present in either set 1 or set 2 but not both, and there should no edge