Add files via upload

Author: utsavpatel562

8 - Postfix_Evaluation.c

@@ -0,0 +1,113 @@
+// Implement Postfix Evaluation using Stack.
+
+#include<stdio.h>
+#define max 20
+void push(int[],int);
+int pop (int[]);
+int top=-1;
+void display(int[],int);
+
+void main()
+{
+	int s[max],x1,x2,result,i=0,ans,len;
+	char p[50];
+	
+	printf("Enter Postfix Expression : ");
+	gets(p);
+	
+	len=strlen(p);
+	p[len]=')';
+	
+	puts(p);
+	while(p[i]!=')')
+	{	
+		switch(p[i])
+		{
+			case '+':
+				x1=pop(s);
+				x2=pop(s);
+				result=x2+x1;
+				push(s,result);
+				break;
+				
+			case '-':
+				x1=pop(s);
+				x2=pop(s);
+				result=x2-x1;
+				push(s,result);
+				break;
+				
+			case '*':
+				x1=pop(s);
+				x2=pop(s);
+				result=x2*x1;
+				push(s,result);
+				break;
+				
+			case '/':
+				x1=pop(s);
+				x2=pop(s);
+				result=x2/x1;
+				push(s,result);
+				break;
+				
+			case '$':
+				x1=pop(s);
+				x2=pop(s);
+				result=pow(x2,x1);
+				push(s,result);
+				break;
+				
+			default:
+				push(s,p[i]-48);
+				break;
+		}
+		display(s,top);
+		i++;
+	}
+	ans=pop(s);
+	printf("Postfix Evaulation is : %d",ans);
+}
+
+void push(int s[],int y)
+{
+	
+	if(top>=max)
+	{
+		printf("\nStack is Overflow...!!");
+		printf("\n\n");
+	}
+	else
+	{
+		top++;
+		s[top]=y;
+	}
+}
+
+int pop(int s[])
+{
+	int x;
+	if(top<0)
+	{
+		printf("\nStack is Underflow...!!");
+		printf("\n\n");
+	}
+	else
+	{
+		x=s[top];
+		top--;
+		return x;
+	}
+}
+
+void display(int s[],int top)
+{
+	int i;
+	printf("\nStack has Following Elements : \n");
+	for(i=0;i<=top;i++)
+	{
+		printf("\t%d",s[i]);
+		printf("\n");
+	}
+	printf("\n");
+}

Doubly_link_list_first_last_End.c

@@ -0,0 +1,114 @@
+#include<stdio.h>
+#include<conio.h>
+#include<malloc.h>
+void ins_first(int);
+void ins_last(int);
+void Display();
+struct node
+{
+	int info;
+	struct node *lptr;
+	struct node *rptr;
+}*l,*r;
+void main()
+{
+	int choice,item;
+	l=r=NULL;
+	do
+	{
+		printf("\nDoubly Link List: \n(1)Insert at First \n(2)Insert at Last \n(3)Display \n(4)Exit \nEnter Your choice:");
+		scanf("%d",&choice);
+		switch(choice)
+		{
+			case 1:
+			printf("\nEnter Item:");
+			scanf("%d",&item);
+			ins_first(item);
+			break;
+
+			case 2:
+			printf("\nEnter Item:");
+			scanf("%d",&item);
+			ins_last(item);
+			break;
+
+			case 3:
+			Display();
+			break;
+		}
+	}while(choice < 4);
+}
+void ins_first(int item)
+{
+	struct node *newnode;
+	newnode=(struct node *)malloc(sizeof(struct node));
+	if(newnode==NULL)
+	{
+		printf("\nMemory Not Allocated");
+		getch();
+		return;
+	}
+	newnode->info=item;
+	if(l==NULL)
+	{
+		newnode->lptr=NULL;
+		newnode->rptr=NULL;
+		l=newnode;
+		r=newnode;
+		return;
+	}
+	else
+	{
+		newnode->lptr=NULL;
+		newnode->rptr=l;
+		l->lptr=newnode;
+		l=newnode;
+		return;
+	}
+}
+void ins_last(int item)
+{
+	struct node *newnode;
+	newnode=(struct node *)malloc(sizeof(struct node));
+	if(newnode==NULL)
+	{
+		printf("\nMemory Not Allocated" );
+		getch();
+		return;
+	}
+	newnode->info=item;
+	if(l==NULL)
+	{
+		newnode->lptr=NULL;
+		newnode->rptr=NULL;
+		l=newnode;
+		r=newnode;
+		return;
+	}
+	else
+	{
+		newnode->lptr=r;
+		newnode->rptr=NULL;
+		r->rptr=newnode;
+		r=newnode;
+		return;
+	}
+}
+void Display()
+{
+	struct node *temp;
+	if(l==NULL)
+	{
+		printf("\nEmpty Linked List...");
+		getch();
+		return;
+	}
+	printf("\nList is:");
+	temp=l;
+	while(temp!=NULL)
+	{
+		printf("\t%d",temp->info);
+		temp=temp->rptr;
+	}
+	getch();
+}

In_Sorted_New_node_Linked List.c

@@ -0,0 +1,96 @@
+// Implement algorithm of insert a newnode in sorted Link List //
+
+//CODE:~
+
+#include<stdio.h>
+#include<conio.h>
+#include<malloc.h>
+void insert_sorted(int);
+void display();
+struct node
+{
+	int info;
+	struct node *link;
+}*first;
+void main()
+{
+	int item,choice,pos;
+	do
+	{
+		printf("\n(1)Insert \(2)Display \n(3)Exit \n\nEnter Choice :");
+		scanf("%d",&choice);
+		switch(choice)
+		{
+			case 1:
+			    printf("\nEnter value for Insert :");
+				scanf("%d",&item);
+				insert_sorted(item);
+				break;
+			case 2:
+                display();
+				break;
+		}
+	}while(choice < 3);
+}
+void insert_sorted(int item)
+{
+	struct node *newnode,*temp,*next;
+	int flag = 0;
+	newnode = (struct node*)malloc(sizeof(struct node));
+	newnode->info = item;
+	if(first==NULL)
+	{
+		newnode->link = NULL;
+		first = newnode;
+	}
+	else
+	{
+		if(item<first->info)
+		{
+			newnode->link = first;
+			first = newnode;
+		}
+		else
+		{
+			temp = first;
+			while(temp->link!=NULL)
+			{
+				next = temp->link;
+				if(item>temp->info && item<=next->info)
+				{
+					newnode->link=next;
+					temp->link=newnode;
+					flag=1;
+				}
+				temp = temp->link;
+			}
+			if(flag==0)
+			{
+				temp->link=newnode;
+				newnode->link=NULL;
+			}
+		}
+	}
+	return;
+}
+void display()
+{
+	struct node * temp;
+	if(first==NULL)
+	{
+		printf("\nLink list is Empty");
+	}
+	else
+    {
+		temp = first;
+		printf("\n\Link List :");
+		while(temp!=NULL)
+		{
+			printf("\t%d",temp->info);
+			temp=temp->link;
+		}
+	}
+	return;
+}
+
+//OUTPUT:~

Insertion_Sort.c

@@ -0,0 +1,39 @@
+//To Implement Insertion Sort 
+//CODE:~
+
+#include<stdio.h>
+#include<conio.h>
+void Insertion_sort(int[],int);
+void main()
+{
+	int i,a[50],N;
+	printf("\nEnter the Size of List =");
+	scanf("%d",&N);
+	printf("\nEnter Numbers:\n");
+	for(i=0;i<N;i++)
+	{
+		scanf("%d",&a[i]);
+	}
+	Insertion_sort(a,N);
+	printf("\nYour Sorted List:\n");
+	for(i=0;i<N;i++)
+	{
+		printf("%d\n",a[i]);
+	}
+	getch();
+}
+void Insertion_sort(int array[],int N)
+{
+	int i,j,key;
+	for(i=1;i<=N-1;i++)
+	{
+		key=array[i];
+		j=i;
+		while(j>0 && array[j-1]>key)
+		{
+			array[j]=array[j-1];
+			j--;
+		}
+		array[j]=key;
+	}
+}