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

Convert Binary Code of a Number into its Equivalent Gray's Code without using Recursion

Convert Binary Code of a Number into its Equivalent Gray's Code without using Recursion

This C program, using iteration, evaluates the gray code equivalent of a binary number. A gray is also represented using 0s and 1s. The speciality of gray code is that only one bit is changed in 2 consecutive numbers, say 3 and 4.

/*
- C Program to Convert Binary Code of a Number into its Equivalent 
- Gray's Code without using Recursion
*/

    #include <stdio.h>

    #include <math.h>
     

    int bintogray(int);
     

    int main ()

    {

        int bin, gray;
     

        printf("Enter a binary number: ");

        scanf("%d", &bin);

        gray = bintogray(bin);

        printf("The gray code of %d is %d\n", bin, gray);

        return 0;

    }
     

    int bintogray(int bin)

    {

        int x, y, result = 0, i = 0;
     

        while (bin != 0)

        {

            x = bin % 10;

            bin = bin / 10;

            y = bin % 10;

            if ((x && !y) || (!x && y))

            {

                result = result + pow(10, i);

            }

            i++;

        }

        return result;

    }

What is The Function Overloading in C++ - Code sample about C++ language Function overloading. If a "C++ Class" have multiple member functions, having the same name but different parameters and programmers

C Search for an Element in the Linked List - Search an element in the linked list without using Recursion. C Program, using iteration, Searches for an Element in a Linked List. A Linked List is ordered set of Data Elements,

Balanced Binary tree of the Incoming Data - In computer science, a "self-balancing" binary search tree is any "node-based" binary search tree that automatically keeps its height small in the face of arbitrary item insertions & item

C Program Insertion Sort implementations - 'Insertion Sort Algorithm' picks elements one by one & places it to the right position where it belongs in the "Sorted List of Elements". In C program we have "implemented the same"

C Codes Multiply 2 Numbers use Function - Create a user defined function product() that multiplies the numbers that we are passing to it during function call. This c function returns the product of these numbers. To understand

Count Number of non leaf nodes of a tree - C create a new node with the data from the user. Check for root node and then create it. Search for the appropriate position to insert the new node. Display and count the sum of

Program Create the Prufer Code for a Tree - The Time complexity to generate this code is 'O(v*e)'. This algorithm takes the input of the number of vertexes for the tree. Then it takes the input if "Vertex Pairs" which have an edge

Performs Binary Search on a Sorted Array - Returns a pointer to the first member that matches *key. A null pointer is returned if not found. The array must be sorted in ascending order. The number of elements in the array is