Past VU Paper

--
You received this message because you are subscribed to the Google
Groups "vupindi" group.
To post to this group, send email to vupindi@googlegroups.com
To unsubscribe from this group, send email to
vupindi+unsubscribe@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/vupindi?hl=en

[discussion_vu] Sahih_Bukhari 3: 463,464,476,482

 
 
 
     
 
Phr Yaad-e-Khuda Se Ghafil Iss Duniya Ki Hawass Mein
 
Iss Mukhtasir Si Zindgi Ka Ik Aor Din Beet Gaya...!!!
 
                 <<<<<<<<<< sAd pAncHi >>>>>>>>>>

--
You received this message because you are subscribed to the Google Groups "Virtual University of Pakistan" group.
To post to this group, send email to discussion_vu@googlegroups.com.
To unsubscribe from this group, send email to discussion_vu+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/discussion_vu?hl=en.

..::VU-Pink::.. ````.....JUMMA k Din ...Mst C.....````

`JUMMA K DIN`

Jumma k Din Asr k bad se le kr MAghrib tak Qaboolyate Dus ka waqt hay ..

...So dont waste ur precious time....

"""Don't worry if people hate you because there are many others who love and care you in the earth. But be worried if ALLAH hates you because there is no other who loves and cares you in akhirat."""

"...SUBHANALLAHI WABI HAMDIHI...SUBHANALLAH IL AZEEM..."

~*~$H!N!NG $T@R~*~

--
...:::Group Rules:::...
http://groups.google.com.pk/group/vu-pink/web/group-rules
^^^^^^
You received this message because you are subscribed to the Google
Groups "vu pink" group.
To post to this group, send email to vu-pink@googlegroups.com
To unsubscribe from this group, send email to
vu-pink+unsubscribe@googlegroups.com
For more options, visit this group at
http://groups.google.com.pk/group/vu-pink?hl=en

[discussion_vu] ````.....JUMMA k Din ...Mst C.....````

`JUMMA K DIN`

Jumma k Din Asr k bad se le kr MAghrib tak Qaboolyate Dus ka waqt hay ..

...So dont waste ur precious time....

"""Don't worry if people hate you because there are many others who love and care you in the earth. But be worried if ALLAH hates you because there is no other who loves and cares you in akhirat."""

"...SUBHANALLAHI WABI HAMDIHI...SUBHANALLAH IL AZEEM..."

~*~$H!N!NG $T@R~*~

..::VU-Pink::.. ```` Daily Quran and Hadith 18 Nov 2011````

IN THE NAME OF "ALLAH"
Assalamu'alaikum Wa Rahmatullah e Wa Barakatuhu,

Note : If Quran and Hadith is not viewable CLICK HERE to Read Today Quran and Hadith.

Visit
www.quranurdu.com
www.tafheemonline.com
www.quranenglish.com
www.daroos.com
www.islamicrishta.com

"""Don't worry if people hate you because there are many others who love and care you in the earth. But be worried if ALLAH hates you because there is no other who loves and cares you in akhirat."""

*~*$H!N!NG $T@R*~*

SUHANALLAH HI WABIHAMDIHI SUBHANALLAH HIL AZEEM

[discussion_vu] CS301 Second Assignment Solution

#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<string>

#define MAX_SIZE 20

using namespace std;
template<class T>
class Stack{
private:
T item[MAX_SIZE];
int top;
public:
Stack(){
top = -1;
}
void push(T data){
if(!this->is_full())
item[++top] = data;
else{
cout<<"Stack Error"<<endl;
exit(10);
}
}
T pop(){
if(!this->is_empty())
return item[top--];
else{
cout<<"Stack is Empty"<<endl;
exit(11);
}
}

int size(){
return top+1;
}

bool is_empty(){
if(top==-1)
return true;
else
return false;
}

bool is_full(){
if(top==MAX_SIZE-1)
return true;
else
return false;
}

void display(){
for(int i=0; i<this->size(); i++){
cout<<item[i]<<" ";
}
cout<<endl;
}
T return_top(){
return item[top];
}
};

class Convert{
private:
bool num_flag;
bool tow_digit_flag;
public:
Convert();
string return_with_bracket(string infix);
void to_Postfix(string infix,char postfix[]);
bool prcd(char op1, char op2);
int isOperand(char op);
int isOperator(char op);
bool return_flag(){
return num_flag;
}
};

Convert::Convert(){
this->num_flag = false;
this->tow_digit_flag = false;
}
string Convert::return_with_bracket(string infix){
return("(" + infix + ")");
}

bool Convert::prcd(char op1, char op2){
if((op1=='+' || op1=='-' || op1=='*' || op1=='/') && op2=='(' )
return true;
if(op1=='+' && op2=='+')
return true;
if(op1=='-' && op2=='-')
return false;
if(op1=='-' && op2=='+')
return false;
if(op1=='+' && op2=='-')
return false;
if(op1=='/' && op2=='/')
return false;
if(op1=='/' && (op2=='-' || op2=='+'))
return true;
if(op1=='*' && (op2=='+' || op2=='-'))
return true;
if((op1 == '-' || op1 == '+') && (op2 =='*' || op2 == '/'))
return false;
if((op1=='$' || op1 == '+') && (op2 =='*' || op2 == '/' || op2=='-'))
return true;
if((op1 == '-' || op1 == '+' || op1 =='*' || op1 == '/')&& op2=='^')
return false;
if(op1 == '^' && ( op2 == '+' || op2 =='*' || op2 == '/' || op2=='-'))
return false;
}

int Convert::isOperand(char op){
return(op>= '0' && op <= '9');
}

int Convert::isOperator(char op){
return(op=='+' || op=='-' || op == '/' || op=='*' || op=='^');
}

void Convert::to_Postfix(string infix, char postfix[]){
int position, outpos=0;
char c;
int count = 0;
char temp;
char stacktop ;
Stack<char> stack;
for(position = 0; (c = infix[position])!='\0'; position++){
if(this->isOperand(c)){
postfix[outpos++] = c;
this->num_flag = true;
count++;
if(count>=2){
this->tow_digit_flag = true;
}
}else if(this->isOperator(c)){
count = 0;
if(isOperator(infix[position]) && isOperator(infix[position+1])){
cout<<"\aMissing argument in between "<<infix[position]<<" and "<<infix[position+1]
<<" in column "<< position+1<<endl;
exit(9);
}
if(this->prcd(c, stacktop)){
stacktop=stack.return_top();
stack.push(c);
stacktop = c;
}else{
while(true){
temp = stack.pop();
postfix[outpos++] =temp;
stacktop = stack.return_top();
if(prcd(c, stacktop) || stacktop=='(')
break;
}
stack.push(c);
stacktop = stack.return_top();
}
}
else if(c=='('){
count = 0;
stack.push(c);
stacktop = stack.return_top();
}else if(c==')'){
count = 0;
while(1){
if(stack.size()==0){
cout<<"Warning!! Number of ')' is greater than '('" <<endl;
exit(2);
}
temp = stack.pop();
if(temp!='('){
postfix[outpos++] = temp;
}else{
break;
}
}
stacktop =stack.return_top();
}
else{
cout<<"Invalid input";
exit(3);
}
if(infix[position]==')' && infix[position+1]=='('){
stack.push('*');
stacktop = stack.return_top();
}
}
if(stack.size()!=0){
cout<<"Warning!!Number of '(' is greater than ')'"<<endl;
// exit(6);
}
if(!this->return_flag()){
cout<<"You must Enter Numeric value for calculation"<<endl;
cout<<"This program cannot perform operations on variables";
exit(5);
}
if(this->tow_digit_flag){
cout<<"Sory! Althoug u may have entered right string"<<endl;
cout<<"this program is only for single digit operation"<<endl;
exit(8);
}
postfix[outpos] = '\0';
}

class Evaluate{
public:
double eval(char expr[], Convert &);
double oper(int symb, double op1, double op2);
};
double Evaluate::oper(int symb, double op1, double op2){
switch(symb){
case '+': return (op1 + op2);
case '-': return (op1 - op2);
case '*': return (op1 * op2);
case '/': return (op1 / op2);
case '^': return (pow(op1, op2));
}
}
double Evaluate::eval(char expr[],Convert &convert){
int c, position;
char temp1;
int count = 0;
double opnd1, opnd2, value;
Stack<double> stack;
for(position = 0; (c = expr[position])!='\0'; position++){
if(convert.isOperand(c)){
temp1 = double(c-'0');
stack.push(temp1);
}else{
opnd2 = stack.pop();
if(stack.size()==0){
cout<<"This program cannot process unary operation";
exit(1);
}
opnd1 = stack.pop();
value = oper(c, opnd1, opnd2);
stack.push(value);
}
}
if(stack.size()>=2){
cout<<"Sory! this program cannot calculate this"<<endl;
cout<<"Enter +, *, /, - or ^ between bracket"<<endl;
exit(4);
}

return (stack.pop());
}
int main(){
Convert convert;
Evaluate evaluate;
string bracketted_infix;
char infix[50], postfix[50];
char choice;
while(1){
cout<<"Enter operation: ";
cin>>infix;
cout<<endl;
cout<<"Entered operation: "<<infix<<endl;
bracketted_infix = convert.return_with_bracket(infix);
convert.to_Postfix(bracketted_infix, postfix);
cout<<"Equivalent Postfix operation: "<<postfix<<endl;
cout<<"RESULT: ";
cout<<evaluate.eval(postfix, convert);
cout<<"\nCalculate another operation?(y/n) ";
cin>>choice;
cout<<endl;
if(choice=='n')
break;
}
return 0;
}

 
 
 
     
 
Phr Yaad-e-Khuda Se Ghafil Iss Duniya Ki Hawass Mein
 
Iss Mukhtasir Si Zindgi Ka Ik Aor Din Beet Gaya...!!!
 
                 <<<<<<<<<< sAd pAncHi >>>>>>>>>>

[~>VU-P!nD!<~] Can you afford to lose 300,000 potential customers per year ?

What if you could drive 1000s of
customers to your website from the
major search-engines that are exclusively
looking for your product/offer for free ?

What about an instant number one
ranking for your keywords, for free ?!

We have developed a program that
will automatically do this for you.

Click here to visit our website

Click here to unsubscribe

Subscribe / UnSubscribe to QuranUrdu.com Group Enter your Email Address for Subscribe or Unsubscribe

Thursday, 17 November 2011

Total Pageviews