Educational Wealth: algorithm

[PastPapers] Analysis and Design of Algorithms - 3466/3506 -AIOU BS(CS)

[PastPapers] Analysis and Design of Algorithms - 3466/3506 -AIOU BS(CS)

Spring 2014 Autumn 2014 Autumn 2012 Spring 2012 Autumn 2011 Spring 2011 Spring 2008 Spring 2006

Data Structure (3408)-Assignment--aiou-spring 2015-algorithm

<div dir="ltr" style="text-align: left;" trbidi="on">
<h2 style="text-align: left;">
<span style="color: red;">Solved Assighnments</span></h2>
<table cellpadding="0" cellspacing="0" class="tr-caption-container" style="clear: left; float: left; margin-bottom: 1em; text-align: left;"><tbody>
<tr><td style="text-align: center;"><a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg631E3T38WKi1W79dg5QQuomT_lo3ySCSL2VeLMtINqVYHOsJ3lZz6tlQ4K2Qxy9Jk2bmGBrx8mAxXfhqiu_Ql67g3Wqqo90qVL5n63vRka_4zCgqdVyDcq_zllACNrBxwsMky59sa8k8/s1600/allama.png" style="clear: left; margin-bottom: 1em; margin-left: auto; margin-right: auto;"><img border="0" loading="lazy" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEg631E3T38WKi1W79dg5QQuomT_lo3ySCSL2VeLMtINqVYHOsJ3lZz6tlQ4K2Qxy9Jk2bmGBrx8mAxXfhqiu_Ql67g3Wqqo90qVL5n63vRka_4zCgqdVyDcq_zllACNrBxwsMky59sa8k8/s1600-rw/allama.png" /></a></td></tr>
<tr><td class="tr-caption" style="text-align: center;">AIOU</td></tr>
</tbody></table>
<h2 align="center" class="western">
<span style="color: #990000;"><span style="font-size: x-large;"><span style="letter-spacing: -0.3pt;"> </span></span></span></h2>
<h2 align="center" class="western">
<span style="color: #990000;"><span style="font-size: x-large;"><span style="letter-spacing: -0.3pt;"> </span></span></span></h2>
<h2 align="center" class="western">
<span style="color: #990000;"><span style="font-size: x-large;"><span style="letter-spacing: -0.3pt;"> </span></span></span></h2>
<h2 align="center" class="western">
<span style="color: #990000;"><span style="font-size: x-large;"><span style="letter-spacing: -0.3pt;"> </span></span></span></h2>
<h2 align="center" class="western">
 
</h2>
<h2 align="center" class="western">
<span style="color: #990000;"><span style="font-size: x-large;"><span style="letter-spacing: -0.3pt;"> </span></span></span></h2>
<h2 align="center" class="western">
 
<span style="color: #990000;"><span style="font-size: x-large;"><span style="letter-spacing: -0.3pt;">Course:</span></span></span><span style="font-size: x-large;"><span lang="en-GB"><b>Data structure  (3408)</b></span></span></h2>
<h2 class="western">
Level: B.S (CS) Semester: Spring, 2015</h2>
<h2 class="western">
Total Marks: 100 Pass Marks: 50</h2>
<h1 align="center" class="western">
<span style="font-size: large;"><b>ASSIGNMENT
No.1</b></span></h1>
<h3 class="western" style="text-align: left;">
 <span style="font-family: "times new roman" , serif; font-size: large;">Q:3 <span style="color: blue;">write
an algorithm to reverse a string </span></span></h3>
<h3 style="text-align: left;">
<span style="color: blue;">
</span><span style="font-family: "times new roman" , serif; font-size: large;"><span style="color: blue;">     “ P A K I S T A N” by using
Queue or Stack data structure</span>.</span></h3>
<br />
<span style="font-size: large;">#include<iostream><br />#include<string.h><br />using namespace std;<br /><br />int main()<br />{<br />    char str[] = "PAKISTAN";<br />    char temp;<br />    int i;<br />    <br />    <br />        cout<<"Input String: "<<str<<endl;<br /><br />for(i=0;i<strlen(str)/2;i++)<br />{<br />    temp=str[i];<br />    str[i]=str[strlen(str)-i-1];<br />    str[strlen(str)-i-1]=temp;<br />}<br />    <br />    cout<<"Reversed String: "<<str;<br />    return 0;<br />}</span><br />
<span style="background-color: yellow;"><span style="font-size: large;">click here to read other  answers of assihnment 1 and 2</span></span><br />
<a href="http://educational-wealth.blogspot.com/2015/07/assignment-data-structure-course-outline.html" target="_blank">http://educational-wealth.blogspot.com/2015/07/assignment-data-structure-course-outline.html</a><br />
<a href="http://educational-wealth.blogspot.com/2015/07/assignment-data-structure-course-outline.html" target="_blank"><span style="font-size: large;">   </span></a></div>

Data Structure (3408)-Assignment--aiou-spring 2015-algorithm

Solved Assighnments AIOU Course: Data structure (3408) Level: B.S (CS) Semester: Spring, 2015 Total M...

Attention! Ad blocker Detected!

Educational Wealth

[PastPapers] Analysis and Design of Algorithms - 3466/3506 -AIOU BS(CS)

Data Structure (3408)-Assignment--aiou-spring 2015-algorithm

Popular Posts

Tags

Blog Posts