tag:blogger.com,1999:blog-52092168075899019902024-03-05T05:37:24.053-08:00THE NEW WORLD OF PROGRAMMINGExplore the new and unique programing techniques with just a click and u can visit <a href="http://devgroupindia.webs.com">DEVGROUP</a> ,
<a href="http://computersciencedora.blogspot.in">COMPUTERS & TECHNOLOGY</a>,
<a href="artificialintelligencedevdora.blogspot.in">ARTIFICIAL INTELLIGENCE</a>,<a href="http://hackingprotectdevdora.blogspot.in">PROTECT HACKING</a>and<a href="https://facebook.com/csedevgroup"> FACEBOOK PAGE</a>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.comBlogger25125tag:blogger.com,1999:blog-5209216807589901990.post-10627646083092786792013-11-05T08:39:00.003-08:002015-02-10T05:14:30.367-08:00Auto light switching arduino program based on bidirectional counter<div dir="ltr" style="text-align: left;" trbidi="on">
<br />
<div class="separator" style="clear: both; text-align: center;">
</div>
<br />
<div class="separator" style="clear: both; text-align: center;">
</div>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjrSDEspkO7g5L0ALYOSyajfnUaTMajLEwO_Kl36sjNptKAD_pHW9jAXtVuxv1I7sXiyMmnczpcObeHebzQMkQmNy0pVZGn81N29OM9Bhng-kvNwqtfeugz2kJvgDtF5vyrnQ-rlzK8y-8/s1600/autolightswitching.jpg" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEjrSDEspkO7g5L0ALYOSyajfnUaTMajLEwO_Kl36sjNptKAD_pHW9jAXtVuxv1I7sXiyMmnczpcObeHebzQMkQmNy0pVZGn81N29OM9Bhng-kvNwqtfeugz2kJvgDtF5vyrnQ-rlzK8y-8/s1600/autolightswitching.jpg" height="300" width="400" /></a></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhb94yQPmugsXbcr5FnCbzdF0_FUBJ42ufy-1Zfsakmcu_h78_M3_T9csITvo9w6KJ626NGdgAyBOoR1hT1sTLbzdWGhznLKb4o4hNToZek5VNhH4b4f5WpKgJB38YMWNz7iirA8GlZydA/s1600/bidirectionalcounte.jpg" imageanchor="1" style="clear: left; margin-bottom: 1em; margin-right: 1em;"><img border="0" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhb94yQPmugsXbcr5FnCbzdF0_FUBJ42ufy-1Zfsakmcu_h78_M3_T9csITvo9w6KJ626NGdgAyBOoR1hT1sTLbzdWGhznLKb4o4hNToZek5VNhH4b4f5WpKgJB38YMWNz7iirA8GlZydA/s1600/bidirectionalcounte.jpg" height="240" width="320" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEih5dqbzxaV_nTx1f3qLhzG85RHxyg7GzVLhBQDwCFJt1Vg5vq5HJ-bja0WWBrlBGxtwpRz10M9cYb0zSox6WOEMO8XCogevKcXR1EC_qovGBBUl37q9AR0D4LoUA1GPIsLl2oNKF4PTpQ/s1600/autolightswitchingckt.jpg" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEih5dqbzxaV_nTx1f3qLhzG85RHxyg7GzVLhBQDwCFJt1Vg5vq5HJ-bja0WWBrlBGxtwpRz10M9cYb0zSox6WOEMO8XCogevKcXR1EC_qovGBBUl37q9AR0D4LoUA1GPIsLl2oNKF4PTpQ/s1600/autolightswitchingckt.jpg" height="640" width="584" /></a></div>
<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi2WWBRA_sfF6QFRfklu2IJktlwP7ox3Wv1AMG4qY6EwNx5BV1qEH3QC3ExXyV9Wr9z2anIrUhU8cNT57C4duUIu5JP_VTW-4D0MfgYj2p4X7FljZSyA2tnpHiNUkdM2_AgiJzQYkgXMp0/s1600/seg.gif" imageanchor="1" style="margin-left: 1em; margin-right: 1em;"><img border="0" src="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEi2WWBRA_sfF6QFRfklu2IJktlwP7ox3Wv1AMG4qY6EwNx5BV1qEH3QC3ExXyV9Wr9z2anIrUhU8cNT57C4duUIu5JP_VTW-4D0MfgYj2p4X7FljZSyA2tnpHiNUkdM2_AgiJzQYkgXMp0/s1600/seg.gif" height="264" width="320" /></a></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
<div class="separator" style="clear: both; text-align: center;">
Here I have used common cathode configuration , 7-segment pins a,b.c...g are connected to 4,5,6...10 digital pins of arduino board.</div>
<div class="separator" style="clear: both; text-align: center;">
<br /></div>
int pd1=2; //photodiode<br />
int pd2=3;<br />
//Photodiode to digital pin 2 and pin 3<br />
int led=13; //led to digital pin 9<br />
int pd1Read=0; //Readings from sensor to analog pin 0 <br />
int pd2Read=1;<br />
int limit1=975;//Threshold range of an obstacle <br />
int limit2=975;<br />
int flag=0;<br />
<br />
int count=0; <br />
const int segment[]={4,5,6,7,8,9,10};<br />
<br />
void setup() <br />
{ for(int i=0;i<7;i++)<br />
{<br />
pinMode(segment[i],OUTPUT);<br />
<br />
}<br />
<br />
pinMode(pd1,OUTPUT); <br />
pinMode(pd2,OUTPUT); <br />
pinMode(led,OUTPUT); <br />
digitalWrite(pd1,HIGH); //supply 5 volts to photodiode<br />
digitalWrite(pd2,HIGH); <br />
digitalWrite(led,LOW); //set the led in off mode (initial condition) <br />
Serial.begin(9600); //setting serial monitor at a default baund rate of 9600 <br />
} <br />
void loop() <br />
{<br />
int val1=analogRead(pd1Read); //variable to store values from the photodiode 1<br />
int val2=analogRead(pd2Read);<br />
// const byte segmentnumbers[]={B1111110,B0110000,B1101101,B1111001,B0110011,B1011011,B1011111,B1110000,B1111111,B1111011};<br />
<br />
if(val1<=limit1)<br />
{count=count+1;<br />
//digitalWrite(led,HIGH);<br />
}<br />
delay(500);<br />
if(val2<=limit2)<br />
{count=count-1;<br />
if(count==-1)<br />
count=0;<br />
}<br />
<br />
for(int i=0;i<7;i++)<br />
{<br />
digitalWrite(segment[i],LOW);<br />
}<br />
<br />
// delay(100);<br />
<br />
switch(count)<br />
{case 0:<br />
for(int i=0;i<6;i++)<br />
digitalWrite(segment[i],HIGH);<br />
break;<br />
case 1:<br />
digitalWrite(segment[1],HIGH);<br />
digitalWrite(segment[2],HIGH);<br />
break;<br />
<br />
case 2:<br />
<br />
digitalWrite(segment[0],HIGH);<br />
digitalWrite(segment[1],HIGH);<br />
digitalWrite(segment[3],HIGH);<br />
digitalWrite(segment[4],HIGH);<br />
digitalWrite(segment[6],HIGH);<br />
break;<br />
<br />
case 3:<br />
digitalWrite(segment[0],HIGH);<br />
digitalWrite(segment[1],HIGH);<br />
digitalWrite(segment[3],HIGH);<br />
digitalWrite(segment[2],HIGH);<br />
digitalWrite(segment[6],HIGH);<br />
break;<br />
<br />
<br />
case 4:<br />
digitalWrite(segment[2],HIGH);<br />
digitalWrite(segment[1],HIGH);<br />
digitalWrite(segment[5],HIGH);<br />
digitalWrite(segment[6],HIGH);<br />
break;<br />
case 5:<br />
digitalWrite(segment[0],HIGH);<br />
digitalWrite(segment[2],HIGH);<br />
digitalWrite(segment[3],HIGH);<br />
digitalWrite(segment[5],HIGH);<br />
digitalWrite(segment[6],HIGH);<br />
break;<br />
<br />
case 6:<br />
for(int i=0;i<7;i++)<br />
if(i!=1)<br />
digitalWrite(segment[i],HIGH);<br />
break;<br />
<br />
case 7: digitalWrite(segment[0],HIGH);<br />
digitalWrite(segment[1],HIGH);<br />
digitalWrite(segment[2],HIGH);<br />
break;<br />
<br />
case 8:<br />
for(int i=0;i<7;i++)<br />
digitalWrite(segment[i],HIGH);<br />
break;<br />
case 9:<br />
for(int i=0;i<7;i++)<br />
if(i!=4)<br />
digitalWrite(segment[i],HIGH);<br />
break;<br />
}<br />
<br />
if(count==0)<br />
{digitalWrite(led,LOW);<br />
<br />
}<br />
else<br />
{<br />
digitalWrite(led,HIGH);<br />
}<br />
delay(50);<br />
<br />
}<br />
<div class="separator" style="clear: both; text-align: center;">
<a href="https://blogger.googleusercontent.com/img/b/R29vZ2xl/AVvXsEhb94yQPmugsXbcr5FnCbzdF0_FUBJ42ufy-1Zfsakmcu_h78_M3_T9csITvo9w6KJ626NGdgAyBOoR1hT1sTLbzdWGhznLKb4o4hNToZek5VNhH4b4f5WpKgJB38YMWNz7iirA8GlZydA/s1600/bidirectionalcounte.jpg" imageanchor="1" style="clear: left; float: left; margin-bottom: 1em; margin-right: 1em;"><br /></a><iframe allowfullscreen='allowfullscreen' webkitallowfullscreen='webkitallowfullscreen' mozallowfullscreen='mozallowfullscreen' width='320' height='266' src='https://www.youtube.com/embed/M3VQ34Lrx2c?feature=player_embedded' frameborder='0'></iframe></div>
<br /></div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com9tag:blogger.com,1999:blog-5209216807589901990.post-4960030753076210652013-08-11T07:41:00.000-07:002013-08-11T07:41:51.333-07:00Indentation of program by c++<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />
#include<fstream><br />
#include<stack><br />
using namespace std;<br />
class Indentation<br />
{ char store[500000];<br />
int numofchar;<br />
public:<br />
void readFile(ifstream &inp);<br />
void indentData();<br />
void printSpace(int &s);<br />
};<br />
int main()<br />
{Indentation f;<br />
ifstream f1("filetobeindented.txt");<br />
f.readFile(f1);<br />
f.indentData();<br />
return 0;<br />
}<br />
<br />
<br />
void Indentation::readFile(ifstream &inp)<br />
{int i;<br />
inp.unsetf(ios::skipws); //include white space in read<br />
for(i=0;!inp.eof();i++)<br />
inp>>store[i];<br />
numofchar=i-1;<br />
}<br />
void Indentation::printSpace(int &s)<br />
{<br />
for(int k=0;k<s;k++) cout<<" ";<br />
}<br />
void Indentation::indentData()<br />
{ stack<char> symbol;<br />
<br />
stack<int> symbolspacegap;<br />
int cntsymbolgap=0,s=0,k;<br />
for(int i=0;i<numofchar;i++)<br />
{ cntsymbolgap++;<br />
switch(store[i])<br />
{case '#' :{ for(;store[i]!='>';i++)<br />
cout<<store[i];<br />
cout<<">\n";<br />
break;<br />
}<br />
case '\n': printSpace(s);cntsymbolgap=0;break;<br />
case ';' : cout<<store[i]<<endl; printSpace(s);break;<br />
case '{' :{ cout<<endl;<br />
printSpace(s);<br />
cout<<store[i]<<endl;<br />
printSpace(s);<br />
symbol.push(store[i]);<br />
symbolspacegap.push(s);s++;<br />
break;<br />
}<br />
case '}':{cout<<endl;<br />
printSpace(symbolspacegap.top());<br />
cout<<store[i]<<endl;<br />
symbol.pop();symbolspacegap.pop();<br />
break;<br />
}<br />
case '(' :{ for(;store[i]!=')';i++)<br />
cout<<store[i];cout<<")";break;<br />
}<br />
<br />
default:{cout<<store[i];}<br />
}<br />
}<br />
<br />
}<br />
<div>
<br /></div>
</div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-46105698961480738522013-08-11T01:28:00.001-07:002013-08-11T01:32:09.354-07:00converting infix to postfix expressions using stack<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />
#include<stack><br />
#include<string><br />
#include<cstdlib><br />
<br />
using namespace std;<br />
<br />
class Infix2postfix<br />
{char infix[50];<br />
char postfix[50];<br />
<br />
<br />
public:<br />
void readData()<br />
{<br />
cout<<"Enter infix epression";<br />
cin.getline(infix,50);<br />
}<br />
int priorityOf(char sym)<br />
{<br />
switch(sym)<br />
{<br />
case '*':<br />
case '/':return 2; break;<br />
case '+':<br />
case '-':return 1; break;<br />
case '(':return 0;break;<br />
default: cout<<"Unknown symbol "<<sym;exit(1);<br />
}<br />
}<br />
<br />
void infix2Postfix()<br />
{ stack<char> s;<br />
<br />
int i,p=0;char c;<br />
for(i=0;infix[i]!='\0';i++)<br />
{<br />
while(infix[i]==' ' || infix[i]=='\t') i++;<br />
<br />
if(isdigit(infix[i])) postfix[p++]=infix[i];<br />
else if(infix[i]=='(') s.push(infix[i]);<br />
else if(infix[i]==')')<br />
{ if(s.empty())<br />
{<br />
cout<<"There is no ( corresponding to ) in infix expression";exit(1);<br />
}<br />
while(s.top()!= '(' )<br />
{<br />
postfix[p++]=s.top();<br />
s.pop();<br />
}<br />
s.pop();<br />
<br />
}<br />
else if (infix[i]=='*' ||infix[i]=='/' ||infix[i]=='+' ||infix[i]=='-' )<br />
{ if(s.empty()) s.push(infix[i]);<br />
else if(priorityOf(infix[i])>priorityOf(s.top()))<br />
s.push(infix[i]);<br />
else<br />
{<br />
while(priorityOf(s.top())>=priorityOf(infix[i]))<br />
{<br />
postfix[p++]=s.top();<br />
s.pop();<br />
<br />
if(s.empty()) break;<br />
<br />
}<br />
s.push(infix[i]);<br />
}<br />
}<br />
<br />
}<br />
while(!s.empty())<br />
{ postfix[p++]=s.top();<br />
s.pop();<br />
<br />
}<br />
cout<<"\nEquivalent postfix expresion : ";<br />
for(int k=0;k<p;k++)<br />
cout<<postfix[k]<<" ";<br />
}<br />
};<br />
int main()<br />
{Infix2postfix e;<br />
e.readData();<br />
e.infix2Postfix();<br />
return 0;<br />
}<br />
<div>
<br /></div>
</div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-39091921390940616002013-08-11T01:27:00.002-07:002013-08-11T01:27:39.908-07:00Evaluating postfix expressions using stack<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />
#include<cstdlib><br />
#include<stack><br />
using namespace std;<br />
class Postfix<br />
{public:<br />
<br />
char exp[50];<br />
int char2integer(char x)<br />
{<br />
return(x-'0'); //he character encodings for digits in AscII are all in order from 48 (for '0') to 57 (for '9').<br />
}<br />
void inputdata()<br />
{ cout<<"Enter postfix expression\n";<br />
cin.getline(exp,50);<br />
}<br />
void evaluatepostfix()<br />
{ stack<int> store;<br />
int j=0,num,first,second,result;<br />
<br />
<br />
<br />
for(;exp[j]!='\0';j++)<br />
{while( exp[j]==' ' || exp[j]=='\t') j++;<br />
<br />
if(exp[j]>='0' && exp[j]<='9')<br />
{<br />
num =char2integer(exp[j]);<br />
store.push(num);<br />
}<br />
else<br />
{<br />
first=store.top();store.pop();<br />
second=store.top();store.pop();<br />
switch(exp[j])<br />
{<br />
case '*' :result=second * first; store.push(result);break;<br />
case '/' :result=second / first; store.push(result);break;<br />
case '+' :result=second + first; store.push(result);break;<br />
case '-' :result=second - first; store.push(result);break;<br />
default :cout<<"unknown operator \n";exit(1);<br />
}<br />
<br />
}<br />
<br />
}<br />
cout<<"After evaluating postfix expression, result is :"<<store.top();<br />
}<br />
};<br />
int main()<br />
{Postfix ex;<br />
ex.inputdata();<br />
ex.evaluatepostfix();<br />
return 0;<br />
}<br />
<br />
<br />
<br /></div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-78116057314630965042013-08-05T09:34:00.001-07:002013-08-14T11:35:03.971-07:00Graphical representation of frequency of data contained in a file<div dir="ltr" style="text-align: left;" trbidi="on">
If sourcefile.txt contains the following data<br />
a 2 ab 10 2 ab 10 2 2 10 8<br />
<br />
then the graph in graph.txt file would be<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>*<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>*<span class="Apple-tab-span" style="white-space: pre;"> </span>*<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>*<span class="Apple-tab-span" style="white-space: pre;"> </span>* <span class="Apple-tab-span" style="white-space: pre;"> </span>*<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
* <span class="Apple-tab-span" style="white-space: pre;"> </span>* <span class="Apple-tab-span" style="white-space: pre;"> </span>*<span class="Apple-tab-span" style="white-space: pre;"> </span>*<span class="Apple-tab-span" style="white-space: pre;"> </span>*<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
a<span class="Apple-tab-span" style="white-space: pre;"> </span>2<span class="Apple-tab-span" style="white-space: pre;"> </span>ab<span class="Apple-tab-span" style="white-space: pre;"> </span>10<span class="Apple-tab-span" style="white-space: pre;"> </span>8<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
<br />
<br />
#include<iostream><br />
#include<fstream><br />
<br />
using namespace std;<br />
class Graphview<br />
{public:<br />
int big;<br />
int biggest(int num[],int numofelements);<br />
void showfreqgraph(string store[],int storefreq[],int numofelements,ofstream &output);<br />
void computefrequency(ifstream &input,string store[],int storefreq[],int &numofelements);<br />
<br />
<br />
<br />
};<br />
int main()<br />
{ ifstream input("sourcefile.txt");<br />
ofstream output("graph.txt");<br />
string store[100];int storefreq[100];<br />
<br />
int numofelements=0;<br />
Graphview one;<br />
one.computefrequency(input,store,storefreq,numofelements);<br />
one.showfreqgraph(store,storefreq,numofelements,output);<br />
return 0;<br />
}<br />
int Graphview::biggest(int num[],int numofelements)<br />
{ int big=0;<br />
for(int i=0;i<numofelements;i++)<br />
{<br />
if(num[i]>big)<br />
big=num[i];<br />
}<br />
return big;<br />
}<br />
void Graphview:: showfreqgraph(string store[],int storefreq[],int numofelements,ofstream &output)<br />
{ for(int k=0;k<numofelements;k++)<br />
cout<<store[k]<<"\t----> "<<storefreq[k]<<endl;<br />
cout<<endl<<endl;<br />
int i;<br />
big=biggest(storefreq,numofelements);<br />
int freqprintstart[big];<br />
for(i=0;i<numofelements;i++)<br />
freqprintstart[i]=big-storefreq[i];<br />
<br />
<br />
for(int line=0;line<big;line++)<br />
{<br />
for(int k=0;k<numofelements;k++)<br />
{<br />
if(line>=freqprintstart[k])<br />
{cout<<"*\t";<br />
output<<"*\t";<br />
}<br />
else<br />
{cout<<"\t";<br />
output<<"\t";<br />
}<br />
}<br />
cout<<endl;<br />
output<<endl;<br />
<br />
}<br />
<br />
for(i=0;i<numofelements;i++)<br />
{ cout<<store[i]<<"\t";<br />
output<<store[i]<<"\t";<br />
<br />
<br />
}<br />
}<br />
<br />
void Graphview::computefrequency(ifstream &input,string store[],int storefreq[],int &numofelements)<br />
{ int i,j,k,c;<br />
string x[50];<br />
for(i=0;!input.eof();i++)<br />
input>>x[i];<br />
cout<<"number of elements from file:" <<i-1<<endl;<br />
<br />
for(j=0;j<i;j++)<br />
{c=1;int remember;<br />
for(k=j+1;k<i;k++)<br />
{ if(x[j]==x[k])<br />
{c++;i--;remember=k;<br />
while(remember<i)<br />
{ x[remember]=x[remember+1];<br />
remember++;<br />
}<br />
k--;<br />
}<br />
}<br />
store[j]=x[j];<br />
storefreq[j]=c;<br />
}<br />
numofelements=j-1;<br />
<br />
<br />
}<br />
<div>
<br /></div>
</div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-66722394663855674882013-08-05T09:30:00.005-07:002013-08-05T09:30:53.209-07:00intersection of data contained in 2 files<div dir="ltr" style="text-align: left;" trbidi="on">
If set1.txt contain 5 6 7 9 4 10 3 2 and set2.txt contain 89 8 10 45 11 5<br />
then Intersection.txt would contain 5 10 <br />
<br />
<br />
#include<iostream><br />
#include<fstream><br />
#include<cstdlib><br />
#include<cmath><br />
using namespace std;<br />
class Intersection<br />
{public:<br />
void Read2Files(ifstream &input1 ,ifstream &input2, string store1[],string store2[] ,int &storecount1,int &storecount2 );<br />
void copy2fileintersection(string store1[],string store2[],int &storecount1,int &storecount2, ofstream &output); //set has no repition of elements<br />
<br />
};<br />
<br />
int main()<br />
{<br />
<br />
int storecount1=0,storecount2=0,k;<br />
string store1[50],store2[50];<br />
<br />
ifstream f1("set1.txt"),f2("set2.txt");<br />
ofstream f3("Intersection.txt");<br />
if(f3.fail())<br />
{<br />
cout<"The file to be written not accessed";<br />
exit(1);<br />
}<br />
Intersection group;<br />
<br />
<br />
group.Read2Files(f1 ,f2,store1,store2,storecount1,storecount2 );<br />
<br />
group.copy2fileintersection(store1,store2,storecount1,storecount2,f3);<br />
<br />
<br />
<br />
<br />
return 0;<br />
}<br />
<br />
void Intersection::Read2Files(ifstream &input1 ,ifstream &input2, string store1[],string store2[] ,int &storecount1,int &storecount2 )<br />
{<br />
if(input1.fail()|| input2.fail())<br />
{<br />
cout<<"Files to be read accessing failed";<br />
exit(1);<br />
}<br />
<br />
int i,j;string element;<br />
for(i=0;!input1.eof();i++)<br />
{input1>>element;<br />
store1[i]=element;<br />
<br />
}<br />
for(j=0;!input2.eof();j++)<br />
{input2>>element;<br />
store2[j]=element;<br />
<br />
}<br />
storecount1=i-1; storecount2=j-1;<br />
<br />
}<br />
<br />
<br />
void Intersection::copy2fileintersection(string store1[],string store2[],int &storecount1,int &storecount2, ofstream &output) //set has no repition of elements<br />
{<br />
int i,j;<br />
for(i=0;i<storecount1;i++)<br />
{<br />
for(j=0;j<storecount2;j++)<br />
{<br />
if (store1[i]==store2[j])<br />
{cout<<store1[i]<<" ";<br />
output<<store1[i]<<" ";<br />
break;<br />
}<br />
<br />
}<br />
<br />
}<br />
cout<<"\nIntersection of elements copied to file";<br />
}<br />
<div>
<br /></div>
</div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-71538146478187943012013-08-05T09:26:00.003-07:002013-08-05T09:26:52.495-07:00Union of data contained in 2 files <div dir="ltr" style="text-align: left;" trbidi="on">
if set1.txt file contains 2 3 56 4 5 7 and set2.txt contains 8 5 4 9 7 85<br />
Union.txt file would contain 2 3 56 4 5 7 8 9 85<br />
<br />
<br />
<br />
#include<iostream><br />
#include<fstream><br />
#include<cmath><br />
#include<cstdlib><br />
using namespace std;<br />
class Unionofelements<br />
{public:<br />
string element;<br />
void read2files(ifstream &input1 ,ifstream &input2, string store[] ,int &storecount );<br />
void copyunion2file(string store[],int &storecount, ofstream &output); //set has no repition of elements<br />
<br />
};<br />
<br />
int main()<br />
{Unionofelements group;<br />
string store[100]; int storecount=0;<br />
ifstream f1("set1.txt"),f2("set2.txt");<br />
ofstream f3("Union.txt");<br />
if(f3.fail())<br />
{<br />
cout<"The file to be written not accessed";<br />
exit(1);<br />
}<br />
group.read2files(f1,f2,store,storecount);<br />
group.copyunion2file(store,storecount,f3);<br />
return 0;<br />
<br />
}<br />
<br />
void Unionofelements::read2files(ifstream &input1 ,ifstream &input2, string store[] ,int &storecount )<br />
{ int i;<br />
for(i=0;!input1.eof();i++)<br />
{input1>>element;<br />
store[i]=element;<br />
}<br />
i--; //note this<br />
for(;!input2.eof();i++)<br />
{input2>>element;<br />
store[i]=element;<br />
}<br />
i--;<br />
storecount=i;<br />
for(int k=0;k<i;k++) //displaying elements from both sets<br />
cout<<store[k]<<" ";<br />
cout<<"\nnumber of elements : "<<i<<endl;<br />
}<br />
<br />
void Unionofelements::copyunion2file(string store[],int &storecount, ofstream &output) //set has no repition of elements<br />
{int i,j,remember;<br />
for(i=0;i<storecount;i++)<br />
{ for(j=i+1;j<storecount;j++)<br />
{if (store[i]==store[j])<br />
{remember=j;storecount--;<br />
for(;remember<storecount;remember++)<br />
store[remember]=store[remember+1];<br />
j--;<br />
}<br />
<br />
}<br />
cout<<store[i] <<" ";<br />
output<<store[i]<<" ";<br />
}<br />
<br />
cout<<"\nUnion of elements copied.....";<br />
<br />
}<br />
<div>
<br /></div>
</div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-46594064455051731842013-08-05T09:23:00.003-07:002013-08-05T09:23:45.303-07:00Merging 2 sorted files into another file (sorted)<div dir="ltr" style="text-align: left;" trbidi="on">
If file1.txt contains 6 7 8 9 10 12 48 and file2.txt contains 1 3 5 11<br />
<br />
Outfile.txt would contain 1 3 5 6 7 8 9 10 11 12 48<br />
<br />
#include<iostream><br />
#include<fstream><br />
#include<cstdlib><br />
using namespace std;<br />
int main()<br />
{ifstream f1("File1.txt");<br />
ifstream f2("File2.txt");<br />
ofstream outfile("Outputfile.txt");<br />
if(f1.fail()||f2.fail()||outfile.fail())<br />
{<br />
cout<<"File accesing failed";<br />
exit(1);<br />
}<br />
int c,x;<br />
f1>>c;<br />
f2>>x;<br />
while(!f1.eof() || !f2.eof())<br />
{<br />
if(f1.eof())<br />
{ while(!f2.eof())<br />
{ cout<<x<<" ";<br />
outfile<<x<<" ";<br />
f2>>x;<br />
}<br />
}<br />
else if(f2.eof())<br />
{<br />
while(!f1.eof())<br />
{ cout<<c<<" ";<br />
outfile<<c<<" ";<br />
f1>>c;<br />
}<br />
}<br />
<br />
else if(c > x)<br />
{ cout<<x<<" ";<br />
outfile<<x<<" ";<br />
f2>>x;<br />
}<br />
else<br />
{ cout<<c<<" ";<br />
outfile<<c<<" ";<br />
f1>>c;<br />
}<br />
<br />
}<br />
f1.close();<br />
f2.close();<br />
outfile.close();<br />
<br />
<br />
return 0;<br />
<br />
}<br />
<div>
<br /></div>
</div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-61897213068608913192013-02-19T05:57:00.002-08:002013-02-19T05:57:28.638-08:00To display the roman numeral of given number<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />using namespace std;<br />int main()<br />{<br /> int n;<br /> cout<<"Enter number to display equivalent roman numeral\n";<br /> cin>>n;<br /> for (;n>=1000;n-=1000)<br /> cout<<"M";<br /> for (;n>=900;n-=900)<br /> cout<<"CM";<br /> for (;n>=500;n-=500)<br /> cout<<"D";<br /> for (;n>=400;n-=400)<br /> cout<<"CD";<br /> for (;n>=100;n-=100)<br /> cout<<"C";<br /> for (;n>=90;n-=90)<br /> cout<<"XC";<br /> for (;n>=50;n-=50)<br /> cout<<"L";<br /> for (;n>=40;n-=40)<br /> cout<<"XL";<br /> for (;n>=10;n-=10)<br /> cout<<"X";<br /> for (;n>=9;n-=9)<br /> cout<<"IX";<br /> for (;n>=5;n-=5)<br /> cout<<"V";<br /> for (;n>=4;n-=4)<br /> cout<<"IV";<br /> for (;n>=1;n-=1)<br /> cout<<"I";<br /><br /><br /> return 0;<br />}<br />
<br />
<br />
Do visit<br />
http://facebook.com/csedevgroup<br />
http://devendradora.blogspot.in/<br />
http://computersciencedora.blogspot.in/<br />
<br /></div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-38818709383152032722013-02-19T05:38:00.002-08:002013-04-11T09:19:24.654-07:00To count the number of occurences of characters in a sentence<div dir="ltr" style="text-align: left;" trbidi="on">
<br />
<br />
#include<iostream><br />
#include<conio.h><br />
#include<cstring><br />
#include<string><br />
using namespace std;<br />
int main()<br />
{string a;<br />
cout<<"enter some text :\n\n";<br />
getline(cin,a);<br />
<br />
int l=a.length(),c=1,j,k,i,m; //c for counting the number of occourences which is stored in freq<br />
int freq[l];<br />
for(j=0;j<l;j++)<br />
{freq[j]=c;<br />
for( k=j+1;k<l;k++)<br />
{ if(a[j]==a[k]) //a[j] is compared with all of the remaining of characters, if<br />
{freq[j]=++c; //it is equal to any of the character , count of freq[j]<br />
for( m=k;m<l-1;m++) //corresponding to a[j] is increased.a[k] equal to a[j] is <br />
a[m]=a[m+1]; // replaced by a[k+1].similarly a[k+1] by a[k+2].... so on<br />
k--;l--;<br />
}<br />
}c=1;<br />
}<br />
<br />
cout<<"character\tFrequency\n";<br />
for(i=0;i<l;i++)<br />
cout<<a[i]<<"\t\t"<<freq[i]<<endl;<br />
<br />
<br />
getch();<br />
return 0;<br />
}<br />
<div>
<br /></div>
</div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-91883820211607060302013-02-19T05:26:00.002-08:002013-02-19T05:26:32.714-08:00Ragged matrix<div dir="ltr" style="text-align: left;" trbidi="on">
ragged matrix is that which has unequal number of elements in the each row<br />
#include<iostream><br />using namespace std;<br />#include<conio.h><br />int main()<br />{int r,j,i,pos[]={2,1,3,5,7,4,6,9,10,8,11,13,12,15,14};<br />cout<<"enter how many rows u want to display of a ragged matrix";<br />cin>>r;int a[r][15];<br />cout<<"Enter the elements\n";<br />int s=1,n;<br />for(i=0;i<r;i++)<br /> { for(j=0;j<pos[i];j++)<br /> cin>>a[i][j];<br /> }<br />cout<<"\n\n\n\n";<br />for(i=0;i<r;i++)<br /> { for(j=0;j<pos[i];j++)<br /> cout<<a[i][j]<<" ";<br /> cout<<endl;<br /> }<br /> getch();<br />}<br /></div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-46655500393213425262013-02-19T05:19:00.001-08:002013-02-19T05:28:16.666-08:00convert decimal to hexadecimal number(using arrays)<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />#include<math.h><br />using namespace std;<br />int main()<br />{ int dec,i=0,store[20];<br />cout<<"decimal number please.....\n";<br />cin>>dec;<br />while(dec!=0)<br />{ store[i]=dec%16; //remainder represents hexadecimal equivalent<br /> dec=dec/16;<br /> i++;<br />}<br />for(;i>=0;i--)<br />{if(store[i]>=10)<br /> cout<<(char)(store[i]+55); //55 added to give equivalent ASCII value<br /> else<br /> cout<<store[i];<br /><br />}<br /><br />return 0;<br />}<br /></div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-20364488717975272862013-02-19T05:15:00.011-08:002013-02-19T05:15:50.484-08:00convert decimal number to hexadecimal number(Basic method)<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />#include<math.h><br />using namespace std;<br />int main()<br />{ int dec,i,maxi,rem,q,s;<br />cout<<"decimal number please.....\n";<br />cin>>dec;rem=dec;<br />for(i=1;dec>pow(16,i);i++);<br />--i; //q=quotient represents the hexdecimal equivalent<br />for(;i>=0;i--)<br />{ s=pow(16,i);<br />q=rem/s;<br />if(q>=10)<br /> { ;cout<<(char)(q+55);} //55 added to give equivalent ASCII value<br />else<br /> cout<<q;<br /> rem=rem % s;<br />}<br />return 0;<br />}<br /></div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-34716822121019112392013-02-01T20:02:00.003-08:002013-02-01T20:02:55.549-08:00Finy any day of any century Devcalendar<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />#include<conio.h><br />using namespace std;<br />int main()<br />{<br /> long int y,i,count=0,m,d,j;<br /> cout<<"Enter day-month-year.\n";<br /> cin>>d;cout<<"/";cin>>m;cout<<"/";cin>>y;<br /> <br /> for (i=1;i<y;i++)<br /> {<br /> if ((i%400==0)||((i%4==0)&&(i%100!=0))) //checking leap year<br /> count= count+2; <br /> else<br /> count=count+1;<br /> }<br /> <br /> for(j=1;j<m;j++) //checking month<br /> {switch(j)<br /> {case 1:case 3:case 5: case 7: case 8: case 10: case 12: count=count+31;break; <br /> case 2:if ((i%400==0)||((i%4==0)&&(i%100!=0))) count=count+29; else count=count+28;break;<br /> default :count=count+30;<br /> }<br /> }<br /> count=count+d-1;<br /> switch (count%7)<br /> {<br /> case 0:cout<<"Mon\n";break;<br /> case 1:cout<<"Tues\n";break;<br /> case 2:cout<<"Wed\n";break;<br /> case 3:cout<<"Thu\n";break;<br /> case 4:cout<<"Fri\n";break;<br /> case 5:cout<<"Sat\n";break;<br /> case 6:cout<<"Sun\n";break;<br /> <br /> }<br /> <br /> getch();<br /> }<br /></div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-64765542447810481292012-12-30T08:36:00.000-08:002013-01-27T08:07:29.907-08:00How the songs are played randomly in a playlist?? This may be the algorithm<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />
#include<conio.h><br />
using namespace std;<br />
class Playlist<br />
{public:<br />
void random(); /*This function initialises the values from 1 to n and swaps the numbers for odd number count*/<br />
void swap(int &a,int &b);<br />
}; <br />
<br />
int main()<br />
{Playlist dev;<br />
dev.random();<br />
getch();<br />
}<br />
<br />
void Playlist::random()<br />
{int n,s,i,p; //present song number p<br />
cout<<"The number of songs in the playlist :"; cin>>n;<br />
int a[n],j=1;<br />
cout<<"enter the present song number : "; cin>>p; s=p;//s store <br />
a[0]=p;<br />
for(i=++p;i<=n;i++,j++)<br />
{<br />
a[j]=i;<br />
if(j%2!=0)<br />
swap(a[j-1],a[j]);<br />
} <br />
<br />
<br />
if(j!=n)<br />
{ for(i=1;i<p;i++,j++)<br />
{a[j]=i;<br />
if(j%2!=0)<br />
swap(a[j-1],a[j]);<br />
}<br />
}<br />
cout<<"\nNew playlist generated \n";<br />
for(j=0;j<n;j++)<br />
cout<<a[j]<<" "; <br />
}<br />
void Playlist::swap(int &a,int &b)<br />
{int temp=a;<br />
a=b;<br />
b=temp;<br />
}</div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-35335651669452842792012-12-22T21:36:00.001-08:002013-10-31T08:16:52.489-07:00Determinant of a nxn Matrix c++ program<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />
#include<math.h><br />
#include<conio.h><br />
using namespace std;<br />
double d=0;<br />
double det(int n,double mat[10][10]); // u can replace 10 with any number<br />
<br />
<br />
int main()<br />
{int n;<br />
cout<<"enter the order of matrix" ;<br />
cin>>n;<br />
double mat[10][10];<br />
int i,j;<br />
cout<<"enter the elements"<<endl;<br />
for(i=0;i<n;i++)<br />
for(j=0;j<n;j++)<br />
cin>>mat[i][j];<br />
cout<<"\ndeterminant "<<det(n,mat);<br />
getch();<br />
} <br />
<br />
<br />
double det(int n,double mat[10][10])<br />
double submat[10][10]; <br />
if(n==2) return( (mat[0][0]*mat[1][1])-(mat[1][0]*mat[0][1]));<br />
else<br />
{ for(c=0;c<n;c++)<br />
{ subi=0; //submatrix's i value<br />
for(i=1;i<n;i++)<br />
{ subj=0;<br />
for(j=0;j<n;j++)<br />
{if(j==c)<br />
continue;<br />
submat[subi][subj]=mat[i][j];<br />
subj++;<br />
}<br />
subi++;<br />
<br />
}<br />
d=d+(pow(-1,c)*mat[0][c]*det(n-1 ,submat));<br />
}<br />
}<br />
return d;<br />
}</div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com3tag:blogger.com,1999:blog-5209216807589901990.post-13831224067032532052012-12-21T06:10:00.003-08:002012-12-30T08:47:04.547-08:00Random generation c++ program<a href="http://computerstechnologydevdora.blogspot.in/">computerstechnologydevdora.blogspot.in</a><br />
<a href="http://devgroupindia.webs.com/">devgroupindia.webs.com</a><br />
<br />
#include<iostream> // based on the principle of prime,odd,even numbers<br />
using namespace std;<br />
#include<conio.h><br />
#include<math.h><br />
int j=0,s=1;bool prime(int num);<br />
int random(int k);<br />
int main()<br />
{ int d=100,i,num;<br />
cout<<"Enter any number :";<br />
cin>>num;<br />
cout<<"random numbers generated\n"; <br />
for( i=num;i<d;)<br />
{ cout <<abs(i)<<" ";i=random (i);}<br />
getch();<br />
}<br />
int random(int k)<br />
{ <br />
if (prime(k))<br />
return (k- ++j);<br />
else if (k%2!=0){<br />
return (k+ ++s);}<br />
else<br />
return k+ ++j;<br />
}<br />
bool prime(int num)<br />
{int c=1;for(int i=2;i<=num;i++)<br />
if(num%i==0)<br />
++c;<br />
if (c==2)<br />
return 1;<br />
else <br />
return 0;<br />
}Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-72932602973036082452012-12-18T08:43:00.000-08:002012-12-18T08:43:02.052-08:00To substract two numbers without using minus sign c++ program<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />#include<conio.h><br />using namespace std;<br />int main()<br />{int a,b,c=0,i,f;<br />cout<<"Enter two numbers to substract :";<br />cin>>a>>b;<br />if(b>a)<br />{i=a;f=b;}<br />else<br />{i=b;f=a;} // i initial value f final value<br />for( ;i<f;i++)<br /> ++c;<br />(b>a)? //conditional operators eqivalent to if (b>a)<br />cout<<a <<" - " <<b<< " = "<<(char)45<< c //ASCII value of 45 is minus -<br />: // else<br />cout<<a <<" - " <<b <<" = "<< c;<br />getch();<br />}<br />
<br />
<br />
<br />
visit <a href="http://computerstechnologydevdora.blogspot.in/">computerstechnology</a><br />
<a href="http://www.facebook.com/csedevgroup">Facebook Devgroup</a></div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-10745159198828995112012-12-18T07:55:00.003-08:002012-12-18T07:55:46.497-08:00To display the elements in a spiral way c++ program<div dir="ltr" style="text-align: left;" trbidi="on">
<br />
<br />
<br />
<br />
<br />
<br />
<br />
<img alt="" height="122" src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAL8AAABJCAIAAADjQ2BVAAAC90lEQVR4nO2WS3bEIAwEff9TcbTs8hgLKURILQa6Vh7jUfFpY56HfC2to7ovhMRipzsv8po3+23bzft6AONtAn9pea3diULz2v05z/t6oGS8WdXvSY/2DMabN9u4udVGFemY82Lsm3h/fyK9wa5hOUB6NlnC/mZJdLQupXpjxrvVEhZ6s+2ychsB8M63+ksj3waMdKZ+yRJ+pbf/p/ZmeOp6vXZ/zvNqz2R7Y8bbBPb9KHbzvppipbY31V41XkIIIWRTZj7GJZ0B26vOARivfdJyqvt/Dk9VnqILVPXBmIcDvLJyzDxrvS+JjvQyPSH17fQMH3Ca5HUhTE+45XVHi9eSoH3ir7sAWF01XsBU2+kZPhBTfbW0l5LolKgBUm19XztQTOmnejZrjVelZ8mulWB6quyY+q87S+npGTb5Ou2mUFoVnSTp5PriZ5sQQgipYeajCP40Fn6MTz1vacWXpH2ntWv5M5XCQ1zVkTnbrlVeNe6WnsItp2TDy06PNq748Rq1jk/P2fasvWemEHJO2ycY6csOlgLUuenZJDoP6hwwYz/Jm5iefaLzXJkegDQrPfZqMT1IY549Nz09kdWXu1QiRaqzvVr9qvESQgghxdiHnkvOH7IPYF22VBYP8MqTlH2dTfkJDpxazDxrW8Oql+mR9pP2PG1E8et7eXp+1SelZ6ZygFeLJ3gq2ydgr7xG2vOkRvHE6IQJXOD3vKrs9n1AVk6JznNfes72/rnEAXVnrrO5LbWY8crKMd4mGDb5Ou2jyltlTzVq62usOyGEEHIy2scP81EcFsd7YecAozLYGzBYeZKyr2MZVgYc4rRXJVVqW1JTa4/X761Kjxb87FXczTvTmuftn4kx2dex4FdxN29/EznP861OQftkqfpO0g29Wmuet78fH52ZpnV2m028t40AeOdb60r/X31ber7ba69WanT+NOL3ALx3vjXWGzPeJpBNvh6vezPUG3pT7VXjJYQQQgghhBBCCCGEEEIIIYQQQu7jB1XDXVevrVjXAAAAAElFTkSuQmCC" width="320" /><br />
Here middle element is 1 and the numbers after 1 are displayed in spiral way<br />
<br />
#include<iostream><br />#include<iomanip> // for setw(int) space generating<br />using namespace std;<br />#include<conio.h><br /><br />int main()<br />{<br />int num,r,s=1,i,c,j,k,ord;<br /><br />cout<<"Enter mid element of square matrix and get the elements in a spiral way :";<br />cin>>num;<br />cout<<"enter odd order of square matrix";<br />cin>>ord;<br />int a[ord][ord];r=ord/2;c=ord/2;a[r][c]=num; //r row c column<br />for(i=1;i<=ord;i++)<br />{if(i%2==0)<br /> {for(j=0;j<s;j++) // i =even control left side<br /> a[r][--c]=++num;<br /> for(k=0;k<s;k++)<br /> a[--r][c]=++num;<br /> }<br /> <br /> else<br /> {for(j=0;j<s;j++) //i =odd control right side<br /> a[r][++c]=++num;<br /> for(k=0;k<s;k++)<br /> a[++r][c]=++num;<br /> }<br /> s++;<br />}cout<<setw(ord);<br />for(r=0;r<ord;r++)<br />{ for(c=0;c<ord;c++)<br /> cout<<a[r][c]<<setw(ord);<br /> cout<<endl;<br />}<br />getch();<br />}<br /></div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-31887760148563994262012-12-04T22:56:00.001-08:002013-03-24T00:45:20.646-07:00To find the squareroot of a number without using sqrt() functon<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />
#include<conio.h><br />
using namespace std;<br />
<br />
int main()<br />
{ float g,r,c=0,n,pg;<br />
cout<<"enter the number to find squareroot ";<br />
cin>>n;<br />
g=n/2; pg=n; //g - guess pg - previous guess<br />
while(g!=pg) // when g==pg , then g or pg is the square root<br />
{r=n/g;<br />
pg=g;<br />
g=(g+r)/2; <br />
}<br />
cout<<"square root \t"<<g<<endl;<br />
getch(); <br />
}<br />
<br />
For more visit<br />
<a href="http://computersciencedora.blogspot.in/">http://computersciencedora.blogspot.in</a></div>
Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-26509917681846192272012-12-04T22:38:00.001-08:002012-12-04T22:38:13.282-08:00Alphabet pattern <img alt="" src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAANMAAABeCAIAAAA2S7aIAAAHAUlEQVR4nO2dW0/qXBCG+yvdxr1FPxBFDp7+lL/BxJgab0y8MV6o8ZDPVgSkLdQD6OW+aGzYLKEzs7oOyDxXSGbNetfMS1lFSh3/iziOX/DEMPq50tNIOum3a9G/3iiKwjAMgiAIgm63+/z83Ol0Op1Ou91utVqtVuvp6anZbDabTd/3Pc/7/4uHhwfP83zfbzabrVbr+fk5CIIwDKMo0lnPFCeR+/r6ur+/v8XYR+OLer1er9drtVq1Wt3c3KxUKhsbG+vr6+VyeW1trVQqFYvFYrH43xcrKyuFQmF5efnPnz/Ly8uFQqFQKKyurhaLxXK5XKlUqtVqrVar1+uNRkP/upzk1TMYDHZ2dhyG0UYYhmEYDgaD3d3d5BnXdV3XhYx1BbCjUPkJeqaPwsZL6s9dD1a5vH54/uy45E13OBzu7e2hZInTwBdDiAdKGgtTp0dDvIPRT6iPOv0gMcke9uPjY29vDzsNVplYVtWdywTVaUn9mfmBOSfFG68/rlkGnQdBxnkE/fBgIEr1iPFm62/AeSmQ4Myck4bApwDqwcaT9SvS4+hyHqE+2fGi8yxcOXz4WDw2P1aMWT3fSgIGAyHkh/qH93nweEn9uetxLKs/rlk6nScTT9DjmN7RS+Z3Zu3cVp/zXIHp8eIoVH5UZsgorHKsKpnKYPPDl0CuPzBefPw9URRFUTQcDtNPkhlGB8n/MNh5jG663W632x0MBtvb26a1MPNE8h2b9/f3ra2t5BmZfQl2FCo/QQ9qn4TaLUFQrYemnFx/4BTQyOQbXW9vb41GAyVLnAa+GEI8UNJYWO56sMjUx5m1c1sH5Z/Hx8fHx8fX19d6vU5oA2qIWFZ1TgWC7TQWmVcCNr/x+uOa5Xme53kvLy+1Wk2z8yDIOI+gH6UNgmo9VtWf6LxqtUp2XgokODPnpCHwKYB6CPFYVOshOwMIub/Z8aLzLFw5fPhYPDY/ShsE1Xqsqj/OPwbfbQlOQsVDIDQDhWo9VtUf16zkwjM9zpOJJ+hxFOzosUg6T2l9DDtP5tzWFZgeL45C5UdlhozCKsciUxmsfvgSyPUHxouPvye5NjNxHlA6w+TA6DHPtBZmnhjd55nWwswTo5+qJM/I7Euwo1D5CXrgux8bwOqnrZRcf1R/s+Pu7+/v7+/jOK5UKihZ4jTwxRDiUeYb/TNziFVg9cvUR12/QGKurq6urq6iKFpfX8dOg1UmllWdU2cUrH6r6o9r1vn5+fn5eRAExWJRs/MgyDhvFi2I1W9V/XHNOj09PT09bbfbhUKB7LwUSHBmzklD4FMA9VgIVr8e5xH6mx1/fHx8fHzcbDaXlpZcAaAy4GTanJc+Rs1lA1j9VtUf55/Dw8PDw0Pf93/9+oVtM03ZpD/l8wNjbAar36r645p1cHBwcHDged7CwoJq58nEE/Q4M3jYw+qXqc8MO88VmB4vjkLlR2VGSbIErH7aSsn1B8aLj7/n6Ojo6OjI9/3FxUWgdIbJgZOTk5OTk6enp9+/f5vWwswTZ2dnZ2dnnU5nZWXFtBZmnri4uLi4uAiCoFQqJc/Qdmy0Uaj8kORzhW37vNFR2XHX19fX19dRFJXLZZQscZr8N6H4c7d5A1sfPf0Cibm9vb29ve33+xsbG9hpsMrGAlSsfN6wqv64Zt3d3d3d3RlxHgR23nSsqj+uWckxr9fryXxXJQUSnJlz0hB2noge5xH6mx1/c3Nzc3Mz6jz4TNjJ2Hm5Y1X9cf5Jv5+3trZGaLPMyvN/Gc0fVtUf16zLy8vLy8swDEulkmrnycSz7b4FWx+l/cIllznmuQLT48VRqPyQ5HMFrT7k+udr03/2eUDpDJMDyW134zje3Nw0rYWZJ9Irvfl6W0Yr7Xa73W7b+TvJjArU7fNGR2XHpXclSO7pLTNN/ptQJm9U9wvhn9E7sRBsgRoyFsDO0wyh/uT+ZidP7ult7f1tmRwh1F+h8+I4juP48/PTzvvbMjlCdh6hvxTnwWfCTsbOM4ueYx7UP7kc81DKJv3JqIZQf3J/7XIeIZ7JF6X90uc8V2B6vDgKEs/kC7z+2P7SnQfVzjDysPMYM7DzGDOIzqPt2Hjf9vOQ2cdnx405T2YaNt/PA9tfhH80f6rCzBao/tLPbdl5zBi2Ow96gGVmDVR/ZZ2HchIf8342hGMe1D/8bstMgeA8YDA7j5mGpc7DHV2ZWQPbX7rzcpHLMCDYeYwZ2HmMGfr9fr/fT64ASp7hHRsjA9Q/o9eeOf9uKhUrZH4gCP9IXvXIMCk4/7DzmLxg5zFmkHUeb/UYGjj/8DGPyQt+t2XMwM5jzEB3nnptDPNF4rzhcMjOY7TS6/WSX25k5zFaSX8zlJ3HaIWdx5iBnceYgZ3HmIGdx5iBnceYgZ3HGOEvX7Ql9npfWsEAAAAASUVORK5CYII=" /><br />
#include<iostream><br />using namespace std; <br />#include<conio.h><br />#include<math.h><br />int main()<br />{<br /> int k=-1,j;<br />char i,m=71,n=65;<br />for(int x=1;x<=7;x++) //for number of lines 7<br />{<br /> for(i=65;i<=m;i++) //for displaying A B C ...<br /> {<br /> cout<<i<<" ";<br /> }<br /> for(j=1;j<=k;j++) //for displaying spaces<br /> {<br /> cout<<" ";<br /> }<br /> k=k+2;<br /> if(i==72)<br /> {<br /> i--;<br /> }<br />i--;<br /> for(;i>=n;i--) //for displaying alphabets in reverse<br /> {<br /> cout<<i<<" ";<br /> }<br /> m--;<br /> cout<<"\n";<br /> }<br /> getch();<br />}<br />Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-14786528417543404372012-12-04T21:22:00.003-08:002012-12-04T21:22:58.348-08:00sum of series 1+x+(x^2)/2!+..............+(x^n)/n! c++ program#include<iostream><br />
using namespace std;<br />
#include<conio.h><br />
<br />
int fact(int);<br />
#include<math.h><br />
int main()<br />
{ double sum=1;<br />
int x,i=1,n;<br />
cout<<"1+x+(x^2)/2!+............+(x^n)/n!\n\n\n\n";<br />
cout<<"enter the value of x ";<br />
cin>>x;<br />
cout<<"enter th value of n "; cin>>n;<br />
while(i<=n)<br />
{<br />
sum=sum+(pow(x,i)/fact (i));<br />
i++;<br />
}<br />
double val=(double)sum; //typecasting<br />
cout<<"sum is "<<val;<br />
getch();<br />
}<br />
<br />
int fact(int j)<br />
{<br />
int fact=1,k=1;<br />
while(k<=j)<br />
{<br />
fact=fact*k;<br />
k++;<br />
}<br />
return fact;<br />
}Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-60325984624862990312012-12-04T20:54:00.000-08:002012-12-04T20:54:51.157-08:00to convert binary number to decimal equivalent#include<iostream><br />using namespace std;<br />#include<conio.h><br />#include<math.h><br /><br /> int main()<br />{ int n,i,sum,rem;<br /> sum=0,i=0;<br /> cout<<"enter the binary number ";<br /> cin>>n;<br /> while(n!=0)<br /> { if((n%10==0) || (n%10==1))<br /> {rem=n%10;<br /> sum=sum+(rem*pow(2,i));<br /> n=n/10;<br /> ++i;<br /> }<br /> else {cout<<"entered number is not binary";goto a;}<br /> }<br /> cout<<"the decimal number is:"<<sum;<br /> a:<br /> getch();<br />}Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-45459314861883248672012-11-25T12:09:00.001-08:002012-11-25T12:09:12.583-08:00To substract two numbers without using minus sign c++ program#include<iostream><br />
#include<conio.h> <br />
using namespace std;<br />
<br />
int main()<br />
{<br />
cout<<"enter two numbers";<br />
cin>>a>>b;<br />
cout<<"substracting a-b ="<<a+~b+1;<br />
getch();<br />
}Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0tag:blogger.com,1999:blog-5209216807589901990.post-22353852101484446982012-11-25T12:00:00.003-08:002012-11-25T12:10:21.169-08:00To display the new world of programming without using semicolon in c++ program #include <iostream><br />
#include<conio.h> <br />
using namespace std ;<br />
int main()<br />
{<br />
while(cout<<"the new world of programming ") \\no semicolon here<br />
getch();<br />
}<br />
<br />
<br />
By devendra dora<br />
<br />Devendra Dorahttp://www.blogger.com/profile/16831790932164435227noreply@blogger.com0