Prime

#include<stdio.h>
#include<conio.h>
void main()
{
int num,i,cnt;
clrscr();
printf("Enter a number:");
scanf("%d",&num);
cnt=0;
for(i=1;i<num;i++)
{
if(num%i==0)
cnt++;
}
if(cnt==1)
printf("Num is prime");
else
printf("Not prime");
getch();
}

Queue

#include<stdio.h>
#include<conio.h>
#define MAX 10
int front=0,rear=0,ch,i;
int q[MAX],ele;
void Insert()
{
if(rear==MAX)
printf("\nQueue is full");
else
{
printf("\nEnter an element:");
scanf("%d",&ele);
q[rear]=ele;
rear++;
printf("\nElement inserted successfully\n");
}
}
void Delete()
{
if(front==rear)
printf("\nQueue is empty");
else
{
ele=q[front];
front++;
printf("The deleted element is:%d",ele);

}
}
void Display()
{
if(front==rear)
printf("\nQueue is empty");
else
{
printf("\nThe elements in the queue are:");
for(i=front;i<rear;i++)
printf("%d",q[i]);
printf(" ");
}
}
int main()
{
clrscr();
do
{
printf("\n***MENU***");
printf("\n1. Insert\n2. Delete\n3. Display\n4. Exit");
printf("\nEnter ur Choice:");
scanf("%d",&ch);
switch(ch)
{
case 1: Insert();
break;
case 2: Delete();

break;
case 3: Display();
break;
default: printf("Enter correct Choice");
}
}while(ch<=3);
}

Reverse

#include<stdio.h>
#include<string.h>
#include<conio.h>
int main()
{
char text[30]="I work for TBSS";
int i,j,n;
clrscr();
n=strlen(text);
for(i=n;i>=0;i--)
{
if(text[i-1]==' '||i==0)
{
for(j=i;text[j]!=' ';j++)
{
printf("%c",text[j]);
if(j==n)
break;

}
printf(" ");
}
}
getch();
}

SORT

#include<stdio.h>
#include<conio.h>
void main()
{
int a[10],temp,i,j;
clrscr();
printf("Enter 10 numbers");
for(i=0;i<10;i++)
scanf("%d",&a[i]);
for(i=0;i<10;i++)
{
for(j=i+1;j<10;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;

}
}
}
for(i=0;i<10;i++)
printf("%d",a[i]);
getch();
}