dectobin.c

#include <stdio.h>

#define MAX 100

int stack[MAX], top = -1; // stack array and top

// Push function to insert element
void push(int data)
{
    if (top == MAX - 1)
        printf("\nStack overflow");
    else
        stack[++top] = data;
}

// Pop function to pop element
int pop()
{
    int del;
    if (top == -1)
    {
        printf("\nStack empty");
        return -1;
    }
    else
    {
        del = stack[top--];
        return del;
    }
}


// Displays top element without popping it
int peek()
{
	if(top == -1)
		return -1;
	else
		return stack[top];
}


// To print elements of stack
void display()
{
    if (top == -1)
        printf("\nStack empty");
    else
    {
        printf("\n");
        for (int i = 0; i <= top; i++)
        {
            printf("%d, ", stack[i]);
        }
    }
}

void convertToBinary(int num)
{
    while (num)
    {
        push(num%2);
        num /= 2;
    }
}

void displayBinary()
{
    printf("\nBinary : ");
    while(top != -1)
    {
        printf("%d",pop());
    }
    printf("\n");
}

void convertToHex(int num)
{
    while (num)
    {
        push(num%16);
        num /= 16;
    }
}

void displayHex()
{
    printf("\nHex : ");
    while(top != -1)
    {
        int disp = pop();
        switch (disp)
        {
        case 10:
            printf("A");
            break;
        case 11:
            printf("B");
            break;
        case 12:
            printf("C");
            break;
        case 13:
            printf("D");
            break;
        case 14:
            printf("E");
            break;
        case 15:
            printf("F");
            break;
        
        default:
            printf("%d",disp);
            break;
        }
        
    }
    printf("\n\n");
}

int main()
{
    int num;
    printf("Enter a Number: ");
    scanf("%d",&num);
    convertToBinary(num);
    displayBinary();
    
    convertToHex(num);
    displayHex();
    return 0;
}