Add files via upload

Author: prasadbylapudi

1 gcd.c

@@ -0,0 +1,23 @@
+#include<stdio.h> 
+int gcd(int,int); 
+void main() 
+{ 
+	int a,b,result;
+	printf("enter any two numbers"); 
+	scanf("%d %d",&a,&b); 
+	result=gcd(a,b); 
+	printf("gcd=%d",result); 
+} 
+int gcd(int a,int b) 
+{ 
+	int r; 
+	r=a%b; 
+	if(r==0) 
+	{ 
+		return b; 
+	} 
+	else 
+	{ 
+		return gcd(b,r); 
+	} 
+}

2 multiply without.c

@@ -0,0 +1,24 @@
+#include<stdio.h> 
+int mul(int x,int y) 
+{ 
+	if(y==0) 
+	{ 
+		return 0; 
+	} 
+	else if(y>0) 
+	{ 
+		return (x+mul(x,y-1)); 
+	} 
+	else if(y<0)
+	{
+		return -mul(x,-y);
+	}
+} 
+int main() 
+{ 
+	int a,b,result; 
+	printf("enter two numbers\n"); 
+	scanf("%d %d",&a,&b); 
+	result=mul(a,b); 
+	printf("%d",result); 
+} 

3 without division.c

@@ -0,0 +1,19 @@
+#include<stdio.h> 
+int division(int,int); 
+void main() 
+{
+	int a,b,result; 
+	printf("enter two numbers\n"); 
+	scanf("%d %d",&a,&b); 
+	result=division(a,b); 
+	printf("%d",result);
+} 
+int division(int a,int b) 
+{ 
+	if(a-b<0) 
+	return 0; 
+	else if(a-b==0) 
+	return 1; 
+	else return division(a-b,b)+1; 
+} 
+

4 power of 2num.c

@@ -0,0 +1,31 @@
+#include<stdio.h> 
+int power(int,int); 
+void main() 
+{ 
+	int b,p,result; 
+	printf("enter base\n"); 
+	scanf("%d",&b); 
+	printf("enter power\n"); 
+	scanf("%d",&p); 
+	if(p>=0) 
+	{
+		result=power(b,p); 
+		printf("%d^%d=%d",b,p,result);
+	}
+	if(p<0) 
+	{ 
+		result=power(b,-p); 
+		printf("%d^%d=1/%d",b,p,result); 
+	}
+} 
+int power(int b,int p) 
+{ 
+	if(p!=0) 
+	{ 
+		return (b*power(b,p-1)); 
+	} 
+	else 
+	{ 
+		return 1;
+	}
+}

5 palinfrome or not.c

@@ -0,0 +1,29 @@
+#include<stdio.h> 
+void main()
+{
+	int n,num ; 
+	printf("enter any number\n"); 
+	scanf("%d",&n); 
+	num=reverse(n); 
+	if(n==num) 
+	{ 
+		printf("palindrome"); 
+	} 
+	else 
+	{ 
+		printf("not palidrome"); 
+	}
+} 
+int reverse(int n) 
+{ 
+	static sum=0; 
+	if(n!=0) 
+	{ 
+		sum=sum*10+(n%10); 
+		reverse(n/10); 
+	} 
+	else 
+	{ 
+		return sum; 
+	} 
+}

6 tower of hanoi.c

@@ -0,0 +1,20 @@
+#include<stdio.h> 
+void toh(int n,char s,char d,char au) 
+{ 
+	if(n==1) 
+	{ 
+		printf("move disk %d from %c to %c\n",n,s,d); 
+		return; 
+	} 
+	toh(n-1,s,au,d); 
+	printf("move disk %d from %c to %c\n",n,s,d); 
+	toh(n-1,au,d,s);
+} 
+void main() 
+{ 
+	int n; 
+	printf("enter number of dics\n"); 
+	scanf("%d",&n); 
+	toh(n,'A','C','B');
+} 
+

ARRAY REPRESENTATION OF STACK.c

@@ -0,0 +1,91 @@
+#include <stdio.h>
+#include <stdlib.h>
+#define MAX 10
+int top=-1,stack[MAX],x,i;
+void push();
+void pop();
+void display();
+void peek();
+void main()
+{
+   int ch;
+    while(1)
+	{
+		printf("Stack Operations:\n");
+		printf("1.Push\n");
+		printf("2.Pop\n");
+		printf("3.Display\n");
+		printf("4.peek\n5.exit\n");
+		printf("enter your choice=\n");
+		scanf("%d",&ch);
+		switch(ch)
+		{
+			case 1:
+			push();
+        	break;
+			case 2:
+			pop();
+			break;
+			case 3:
+			display();
+			break;
+			case 4:
+		    peek();
+		    break;
+		    case 5:
+		    exit(0);
+		    break;
+			default:
+			printf("choose right option\n");
+     	}
+	}
+}
+void push()
+{
+	if(top>=MAX)
+	{
+		printf("STACK is overe flow\n");
+	}
+	else
+	{
+		printf("enter the element to push=\n");
+		scanf("%d",&x);
+		top++;
+		stack[top]=x;
+	}
+}
+void pop()
+{
+	if(top<=-1)
+	{
+		printf("Stack is underflow\n");
+		
+	}
+	else
+	{
+		printf("The popped element is= %d\n",stack[top]);
+		top--;
+	}
+	
+}
+void display()
+{
+	if(top>=0)
+	{
+		printf("The elements in the stack are=");
+		for(i=top;i>=0;i--)
+		{
+			printf("\n%d",stack[i]);
+		}
+	}
+	else
+	{
+		printf("The stack is empty\n");
+	}
+}
+void peek()
+{
+	printf("The Top element in the stack is=%d\n",stack[top]);
+	
+}
+

BST.c

@@ -0,0 +1,53 @@
+#include<stdio.h> 
+#include<conio.h> 
+#include<stdlib.h> 
+struct node 
+{ 
+struct node *left;  
+int data;  
+struct node *right; 
+}; 
+struct node *root=NULL,*parent; 
+void insert(int val)
+{  
+	struct node *temp,*current,*parent; 
+	 temp=(struct node*)malloc(sizeof(struct node));
+  temp->left=NULL; 
+  temp->data=val; 
+  temp->right=NULL;  
+if(root==NULL)  
+{
+	root=temp; 
+ }
+   else 
+    {  
+		current=root;  
+		while(current) 
+  		{   
+		 parent=current;   
+		  if(val>current->data)  
+		    {     
+				current=current->right;   
+			 } 
+			    else   
+				 {     
+						current=current->left;   
+				 }   
+		} 
+		  if(val>parent->data)
+		    {    
+				parent->right=temp;  
+		    }   
+			else   {    parent->left=temp;   }  } } void preorder(struct node *tree) {  if(tree!=NULL)  {   printf("%d\t",tree->data);   preorder(tree->left); 
+  preorder(tree->right);  } } void inorder(struct node *tree) {  if(tree!=NULL)  {   inorder(tree->left);   printf("%d\t",tree->data);   inorder(tree->right);  } } void postorder(struct node *tree) {  if(tree!=NULL)  {   postorder(tree->left);   postorder(tree->right);   printf("%d\t",tree->data);  } } void delete(struct node *current,int val) {    while(val!=current->data)  {   parent=current; 
+  if(val>current->data)   {    current=current->right;   }   else   {    current=current->left;   }  }  if(current->left==NULL&&current->right==NULL)  {   if(parent->right==current)   {    parent->right=NULL;   }   else   {    parent->left=NULL;   }     }  else if(current->left==NULL&&current->right!=NULL)  {       if(parent->right==current)    {     parent->right=current->right; 
+   }    else    {     parent->left=current->right;    }    current->right=NULL;    free(current);    }  else if(current->right==NULL&&current->left!=NULL)  {   if(parent->right==current)   {    parent->right=current->left;   }   else   {    parent->left=current->left;   }   current->left=NULL;   free(current);  }  else if(current->left!=NULL&&current->right!=NULL)  {    struct node *min,*prev=NULL;    min=current->right;    if(min->left==NULL)    { 
+    parent->right=min;     min->left=current->left;     current->right=NULL;     current->right=NULL;     free(current);    }    else    {         while(min->left!=NULL)     {      prev=min;      min=min->left;     }        prev->left=min->right;     parent->right=min;     min->left=current->left;     min->right=current->right;     current->right=NULL;     current->left=NULL;     free(current);   }  } } int countn(struct node *tree) { 
+ int c=1;  if(tree==NULL)  {   return 0;  }  else  {   c=c+countn(tree->left);   c=c+countn(tree->right);   return c;  } } void nthnode(struct node *tree,int n) {  static int count=0;  if(tree==NULL)  {   return;  }  if(count<=n)  {   nthnode(tree->left,n);   count++;   if(count==n)   {    printf("\n%d",tree->data);   } 
+  nthnode(tree->right,n);  } } void small() {  struct node *current=root;  while(current->left!=NULL)  {   current=current->left;  }  printf("\n%d",current->data);   } void max() {  struct node *current=root;  while(current->right!=NULL)  {   current=current->right;  }  printf("\t%d",current->data); } void at_level(struct node* temp,int desired,int current) {  if(temp)  {   if(desired==current)    printf("%d\t",temp->data); 
+  else   {    at_level(temp->left,desired,current+1);    at_level(temp->right,desired,current+1);   }  } } 
+ 
+ 
+void main() {  int op,val,ele,count,n,c,l;  while(1)  {   printf("\n**MENU**");   printf("\n1.create");   printf("\n2.preorder traversal");   printf("\n3.inorder traversal");   printf("\n4.postorder");   printf("\n5.delete");   printf("\n6.count");   printf("\n7.nthnode in inorder");   printf("\n8.small");   printf("\n9.max");   printf("\n10.nodes at nth level");   printf("\nenter option");   scanf("%d",&op); 
+  switch(op)   {    case 1:      printf("\nenter data");      scanf("%d",&val);      insert(val);      break;    case 2:      preorder(root);      break;    case 3:      inorder(root);      break;    case 4:      postorder(root);      break;    case 5:            printf("\nenter value");      scanf("%d",&ele);      delete(root,ele);      break;    case 6:      c=countn(root);      printf("\ncount:%d",c);      break;    case 7: 
+     printf("\nenter n value");      scanf("%d",&n);      count=0;      nthnode(root,n);      break;    case 8:      small();      break;    case 9:      max();      break;    case 10:      printf("enter n value\n");      scanf("%d",&l);      at_level(root,l,0);      break;            }  } }