Professional Documents
Culture Documents
PRACTICAL-1
Output:
PRACTICAL-2
#include<iostream.h>
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int i,a,flag;
cout<<"enter a number=";
cin>>a;
for(i=2;i<a;i++)
{
if(a%i==0)
{flag=1;}
}
if(flag==1)
{cout<<"not a prime number";}
else
cout<<"Prime number";
getch();
}
OUTPUT:
PRACTICAL-3
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int n,i,a[20],item,position;
cout<<"enter a no. of elements";
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i];
}
cout<<"enter new element u want to insert";
cin>>item;
cout<<"enter position where u want to insert element";
cin>>position;
for(i=n-1;i>=position-1;i--)
{
a[i+1]=a[i];}
a[position-1]=item;
for(i=0;i<n+1;i++)
{
cout<<a[i];
}
getch();
}
OUTPUT:
PRACTICAL-4
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int n,i,a[7],position;
cout<<"enter an elements";
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
cout<<"enter position where u want to delete element";
cin>>position;
for(i=position;i<=n;i++)
{
a[i]=a[i+1];}
n=n-1;
for(i=1;i<=n;i++)
{cout<<a[i];
}
getch();
}
OUTPUT:
PRACTICAL-5
#include<iostream.h>
#include<conio.h>
#include<stdlib.h>
void main()
{
clrscr();
int a[100],n,i,flag,ch,item,position;
cout<<"enter size of an array=";
cin>>n;
for(i=1;i<=n;i++)
{cout<<"enter an elements=";
cin>>a[i];}
do{
cout<<"1 insertion, 2 deletion,3 traversing,4 searching";
cin>>ch;
switch(ch)
{
case 1:
{
cout<<"enter new element you want to insert=";
cin>>item;
cout<<"enter position u want to insert element=";
cin>>position;
for(i=n;i>=position;i--)
{a[i+1]=a[i];}
a[position]=item;
for(i=1;i<=n+1;i++)
{
cout<<a[i];
}
break;
}
case 2:
{
cout<<"enetr the position where u want to delete element=";
cin>>position;
for(i=position;i<=n;i++)
{
a[i]=a[i+1];}
n=n-1;
for(i=1;i<=n;i++)
{
cout<<a[i]<<endl;}
break;
}
case 3:
{ for(i=1;i<=n;i++)
{
cout<<a[i];
}
break;
}
case 4:
{
cout<<"enter element u want to search";
cin>>item;
for(i=1;i<=n;i++)
{
if(a[i]==item)
{flag=1;}}
if(flag==1)
cout<<"element found"<<endl;
else
cout<<"not found"<<endl;}
break;
}
cout<<"PRESS:: 1 CONTINUE \t 2 EXIT";
cin>>i;
}
while(i==1);
getch();
}
OUTPUT:
PRACTICAL-6
Create a program of sorting using bubble sort.
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int temp,j,a[20],n,i;
cout<<"enter the size of an array=";
cin>>n;
for(i=1;i<=n;i++)
{
cout<<"enter an elements of an array=";
cin>>a[i];
}
for(i=1;i<=n;i++)
{
for(j=1;j<n;j++)
{
if(a[j]>a[j+1])
{temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}}}
for(i=1;i<=n;i++)
{cout<<a[i]}
getch();
}
OUTPUT:
PRACTICAL-7
return 0;
}
OUTPUT:
PRACTICAL-8
#include <iostream>
using namespace std;
int main()
{ int n,i,j,a[100],temp;
cout << "enter size of array" << endl;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
for(i=2;i<=n;i++)
{
temp=a[i];
j=i-1;
while((temp<a[j])&&(j>=1))
{a[j+1]=a[j];
j=j-1;
}a[j+1]=temp;}
for(i=1;i<=n;i++)
{
cout<<a[i];
}
return 0;
}
OUTPUT:
PRACTICAL-9
return 0;
}
void merge_sort(int i,int j)
{ int mid;
if(i<j){
mid=(i+j)/2;
merge_sort(i,mid);
merge_sort(mid+1,n);
merge_array(i,mid,mid+1,n);
}
}
void merge_array(int e,int b,int c,int d)
{ int i=e,j=c,k=1,t[100];
while(i<=b&&j<=d)
{
if(a[i]<a[j])
t[k++]=a[i++];
else
t[k++]=a[j++];
}
while(i<=b)
t[k++]=a[i++];
while(j<=d)
t[k++]=a[j++];
for(i=e,j=1;j<=n;i++,j++)
{a[i]=t[j];}
}
OUTPUT:
PRACTICAL-10
PRACTICAL-11
{
if(top<maxi)
cin>>item;
top=top+1;
stack[top]=item;
for(i=1;i<=top;i++)
{cout<<stack[i]<<" ";}
else
cout<<"stack is overflow"<<endl;
return 0;
int pop()
if(top==0)
cout<<"stack is empty";
else
cout<<"deleted element="<<stack[top]<<endl;
top--;
for(i=1;i<=top;i++)
cout<<stack[i]<<" ";
return 0;
OUTPUT:
PRACTICAL-12
char pop()
{
char item;
item=stack[top];
top--;
return(item);
}
j++;
temp=pop();
}
push(temp);
push(item);
}
else if(item==')')
{
temp=pop();
while(temp!='(')
{
postfix[j]=temp;
j++;
temp=pop();
}
}
else{
cout<<"invalid arthimetic expression"<<endl;
}
i++;
}
while(top>-1)
{
postfix[j]=pop();
j++;
}
postfix[j]='\0';
printf("\nArithmetic expression in post is:");
puts(postfix);
return 0;
}
OUTPUT:
PRACTICAL-13
break;
}
case 2:
{
deletion();
break;
}
case 3:
{
display();
break;
}
}
cout<<"1 for continue and 2 for exit=";
cin>>i;
}while(i=1);
}
int insertion()
{
if(rear==maxsize)
{
cout<<"overflow";
}
else
{rear++;
cout<<"enter element which u want to insert=";
cin>>item;
queue[rear]=item;
return 0;
}}
int deletion()
{
if(rear==0)
{
cout<<"underflow";
}
else cout<<"item deleted"<<queue[front]<<endl;
front ++;
return 0;
}
int display()
{
for(j=front;j<=rear;j++)
{
cout<<queue[j];
}
return 0;
}
OUTPUT: