Removed #include<conio.h>

APPEND.C

@@ -1,9 +1,7 @@
 #include<stdio.h>
-#include<conio.h>
 void main()
 {
 	int a[10],b[10],i,j,m,n;
-	clrscr();
 	printf("Enter the size of first array: ");
 	scanf("%d",&m);
 	printf("\nEnter %d elements into first array:\n",m);
@@ -19,5 +17,4 @@ void main()
 	printf("\nFirst array after appending second array:\n");
 	for(i=0;i<m+n;i++)
 	printf("\n%d",a[i]);
-	getch();
 }

BINSEARC.C

@@ -1,12 +1,9 @@
 #include<stdio.h>
-#include<conio.h>
-
 int search(int [],int,int);
 
 void main()
 {
 	int a[10],i,n,x,loc;
-	clrscr();
 	printf("Enter the size : ");
 	scanf("%d",&n);
 	printf("\nEnter %d elements into the array in ascending order:\n",n);
@@ -17,7 +14,6 @@ void main()
 	loc=search(a,n,x);
 	if(loc==-1) printf("\n%d is not found.",x);
 	else printf("\n%d is found at position %d in the array.",x,loc);
-	getch();
 }
 
 int search(int a[],int n,int v)

BSERREC.C

@@ -1,13 +1,11 @@
 #include<stdio.h>
-#include<conio.h>
 
 int search(int [],int,int);
 int binsearch(int [],int,int,int);
 
 void main()
 {
 	int a[10],i,n,x,loc;
-	clrscr();
 	printf("Enter the size : ");
 	scanf("%d",&n);
 	printf("\nEnter %d elements into the array in ascending order:\n",n);
@@ -18,7 +16,6 @@ void main()
 	loc=search(a,n,x);
 	if(loc==-1) printf("\n%d is not found.",x);
 	else printf("\n%d is found at position %d in the array.",x,loc+1);
-	getch();
 }
 
 int search(int a[],int n,int v)

BSTSEARC.C

@@ -1,5 +1,4 @@
 #include<stdio.h>
-#include<conio.h>
 #include<alloc.h>
 
 typedef struct treeNode* treePointer;
@@ -20,7 +19,6 @@ void main()
 	int choice,n;
 	do
 	{
-		clrscr();
 		printf("\n\tBINARY SEARCH TREE OPERATIONS\n");
 		printf("\n\t\t1. Create");
 		printf("\n\t\t2. Search");
@@ -43,7 +41,6 @@ void main()
 				break;
 			default:continue;
 		}
-		getch();
 	}while(choice!=3);
 }
 

BUBBSORT.C

@@ -1,12 +1,10 @@
 #include<stdio.h>
-#include<conio.h>
 
 void sort(int*,int);
 
 void main()
 {
 	int a[10],n,i;
-	clrscr();
 	printf("Enter the size : ");
 	scanf("%d",&n);
 	printf("\nEnter %d elements into the array :\n",n);
@@ -19,7 +17,6 @@ void main()
 	printf("\n\nArray after sorting  :");
 	for(i=0;i<n;i++)
 	printf(" %d",a[i]);
-	getch();
 }
 
 void sort(int a[],int n)

CIRQUEUE.C

@@ -1,5 +1,4 @@
 #include<stdio.h>
-#include<conio.h>
 
 #define LENGTH 5
 
@@ -15,7 +14,6 @@ void main()
 	int ch,n;
 	do
 	{
-		clrscr();
 		printf("\n\tQUEUE OPERATIONS\n");
 		printf("\n\t\t1.ADD");
 		printf("\n\t\t2.DELETE");
@@ -38,7 +36,6 @@ void main()
 				break;
 			default:continue;
 		}
-		getch();
 	}while(ch!=4);
 }
 

DHEADLIS.C

@@ -1,6 +1,5 @@
 #include<stdio.h>
 #include<alloc.h>
-#include<conio.h>
 
 typedef struct listnode* listpointer;
 
@@ -27,7 +26,6 @@ void main()
 	head->next=head->prev=head;
 	do
 	{
-		clrscr();
 		printf("\n\tLINKED LIST OPERATIONS\n");
 		printf("\n\t\t1. CREATE");
 		printf("\n\t\t2. LIST");
@@ -59,7 +57,6 @@ void main()
 			       break;
 			default:continue;
 		}
-		getch();
 	}while(choice!=6);
 }
 

DOUBLLIS.C

@@ -1,6 +1,5 @@
 #include<stdio.h>
 #include<alloc.h>
-#include<conio.h>
 
 typedef struct listnode* listpointer;
 
@@ -25,7 +24,6 @@ void main()
 	int n,pos;
 	do
 	{
-		clrscr();
 		printf("\n\tLINKED LIST OPERATIONS\n");
 		printf("\n\t\t1. CREATE");
 		printf("\n\t\t2. LIST");
@@ -57,7 +55,6 @@ void main()
 			       break;
 			default:continue;
 		}
-		getch();
 	}while(choice!=6);
 }
 

EXCHANGESORT.C

@@ -1,9 +1,7 @@
 #include<stdio.h>
-​#​include​<​conio.h​>
 void main(void)
 {
     int array[5], i, j, temp,n;  
- ​   ​clrscr​();
     printf("Enter the number of elements : ");
     scanf("%d",&n);
     printf("Enter %d numbers : ",n);
@@ -28,5 +26,4 @@ void main(void)
     {
         printf(" %d ",array[i]);
     }
-    getch();
 }

HEADLIST.C

@@ -1,6 +1,5 @@
 #include<stdio.h>
 #include<alloc.h>
-#include<conio.h>
 
 typedef struct listnode* listpointer;
 
@@ -63,7 +62,6 @@ void main()
 			       break;
 			default:continue;
 		}
-		getch();
 	}while(choice!=7);
 }
 

INSSORT.C

@@ -1,12 +1,10 @@
 #include<stdio.h>
-#include<conio.h>
 
 void sort(int*,int);
 
 void main()
 {
 	int a[10],n,i;
-	clrscr();
 	printf("Enter the size : ");
 	scanf("%d",&n);
 	printf("\nEnter %d elements into the array :\n",n);
@@ -19,7 +17,6 @@ void main()
 	printf("\n\nArray after sorting  :");
 	for(i=0;i<n;i++)
 	printf(" %d",a[i]);
-	getch();
 }
 
 void sort(int a[],int n)

LINKEDLI.C

@@ -1,6 +1,5 @@
 #include<stdio.h>
 #include<alloc.h>
-#include<conio.h>
 
 typedef struct listnode* listpointer;
 
@@ -25,7 +24,6 @@ void main()
 	int n,pos;
 	do
 	{
-		clrscr();
 		printf("\n\tLINKED LIST OPERATIONS\n");
 		printf("\n\t\t1. CREATE");
 		printf("\n\t\t2. LIST");
@@ -57,7 +55,6 @@ void main()
 			       break;
 			default:continue;
 		}
-		getch();
 	}while(choice!=6);
 }
 

LINSEARC.C

@@ -1,12 +1,10 @@
 #include<stdio.h>
-#include<conio.h>
 
 int search(int [],int,int);
 
 void main()
 {
 	int a[10],i,n,x,loc;
-	clrscr();
 	printf("Enter the size : ");
 	scanf("%d",&n);
 	printf("\nEnter %d elements into the array:\n",n);
@@ -17,7 +15,6 @@ void main()
 	loc=search(a,n,x);
 	if(loc==-1) printf("\n%d is not found.",x);
 	else printf("\n%d is found at position %d in the array.",x,loc);
-	getch();
 }
 
 int search(int a[],int n,int v)

LISTSORT.C

@@ -1,6 +1,5 @@
 #include<stdio.h>
 #include<alloc.h>
-#include<conio.h>
 
 typedef struct listnode* listpointer;
 
@@ -21,7 +20,6 @@ void main()
 	int choice;
 	do
 	{
-		clrscr();
 		printf("\n\tLINKED LIST OPERATIONS\n");
 		printf("\n\t\t1. CREATE");
 		printf("\n\t\t2. LIST");
@@ -39,7 +37,6 @@ void main()
 			       break;
 			default:continue;
 		}
-		getch();
 	}while(choice!=4);
 }
 

PATTERNMATCHING.C

@@ -1,6 +1,5 @@
 #include <stdio.h>
 #include <string.h>
-#include<conio.h>
 void main()
 {
     char text[20],pat[20];
@@ -9,7 +8,6 @@ void main()
     gets(text);
     printf("Enter the pattern to find : ");
     gets(pat);
-    clrscr();
 
     a = strlen(pat);
     b = strlen(text);
@@ -30,5 +28,4 @@ void main()
     if (flag==0)
         printf("Not found");
 
-    getch();
 }

POLYARR1.C

@@ -1,5 +1,4 @@
 #include<stdio.h>
-#include<conio.h>
 
 typedef struct {int coef,exp;} polynomial;
 
@@ -10,7 +9,6 @@ void main()
 {
 	polynomial p1[10],p2[10],p3[20],p4[50],t;
 	int n1,n2,n3,n4,i,j,k;
-	clrscr();
 	printf("Number of terms in first polynomial : ");
 	scanf("%d",&n1);
 	printf("\nEnter %d terms for first polynomial:\n",n1);
@@ -53,7 +51,6 @@ void main()
 	print(p3,n3);
 	printf("\nPolynomial product : ");
 	print(p4,n4);
-	getch();
 }
 
 void read(polynomial p[],int n)

POLYLIN1.C

@@ -1,5 +1,4 @@
 #include<stdio.h>
-#include<conio.h>
 #include<alloc.h>
 
 typedef struct node* polynomial;
@@ -14,7 +13,6 @@ void main()
 {
 	polynomial p,t;
 	int i,n;
-	clrscr();
 	printf("Number of terms in the polynomial : ");
 	scanf("%d",&n);
 	printf("\nEnter %d terms for the polynomial:\n",n);
@@ -46,5 +44,4 @@ void main()
 		else if(t->exp==1) printf("%dx",t->coef);
 		else printf("%dx^%d",t->coef,t->exp);
 	}
-	getch();
 }

POSTFIX.C

@@ -1,16 +1,13 @@
 #include<stdio.h>
-#include<conio.h>
 
 int evaluate(char*);
 
 void main()
 {
 	char exp[15];
-	clrscr();
 	printf("Enter an expression in postfix form : ");
 	gets(exp);
 	printf("\nResult = %d",evaluate(exp));
-	getch();
 }
 
 int evaluate(char *str)

QUEUEARR.C

@@ -1,5 +1,4 @@
 #include<stdio.h>
-#include<conio.h>
 
 #define LENGTH 5
 
@@ -15,7 +14,6 @@ void main()
 	int ch,n;
 	do
 	{
-		clrscr();
 		printf("\n\tQUEUE OPERATIONS\n");
 		printf("\n\t\t1.ADD");
 		printf("\n\t\t2.DELETE");
@@ -38,7 +36,6 @@ void main()
 				break;
 			default:continue;
 		}
-		getch();
 	}while(ch!=4);
 }