Added Many Programs

Area.c

@@ -0,0 +1,12 @@
+#include<stdio.h>
+int main() {
+int rad; float PI = 3.14;
+float  area, ci;
+printf("\nEnter radius of circle: ");
+scanf("%d", &rad);
+area = PI * rad * rad;
+printf("\nArea of circle : %f ", area);
+ci = 2 * PI * rad;
+printf("\nCircumference: %f ", ci);
+return (0);
+}

BMI Calculator.py

@@ -0,0 +1,20 @@
+print('                  BMI CALCULATOR')
+name = input('What is your name?')
+weight = float(input('What is your weight (in Kgs)?'))
+height = float(input('What is your height (in meters)?'))
+bmi = weight / (height ** 2)
+
+if bmi<18.5:
+    print(f"\n{name} is underweight by {bmi} BMI")
+    print('Eat foods containing high portion of fats and carbohydrates')
+elif 18.5<bmi<24.9:
+    print(f"\n{name} has normal weight by {bmi} BMI")
+    print('You are living a healthy life and !!!KEEP IT UP!!!')
+elif 25.0<bmi<29.9:
+    print(f"\n{name} is overweight by {bmi} BMI")
+    print('\nEat foods containing less amount of fats and carbohydrates and do regular exercise.')
+else:print(f"\n{name} is obese by {bmi} BMI.\nRegular exercise is very important for you & consult a dietician to plan your diet.")
+print('\n                        ||||||||||  THANK YOU   ||||||||||')
+
+
+

C/Armstrong_number.c

@@ -0,0 +1,19 @@
+#include<stdio.h>  
+ int main()    
+{    
+int n,r,sum=0,temp;    
+printf("enter the number=");    
+scanf("%d",&n);    
+temp=n;    
+while(n>0)    
+{    
+r=n%10;    
+sum=sum+(r*r*r);    
+n=n/10;    
+}    
+if(temp==sum)    
+printf("armstrong  number ");    
+else    
+printf("not armstrong number");    
+return 0;  
+}   

C/BFS.c

@@ -0,0 +1,174 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+#define MAX 100  
+
+#define initial 1
+#define waiting 2
+#define visited 3
+
+int n;    
+int adj[MAX][MAX];
+int state[MAX]; 
+void create_graph();
+void BF_Traversal();
+void BFS(int v);
+
+int queue[MAX], front = -1,rear = -1;
+void insert_queue(int vertex);
+int delete_queue();
+int isEmpty_queue();
+
+int main()
+{
+    create_graph();
+    BF_Traversal();
+    return 0;
+}
+
+void BF_Traversal()
+{
+    int v;
+
+    for(v=0; v<n; v++) 
+        state[v] = initial;
+
+    printf("Enter Start Vertex for BFS: \n");
+    scanf("%d", &v);
+    BFS(v);
+}
+
+void BFS(int v)
+{
+    int i;
+
+    insert_queue(v);
+    state[v] = waiting;
+
+    while(!isEmpty_queue())
+    {
+        v = delete_queue( );
+        printf("%d ",v);
+        state[v] = visited;
+
+        for(i=0; i<n; i++)
+        {
+            if(adj[v][i] == 1 && state[i] == initial) 
+            {
+                insert_queue(i);
+                state[i] = waiting;
+            }
+        }
+    }
+    printf("\n");
+}
+
+void insert_queue(int vertex)
+{
+    if(rear == MAX-1)
+        printf("Queue Overflow\n");
+    else
+    {
+        if(front == -1) 
+            front = 0;
+        rear = rear+1;
+        queue[rear] = vertex ;
+    }
+}
+
+int isEmpty_queue()
+{
+    if(front == -1 || front > rear)
+        return 1;
+    else
+        return 0;
+}
+
+int delete_queue()
+{
+    int delete_item;
+    if(front == -1 || front > rear)
+    {
+        printf("Queue Underflow\n");
+        exit(1);
+    }
+
+    delete_item = queue[front];
+    front = front+1;
+    return delete_item;
+}
+
+void create_graph()
+{
+    int count,max_edge,origin,destin;
+
+    printf("Enter number of vertices : ");
+    scanf("%d",&n);
+    max_edge = n*(n-1);
+
+    for(count=1; count<=max_edge; count++)
+    {
+        printf("Enter edge %d( -1 -1 to quit ) : \n",count);
+        scanf("%d %d",&origin,&destin);
+
+        if((origin == -1) && (destin == -1))
+            break;
+
+        if(origin>=n || destin>=n || origin<0 || destin<0)
+        {
+            printf("Invalid edge!\n");
+            count--;
+        }
+        else
+        {
+            adj[origin][destin] = 1;
+        }
+    }
+}
+
+/* ""OUTPUT""
+Enter number of vertices : 9
+Enter edge 1( -1 -1 to quit ) :
+0
+1
+Enter edge 2( -1 -1 to quit ) :
+0
+3
+Enter edge 3( -1 -1 to quit ) :
+0
+4
+Enter edge 4( -1 -1 to quit ) :
+1
+2
+Enter edge 5( -1 -1 to quit ) :
+3
+6
+Enter edge 6( -1 -1 to quit ) :
+4
+7
+Enter edge 7( -1 -1 to quit ) :
+6
+4
+Enter edge 8( -1 -1 to quit ) :
+6
+7
+Enter edge 9( -1 -1 to quit ) :
+2
+5
+Enter edge 10( -1 -1 to quit ) :
+4
+5
+Enter edge 11( -1 -1 to quit ) :
+7
+5
+Enter edge 12( -1 -1 to quit ) :
+7
+8
+Enter edge 13( -1 -1 to quit ) :
+-1
+-1
+Enter Start Vertex for BFS:
+0
+0 1 3 4 2 6 5 7 8
+
+*/

C/Binary_Search.c

@@ -0,0 +1,98 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+void binarySearch(int searchValue, int a[], int n);
+
+void selectionSort(int a[], int n)
+{
+    int i, j, minimunIndex, temp;
+
+    printf("Just started to sort Using the Selection Sort Algorithm\n");
+    // Started Sorting Using Selection sort
+    for ( i = 0; i < n; i++)
+    {
+        minimunIndex = i;
+
+        for ( j = i + 1; j < n; j++)
+        {
+            if (a[minimunIndex] > a[j])
+                minimunIndex = j;    
+        }
+        temp = a[i];
+        a[i] = a[minimunIndex];
+        a[minimunIndex] = temp;
+    }
+    // Now the Array has been sorted in Ascending Order
+    printf("Ended Sorting using Selection Sort\n");
+}
+
+
+void main()
+{
+    int length, i, searchValue;
+    printf("Welcome to the Binary Search!!\n");
+    printf("You can search the data element from an array, don't worry I will do it for you\n");
+    printf("For simplicity here the data elements are considered as integers\n");
+    printf("So let me know how many integers you want:\n");
+    scanf("%d", &length);
+
+    // Creating an array using calloc i.e. array for the user defined length
+    int *a = (int *) calloc (length, sizeof(int));
+
+    // Accepting the data elements for the array
+    printf("Please enter the integers now:\n");
+    for ( i = 0; i < length; i++)
+    {
+        scanf("%d", &a[i]);
+    }
+
+    // Accepting the Value to be searched
+    printf("Please enter the value you want me to search for:\n");
+    scanf("%d", &searchValue);
+
+    // Binary Search needs the sorted array as input without which the search can't occur
+    // Hence sorting elements before the Search
+    selectionSort(a, length);
+    // Implementing the Binary Search on the Sorted Array
+    binarySearch(searchValue, a, length);
+
+    printf("Thanks for Investing time in Me!!");
+}
+
+void binarySearch(int searchValue, int a[], int n)
+{
+    int middle, first, last;
+    first = 0;      // First initalized to the first position of the array
+    last = n-1;     // Last initialized to the last position of the array
+
+    middle = first + last / 2;      // Middle position of the array is calculated using this formula
+
+    printf("Starting to search the Data element --> %4d\n", searchValue);   
+    // Search until the last element is greater then equal to the first element
+    while( first <= last)
+    {
+        // If the searched value is greater then the element at the middle position modify the first position to the upper half of the array
+        if(a[middle] < searchValue)
+            first = middle + 1;
+
+        // Also check if the the element at the middle position is equal to the searched value
+        else if(a[middle] == searchValue)
+        {
+            printf("The element %d was found at the location %d starting from 0\n", searchValue, middle);
+            break;
+        }
+        // If the searched value is lesser then the element at the middle position modify the last position to the lower half of the array
+        else
+            last = middle - 1;
+
+        middle = first + last / 2; 
+    }
+
+    // If first becomes greater then the last position in the array then the element is not at all found in the array
+    if (first > last)
+    {
+        printf("Sorry the element you wanted me to Search doesn't exist in the given array\n");
+    }
+
+    printf("Just Ended Binary Search\n");
+}

C/Bit_stuffed_data.c

@@ -0,0 +1,26 @@
+// data communiction and networking Bit Stuffed data algorithm implemented
+#include "stdio.h"
+int main()
+{
+int i=0,c=0;
+char data[100];
+printf("Enter the data: ");
+scanf("%s",data);
+printf("\nBit Stuffed Data \n");
+printf("01111110");
+for(i=0;data[i]; i++)
+{
+    if(data[i]=='1')
+        c++;
+    else
+        c=0;
+printf("%c",data[i]);
+if(c==5)
+    {
+        printf("0");
+        c=0;
+    }
+}
+printf("01111110");
+return 1;
+}