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 > Beginners Lab Assignments Code Examples




C++ Sample Code Make Simple Calculator - To make a simple calculator in the C++, which performs basic four mathematical operations (addition, subtraction, multiplicatin, division) depending on the "user's choice", switch case

C Program to Linked List implementation - Create list, add in the list, delete in the list, append two list, show list, add in beginning, add in end, add after a given element, return to main menu, delete in beginning, delete in

C Multiply two Matrices by Passing Matrix - C program asks the user to enter the size of the matrix (rows and column). It asks the user to enter the elements of those matrices and finally adds and displays the result. Perform

Replace all Occurrences of a Character in a - Write a C program to 'Replace all Occurrence' of a character with another in a string using a Function. 'Input a string' from user, store it in some variable say str. Input old character and

Program to Find Maximum and Minimum - Program to find maximum in array elements using recursion and c conditional operator. C program code to find maximum & minimum elements in an array using recursion. How to

If Else If Statement & Multiple Conditions - In this control structure we have only one 'if' and one 'else', however we can have multiple 'else if' blocks. This is how it looks: If none of the 'condition is true' then these statements

Using the Bellman-Ford Algorithm to Find - Using the bellman-ford algorithm to find the shortest path between two vertices assuming that negative size edges exist in the graph. A Program to find the 'shortest path' algorithm

Implement A Heuristic to Find the Vertex - Problem takes E edges as input and outputs vertex cover of the graph, implementing the following heuristic. There is no "Polynomial" time algorithm "invented up to date" to find