DYNAMIC APPROACH ALGORITHM

BINARY SEARCH TREE USING DYNAMIC APPROACH


#include<iostream.h>
#include<conio.h>
int i,j,k,n,r[10][10]={0},d,s,kmin;
float p[20],minval,sum,c[10][10];
class binary
{
public:
void getdata();
void calc();
void display();
};
void binary::getdata()
{
cout<<"\nEnter the total number key value:\n";
cin>>n;
cout<<"\nEnter probability value:\n";
for(i=1;i<=n;i++)
cin>>p[i];
}
void binary :: calc()
{
for(i=1;i<=n;i++)
{
c[i][i-1]=0;
c[i][i]=p[i];
r[i][i]=i;
}
c[n+1][n]=0;
for(d=1;d<=n-1;d++)
{
for(i=1;i<=n-d;i++)
{
j=i+d;
minval=1000;
for(k=i;k<=j;k++)
{
if(c[i][k-1]+c[k+1][j]<minval)
{
minval=c[i][k-1]+c[k+1][j];
kmin=k;
}
}
r[i][j]=kmin;
sum=p[i];
for(s=i+1;s<=j;s++)
sum=sum+p[s];
c[i][j]=minval+sum;
}
}
}

void binary::display()
{
cout<<"\n\t\tMain Table\n\n\n";
cout<<"\t";
for(i=0;i<=n;i++)
cout<<"\t"<<i;
cout<<"\n";
for(i=1;i<=n+1;i++)
{
cout<<"\t"<<i;
for(j=0;j<=n;j++)
cout<<"\t"<<c[i][j];
cout<<"\n";
}
getch();
cout<<"\n\t\tRoot Table\n\n\n";
cout<<"\t";
for(i=0;i<=n;i++)
cout<<"\t"<<i;
cout<<"\n";
for(i=1;i<=n+1;i++)
{
cout<<"\t"<<i;
for(j=0;j<=n;j++)
cout<<"\t"<<r[i][j];
cout<<"\n";
}
}

void main()
{
clrscr();
binary bin;
bin.getdata();
bin.calc();
bin.display();
getch();
}




OUTPUT:
           

Enter the total number key value:
4

Enter probability value:
0.1
0.2
0.3
0.4

                Main Table


                 0       1       2       3       4
        1       0       0.1    0.4    1       1.8
        2       0       0       0.2    0.7    1.5
        3       0       0       0       0.3    1
        4       0       0       0       0       0.4
        5       0       0       0       0       0

                Root Table


                 0       1       2       3       4
        1       0       1       2       2       3
        2       0       0       2       3       3
        3       0       0       0       3       4
        4       0       0       0       0       4
        5       0       0       0       0       0

 





Comments

Post a Comment

Popular posts from this blog

TRAVELING SALESMAN USING BRANCH AND BOUND TECHNIQUE

Image
The Traveling Salesman Problem (TSP) is a classic problem in computer science and optimization theory. The problem is defined as follows: given a set of cities and the distances between them, find the shortest possible path that visits each city exactly once and returns to the starting city. The Branch and Bound technique is an algorithmic paradigm for solving combinatorial optimization problems. The basic idea is to explore the search space by dividing it into smaller subproblems, and then pruning branches of the search tree that can be shown to lead to suboptimal solutions. The branch and bound algorithm for the TSP works by starting with an initial lower bound on the length of the optimal tour, and then exploring the search space by systematically building up partial tours and computing lower bounds on their completion. Sample C code for solving the Traveling Salesman Problem(TSP) using the branch and bound technique: #include <stdio.h> #include <stdlib.h> #include ...
Read more

OPERATING SYSTM’s ALGORITHM (In LINUX OS) - FIRST FIT, BEST FIT, WORST FIT ALGORITHM

FIRST FIT, BEST FIT, WORST FIT ALGORITHM PROGRAM: #include<stdio.h> int mem[20],proc[20],bp[20],bm[20],cm[20],cp[20],ms,ps,i,j,ch,y; main() {             printf(“\nEnter the number of memory segments”);             scanf(“%d”,&ms);             printf(“\nEnter the memory segment”);             for(i=0;i<ms;i++)             {                         scanf(“%d”,&mem[i]);                         bm[...
Read more

OPERATING SYSTM’s ALGORITHM (In LINUX OS) - BANKERS ALGORITHM

BANKERS ALGORITHM – SINGLE RESOURCES PROGRAM: #include<stdio.h> main() { int j=0,cmp=0,i,tot,avail,need[20],n,tr,max[20],hold[20]; printf("Enter the number of process"); scanf("%d",&n); printf("Enter the number of resources"); scanf("%d",&tr); printf("Enter the max,need,hold for each process"); for(i=0;i<n;i++) { printf("p%d",i); scanf("%d",&max[i]); scanf("%d",&hold[i]); } tot=0; for(i=0;i<n;i++) { tot=tot+hold[i]; need[i]=max[i]-hold[i]; } avail=tr-tot; while(j!=tr) { for(i=0;i<n;i++) { if(need[i]!=0&&need[i]<=avail) { avail=avail+hold[i]; need[i]=0; printf("%d\t%d\n",i,avail); cmp++; } } j++; } if(avail==tr) printf("safe state"); else printf("unsafe state"); }
Read more