Virtual Study Solutions: CS301 Assignment Solution Fall 2016

CS301 Assignment no 3 Solution Fall 2016

<div dir="ltr" style="text-align: left;" trbidi="on">
<h3 style="text-align: left;">
CS301 Assignment no 3 Fall 2016</h3>
Here we have CS301- Data Structures Assignment  No. 3 Solution and discussion, Fall 2016, Total Marks: 15, Due Date: 20/01/2017.<div>
 </div>
<div>
You Can Also Download CS301 Solved Final Term Papers, CS301 Short Notes, CS301 Assignment Solutions, Lecture Wise Questions Answers Files, Solved MCQs, Solved Quiz ,CS301 Solved Final Term Subjective Papers ,CS301 Solved Final Term Objective Papers from Virtual Study Solutions For Preparation of Final Term Papers.</div>
<div>
 </div>
Also Read: <a href="http://virtualstudysolutions.blogspot.com/2017/01/cs302-short-notes-for-final-term.html">CS302 Short Notes for Final term Preparation</a> <div>
<h3 style="text-align: left;">
CS301 Assignment  Instructions</h3>
Please read the following instructions carefully before solving & submitting assignment: It should be clear that your assignment will not get any credit (zero marks) if: <ul style="text-align: left;">
<li>The assignment is submitted after due date.</li>
<li>The submitted assignment is other than Ms Word 2003 file.</li>
<li>The submitted assignment does NOT open or file is corrupted.</li>
<li>The assignment is copied (from other student or ditto copy from handouts or internet).</li>
</ul>
Also Read: <a href="http://virtualstudysolutions.blogspot.com/2015/07/write-allah-using-c-program.html">Write ALLAH Using C++ Program</a><h3 style="text-align: left;">
CS301 Assignment Uploading instructions</h3>
For clarity and simplicity, You are required to Upload/Submit only Ms Word file (.doc or docx format). Note: Use ONLY Microsoft Word<h3 style="text-align: left;">
CS301 Assignment Objective</h3>
The objective of this assignment is, To make you familiar with concept of Huffman Encoding. For any query about the assignment, contact at <a href="mailto:cs301@vu.edu.pk" rel="nofollow" target="_blank">cs301@vu.edu.pk</a><h3 style="text-align: left;">
CS301 Assignment Statement:</h3>
Question 1: [Marks 15] While transmission through network, it is always important to keep data transmission rate high so data over the network can be increased using two ways; either increases the bandwidth of communication channel or decrease the size of data (compression) to increase the bandwidth utilization. Lossless data compression algorithms are important in network and Huffman encoding scheme can be used for lossless data compression. Suppose the following string is being transmitted over the network: “Data Compression in data structure” We cannot increase the bandwidth of communication channel. Instead we have to compress the given string. Use Huffman encoding scheme to encode the given string. To encode the string: Build a table containing the following information about the string. Build Huffman encoding tree. The tree will be built with the help of characters and their respective frequencies which you will find in step 1. Calculate how much bits are consumed by original and compressed string. What percentage of bits is saved by Huffman encoding scheme? Mention step by step construction of Huffman Encoding tree from the above table.</div>
<div>
 </div>
<div>
Also Read: <a href="http://virtualstudysolutions.blogspot.com/2013/08/how-to-take-quiz-on-lms.html">HOW TO TAKE QUIZ ON LMS</a><h4 style="text-align: left;">
CS301 Assignment no 3 Solution</h4>
</div>
<ul style="text-align: left;">
<li>Please Wait.</li>
<li>Assignment Solution of CS301 will be updated Soon.</li>
</ul>
<div>
If You want to receive the Solution directly in your inbox. Please Subscribe below or like us on Facebook.</div>
</div>

CS301 Assignment no 3 Solution Fall 2016

CS301 Assignment no 3 Fall 2016 Here we have CS301- Data Structures Assignment No. 3 Solution and discussion, Fall 2016, Total Marks: 15...

CS301 Assignment No. 2 Solution Fall 2016

<div dir="ltr" style="text-align: left;" trbidi="on">
<div>
<h3 style="text-align: left;">
CS301 Assignment No. 2 Fall2016</h3>
CS301 - Data Structures Assignment No. 2 Solution Fall 2016 Due Date: Nov 29, 2016</div>
CS301 Assignment No. 2 Semester: Fall 2016 CS301 – Data Structures CS301 Assignment Total Marks: 20 CS301 Assignment Due Date: Tuesday, November 29, 2016 
<div>
 </div>
<div>
Also Read: <a href="http://virtualstudysolutions.blogspot.com/2016/11/cs502-assignment-no-02-solution-fall-2016.html">CS502 Assignment No. 02 Solution Fall 2016</a> 
<h3 style="text-align: left;">
CS301 Assignment Instructions</h3>
Please read the following instructions carefully before submitting assignment: It should be clear that your assignment will not get any credit if: 
<ul style="text-align: left;">
<li>Assignment is submitted after due date.</li>
<li>Submitted assignment does not open or file is corrupt.</li>
<li>Assignment is copied (From internet/ to from students).</li>
</ul>

For clarity and simplicity, You are required to Upload/Submit only ONE .CPP file. Other format will not be accepted and will be graded zero marks. 
<blockquote class="tr_bq">
Note: Use ONLY Dev-C++ IDE for writing and executing your code.</blockquote>
 
Also Read : <a href="http://virtualstudysolutions.blogspot.com/2016/11/free-microsoft-office-specialist-mos-for-VU.html">Free Microsoft Office Specialist (MOS) for Virtual University</a></div>
<div>
<h3 style="text-align: left;">
CS301 Assignment Objectives:</h3>
The purpose of this assignment is to make you familiar with following topics: 
<ul style="text-align: left;">
<li>Tree</li>
<li>Binary Tree</li>
<li>Terminologies of a Binary Tree</li>
<li>Level</li>
<li>Complete Binary Tree</li>
<li>Level of a Complete Binary Tree</li>
</ul>

Also Read: <a href="http://virtualstudysolutions.blogspot.com/2016/11/pm-laptop-scheme-for-virtual-university-students.html">PM Laptop Scheme for Virtual University Students 2016-17</a> 
<div>
<h3 style="text-align: left;">
CS301 Assignment Submission Instructions</h3>
You have to submit only .cpp on the Assignments interface of CS301 at VULMS. Assignment submitted in any other format will not be accepted and will be graded zero marks. 
<h3 style="text-align: left;">
CS301 Assignment No. 2</h3>
<div>
Marks= 20</div>
<h3 style="text-align: left;">
CS301 Assignment Question 1: </h3>
Write down C++ code to create a complete binary Tree in which user can add any number of node/elements (Numeric). After Creating a complete binary tree , You need to calculate the product of the 2nd lowest level and find the smallest number in the binary tree as given in the example: 
 <a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgWo2A2_kKdDDpbsUiYz21COt7_IUIH2fUXLmoeJwMlvtOQpvG7dQEh3tXGwHedjFyX9NoliOvCBxCIX7lCr87ibYRmvYlvHJelJAbUI377YLBR1k9lVG0-ftBfzasfgysaGNuXKhIpg1A/s1600/CS301+Assignment+no+2.JPG" imageanchor="1" style="margin-left: 1em; margin-right: 1em; text-align: center;"><img alt="CS301 Assignment No. 2 Solution Fall 2016" border="0" height="490" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgWo2A2_kKdDDpbsUiYz21COt7_IUIH2fUXLmoeJwMlvtOQpvG7dQEh3tXGwHedjFyX9NoliOvCBxCIX7lCr87ibYRmvYlvHJelJAbUI377YLBR1k9lVG0-ftBfzasfgysaGNuXKhIpg1A/s640/CS301+Assignment+no+2.JPG" title="CS301 Assignment No. 2 Solution Fall 2016" width="640" /></a> Product of Elements in 2nd last level (N-1)= 20 Smallest number in Binary Tree = 2 Note: N levels mean any number of levels. 
<h3 style="text-align: left;">
CS301 Assignment Deadline:</h3>
Your assignment must be uploaded on or before Tuesday, November 29, 2016. We shall not accept your solution through email after the due date.</div>
<div>
 </div>
<div>
Also Read: <a href="http://virtualstudysolutions.blogspot.com/2015/01/financial-accounting-mgt101-solved.html">financial accounting MGT101 Solved Papers</a>
 
 
<dt style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; font-size: 16px; margin: 0px 0px 3px; outline: 0px; padding: 0px; vertical-align: baseline;"> </dt>
 
<h4 style="text-align: left;">
CS301 Assignment No. 2 Solution Fall 2016</h4>
<dt style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; margin: 0px 0px 3px; outline: 0px; padding: 0px; vertical-align: baseline;"><div style="border: 0px; margin-bottom: 5px; margin-top: 5px; outline: 0px; padding: 0px; vertical-align: baseline;">
Here You can download CS301 Assignment No. 2 Solution & Discussion for Fall 2016.</div>
<h4 style="text-align: left;">
CS301 Assignment No. 2 Solution</h4>
<div style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; font-size: 16px; margin-bottom: 5px; margin-top: 5px; outline: 0px; padding: 0px; vertical-align: baseline;">
#include <stdio.h> 
#include <iostream> 
using namespace std; 
struct Node 
{</div>
<div style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; font-size: 16px; margin-bottom: 5px; margin-top: 5px; outline: 0px; padding: 0px; vertical-align: baseline;">
int val; 
struct Node *left, *right; 
}; 
Node *newNode(int data) 
{ 
Node *temp = new Node; 
temp->val = data; 
temp->left = temp->right = NULL; 
return temp; 
} 
// A utility function to find deepest leaf node. 
// lvl: level of current node. 
// maxlvl: pointer to the deepest left leaf node found so far 
// isLeft: A bool indicate that this node is left child of its parent 
// resPtr: Pointer to the result 
void deepestLeftLeafUtil(Node *root, int lvl, int *maxlvl, 
bool isLeft, Node **resPtr) 
{ 
// Base case 
if (root == NULL) 
return; 
// Update result if this node is left leaf and its level is more 
// than the maxl level of the current result 
if (isLeft && !root->left && !root->right && lvl > *maxlvl) 
{ 
*resPtr = root; 
*maxlvl = lvl; 
return; 
} 
// Recur for left and right subtrees 
deepestLeftLeafUtil(root->left, lvl+1, maxlvl, true, resPtr); 
deepestLeftLeafUtil(root->right, lvl+1, maxlvl, false, resPtr); 
} 
// A wrapper over deepestLeftLeafUtil(). 
Node* deepestLeftLeaf(Node *root) 
{ 
int maxlevel = 0; 
Node *result = NULL; 
deepestLeftLeafUtil(root, 0, &maxlevel, false, &result); 
return result; 
} 
Node* insert(Node* node, int val) 
{ 
/* 1. If the tree is empty, return a new, 
single node */ 
if (node == NULL) 
return(newNode(val)); 
else 
{ 
/* 2. Otherwise, recur down the tree */ 
if (val <= node->val) 
node->left = insert(node->left, val); 
else 
node->right = insert(node->right, val);</div>
<div style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; font-size: 16px; margin-bottom: 5px; margin-top: 5px; outline: 0px; padding: 0px; vertical-align: baseline;">
/* return the (unchanged) node pointer */ 
return node; 
} 
} 
int minValue(Node* node) { 
Node* current = node;</div>
<div style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; font-size: 16px; margin-bottom: 5px; margin-top: 5px; outline: 0px; padding: 0px; vertical-align: baseline;">
/* loop down to find the leftmost leaf */ 
while (current->left != NULL) { 
current = current->left; 
} 
return(current->val); 
}</div>
<div style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; font-size: 16px; margin-bottom: 5px; margin-top: 5px; outline: 0px; padding: 0px; vertical-align: baseline;">
// Driver program to test above function 
int main() 
{ 
int a, b, c, d, e, f, g, h, i, j; 
cout"Enter 10 Numbers in Tree:\n"; 
cin>>a>>b>>c>>d>>e>>f>>g>>h>>i>>j; 
Node* root = newNode(a); 
root->left = newNode(b); 
root->right = newNode(c); 
root->left->left = newNode(d); 
root->right->left = newNode(e); 
root->right->right = newNode(f); 
root->right->left->right = newNode(g); 
root->right->right->right = newNode(h); 
root->right->left->right->left = newNode(i); 
root->right->right->right->right = newNode(j); 
root = insert(root, a); 
insert(root, b); 
insert(root, c); 
insert(root, d); 
insert(root, e); 
insert(root, f); 
insert(root, g); 
insert(root, h); 
insert(root, i); 
insert(root, j); 
Node *result = deepestLeftLeaf(root); 
if (result){ 
cout "Product of 2nd lowest level of a binary tree is: " result->val * result->val; 
}</div>
<div style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; font-size: 16px; margin-bottom: 5px; margin-top: 5px; outline: 0px; padding: 0px; vertical-align: baseline;">
else{ 
cout "There is no left leaf in the given tree"; 
}</div>
<div style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; font-size: 16px; margin-bottom: 5px; margin-top: 5px; outline: 0px; padding: 0px; vertical-align: baseline;">
printf("\nMinimum value in BST is %d", minValue(root)); 
return 0; 
}</div>
</dt>
 
<h4 style="text-align: left;">
Download CS301 Solution file:</h4>
 
<dt style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; font-size: 16px; margin: 0px 0px 3px; outline: 0px; padding: 0px; vertical-align: baseline;"><a href="http://vustudents.ning.com/group/cs301datastructures/forum/attachment/download?id=3783342%3AUploadedFile%3A5682485" rel="nofollow" style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; font-size: 1em; margin: 0px; outline: 0px; padding: 0px; text-decoration: none; vertical-align: baseline;" target="_blank">CS301 Solution 2 Fall 2016- By_irfan.cpp</a>, 3 KB9</dt>
</div>
</div>
</div>

CS301 Assignment No. 2 Solution Fall 2016

CS301 Assignment No. 2 Fall2016 CS301 - Data Structures Assignment No. 2 Solution Fall 2016 Due Date: Nov 29, 2016 CS301 Assignment No....

CS301 Assignment no 1 Solution Fall 2016

<div dir="ltr" style="text-align: left;" trbidi="on">
<h3 style="text-align: left;">
CS301 Assignment no 1</h3>
Here You can easily download CS301 Assignment Solution - Data Structures. CS301 Assignment No. 1 Semester: Fall 2016. CS301 Data Structures .CS301 Assignment Total Marks: 20. CS301 Assignment Due Date: November 16, 2016. 
<div>
<h3 style="text-align: left;">
CS301 Assignment Instructions</h3>
<div>
Please read the following instructions carefully before submitting assignment: It should be clear that your assignment will not get any credit if: 
<ul style="text-align: left;">
<li>Assignment is submitted after due date.</li>
<li>Submitted assignment does not open or file is corrupt.</li>
<li>Assignment is copied (From internet/ to from students).</li>
</ul>
You May also Read: <a href="http://virtualstudysolutions.blogspot.com/2016/11/cs401-mid-term-past-papers-notes.html">CS401 Mid Term Past Papers / Notes</a> 
<ul style="text-align: left;">
</ul>


 
<blockquote class="tr_bq">
Note: For clarity and simplicity, You are required to Upload/Submit only ONE .CPP file if needed. Keep all your files (word and .cpp) in a folder and make its zipped file to upload on LMS. Use ONLY Dev-C++ IDE for writing and executing your code.</blockquote>
You May also Read: <a href="http://virtualstudysolutions.blogspot.com/2016/11/cs501-assignment-no-01-solution-fall-2016.html">CS501 Assignment no. 01 Solution Fall 2016</a></div>
<div>
<h3 style="text-align: left;">
CS301 Assignment Objectives:</h3>
The purpose of this assignment is to make you familiar with following topics: 
<ul style="text-align: left;">
<li>Singly Linked List, Double Linked List and Circular Linked List</li>
<li>Infix to Postfix</li>
<li>C++ Templates</li>
<li>Implementation of Stack</li>
<li>Function Call Stack</li>
</ul>


 
<div>
You May also Read: <a href="http://virtualstudysolutions.blogspot.com/2016/11/cs402-assignment-no-01-solution-fall.html">CS402 Assignment No 01 Solution Fall 2016</a></div>

</div>
<div>
<h3 style="text-align: left;">
CS301 Assignment Submission Instructions</h3>
You have to submit only word file on the Assignments interface of CS301 at VULMS. Assignment submitted in any other format will not be accepted and will be graded zero marks.</div>
<div>
 </div>
<div>
You May also Read: <a href="http://virtualstudysolutions.blogspot.com/2016/11/cs201-assignment-no-01-Solution.html">CS201 Assignment No 01 Solution / Discussion Fall 2016</a> 
<h3 style="text-align: left;">
CS301 Assignment no. 1 Fall 2016</h3>
<div>
You May also Read: <a href="http://virtualstudysolutions.blogspot.com/2016/11/eng201-assignment-no-1-solution-fall.html">ENG201 Assignment no. 1 Solution Fall 2016</a></div>
<h3 style="text-align: left;">
CS301 Assignment Question 1:</h3>
</div>
<div>
marks: 10</div>
<div>
<table align="center" cellpadding="0" cellspacing="0" class="tr-caption-container" style="margin-left: auto; margin-right: auto; text-align: center;"><tbody>
<tr><td style="text-align: center;"><img alt="CS301 Assignment no 1 Solution Fall 2016" src="http://api.ning.com/files/AY*SjrncyfqPDO4YF6-MoaXIWPtC6O8qB0D0SXraXJ*7BqSEe4w-WRyHcukj0KV3lOUZu73S*nLWmLD2uOU9SFewgP2TUoIj/123.jpg" style="margin-left: auto; margin-right: auto;" title="CS301 Assignment no 1 Solution Fall 2016" /></td></tr>
<tr><td class="tr-caption" style="text-align: center;">CS301 Assignment no 1 Question no 1 Fall 2016</td></tr>
</tbody></table>
 Given is a code of abstract class declaration for a list (ADT) in Figure 1(a). </div>
<div>
Figure 1(a) 
(a) Assume a list has the following configuration: < | 2, 23, 15, 5, 9 >Write only Method calls (Name of function) using the List ADT of Figure 1(a) to delete the element with value 15.</div>
<div>
e.g To move the pointer to end of the list We will use function movetoEnd( ). No need to write function implementation. Note: Here the ‘|’ symbol represents ‘fence’ like pointer that indicates the current position of pointer in list. (b)  Show the list configuration resulting from each series of list operations using the List ADT of Figure 1(a) </div>
<div>
Assume that list L1 is empty at the beginning of each series. Show where the fence is in the list. L1.append(10); L1.append(20); L1.append(15); 
<h3 style="text-align: left;">
CS301 Assignment Question 2: </h3>
</div>
<div>
marks: 10 Given is an infix expression: A + B * C / (D-B) Write a complete program in C++ to convert the above infix expression into postfix notation. 
<h3 style="text-align: left;">
CS301 Assignment Deadline:</h3>
Your CS301 Assignment must be uploaded on or before November 16, 2016. We shall not accept your solution through email after the due date.</div>
<h3 style="text-align: center;">
CS301 Assignment no 1 Solution Fall 2016</h3>
<div style="text-align: left;">
<h4 style="text-align: left;">
CS301 Solution Correct</h4>
<dd style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; font-size: 16px; margin: 0px 0px 3px; outline: 0px; padding: 0px; vertical-align: baseline;"><ul class="attachments" style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; list-style: none; margin: 5px 0px; outline: 0px; padding: 0px; vertical-align: baseline;">
<li style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; font-size: 1em; list-style: none; margin: 0.3em 0px; outline: 0px; padding: 0.1em 0px; vertical-align: baseline;"><a href="http://vustudents.ning.com/group/cs301datastructures/forum/attachment/download?id=3783342%3AUploadedFile%3A5665154" rel="nofollow" style="background-attachment: initial; background-clip: initial; background-image: initial; background-origin: initial; background-position: initial; background-repeat: initial; background-size: initial; border: 0px; margin: 0px; outline: 0px; padding: 0px; text-decoration: none; vertical-align: baseline;" target="_blank">CS301_Assignment_no_1_Solution.zip</a>, 14 KB</li>
</ul>
</dd></div>
<h4 style="text-align: left;">
CS301 Assignment Question no. 1 Solution:</h4>
#include using namespace std; struct node { int data; struct node *next; }; class stack { struct node *top; public: stack() { top=NULL; } void push(); void pop(); void show(); }; void stack::push() { int value; struct node *ptr; cout"Enter Item number to insert : "; cin>>value; ptr=new node; ptr->data=value; ptr->next=NULL; if(top!=NULL) ptr->next=top; top=ptr; cout"\n New item is inserted to the stack!!!"; } void stack::pop() { struct node *temp; if(top==NULL) { cout"\n The stack is empty!!!"; } temp=top; top=top->next; cout"\n Remove Item \n ============ \n Item number " temp->data; cout" is removed"; delete temp; } void stack::show() { struct node *ptr1=top; cout"\n Pruchased Items are :\n"; while(ptr1!=NULL) { coutptr1->data" ->"; ptr1=ptr1->next; } cout"NULLn"; } int main() { stack s; int choice; while(1) { cout"\n-------------- *Zohaib* -----------------\n------------- khan--------------------"; cout"\n------------- bc130201551---------------\n------------- Student Of BsCs----------------"; cout"\n ------------ Purchased Module -------------------------"; cout"\n MENU\n ====\n1:Insert Item\n2:Remove Item\n3:DISPLAY Purchased Item \n4:EXIT"; cout"\n Enter your choice(1-4): "; cin>>choice; switch(choice) { case 1: s.push(); break; case 2: s.pop(); break; case 3: s.show(); break; case 4: return 0; break; default: cout"Please enter correct choice(1-4)!!"; break; } } return 0; }<h4 style="text-align: left;">
CS301 Assignment Question no. 2 Solution:</h4>
#include<iostream> #include<stack>//import Stack STL #include<string>//import String STL #include<conio .h=""> using namespace std; string infixToPostfix(string expr); //Function declaration int precendence(char arg); bool isoperand(char arg); bool isoperator(char arg); int operatorweight(char arg); bool highprecendence(char a, char b); int main() { string exp;//Variable to get input expression cout"Enter the infix expression:"; getline(cin,exp); cout"Output Postfix Expression:"infixToPostfix(exp); getch(); } string infixToPostfix(string expr)//Function to perform all conversion operation { stack<char> stk;//Declaring a stack for conversion purpose string postfix = "";//Initialize the output string as empty; for(int i = 0;i < expr.length(); i++)//Scan the infix string one by one if(expr[i] == '(') { stk.push(expr[i]); } else if(expr[i] == ')') { while(stk.top() != '(') { postfix = postfix + stk.top(); stk.pop(); } stk.pop(); } else if(isoperand(expr[i])) { postfix += expr[i]; } else if(isoperator(expr[i])) { while(!stk.empty()&& !highprecendence(expr[i],stk.top())) { postfix+= stk.top(); stk.pop(); } stk.push(expr[i]); } while(!stk.empty()) { postfix+= stk.top(); stk.pop(); } return postfix; } bool highprecendence(char a, char b)//Check for operator precendence { int weighta = operatorweight(a); int weightb = operatorweight(b); if(weighta >= weightb) return 1; return 0; } bool isoperator(char arg)//Check weather the character is operator { if(arg == '*' || arg == '/' || arg == '+' || arg == '-') return(1); else return(0); } bool isoperand(char arg)//Check weather the character is operand { if(arg >= '0' && arg <= '9') return 1; if(arg >= 'a' && arg <= 'z') return 1; if(arg >= 'A' && arg <= 'Z') return 1; return 0; } int operatorweight(char arg)//Add weight to the operator { int weight = 0; switch(arg) { case '*': case '/': weight = 2; break; case '+': case '-': weight = 1; break; } return(weight); }</char></conio></string></stack></iostream> 
<h4 style="text-align: left;">
Download Links for CS301 Assignment Files:</h4>
<a href="http://vustudents.ning.com/group/cs301datastructures/forum/attachment/download?id=3783342%3AUploadedFile%3A5662287" rel="nofollow" target="_blank">Untitled4.cpp</a>, 2 KB <a href="http://vustudents.ning.com/group/cs301datastructures/forum/attachment/download?id=3783342%3AUploadedFile%3A5662288" rel="nofollow" target="_blank">Untitled4.exe</a>, 1.9 MB</div>
</div>

CS301 Assignment no 1 Solution Fall 2016

CS301 Assignment no 1 Here You can easily download CS301 Assignment Solution - Data Structures. CS301 Assignment No. 1 Semester: Fal...

Virtual Study Solutions

Adsetra Ads

CS301 Assignment no 3 Solution Fall 2016

CS301 Assignment No. 2 Solution Fall 2016

CS301 Assignment no 1 Solution Fall 2016

Trending

Archive