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

Print ASCII Values of Characters





Find Intersection & Union of 2 Linked Lists - This C Program code finds the intersection & union of 2 Linked lists. Intersection is a set of elements that are common in both lists while union is a set of all Unique Elements in both...

Perform Preorder Non-Recursive Traversal - C++ Program to "Print Preorder Traversal" of a given binray tree without using recursion. A binary tree node has data, left child and right child. "Helper Function" that allocates a new

Decimal equivalent of input Hexadecimal - Program to display the decimal equivalent of an input hexadecimal number (Hexadecimal to Decimal). How many digits in input? Digits of your i/p no. must not exceed entered limit

Takes octal number as input and converts - C Program take a octal number as input and store it in the array octalnumber and using switch statement access each digit of a octal number and print its equivalent binary value

C Data Structures Dynamic String Arrays - Dynamic string arrays in C language. Print the array of strings. Free the string array, Note: You must delete each individual string before you delete the array of pointers...

C Programming Language Median Sample - A 'median' value is the value at the center of a sorted list. To median we need to sort the list in ascending or descending order. The List of 3, 5, 2, 7, 3 as our input list, to find out median

Code Finds Second Smallest of n Elements - Linearly traverse the data array. Keep track of the "Smallest Number". Simultaneously keep updating the second smallest number also. A function to calculate second. If array element

Implementing Circular Doubly Linked List - 'Memory allocated' for node dynamically and inserts element at beginning. Inserts elemnet at last. Inserts element at position and delete node at particular position. Update value of a