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

Decimal to Binary, Octal and HEX converter





C Evaluating Subtraction 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. Accept the Elements in Matrix 2. Subtraction of two...

C Language Code find First and Last Digit - C Language program code to find first & last digit. Input a number from user & store it in some variable say num. Find last digit using modulo division by 10 lastDigit = num % 10.

Test Using DFS Whether a Directed Graph - This C++ Program checks whether a directed graph is weakly connected or not. We can do "DFS" V times starting from every vertex. If any DFS, doesn't visit all vertices, then graph

Programming Code Define Array & Use it - Array storing 18 values, number of values to be read, sum of the numbers, average of the numbers, loop counter, read the ten numbers to be averaged, read a number, add it to sum

Checks a Character is Vowel or Consonant - The five alphabets 'A, E, I, O and U' are called 'vowels'. All other alphabets except these five vowel letters are called consonants. Program above assumes that the user always enters an

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

The C++ Implementation for Binary Heap - Capacity is the capacity of the "binary heap". Duplicates are allowed. "Throw Overflow" if container is full. Find the smallest item in the "priority queue". Return the smallest item, or

Program to Find the Vertex Connectivity - C++ Program finds vertex connectivity of a graph. A vertex in an undirected connected graph is an articulation point iff removing it disconnects the graph. 'Articulation points'