Previous Year University Question Papers June 2017
/BE100-B
BE102-A
BE110-B
CE100-B
CS100-A
CY100-B
EC100-B
EE100-B
MA102-B
ME100-B
PH100-B
S4
S4
Previous Year University Question Papers Dec 2017
BE100-D
BE10101-C
BE10102-C
BE10103-C
BE10104-C
BE10105-C
BE103-D
BE110-D
CY100-D
EC100-D
EE100-D
MA101-F
ME100-E
BE110-D
PH100-D
S3
CE201-C
CE203-C
CE205-D
CE207-C
CS201-C
CS203-C
CS205-C
CS207-C
EC201-C
EC203-C
EC205-C
EC207-C
EE201-C
EE203-C
EE205-C
EE207-C
HS200-D
HS210-D
IT201-C
IT203-C
MA201-D
ME201-C
ME203-C
ME205-C
ME210-E
S5
CE301-A
CE303-A
CE303-B
CE305-A
CE307-A
CE309-A
CE361-A
CE363-A
CS301-A
CS303-A
CS305-A
CS307-A
CS309-A
CS361-A
EC301-A
EC303-A
EC305-A
EC307-A
EC365-A
EE301-A
EE303-A
EE305-A
EE307-A
EE309-A
EE311-A
EE367-A
HS300-A
IT301-A
IT303-A
IT305-A
IT307-A
IT367-A
ME301-A
ME303-A
ME305-A
ME367-A
ME371-A
PREFIX EVALUATION
ALGORITHM
1. Scan the Prefix expression right to left.
1.push
all operands into stack until an operator is encountered.
2. when an
operator op is encountered.
2.1 pop the last two operands say Y and X off the stack and apply
the operation Y op X- order of
operands is important
2.2 push
the result of the operation back on the stack to be used as an operand later.
2. When end
of expression is reached one operand remains on the stack - it is the final
result. Pop the value from stack.
PROGRAM
#include
#include
#include
#include
int arr[100];
int top=-1;
void push(int c)
{
top++;
arr[top]=c;
}
int pop()
{
int c;
c=arr[top];
top--;
return c;
}
int main()
{
char prefix[100];
int i=0;
int op1,op2,res,val;
printf("Enter the prefix
expression:");
scanf("%s",prefix);
for(i=strlen(prefix)-1;i>=0;i--)
{
switch(prefix[i])
{
case'+':op1=pop();
op2=pop();
res=op1+op2;
push(res);
break;
case'-':op1=pop();
op2=pop();
res=op1-op2;
push(res);
break;
case'*':op1=pop();
op2=pop();
res=op1*op2;
push(res);
break;
case'/':op1=pop();
op2=pop();
res=op1/op2;
push(res);
break;
default:printf("Enter the value of %c:",prefix[i]);
scanf("%d",&val);
push(val);
break;
}
}
printf(" The Given prefix expression is: %s\n",prefix);
printf("Result after evaluation is :%d",arr[top]);
getch();
}
POSTFIX EVALUATION
ALGORITHM
PROGRAM
1. Scan the Postfix expression left to right.
1.push
all operands into stack until an operator is encountered
2. when an
operator op is encountered.
2.1 pop the last two operands say Y and X off the stack and apply
the operation X op Y- order of
operands is important
2.2 push
the result of the operation back on the stack to be used as an operand later.
2. When end
of expression is reached one operand remains on the stack - it is the final
result. Pop the value from stack.
PROGRAM
#include
#include
#include
#include
int arr[100];
int top=-1;
void push(int c)
{
top++;
arr[top]=c;
}
int pop()
{
if(top==-1)
{
return -1;
}
else
{
int c;
c=arr[top];
top--;
return (c);
}
}
int main()
{
char postfix[100];
int i,op1,op2,res,val;
printf("Enter the
postfix expression:");
scanf("%s",postfix);
for(i=0;i
{
switch(postfix[i])
{
case'+':op1=pop();
op2=pop();
res=op2+op1;
push(res);
break;
case'-':op1=pop();
op2=pop();
res=op2-op1;
push(res);
break;
case'*':op1=pop();
op2=pop();
res=op2*op1;
push(res);
break;
case'/':op1=pop();
op2=pop();
res=op2/op1;
push(res);
break;
default:printf("Enter the value of %c:",postfix[i]);
scanf("%d",&val);
push(val);
break;
}
}
printf(" The Given postfix expression is: %s\n",postfix);
printf("Result after evaluation is :%d",arr[top]);
getch();
}
Infix to postfix Conversion
ALGORITHM
ALGORITHM
1. Scan the
Infix expression left to right
2. If the
character x is an operand
1. Output
the character into the Postfix Expression array
3.
If the character x is a left or right
parenthesis
1. If the
character is “(“
1. Push it
into the stack
2. if the
character is “)”
2. Repeatedly
pop and output all the operators/characters until “(“ is popped from the stack.
4.
If the character x is a is a regular operator
1: Check
the character y currently at the top of the stack.
2: If Stack is empty or y=‘(‘ or y is an operator
of lower precedence than x, then push x into stack.
5: If y is
an operator of higher or equal precedence than x, then pop and output y into
postfix array repeat step 3 until priority of y is lower to x
then push x into the stack.
6. When all
characters in infix expression are processed repeatedly pop the character(s)
from the stack and output them until the stack is empty.
PROGRAM
#include
#include
#include
char arr[100];
int top;
void push(char c)
{
top++;
arr[top]=c;
}
char pop()
{
if(top==-1)
{
return -1;
}
else
{
char c;
c=arr[top];
top--;
return c;
}
}
int prec(char c)
{
if(c=='+'||c=='-')
{
return 1;
}
else if(c=='*'||c=='/')
{
return 2;
}
else
{
return -1;
}
}
int main()
{
top=-1;
char postfix[100],infix[100];
char c;
int i;
int k=0;
printf("Enter the infix
expression:");
scanf("%s",infix);
for(i=0;i
{
switch(infix[i])
{
case '(':
push(infix[i]);
break;
case')':
while((c=pop())!='(')
{
postfix[k++]=c;
}
break;
case'+':
case'-':
case'*':
case'/':
if(top==-1)
{
push(infix[i]);
}
else
{
while(prec(arr[top])>=prec(infix[i]))
{
postfix[k++]=pop();
}
push(infix[i]);
}
break;
default:postfix[k++]=infix[i];
break;
}
}
while(top!=-1)
{
postfix[k++]=pop();
}
postfix[k]='\0';
printf(" The corresponding postfix expression is: ");
printf("%s",postfix);
getch();
}
Posts
