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


C Programming Code Examples

C > Beginners Lab Assignments Code Examples

C Program to Find the Size of a Union





C Convert Lowercase String to Uppercase - C user would be asked to enter a lower case String and the program would convert it into a Upper case String. Logic followed in the program: All lower case characters (a to z)

Binary Search Tree Code in C++ Language - Smaller elements go left. Larger elements go right. All insertions are as leaf nodes. Remove a leaf node and remove a node with a single child. Remove a node with 2 children, replace

C Program Compare two Text or Data files - Firstly Declare two file pointers for two files. Open 2 files in read mode. Now Inside while loop read both files character by character. Check both characters whether they're equal

Insert, Update and Delete value Functions - This c++ program code is helpful to manage a menu "base database" using array and shows how to prevent from a wrong input. Its simple to introduce the basic database management

Program code to addition of two matrices - Before accepting the Elements Check if no of rows and columns of both matrices is equal. Accept the Elements in Matrix 1 and Matrix 2. Addition of two matrices. Print out the matrix

C++ Code Calculate Power of any Number - For calculating the power of any number user have four possibilities to input values. Sample code only work for when we input +ve power, +ve 'base value', -ve base value. It is not work

C Code Find LCM of Number by Recursion - C Language program Find 'LCM' of a Number using Recursion. The following C Program to use recursion, finds the 'LCM'. An 'LCM' is the 'Lowest Common Multiple' of any 2 numbers.

Finds Strongly Connected Components in - This is a C++ program "Displays the Nodes" which are strongly connected to each other. Strongly connected subgraphs are those in which a path is available from any node of