Virtual Study Solutions: CS301 Assignment no 1

CS301 Assignment No 1 Solution Spring 2017

<div dir="ltr" style="text-align: left;" trbidi="on">
<h3 style="text-align: left;">
<span style="font-family: "verdana" , sans-serif;">CS301 Assignment No 1 Spring 2017</span></h3>
<div>
<span style="font-family: "verdana" , sans-serif;">Here we have complete<b> CS301 Assignment No 1</b> <b>Solution </b>and Discussion of <b>Spring 2017</b>. CS301 Assignment Total Marks: 20 , Assignment Due Date: May 3, 2017.</span><br />
<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;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgTeynfEQ9Xth0hMpZXnOo2fXHkGn3sV1OC_pXQF8aXXZujMvdFKcwGgOLuNp6DvwuH5BiQZY7uxzb0RIuw1I4Dg9xerC4Hm_QlosVtrT7dcoubglDD8r7dwEOKFl_PS9kHeGpySY1jBrQ/s1600/CS301+Assignment+no+1+spring+2017+Solution.png" imageanchor="1" style="margin-left: auto; margin-right: auto; text-align: center;"><img alt="CS301 Assignment No 1 Spring 2017 Solution and discussion" border="0" height="161" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgTeynfEQ9Xth0hMpZXnOo2fXHkGn3sV1OC_pXQF8aXXZujMvdFKcwGgOLuNp6DvwuH5BiQZY7uxzb0RIuw1I4Dg9xerC4Hm_QlosVtrT7dcoubglDD8r7dwEOKFl_PS9kHeGpySY1jBrQ/s320/CS301+Assignment+no+1+spring+2017+Solution.png" title="CS301 Assignment No 1 Spring 2017 Solution and discussion" width="320" /></a></td></tr>
<tr><td class="tr-caption" style="text-align: center;"><span style="font-family: "verdana" , sans-serif;">CS301 Assignment No 1 Spring 2017 Solution and discussion</span></td></tr>
</tbody></table>
<span style="font-family: "verdana" , sans-serif;"></span><span style="font-family: "verdana" , sans-serif;"><br /></span></div>
<span style="font-family: "verdana" , sans-serif;"><b>Recommended </b>: <a href="http://virtualstudysolutions.blogspot.com/2016/12/cs301-current-mid-term-papers-fall-2016.html">CS301 Current Mid Term Papers Fall 2016</a></span><br />
<div>
<div>
<span style="font-family: "verdana" , sans-serif;"><br />You Can Also Download CS301 Mid Term Papers, CS301 Short Notes, CS301 Assignment Solutions,CS301 Lecture Wise Questions Answers Files, CS301 Solved MCQs, CS301 Solved Quiz ,CS301  Solved Final Term Subjective Papers , Solved Final Term Objective Papers from Virtual Study Solutions For Preparation of Final Term Papers.</span></div>
<div>
<span style="font-family: "verdana" , sans-serif;"><br /></span></div>
<div>
<span style="font-family: "verdana" , sans-serif;"><b>Recommended:</b> <a href="http://virtualstudysolutions.blogspot.com/2017/04/what-is-network-topology-and-its-types.html">What is Network Topology and its Types - Complete Tutorial</a></span><br />
<h3 style="text-align: left;">
<span style="font-family: "verdana" , sans-serif;">CS301 Assignment Instructions</span></h3>
<span style="font-family: "verdana" , sans-serif;">Please read the following instructions carefully before submitting assignment:<br />It should be clear that your assignment will not get any credit if:</span><br />
<ul style="text-align: left;"><span style="font-family: "verdana" , sans-serif;">
<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>
</span></ul>
<span style="font-family: "verdana" , sans-serif;">
For clarity and simplicity, You are required to Upload/Submit only ONE .CPP file. Other formats will not be accepted and will be graded zero marks.<br /><br /><b>Note:</b> Use ONLY Dev-C++ IDE for writing and executing your code.</span></div>
<div>
<span style="font-family: "verdana" , sans-serif;"><br /></span></div>
<div>
<span style="font-family: "verdana" , sans-serif;"><b>Recommended :</b> <a href="http://virtualstudysolutions.blogspot.com/2017/04/cs604-assignment-no-1-spring-2017.html">CS604 Assignment No 1 Spring 2017</a></span><br />
<h3 style="text-align: left;">
<span style="font-family: "verdana" , sans-serif;">CS301 Assignment Objectives:</span></h3>
<span style="font-family: "verdana" , sans-serif;">The purpose of this assignment is to make you familiar with following topics:</span><br />
<ul style="text-align: left;"><span style="font-family: "verdana" , sans-serif;">
<li>Link List</li>
<li>Adding new node at start (First position) of linked List. </li>
<li>Adding new node at last (last position) of linked List.</li>
<li>Search element from a linked list</li>
<li>Display All nodes of Linked list</li>
</span></ul>
<span style="font-family: "verdana" , sans-serif;">
<b>Recommended </b>: <a href="http://virtualstudysolutions.blogspot.com/2017/04/devc-installation-and-usage-complete-guidelines.html">DevC++ Installation and Usage Complete Guidelines</a></span><br />
<h3 style="text-align: left;">
<span style="font-family: "verdana" , sans-serif;">Assignment Submission Instructions </span></h3>
<span style="font-family: "verdana" , sans-serif;">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.</span><br />
<h3 style="text-align: left;">
<span style="font-family: "verdana" , sans-serif;">CS301 Assignment Question No. 1 </span></h3>
<div>
<span style="font-family: "verdana" , sans-serif;">Marks= 20 <br /><br /><b>Problem Statement:</b>                                                                                                                                <br /><br />Write a C++ program which implements a Simple Single Link List to keep the record of Students. </span><span style="font-family: "verdana" , sans-serif;"><br />The program should contain an Add operation to add new node/record of student in Linked List. Each record/node of the list contains Student ID and Name. The new node/record can be added at the beginning or end of Linked List. <br /><br />You also need to include Search operation in the Linked List. The search operation takes Student ID as an input and searches the entire Linked List to determine whether a student record against the provided Student ID exists or not. If the record for the given Student ID exists in given list then display Student ID and Name. If the record does not exist then display message “Student does not exist”. <br /><br />The output of the program should look like the screenshots attached below:</span></div>
<div>
<span style="font-family: "verdana" , sans-serif;"><br /></span></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;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgJYDKyfA6150z6U3ZHKmQtD-0yGUFADnCHTogsGvPVGeoksBASoDUDW_MN4vMSczJBdQBC-0jE9SfjnPWjlZ_45Ew5Bim6PElqPDGCxAEpMSWeXdycTn_BTN33FAyLbt1xAki3DbseVtc/s1600/cs301+assignment+no+1+screen+shot+1.png" imageanchor="1" style="margin-left: auto; margin-right: auto; text-align: center;"><img alt="CS301 Assignment No 1 Screen shot 1" border="0" height="324" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgJYDKyfA6150z6U3ZHKmQtD-0yGUFADnCHTogsGvPVGeoksBASoDUDW_MN4vMSczJBdQBC-0jE9SfjnPWjlZ_45Ew5Bim6PElqPDGCxAEpMSWeXdycTn_BTN33FAyLbt1xAki3DbseVtc/s640/cs301+assignment+no+1+screen+shot+1.png" title="CS301 Assignment No 1 Screen shot 1" width="640" /></a></td></tr>
<tr><td class="tr-caption" style="text-align: center;"><span style="font-family: "verdana" , sans-serif;">CS301 Assignment No 1 Screen shot 1</span></td></tr>
</tbody></table>
<div>
<span style="font-family: "verdana" , sans-serif;"><br />Adding Student at 1st Position: </span></div>
<div>
<span style="font-family: "verdana" , sans-serif;"></span><br />
<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;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEj5JcTUm7WvtjfVkoH5AlS3GEJY58Kon07RGJLrRIY0fulo1G8iEU0hHbveSnq7jkzC85dFQ-HZS6uKYjN27lepT7-41f4UHIsi4qvLK2LdWNA_78KmFSFyOMB4-K5DX5Ff9K9egKNyrmg/s1600/cs301+assignment+no+1+spring+2017.png" imageanchor="1" style="margin-left: auto; margin-right: auto; text-align: center;"><img alt="CS301 Assignment No 1 Screen shot 2" border="0" height="564" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEj5JcTUm7WvtjfVkoH5AlS3GEJY58Kon07RGJLrRIY0fulo1G8iEU0hHbveSnq7jkzC85dFQ-HZS6uKYjN27lepT7-41f4UHIsi4qvLK2LdWNA_78KmFSFyOMB4-K5DX5Ff9K9egKNyrmg/s640/cs301+assignment+no+1+spring+2017.png" title="CS301 Assignment No 1 Screen shot 2" width="640" /></a></td></tr>
<tr><td class="tr-caption" style="text-align: center;"><span style="font-family: "verdana" , sans-serif;">CS301 Assignment No 1 Screen shot 2</span></td></tr>
</tbody></table>
<span style="font-family: "verdana" , sans-serif;"><br /></span></div>
<div>
<span style="font-family: "verdana" , sans-serif;">Adding Student at Last position. </span></div>
<div>
<span style="font-family: "verdana" , sans-serif;"></span><br />
<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;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgo-VOXTd720wAmfW_PpGuvFDXRusnX53E0ndaqVF9OCLuAyxDjwURisQ8qWhNLRV8bqrBFq24oDcjH3ZA-ZMyzVZNbFp1PHaKNtmetMsiKs2ik4qVAwmHzJmTers-RBIJAJx4fWBxj-hs/s1600/cs301+Assignment+no+1+screen+shot+3.png" imageanchor="1" style="margin-left: auto; margin-right: auto; text-align: center;"><img alt="CS301 Assignment No 1 Screen shot 3" border="0" height="544" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgo-VOXTd720wAmfW_PpGuvFDXRusnX53E0ndaqVF9OCLuAyxDjwURisQ8qWhNLRV8bqrBFq24oDcjH3ZA-ZMyzVZNbFp1PHaKNtmetMsiKs2ik4qVAwmHzJmTers-RBIJAJx4fWBxj-hs/s640/cs301+Assignment+no+1+screen+shot+3.png" title="CS301 Assignment No 1 Screen shot 3" width="640" /></a></td></tr>
<tr><td class="tr-caption" style="text-align: center;"><span style="font-family: "verdana" , sans-serif;">CS301 Assignment No 1 Screen shot 3</span></td></tr>
</tbody></table>
<span style="font-family: "verdana" , sans-serif;"><br /></span></div>
<div>
<span style="font-family: "verdana" , sans-serif;">Searching Student in Link List. </span></div>
<div>
<span style="font-family: "verdana" , sans-serif;"></span><br />
<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;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhOSur351bzciMkyov8SLaJQPLFtPchN8tJUtfzT41e0P3EqNuR7Ghg5FtM-_2TIWlZrjjxQvQhKoJWngVTTJ0PtO9ZrpsQpFXVnLFxJOiT09VefJinyBEswihjMzjnouMpkuEigBzq9ek/s1600/cs301+assignment+no+1+screen+shot+4.png" imageanchor="1" style="margin-left: auto; margin-right: auto; text-align: center;"><img alt="CS301 Assignment No 1 Screen shot 4" border="0" height="600" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhOSur351bzciMkyov8SLaJQPLFtPchN8tJUtfzT41e0P3EqNuR7Ghg5FtM-_2TIWlZrjjxQvQhKoJWngVTTJ0PtO9ZrpsQpFXVnLFxJOiT09VefJinyBEswihjMzjnouMpkuEigBzq9ek/s640/cs301+assignment+no+1+screen+shot+4.png" title="CS301 Assignment No 1 Screen shot 4" width="640" /></a></td></tr>
<tr><td class="tr-caption" style="text-align: center;"><span style="font-family: "verdana" , sans-serif;">CS301 Assignment No 1 Screen shot 4</span></td></tr>
</tbody></table>
</div>
<div>
<h4 style="text-align: left;">
<span style="font-family: "verdana" , sans-serif;">CS301 Assignment Deadline:</span></h4>
<span style="font-family: "verdana" , sans-serif;">Your assignment must be uploaded on or before 3rd May, 2017. No solution will be accepted through email after the due date. </span></div>
<div>
<span style="font-family: "verdana" , sans-serif;"><br /></span></div>
<span style="font-family: "verdana" , sans-serif;"><b>Recommended :</b> <a href="http://virtualstudysolutions.blogspot.com/2017/04/eng201-assignment-no-1-solution-spring-2017.html">ENG201 Assignment No 1 Solution Spring 2017</a></span><br />
<h4 style="text-align: left;">
<span style="font-family: "verdana" , sans-serif; font-size: large;">CS301 Assignment No 1 Solution Spring 2017:</span></h4>
<div>
<span style="font-family: verdana, sans-serif;">You can download CS301 Assignment No 1 Solution from the file below.</span></div>
<div>
<span style="font-family: "verdana" , sans-serif;">Link list.cpp and </span><span style="font-family: verdana, sans-serif;">Link list.exe has also been added in solution file below:</span></div>
<div>
<span style="font-family: "verdana" , sans-serif;"><br /></span></div>
<div>
<span style="color: #333333; font-family: verdana, sans-serif;"><span style="background-color: white;"><a href="https://www.mediafire.com/?n03svd5a0arstb2" rel="nofollow" target="_blank">cs301_assignment_no_1_solution_spring_2017.rar</a></span></span><br />
<h4 style="text-align: left;">
<span style="color: #333333; font-family: Verdana, sans-serif;">CS301 Assignment No 1 Solution Screenshot</span></h4>
</div>
</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;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgbTvK4wpQv9hJM1uId_ggeEraNEQhfogz4OEX6eBkaLsDl8_QFrKp9UFEPgwCA9vet9f6sDiYlFz-u-3titn9Vp8aLJlZlVlZvAQOegbPkjQq5-hNKu5oFU3ikS3Ow9CRcELZogc3ZCHE/s1600/cs301+assignment+solution.png" imageanchor="1" style="margin-left: auto; margin-right: auto;"><img alt="CS301 Assignment No 1 Solution Screenshot" border="0" height="640" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEgbTvK4wpQv9hJM1uId_ggeEraNEQhfogz4OEX6eBkaLsDl8_QFrKp9UFEPgwCA9vet9f6sDiYlFz-u-3titn9Vp8aLJlZlVlZvAQOegbPkjQq5-hNKu5oFU3ikS3Ow9CRcELZogc3ZCHE/s640/cs301+assignment+solution.png" title="CS301 Assignment No 1 Solution Screenshot" width="432" /></a></td></tr>
<tr><td class="tr-caption" style="text-align: center;"><span style="font-family: Verdana, sans-serif;">CS301 Assignment No 1 Solution Screenshot</span></td></tr>
</tbody></table>
<div>
<span style="color: #333333; font-family: Verdana, sans-serif;">If you liked this Post Please share it with your friends. Thank You.</span></div>
</div>

CS301 Assignment No 1 Solution Spring 2017

CS301 Assignment No 1 Spring 2017 Here we have complete CS301 Assignment No 1 Solution and Discussion of Spring 2017 . CS301 Assignmen...

CS301 Assignment No. 2 Solution Fall 2016

<div dir="ltr" style="text-align: left;" trbidi="on">
<div>
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment No. 2 Fall2016</span></h3>
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 - Data Structures Assignment No. 2 Solution Fall 2016 Due Date: Nov 29, 2016</span></div>
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment No.  2 <br />Semester: Fall 2016<br />CS301 – Data Structures<br />CS301 Assignment Total Marks: 20<br />CS301 Assignment Due Date: Tuesday, November 29, 2016</span><br />
<div>
<span style="font-family: "trebuchet ms" , sans-serif;"><br /></span></div>
<div>
<span style="font-family: "trebuchet ms" , sans-serif;">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></span><br />
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Instructions</span></h3>
<span style="font-family: "trebuchet ms" , sans-serif;">Please read the following instructions carefully before submitting assignment:<br />It should be clear that your assignment will not get any credit if:</span><br />
<ul style="text-align: left;"><span style="font-family: "trebuchet ms" , sans-serif;">
<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>
</span></ul>
<span style="font-family: "trebuchet ms" , sans-serif;">
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.</span><br />
<blockquote class="tr_bq">
<span style="font-family: "trebuchet ms" , sans-serif;"><b>Note:</b> Use ONLY Dev-C++ IDE for writing and executing your code.</span></blockquote>
<span style="font-family: "trebuchet ms" , sans-serif;"><br /></span>
<span style="font-family: "trebuchet ms" , sans-serif;">Also Read : <span style="background-color: white; font-size: 15px;"><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></span></span></div>
<div>
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Objectives:</span></h3>
<span style="font-family: "trebuchet ms" , sans-serif;">The purpose of this assignment is to make you familiar with following topics:</span><br />
<ul style="text-align: left;"><span style="font-family: "trebuchet ms" , sans-serif;">
<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>
</span></ul>
<span style="font-family: "trebuchet ms" , sans-serif;">
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></span><br />
<div>
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Submission Instructions</span></h3>
<span style="font-family: "trebuchet ms" , sans-serif;">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.</span><br />
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment No. 2</span></h3>
<div>
<span style="font-family: "trebuchet ms" , sans-serif;">Marks= 20</span></div>
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Question 1: </span></h3>
<span style="font-family: "trebuchet ms" , sans-serif;">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:</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;"><span style="font-family: "trebuchet ms" , sans-serif;"><br /></span><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><span style="font-family: "trebuchet ms" , sans-serif;"><br /><br />Product of Elements in 2nd last level  (N-1)= 20<br /><br />Smallest number in Binary Tree = 2<br /><br />Note: N levels mean any number of levels.</span></span><br />
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Deadline:</span></h3>
<span style="font-family: "trebuchet ms" , sans-serif;">Your assignment must be uploaded on or before Tuesday, November 29, 2016. We shall not accept your solution through email after the due date.</span></div>
<div>
<span style="font-family: "trebuchet ms" , sans-serif;"><br /></span></div>
<div>
<span style="font-family: "trebuchet ms" , sans-serif;"><span style="font-family: "trebuchet ms" , sans-serif;">Also Read: <a href="http://virtualstudysolutions.blogspot.com/2015/01/financial-accounting-mgt101-solved.html">financial accounting MGT101 Solved Papers</a></span>
</span><br />
<br />
<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;"><span style="font-family: "trebuchet ms" , sans-serif;"><br /></span></dt>
<br />
<h4 style="text-align: left;">
<span style="font-family: Trebuchet MS, sans-serif; font-size: large;">CS301 Assignment No. 2 Solution Fall 2016</span></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;">
<span style="font-family: "trebuchet ms" , sans-serif;">Here You can download CS301 Assignment No. 2 Solution & Discussion for Fall 2016.</span></div>
<h4 style="text-align: left;">
<span style="font-family: Trebuchet MS, sans-serif; font-size: large;">CS301 Assignment No. 2 Solution</span></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;">
<span style="font-family: "trebuchet ms" , sans-serif;">#include <stdio.h></span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">#include <iostream></span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">using namespace std;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">struct Node</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">{</span></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;">
<span style="font-family: "trebuchet ms" , sans-serif;">int val;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">struct Node *left, *right;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">};</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">Node *newNode(int data)</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">{</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">Node *temp = new Node;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">temp->val = data;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">temp->left = temp->right = NULL;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">return temp;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">}</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">// A utility function to find deepest leaf node.</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">// lvl: level of current node.</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">// maxlvl: pointer to the deepest left leaf node found so far</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">// isLeft: A bool indicate that this node is left child of its parent</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">// resPtr: Pointer to the result</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">void deepestLeftLeafUtil(Node *root, int lvl, int *maxlvl,</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">bool isLeft, Node **resPtr)</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">{</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">// Base case</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">if (root == NULL)</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">return;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">// Update result if this node is left leaf and its level is more</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">// than the maxl level of the current result</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">if (isLeft && !root->left && !root->right && lvl > *maxlvl)</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">{</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">*resPtr = root;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">*maxlvl = lvl;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">return;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">}</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">// Recur for left and right subtrees</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">deepestLeftLeafUtil(root->left, lvl+1, maxlvl, true, resPtr);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">deepestLeftLeafUtil(root->right, lvl+1, maxlvl, false, resPtr);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">}</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">// A wrapper over deepestLeftLeafUtil().</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">Node* deepestLeftLeaf(Node *root)</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">{</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">int maxlevel = 0;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">Node *result = NULL;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">deepestLeftLeafUtil(root, 0, &maxlevel, false, &result);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">return result;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">}</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">Node* insert(Node* node, int val)</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">{</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">/* 1. If the tree is empty, return a new,</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">single node */</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">if (node == NULL)</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">return(newNode(val));</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">else</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">{</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">/* 2. Otherwise, recur down the tree */</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">if (val <= node->val)</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">node->left = insert(node->left, val);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">else</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">node->right = insert(node->right, val);</span></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;">
<span style="font-family: "trebuchet ms" , sans-serif;">/* return the (unchanged) node pointer */</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">return node;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">}</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">}</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">int minValue(Node* node) {</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">Node* current = node;</span></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;">
<span style="font-family: "trebuchet ms" , sans-serif;">/* loop down to find the leftmost leaf */</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">while (current->left != NULL) {</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">current = current->left;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">}</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">return(current->val);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">}</span></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;">
<span style="font-family: "trebuchet ms" , sans-serif;">// Driver program to test above function</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">int main()</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">{</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">int a, b, c, d, e, f, g, h, i, j;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">cout"Enter 10 Numbers in Tree:\n";</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">cin>>a>>b>>c>>d>>e>>f>>g>>h>>i>>j;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">Node* root = newNode(a);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">root->left = newNode(b);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">root->right = newNode(c);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">root->left->left = newNode(d);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">root->right->left = newNode(e);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">root->right->right = newNode(f);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">root->right->left->right = newNode(g);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">root->right->right->right = newNode(h);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">root->right->left->right->left = newNode(i);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">root->right->right->right->right = newNode(j);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">root = insert(root, a);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">insert(root, b);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">insert(root, c);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">insert(root, d);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">insert(root, e);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">insert(root, f);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">insert(root, g);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">insert(root, h);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">insert(root, i);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">insert(root, j);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">Node *result = deepestLeftLeaf(root);</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">if (result){</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">cout "Product of 2nd lowest level of a binary tree is: " result->val * result->val;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">}</span></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;">
<span style="font-family: "trebuchet ms" , sans-serif;">else{</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">cout "There is no left leaf in the given tree";</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">}</span></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;">
<span style="font-family: "trebuchet ms" , sans-serif;">printf("\nMinimum value in BST is %d", minValue(root));</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">return 0;</span><br />
<span style="font-family: "trebuchet ms" , sans-serif;">}</span></div>
</dt>
<br />
<h4 style="text-align: left;">
<span style="font-family: Trebuchet MS, sans-serif;">Download CS301 Solution file:</span></h4>
<br />
<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;"><span style="font-family: "trebuchet ms" , sans-serif;"><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><span style="font-size: 1em;">, 3 KB9</span></span></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;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment no 1</span></h3>
<span style="font-family: "trebuchet ms" , sans-serif;">Here You can easily download <b>CS301</b> <b>Assignment</b> Solution - Data Structures. </span><span style="font-family: "trebuchet ms" , sans-serif;"><b>CS301 Assignment No. 1</b> Semester:<b> Fall 2016</b>. </span><span style="font-family: "trebuchet ms" , sans-serif;">CS301 Data Structures .</span><span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Total Marks: 20. </span><span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Due Date: <b>November 16</b>, 2016.</span><br />
<div>
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 </span><span style="font-family: "trebuchet ms" , sans-serif;">Assignment </span><span style="font-family: "trebuchet ms" , sans-serif;">Instructions</span></h3>
<div>
<span style="font-family: "trebuchet ms" , sans-serif;">Please read the following instructions carefully before submitting assignment:<br />It should be clear that your assignment will not get any credit if:</span><br />
<ul style="text-align: left;"><span style="font-family: "trebuchet ms" , sans-serif;">
<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>
</span></ul>
<span style="font-family: "trebuchet ms" , sans-serif;">You May also Read: </span><span style="font-family: "trebuchet ms" , sans-serif;"><a href="http://virtualstudysolutions.blogspot.com/2016/11/cs401-mid-term-past-papers-notes.html">CS401 Mid Term Past Papers / Notes</a></span><br />
<ul style="text-align: left;"><span style="font-family: "trebuchet ms" , sans-serif;">
</span></ul>
<span style="font-family: "trebuchet ms" , sans-serif;">
</span>
<br />
<blockquote class="tr_bq">
<span style="font-family: "trebuchet ms" , sans-serif;">Note: For clarity and simplicity, You are required to Upload/Submit only ONE .CPP file if needed.</span><span style="font-family: "trebuchet ms" , sans-serif;"><br /></span><span style="font-family: "trebuchet ms" , sans-serif;">Keep all your files (word and .cpp) in a folder and make its zipped file to upload on LMS.</span><span style="font-family: "trebuchet ms" , sans-serif;"><br /></span><span style="font-family: "trebuchet ms" , sans-serif;">Use ONLY Dev-C++ IDE for writing and executing your code.</span></blockquote>
<span style="font-family: "trebuchet ms" , sans-serif;">You May also Read: </span><span style="font-family: "trebuchet ms" , sans-serif;"><a href="http://virtualstudysolutions.blogspot.com/2016/11/cs501-assignment-no-01-solution-fall-2016.html">CS501 Assignment no. 01 Solution Fall 2016</a></span></div>
<div>
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Objectives:</span></h3>
<span style="font-family: "trebuchet ms" , sans-serif;">The purpose of this assignment is to make you familiar with following topics:</span><br />
<ul style="text-align: left;"><span style="font-family: "trebuchet ms" , sans-serif;">
<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>
</span></ul>
<span style="font-family: "trebuchet ms" , sans-serif;">
</span>
<br />
<div>
<span style="font-family: "trebuchet ms" , sans-serif;">You May also Read: <span style="font-family: "trebuchet ms" , sans-serif;"><a href="http://virtualstudysolutions.blogspot.com/2016/11/cs402-assignment-no-01-solution-fall.html">CS402 Assignment No 01 Solution Fall 2016</a></span></span></div>
<span style="font-family: "trebuchet ms" , sans-serif;">
</span></div>
<div>
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Submission Instructions</span></h3>
<span style="font-family: "trebuchet ms" , sans-serif;">You have to submit only word file on the Assignments interface of CS301 at VULMS. Assignment submitted in<br />any other format will not be accepted and will be graded zero marks.</span></div>
<div>
<span style="font-family: "trebuchet ms" , sans-serif;"><br /></span></div>
<div>
<span style="font-family: "trebuchet ms" , sans-serif;">You May also Read: </span><span style="font-family: "trebuchet ms" , sans-serif;"><a href="http://virtualstudysolutions.blogspot.com/2016/11/cs201-assignment-no-01-Solution.html">CS201 Assignment No 01 Solution / Discussion Fall 2016</a></span><span style="font-family: "trebuchet ms" , sans-serif;"><br /></span><br />
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment no. 1 Fall 2016</span></h3>
<div>
<span style="font-family: "trebuchet ms" , sans-serif;">You May also Read: </span><span style="font-family: "trebuchet ms" , sans-serif;"><a href="http://virtualstudysolutions.blogspot.com/2016/11/eng201-assignment-no-1-solution-fall.html">ENG201 Assignment no. 1 Solution Fall 2016</a></span></div>
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Question 1:</span></h3>
</div>
<div>
<span style="font-family: "trebuchet ms" , sans-serif;">marks: 10</span></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;"><span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment no 1 Question no 1 Fall 2016</span></td></tr>
</tbody></table>
<span style="font-family: "trebuchet ms" , sans-serif;"><br />Given is a code of abstract class declaration for a list (ADT) in Figure 1(a).</span><span style="font-family: "trebuchet ms" , sans-serif;"><br /></span></div>
<div>
<span style="font-family: "trebuchet ms" , sans-serif;"><b>Figure 1(a)</b></span><br />
<span style="font-family: "trebuchet ms" , sans-serif;"><b>(a)</b>  Assume a list has the following configuration: < | 2, 23, 15, 5, 9 ></span><span style="font-family: "trebuchet ms" , sans-serif;">Write only Method calls (Name of function) using the List ADT of Figure 1(a) to delete the element with value<br />15.</span></div>
<div>
<span style="font-family: "trebuchet ms" , sans-serif;">e.g To move the pointer to end of the list We will use function movetoEnd( ). No need to write function implementation.<br /><br /><b>Note:</b> Here the ‘|’ symbol represents ‘fence’ like pointer that indicates the current position of pointer in list.<br /><br /><b>(b)</b>  Show the list configuration resulting from each series of list operations using the List ADT of Figure 1(a) <br /><br /> </span></div>
<div>
<span style="font-family: "trebuchet ms" , sans-serif;">Assume that list L1 is empty at the beginning of each series. Show where the fence is in the list.<br /><br />L1.append(10);<br />L1.append(20); <br />L1.append(15);</span><br />
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Question 2: </span></h3>
</div>
<div>
<span style="font-family: "trebuchet ms" , sans-serif;">marks: 10<br /><br />Given is an infix expression:<br /><br />A + B * C / (D-B)<br /><br />Write a complete program in C++ to convert the above infix expression into postfix notation.</span><br />
<h3 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Deadline:</span></h3>
<span style="font-family: "trebuchet ms" , sans-serif;">Your <b>CS301 Assignment</b> must be uploaded on or before <b>November 16, 2016</b>. We shall not accept your solution through email after the due date.</span></div>
<h3 style="text-align: center;">
<span style="font-family: "trebuchet ms" , sans-serif; font-size: x-large;">CS301 Assignment no 1 Solution Fall 2016</span></h3>
<div style="text-align: left;">
<h4 style="text-align: left;">
<span style="font-family: Trebuchet MS, sans-serif;">CS301 Solution Correct</span></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;"><span style="font-family: Trebuchet MS, sans-serif;"><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</span></li>
</ul>
</dd></div>
<h4 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Question no. 1 Solution:</span></h4>
<span style="font-family: Trebuchet MS, sans-serif;">#include<br />using namespace std;<br /><br />struct node<br />{<br />int data;<br />struct node *next;<br />};<br /><br />class stack<br />{<br />struct node *top;<br />public:<br />stack() <br />{<br />top=NULL;<br />}<br />void push(); <br />void pop(); <br />void show(); <br />};<br /><br />void stack::push()<br />{<br />int value;<br />struct node *ptr;<br />cout"Enter Item number to insert : ";<br />cin>>value;<br />ptr=new node;<br />ptr->data=value;<br />ptr->next=NULL;<br />if(top!=NULL)<br />ptr->next=top;<br />top=ptr;<br />cout"\n New item is inserted to the stack!!!";<br /><br />}<br /><br />void stack::pop()<br />{<br />struct node *temp;<br />if(top==NULL)<br />{<br />cout"\n The stack is empty!!!";<br />}<br />temp=top;<br />top=top->next;<br />cout"\n Remove Item \n ============ \n Item number " temp->data;<br />cout" is removed";<br />delete temp;<br />}<br /><br />void stack::show()<br />{<br />struct node *ptr1=top;<br />cout"\n Pruchased Items are :\n";<br />while(ptr1!=NULL)<br />{<br />coutptr1->data" ->";<br />ptr1=ptr1->next;<br />}<br />cout"NULLn";<br />}<br /><br />int main()<br />{<br />stack s;<br />int choice;<br />while(1)<br />{<br />cout"\n-------------- *Zohaib* -----------------\n------------- khan--------------------";<br />cout"\n------------- bc130201551---------------\n------------- Student Of BsCs----------------";<br />cout"\n ------------ Purchased Module -------------------------";<br />cout"\n MENU\n ====\n1:Insert Item\n2:Remove Item\n3:DISPLAY Purchased Item \n4:EXIT";<br />cout"\n Enter your choice(1-4): ";<br />cin>>choice;<br />switch(choice)<br />{<br />case 1:<br />s.push();<br />break;<br />case 2:<br />s.pop();<br />break;<br />case 3:<br />s.show();<br />break;<br />case 4:<br />return 0;<br />break;<br />default:<br />cout"Please enter correct choice(1-4)!!";<br />break;<br />}<br />}<br />return 0;<br />}</span><h4 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">CS301 Assignment Question no. 2 Solution:</span></h4>
<span style="font-family: "trebuchet ms" , sans-serif;">#include<iostream><br />#include<stack>//import Stack STL<br />#include<string>//import String STL<br />#include<conio .h=""><br />using namespace std;<br /><br />string infixToPostfix(string expr); //Function declaration<br />int precendence(char arg);<br />bool isoperand(char arg);<br />bool isoperator(char arg);<br />int operatorweight(char arg);<br />bool highprecendence(char a, char b);<br /><br />int main()<br />{<br />    string exp;//Variable to get input expression<br />    cout"Enter the infix expression:";<br />    getline(cin,exp);<br />    cout"Output Postfix Expression:"infixToPostfix(exp);<br />    getch();<br />}<br /><br />string infixToPostfix(string expr)//Function to perform all conversion operation<br />{<br /><br />    stack<char> stk;//Declaring a stack for conversion purpose<br />    string postfix = "";//Initialize the output string as empty;<br />    for(int i = 0;i < expr.length(); i++)//Scan the infix string one by one<br />        if(expr[i] == '(')<br />        {<br />            stk.push(expr[i]);<br />        }<br />        else if(expr[i] == ')')<br />        {<br />            while(stk.top() != '(')<br />            {<br />                postfix = postfix + stk.top();<br />                stk.pop();<br />            }<br />            stk.pop();<br />        }<br />        else if(isoperand(expr[i]))<br />        {<br />            postfix += expr[i];<br />        }<br />        else if(isoperator(expr[i]))<br />        {<br />            while(!stk.empty()&& !highprecendence(expr[i],stk.top()))<br />            {<br />                postfix+= stk.top();<br />                stk.pop();<br />            }<br />            stk.push(expr[i]);<br />        }<br />    while(!stk.empty())<br />    {<br />        postfix+= stk.top();<br />        stk.pop();<br />    }<br />    return postfix;<br />}<br /><br />bool highprecendence(char a, char b)//Check for operator precendence<br />{<br />    int weighta = operatorweight(a);<br />    int weightb = operatorweight(b);<br />    if(weighta >= weightb) return 1;<br />    return 0;<br />}<br /><br />bool isoperator(char arg)//Check weather the character is operator<br />{<br />    if(arg == '*' || arg == '/' || arg == '+' || arg == '-') return(1);<br />    else return(0);<br />}<br />bool isoperand(char arg)//Check weather the character is operand<br />{<br />    if(arg >= '0' && arg <= '9') return 1;<br />    if(arg >= 'a' && arg <= 'z') return 1;<br />    if(arg >= 'A' && arg <= 'Z') return 1;<br />    return 0;<br />}<br /><br />int operatorweight(char arg)//Add weight to the operator<br />{<br />    int weight = 0;<br />    switch(arg)<br />    {<br />    case '*':<br />    case '/':<br />        weight = 2;<br />        break;<br />    case '+':<br />    case '-':<br />        weight = 1;<br />        break;<br />    }<br />    return(weight);<br />}</char></conio></string></stack></iostream></span><br />
<h4 style="text-align: left;">
<span style="font-family: "trebuchet ms" , sans-serif;">Download Links for CS301 Assignment Files:</span></h4>
<span style="font-family: "trebuchet ms" , sans-serif;"><a href="http://vustudents.ning.com/group/cs301datastructures/forum/attachment/download?id=3783342%3AUploadedFile%3A5662287" rel="nofollow" target="_blank">Untitled4.cpp</a>, 2 KB<br /><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</span></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 1 Solution Spring 2017

CS301 Assignment No. 2 Solution Fall 2016

CS301 Assignment no 1 Solution Fall 2016

Trending

Archive