#include
#include
#include
char s[20];
int top=-1;
void main()
{
    char str[20];
    char ch;
    int i;
    char pop();
    void push(char);
    int precd(char);
    s[top]='#';
    clrscr();
    printf("\n\t\tOUTPUT");
    printf("\n\tEnter the expression:");
    gets(str);
    printf("\n\tpostfix notation:");
    for(i=0;str[i]!='\0';i++)
    {
        if(isalpha(str[i]))
        {
            printf("%c",str[i]);
            continue;
        }
        if(str[i]==')')
        {
            while((ch=pop())!='(')
                printf("%c",ch);
        }
        else if(str[i]=='(')
            push(str[i]);
        else if(precd(str[i])<=precd(s[top]))
        {
            printf("%c",pop());
            push(str[i]);
        }
        else
            push(str[i]);
    }
    while(top>=0)
        printf("%c",pop());
    getch();
}
void push(char st)
{
    s[++top]=st;
}
char pop()
{
    char st;
    st=s[top--];
    return(st);
}

int precd(char s)
{
    switch(s)
    {
    case '$':return(4);
    case '*':
    case '/': return(3);
    case '+':
    case '-': return(2);
    case '(': return(1);
    case '#': return(-1);
    }
    return(0);
}

The post C program which converts given expression into its post-fix format first appeared on Student Projects.

#include
#define max 3
int q[10],front=0,rear=-1;
void main()
{
    int ch;
    void insert();
    void delet();
    void display();
    clrscr();
    printf("\nCircular Queue operations\n");
    printf("1.insert\n2.delete\n3.display\n4.exit\n");
    while(1)
    {
        printf("Enter your choice:");
        scanf("%d",&ch);
        switch(ch)
        {
        case 1: insert();
            break;
        case 2: delet();
            break;
        case 3:display();
            break;
        case 4:exit();
        default:printf("Invalid option\n");
        }
    }
}

void insert()
{
    int x;
    if((front==0&&rear==max-1)||(front>0&&rear==front-1))
        printf("Queue is overflow\n");
    else
    {
        printf("Enter element to be insert:");
        scanf("%d",&x);
        if(rear==max-1&&front>0)
        {
            rear=0;
            q[rear]=x;
        }
        else
        {
            if((front==0&&rear==-1)||(rear!=front-1))
                q[++rear]=x;
        }
    }
}
void  delet()
{
    int a;
    if((front==0)&&(rear==-1))
    {
        printf("Queue is underflow\n");
        getch();
        exit();
    }
    if(front==rear)
    {
        a=q[front];
        rear=-1;
        front=0;
    }
    else
        if(front==max-1)
        {
            a=q[front];
            front=0;
        }
        else a=q[front++];
        printf("Deleted element is:%d\n",a);
}

void display()
{
    int i,j;
    if(front==0&&rear==-1)
    {
        printf("Queue is underflow\n");
        getch();
        exit();
    }
    if(front>rear)
    {
        for(i=0;i<=rear;i++)
            printf("\t%d",q[i]);
        for(j=front;j<=max-1;j++)
            printf("\t%d",q[j]);
        printf("\nrear is at %d\n",q[rear]);
        printf("\nfront is at %d\n",q[front]);
    }
    else
    {
        for(i=front;i<=rear;i++)
        {
            printf("\t%d",q[i]);
        }
        printf("\nrear is at %d\n",q[rear]);
        printf("\nfront is at %d\n",q[front]);
    }
    printf("\n");
}
getch();

The post C program to implement Circular Queue operations first appeared on Student Projects.

#include
#include
#include
using namespace std;
#define MAX 10
int find(int i,int j);
void print(int,int);
int p[MAX],q[MAX],w[10][10],c[10][10],r[10][10],i,j,k,n,m;
char idnt[7][10];

main()
{
	cout << "enter the no, of identifiers";
	cin >>n;
	cout <<"enter identifiers";
	for(i=1;i<=n;i++)
	gets(idnt[i]);
	cout <<"enter success propability for identifiers";
	for(i=1;i<=n;i++)
		cin >>p[i];
	cout << "enter failure propability for identifiers";
	for(i=0;i<=n;i++)
		cin >> q[i];
	for(i=0;i<=n;i++)
	{
		w[i][i]=q[i];
		c[i][i]=r[i][i]=0;
		w[i][i+1]=q[i]+q[i+1]+p[i+1];
		r[i][i+1]=i+1;
		c[i][i+1]=q[i]+q[i+1]+p[i+1];
	}
	w[n][n]=q[n];
	r[n][n]=c[n][n]=0;
	for(m=2;m<=n;m++)
	{
		for(i=0;i<=n-m;i++)
		{
		     j=i+m;
		     w[i][j]=w[i][j-1]+p[j]+q[j];
		     k=find(i,j);
		     r[i][j]=k;
		     c[i][j]=w[i][j]+c[i][k-1]+c[k][j];
		}
	}
       cout <<"\n";
       print(0,n); }

int find(int i,int j)
{
int min=2000,m,l;
for(m=i+1;m<=j;m++)
if(c[i][m-1]+c[m][j]
OUTPUT
enter the no, of identifiers4

enter identifiers

do

if

int

while

enter success propability for identifiers3 3 1 1

enter failure propability for identifiers2 3 1 1 1
tree in preorder form

if

do

int

while
The post C++ program that uses dynamic programming algorithm to solve the optimal binary search tree problem first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-program-that-uses-dynamic-programming-algorithm-to-solve-the-optimal-binary-search-tree-problem/feed/
			2