Programmers blog

2015-07-26T21:03:00.001-07:00

Towards Energy Efficient Big Data Gathering In Densely Distributed Sensor Networks

INTRODUCTION:- Recent development of various areas of Information and Communication Technology (ICT) has contributed to an explosive growth in the large amount of data. According to a report published by IBM. 90 percent of the data in the world was generated in the last couple of years. In the recent years big data concept has emerged widely, which is currently attracting much attention from government, industry, and academia. As shown in Fig. 1, the big data comprises high volume, velocity, and variety information assets, which are difficult to collect, store, and process by using the available technologies.

The variety indicates that the data is of highly varied structures (e.g. data generated by a wide range of sources such as Machine-to-Machine (M2M), Radio Frequency Identification(RFID), and sensors) while the velocity refers to the high speed processing/analysis processing/analysis (e.g., fast database transactions, click-streaming, and so forth). Although currently used services (e.g. social networks, network switches, cloud storage and so forth) are already generating much volume of the big data it is anticipated that more and more data will be generated by sensors/RFID devices such as motion sensors, accelerometers, atmospheric sensors,, thermometric sensors,and so on. In fact, according to a report by ORACLE the volume of data devices and sensors and RFID sensors is expected to reach the order of petabytes.As shown in Fig. 1, the sensors are responsible for generation of big data in big volume and also in a wide varietygenerated by RFID.

AIM:- To propose an effective solution to reduce the energy consumption in the sensor networks and to utilize the sink node’s mobility to facilitate the data gathering. Here, a new mobile sink routing and data gathering method through network clustering based on modified ExpectationMaximization (EM) technique.

Synopsis:- Mobile wireless sensor networks can simply be defined as a wireless sensor network (WSN) in which the sensor nodes are mobile. Sensor networks are smaller, when they emerge into field of research in contrast to their well-established predecessor.

Sensor Networks are much more versatile than static sensor networks as they can be deployed in any scenario and cope with rapid topology changes. Commonly the nodes consist of a radio transceiver and a micro controller powered by a battery. Also some kind of sensor for detecting heat, light, humidity, temperature, etc.

In this section, we first outline the clustering problem in WSN using mobile sink and the challenges in solving this problem. After that, we introduce the considered network model and the overview of EM algorithm for clustering. Based on EM algorithm, we proposed our clustering method and the procedure to gather data using the proposed method.

Twitter is a well-known social and micro-blogging website which allows millions of users to interact over different types of communities, topics, and tweeting trends. The big data being generated on Twitter daily, and its impact on social networking, has motivated the applications of data mining (analysis) to extract necessary information from tweets. In this paper, we find the impact of tweets based on the spectral clustering.

Existing System:- The systems are used in many situations recently and provide various information. Although they play an important role in our life, their performance is not sufficient in terms of real time data collection. We discuss the requirements for the next generation data gathering.

Although the sensor networks have provided essential services, there are some shortcomings such as their coverage’s and mobility, many of the existing systems for sensor networks based on wired or wireless ground infrastructures are used to collect data from sensor terminals. But the coverage of the networks is limited and creating new infrastructure for remote areas is difficult for both economical and physical reasons.

Drawbacks Of Existing System:- The network is divided to some subnetworks because of the limited wireless communication range. For example, sensors deployed or placed in a building may not be able to communicate with the sensors which are distributed in the neighboring buildings. Therefore, limited communication range wil pose a challenge for data collection from all sensor nodes.

The wireless transmission consumes the energy of the sensors. Even though the large amount of data generated by an individual sensor is not significant, each sensor consumes lot of energy to relay the data generated by surrounding sensors.

Proposed System:- The main motivation is to focus on the effect of data request messages by increasing the number of clusters. Based on a common data gathering model of the densely distributed WSNs, we demonstrate that the number of data request messages has a noticeable impact on the energy consumption of the sensor nodes. When the connectivity of the nodes increases, the impact also becomes bigger.

The mobile sink is responsible to collects the data from the nodes in the cluster. It is easy to see that delay is main problems of using mobile sink in WSNs .To shorten this delay we implemented Expectation Maximization (EM) algorithm.

Modules:-

Cluster Creation:- WSN are autonomous systems consisting of mobile hosts that are connected by multi hop wireless links. In this cluster head (CH) is elected according to its weight computed by combining a set of system parameters (Mobility). Sensor nodes are equipped with store sensed information until mobile sink approaches the cluster centroid.

The network consists of a mobile sink and sensor nodes that spread within a limited field. Every sensor node knows its location, and the mobile sink knows all nodes locations.

Twitter Data Generation:- Twitter is a highly popular platform for information exchange, can be used as a data-mining source which could aid in the aforementioned challenges which is collected by sensor nodes. Specifically, using a large data set of harvested tweets, sensor nodes connect with sink to transfer the dataset to HDFS system.

The REST APIs provides programmatic access to write and read Twitter data. And also REST API identifies Twitter applications and responses are available in JSON.

EM computation:- The sink node sends data request message to cluster head to invoke data transmission from sensor nodes when it arrives at the cluster centroids. The nodes that receive data request message send the data to the sink node and broadcast data request message to their neighboring nodes using multi hop traversal. It was realized that clustering can be based on probability models to cover the missing values. This has led to the development of new clustering methods such as Expectation

Maximization (EM) that is based on the principle of Maximum Likelihood of unobserved variables in finite mixture models.

Data collection:- Once, the mobile sink patrols every cluster centroid and collects the data from the nodes in the cluster. This leads to transfer the sensor data to HDFS system with less energy consumption. The spectral clustering is performed to perform data analytics based on the Hash tag, Location and retweet count.

Motivation:- The following challenges and benefits give us the motivation to developing this product.

Challenges:-

We first outline the clustering problem in WSN using mobile sink and the challenges in solving this problem. After that, we introduce the considered network model and the overview of EM algorithm for clustering. Based on EM algorithm, we proposed our clustering method and the procedure to gather data using the proposed method.

Architecture Diagram:-

Our implementation suggested that energy efficient big data gathering in such networks is, indeed, necessary. Where as the conventional mobile sink schemes can reduce energy consumption of the sensor nodes, they lead to a number of challenges such as determining the sink node’s trajectory and cluster formation prior to data collection. To point out these challenges, we proposed a mobile sink based data collection method by introducing a new clustering method. Here clustering method uses a modified Expectation Maximization technique.

IMPLEMENTATION:-

Implementation literally means to put into effect or to carry out. The system implementation phase of the software deals with the translation of the design specifications into the source code. The ultimate goal of the implementation is to write the source code and the internal documentation so that it can be verified easily. The code and documentation should be written in a manner that eases debugging, testing and modification. System flowcharts, sample output,sample run on packages, etc. Is part of the implementation?

Various types of bugs were discovered while debugging the modules. These ranged from logical errors to failure on account of various processing cases.

System Implementation:-

A post-implementation review is an evaluation of the extent to which the system accomplishes stated objectives and actual project costs exceed initial estimates.

After the system is implemented and conversion is complete, a review should be conducted to determine whether the system is meeting expectations and where improvements are needed. A post implementation review measures the systems performance against predetermined requirements. It determines how well the system continues to meet performance specifications. It also provides information to determine whether major re-design or modification is required.

There are five things in consideration when the project is developed. They are as follows:-

v Adaptation

v Prevention/Integrity

v Enhancement

v Correction

Adaptation/Enhancement:-

In this Project a high performance data synchronization server for mobile device is proposed. For the mobile application system, the information or data (ex. Contacts, Music, Video, Image) sets are usually stored in both the mobile device and system database. After several operations for the mobile system, the data sets between the mobile device and system database may become not identical..

Prevention/Integrity:-

Security has been the measure aspect in the prevailing system and is to be considered the primary key for any successful of the project. The software developed here, Mobile-Sync, has been given a full security providing each TESTERS with their access. We know that:

Integrity= [1-

(security*(1-threat)]

Every measure is employed to secure the system from any types of threats. Integrity has been tried to maintain to its accuracy.

Correction:-

The project is corrective to its end and all the validation has been incorporated to software developed so that no further corrective action can be thought of.

NOTE:-

The software has been developed keeping in mind the requirements of the Share Investors to share application. One of the most important factors in developing any application is experience. Due to lack of experience, We might have overlooked some things that should be put into consideration.

Maintenance:-

Maintenance activities involve making enhancements to software products, adapting products to new environments, and correcting problems. Adaptation of software to a new environment may involve moving the software to a different machine. Problem correction involves modification and revalidation of software to correct errors.

Maintenance activities consume a large portion of the total life cycle budget. Software Maintenance accounts for 70 percent of total software life-cycle costs. Maintenance includes 60 percent of maintenance budget for enhancement, and 20 percent each for adaptation and correction. The primary product attributes that contribute to software maintainability are clarity, modularity, and good internal documentation of the source code, as well as appropriate supporting documents.

Documentation:-

Documentation is a method of communication. A satisfactory documentation of the system should be objective, factual and complete. Thus format, length, volume or complexity does not determine its adequacy. In documentation, there are no uniform standards that are applicable to all system projects.

Embedding Comments in the executable portion of the code did proper documentation of each module. To enhance the readability of the comments, indentation, parenthesis, blank lines and spaces, proper lining of the loops were used around the block of comments. Care was also taken to use descriptive names of tables, fields, modules, forms etc. The proper use of indentation, parenthesis, blank lines and spaces were also ensured during coding to enhance the readability of the code.

REFERENCES:-

[1] IBM, “Four vendor views on big Data and big data analytics: IBM,” http://www.01.ibm.com/software/in/data/bigdata/, Jan. 2012.

[2] A. Divyakant, B. Philip, and et al., “Challenges and opportunities with Big Data,” 2012, a community white paper developed by leading researchers across the United States.

[Online].

Available:http://cra.org/ccc/docs/init/bigdatawhitepaper.pdf.

S. Sagiroglu and D. Sinanc, “Big data: A review,” in International Conference on Collaboration Technologies and Systems (CTS), 2013

[3] D. Baum and CIO Information

Matters, “Big Data, big opportunity,” http://www.oracle.com/us/ccentral/ciosolutions/informationmatters/big-databig-opportunity/index.html.

[4] L. Ramaswamy, V. Lawson, and S. Gogineni, “Towards a qualitycentric big Data architecture for federated sensor services,” in IEEE International Congress on Big Data (BigData

Congress), 2013.

[5] C.-C. Lin, M.-J. Chiu, C.-C. Hsiao, R.G. Lee, and Y.-S. Tsai, “Wireless health care service system for elderly with dementia,” IEEE Transactions on Information Technology in

[6] Biomedicine, vol. 10, no. 4, pp. 696– 704, 2006.

[7] P. Ross, “Managing care through the air [remote health monitoring],” IEEE Spectrum, vol.41, no. 12, pp. 26-31,2004

WRITE A C++ PROGRAM THAT USES A SINGLE FILE FOR BOTH READING AND WRITING THE DATA

2013-04-08T10:18:00.000-07:00

/* WRITE A C++ PROGRAM THAT USES A SINGLE FILE FOR BOTH READING
AND WRITING THE DATA*/
#include<iostream.h>
#include<conio.h>
#include<fstream.h>
void main()
{
char name[20];
int regno;
double perc;
clrscr();
ofstream writefile("nagaraj.dat");
cout<<"\nENTER YOLUR NAME:";
cin>>name;
writefile<<name<<endl;
cout<<"\nENTER YOUR REGNO:";
cin>>regno;
writefile<<regno<<endl;
cout<<"\nENTER YOUR PERCENTAGE:";
cin>>perc;
writefile<<perc<<endl;
writefile.close();
cout<<"\nFILE CREATED SUCCESSULLY........\n";
ifstream readfile("nagaraj.dat");
readfile>>name;
readfile>>regno;
readfile>>perc;
cout<<"\nCONTENTS OF THE FILE NAGARAJ.DAT IS READ AS FOLLOWS......\n";
cout<<"\nSTUDENT NAME:"<<name<<endl;
cout<<"\nSTUDENT REGISTER NUMBER:"<<regno<<endl;
cout<<"\nSTUDENT PERCENTAGE:"<<perc<<endl;
getch();
}

C++ Program To Illustrate Manipulators

2013-04-08T10:16:00.001-07:00

/*WRITE A C++ PROGRAM TO ILLUSTRATE THE USE OF MANIPULATORS AND I/OS FUNCTION*/
#include<iostream.h>
#include<conio.h>
#include<iomanip.h>
#include<math.h>
void main()
{
clrscr();
long int sqrno;
int i;
float sq;
cout<<"TO DISPLAY SQUARE AND SQUARE ROOT OF THE NUMBERS 2 TO 20\n";
cout<<"----------------------------------------------------------------------";
cout<<setw(20)<<"NUMBER"<<setw(20)<<"SQUARE"<<setw(20)<<"SQUARE ROOT"<<endl;
cout<<"----------------------------------------------------------------------\n";
for(i=2;i<=20;i+=2)
{
cout.fill('.');
cout.width(15);
cout.setf(ios::left);
cout<<i;
cout.setf(ios::left);
cout.width(15);
sqrno=i*i;
cout<<sqrno;
cout.setf(ios::showpoint);
cout.setf(ios::right);
sq=sqrt(i);
cout<<sq<<endl;
}
getch();
}

C++ Program To Add Two Complex Numbers

2013-04-08T10:15:00.000-07:00

/*CREATE A CLASS "COMPLEX" TO HOLD A COMPLEX NUMBER. WRITE A FRIEND FUNCTION
TO ADD TWO COMPLEX NUMBERS. WRITE A MAIN PROGRAM TO CHECK THE SAME.*/
#include<iostream.h>
#include<conio.h>
class complex
{
private:float rp;
float ip;
public:void getdata();
void putdata();
friend complex add(complex c1,complex c2);
};
void complex::getdata()
{
cout<<"\nENTER THE REAL PART AND IMAGINARY PART:";
cin>>rp>>ip;
}
void complex::putdata()
{
cout<<rp<<"+i"<<ip<<endl;
}
complex add(complex c1,complex c2)
{
complex c3;
c3.rp=c1.rp+c2.rp;
c3.ip=c1.ip+c2.ip;
return c3;
}
void main()
{
complex c1,c3,c2;
clrscr();
cout<<"\nENTER THE FIRST COMPLEX NUMBER\n";
c1.getdata();
cout<<"\nENTER THE SECOND COMPLEX NUMBER\n";
c2.getdata();
cout<<"\nTHE FIRST COMPLEX NUMBER IS:";
c1.putdata();
cout<<"\nTHE SECOND COMPLEX NUMBER IS:";
c2.putdata();
cout<<"\nTHE ADDITION OF TWO COMPLEX NUMBERS IS:";
c3=add(c1,c2);
c3.putdata();
getch();
}

C++ Program To Illustrate Multiple Inheritence

2013-04-08T10:14:00.000-07:00

#include<iostream.h>
#include<conio.h>
class shape
{
protected:double x;
double y;
public: void getdata()
{
cin>>x>>y;
}
virtual void displayarea(){};
};
class triangle:public shape
{
double area;
public:void displayarea()
{
area=0.5*x*y;
cout<<"area of triangle is:"<<area<<endl;
}
};
class rectangle:public shape
{
double area;
public: void displayarea()
{
area=x*y;
cout<<"area of a rectangle is:"<<area<<endl;
}
};
void main()
{
shape *s;
triangle t;
rectangle r;
clrscr();
cout<<"\nenter the values to find area of triangle\n";
s=&t;
s->getdata();
s->displayarea();
cout<<"\nenter the values to find area of rectangle\n";
s=&r;
s->getdata();
s->displayarea();
getch();
}

C++ Program To Implement == Operator Overloading

2013-04-08T10:12:00.001-07:00

#include<iostream.h>
#include<conio.h>
#include<string.h>
class string
{
private:char s[20];
public:string()
{
}
string(char a[])
{
strcpy(s,a);
}
int operator==(string a)
{
if(strcmp(s,a.s)==0)
return (1);
else
return (0);
}
};
void main()
{
char s1[20],s2[20];
clrscr();
cout<<"ENTER THE FIRST STRING:";
cin>>s1;
string obj1(s1);
cout<<"ENTER THE SECOND STRING:";
cin>>s2;
string obj2(s2);
if(obj1==obj2)
cout<<"TWO STRINGS ARE EQUAL";
else
cout<<"TWO STRINGS ARE NOT EQUAL";
getch();
}

C++ Program To Implement Matrix Operations

2013-04-08T10:11:00.001-07:00

#include<iostream.h>
#include<conio.h>
#include<stdlib.h>
int m,n,p,q;
class mat
{
int mt[10][10];
public: void add(mat m1,mat m2);
void sub(mat m1,mat m2);
void mul(mat m1,mat m2);
void transpose();
void read_matrix();
void display_matrix();
};

void mat::add(mat m1,mat m2)
{
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
mt[i][j]=m1.mt[i][j]+m2.mt[i][j];
}
void mat::sub(mat m1,mat m2)
{
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
mt[i][j]=m1.mt[i][j]-m2.mt[i][j];
}
void mat::mul(mat m1,mat m2)
{
for(int i=0;i<m;i++)
{
for(int j=0;j<q;j++)
{
mt[i][j]=0;
for(int k=0;k<p;k++)
mt[i][j]=mt[i][j]+m1.mt[i][k]*m2.mt[k][j];
}
}
}
void mat::transpose()
{
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
cout<<"\t\t"<<mt[j][i];
}
cout<<"\n";
}
}

void mat::read_matrix()
{
for(int i=0;i<m;i++)
for(int j=0;j<n;j++)
cin>>mt[i][j];
}

void mat::display_matrix()
{
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
cout<<"\t\t"<<mt[i][j];
}
cout<<"\n\n";
}
}

void main()
{
mat m1,m2,msum,msub,mmul,mtrans;
int ch;
clrscr();
cout<<"\nmatrix operations\n";
cout<<"\nenter your choice\n";
cout<<"\n1.addition\n2.subtraction\n3.multiplication\n4.transpose\n5.exit\n";
cin>>ch;
switch(ch)
{
case 1: cout<<"\nmatrix addition\n";
cout<<"\nenter the row & column values for 1st matrix:";
cin>>m>>n;
cout<<"\nenter the row &column values for 2nd matrix:";
cin>>p>>q;
if((m!=p)||(n!=q))
{
cout<<"\nmatric addition is not possible\n";
getch();
exit(0);
}
cout<<"\nenter the elements for 1st matrix\n";
m1.read_matrix();
cout<<"enter the elementes for 2nd matrix\n";
m2.read_matrix();
cout<<"the 1st matrix is\n";
m1.display_matrix();
cout<<"the 2nd matrix is \n";
m2.display_matrix();
cout<<"\naddition of two matrices\n";
msum.add(m1,m2);
msum.display_matrix();
break;
case 2: cout<<"\nmatrix subtraction \n:";
cout<<"\nenter the row & column values for 1st matrix:";
cin>>m>>n;
cout<<"\nenter the row &column values for 2nd matrix:";
cin>>p>>q;
if((m!=p)||(n!=q))
{
cout<<"\nmatrix subtractioin not possible\n";
getch();
exit(0);
}
cout<<"\nenter the elements for 1st matrix\n";
m1.read_matrix();
cout<<"\nenter the elements for 2nd matrix\n";
m2.read_matrix();
cout<<"the 1st matrix is\n";
m1.display_matrix();
cout<<"the 2nd matrix is \n";
m2.display_matrix();
cout<<"\nsubtraction of two matrices is \n";
msub.sub(m1,m2);
msub.display_matrix();
break;
case 3: cout<<"\nmatrix multiplication\n";
cout<<"\nenter the row & column values for 1st matrix:";
cin>>m>>n;
cout<<"\nenter the row &column values for 2nd matrix:";
cin>>p>>q;
if(n!=p)
{
cout<<"\nmatrix multiplication not possible\n";
getch();
exit(0);
}
cout<<"\nenter the elements for 1st matrix\n";
m1.read_matrix();
cout<<"\nenter the elements for 2nd matrix\n";
int tm=m;
m=p;
n=q;
m2.read_matrix();
m=tm;
cout<<"the 1st matrix is\n";
m1.display_matrix();
cout<<"the 2nd matrix is \n";
m2.display_matrix();
cout<<"\nmultiplication of two matrices is \n";
mmul.mul(m1,m2);
n=q;
mmul.display_matrix();
break;
case 4: cout<<"\nmatrix transpose\n";
cout<<"\nenter the row & column values for 1st matrix:";
cin>>m>>n;
cout<<"\nenter the row &column values for 2nd matrix:";
cin>>p>>q;
cout<<"\nenter the elements for matrix\n";
mtrans.read_matrix();
cout<<"\nthe entered matrix is\n";
mtrans.display_matrix();
cout<<"\nafter transposing matrix is \n";
mtrans.transpose();
break;
default:exit(0);
}
getch();
}

C++PROGRAM TO IMPLEMENT EMPLOYEE DATABASE

2013-04-08T10:10:00.001-07:00

#include<iostream.h>
#include<conio.h>
#include<math.h>
class employee
{
private: char ename[20];
int eno;
public:void getdata();
void putdata();
};
void employee::getdata()
{
cout<<"\nENTER THE NAME OF THE EMPLOYEE:";
cin>>ename;
cout<<"\nENTER THE EMPLOYEE NUMBER:";
cin>>eno;
}
void employee::putdata()
{
cout<<ename<<"\t\t"<<eno<<endl;
}
void main()
{
clrscr();
int n,i;
employee e[20];
cout<<"ENTER THE NUMBER OF EMPLOYEES REQUIRED\n";
cin>>n;
cout<<"ENTER THE EMPLOYEE DETAILS\n";
for(i=0;i<n;i++)
e[i].getdata();
cout<<"-------------------------------------------------------------------"<<endl;
cout<<"NAME\t\t"<<"ENUMBER"<<endl;
cout<<"-------------------------------------------------------------------"<<endl;
for(i=0;i<n;i++)
e[i].putdata();
getch();
}

C++ Program To Add Two Times

2013-04-08T10:09:00.001-07:00

#include<iostream.h>
#include<conio.h>
class time
{
int hr;
int min;
int sec;
public:time()
{
hr=0;
min=0;
sec=0;
}
time(int hh,int mm,int ss)
{
hr=hh;
min=mm;
sec=ss;
}
void display()
{
cout<<hr<<":"<<min<<":"<<sec<<endl;
}
void gettime()
{
cout<<"ENTER THE TIME IN HH-MM-SS FORMAT\n";
cin>>hr>>min>>sec;
}
time addtime(time t1,time t2)
{
time t3;
t3.hr=t1.hr+t2.hr;
t3.min=t1.min+t2.min;
t3.sec=t1.sec+t2.sec;
if(t3.sec>=60)
{
t3.sec=t3.sec-60;
t3.min++;
}
if(t3.min>=60)
{
t3.min-=60;
t3.hr++;
}
return t3;
}
};
void main()
{
time t1,t2,t3;
cout<<"ENTER THE FIRST TIME\n";
t1.gettime();
cout<<"ENTER THE SECOND TIME\n";
t2.gettime();
cout<<"THE FIRST TIME IS:";
t1.display();
cout<<"THE SECOND TIME IS:";
t2.display();
cout<<"ADDITION OF TWO TIMES IS:";
t3=t3.addtime(t1,t2);
t3.display();
getch();
}

C++ PROGRAM TO READ & DISPLAY A MATRIX OF SIZE mXn

2013-04-08T10:08:00.000-07:00

/*C++ PROGRAM TO READ & DISPLAY A MATRIX OF SIZE mXn
USING FUNCTIONS WINT ROW PARAMETER AS DEFAULT ARGUMENT FOR
READING & DISPLAYING*/
#include<iostream.h>
#include<conio.h>
int a[10][10];
void read(int n,int m=3);
void display(int n,int m=3);
void read(int n,int m)
{
cout<<"\nENTER ELEMENTS OF ORDER"<<m<<"*"<<n<<":";
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
cin>>a[i][j];
}
}
}
void display(int n,int m)
{
cout<<"\nTHE MATRIX TO BE DISPLAYED IS"<<endl;
for(int i=0;i<m;i++)
{
for(int j=0;j<n;j++)
{
cout<<a[i][j]<<"\t";
}
cout<<"\n";
}
}
void main()
{
int m,n;
clrscr();
cout<<"\nENTER THE ORDER OF MATRIX:";
cin>>m>>n;
read(n,m);
display(n,m);
cout<<"\nENTER THE COLUMN VALUE ONLY:";
cin>>n;
cout<<"\nMATRIX READE & DISPLAYIN WITH "<<"DEFAULT ARGUMENTS FOR ROWS=3";
read(n);
display(n);
getch();
}

C++ PROGRAM TO COMPUTE POWER(m,n) Using Function OverLoading

2013-04-08T09:56:00.000-07:00

/*C++ PROGRAM TO IMPLEMENT FUNCTION OVERLOADING IN ORDER TO COMPUTE POWER(m,n) WHERE
i)m IS DOUBLE AND n IS INT
ii)m & n ARE INT */
#include<iostream.h>
#include<conio.h>
#include<math.h>
double power(double m,int n)
{
double res=1.0;
res=pow(m,n);
return res;
}
int power(int m,int n)
{
int res=1;
res=pow(m,n);
return res;
}
void main()
{
double x;
int y;
clrscr();
cout<<"\nENTER THE VALUES AS DOUBLE & INTEGER TYPES:";
cin>>x>>y;
double res=power(x,y);
cout<<"\nPOW("<<x<<","<<y<<")="<<res<<endl;
int a,b;
cout<<"\nENTER THE VALUES AS INTEGER TYPES:";
cin>>a>>b;
int res1=power(a,b);
cout<<"\nPOW("<<a<<","<<b<<")="<<res1<<endl;
getch();
}

C++ PROGRAM TO SORT AN ARRAY OF INTEGER

2013-04-08T09:54:00.000-07:00

/*C++ PROGRAM TO SORT AN ARRAY OF INTEGER IN ASCENDING ORDER USIN A
FOUNCTION CALLED EXCHANGE() WHICH ACCEPTS TWO INTEGER
ARGUMENTS BY REFERENCE*/
#include<iostream.h>
#include<conio.h>
void exchange(int &m,int &n)
{
int temp;
temp=m;
m=n;
n=temp;
}
void main()
{
int i,j,n,a[10];
clrscr();
cout<<"\nENTER THE NUMBER OF ELEMENTS:";
cin>>n;
cout<<"\nENTER THE ARRAY ELEMENTS"<<endl;
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
exchange(a[i],a[j]);
}
}
}
cout<<"\nTHE SORTED ARRAY ELEMENTS ARE"<<endl;
for(i=0;i<n;i++)
cout<<a[i]<<endl;
getch();
}

C++ PROGRAM TO FIND THE LARGEST OF THREE NUMBERS USING INLINE FUNCTION

2013-04-08T09:53:00.000-07:00

#include<iostream.h>
#include<conio.h>
inline int large(int x,int y,int z)
{
if(x>y&&x>z)return x;
else if(y>z)return y;
else return z;
}
void main()
{
int x,y,z,big;
clrscr();
cout<<"\nENTER 3 NUMBERS:";
cin>>x>>y>>z;
big=large(x,y,z);
cout<<"\nTHE LARGEST NUMBER="<<big;
getch();
}

C++ PROGRAM TO DISPLAY A TABLE OF VALUES FOR A FUNCTION y=e^x WHERE X VARIES FROM 0 TO 1 IN STEPS OF 0.1

2013-04-08T09:51:00.003-07:00

#include<iostream.h>
#include<conio.h>
#include<math.h>
void main()
{
double x;
clrscr();
cout<<"-------------------------------------------------------------\n";
cout<<"X\t\t\tY\n";
cout<<"-------------------------------------------------------------\n";
for(x=0;x<=1;x+=0.1)
{
double y=exp(x);
cout<<x<<"\t\t\t"<<y<<endl;
}
getch();
}

C++ PROGRAM WHICH CONVERTS GALLONS TO CUBIC FEET

2013-04-08T09:50:00.002-07:00

/*(1 CUBIC FEET=7.481 GALLONS)*/
#include<iostream.h>
#include<conio.h>
void main()
{
float gal,cubf;
clrscr();
cout<<"\nENTER THE NUMBER OF GALLONS:";
cin>>gal;
cubf=gal/7.481;
cout<<"\nTHE VALUE OF "<<gal<<" GALLONS="<<cubf<<"CUBIC FEETS\n";
getch();
}

C PROGRAM TO FIND GCD OF TWO NUMBERS RECURSIVELY USINGEUCLIDIAN ALGORITHM

2013-04-08T09:36:00.003-07:00

#include<stdio.h>
int gcd(int m,int n)
{
return (n==0)?m:gcd(n,(m%n));
}
void main()
{
int m,n;
printf("ENTER THE TWO INTEGERS M AND N\n");
scanf("%d%d",&m,&n);
printf("THE GCD OF (%d,%d)=%d",m,n,gcd(m,n));
}

C PROGRAM TO MULTIPLY TWO MATRICES

2013-03-22T22:55:00.001-07:00

#include<stdio.h>

int n,i,j,k,Mat1[4][4],Mat2[4][4],Mat3[4][4];
void main()
{
printf("Enter order of Matrix\n");
scanf("%d",&n);
printf("Enter the elements of Matrix1");
for(i=0;i for(j=0;j scanf("%d",&Mat1[i][j]);

printf("Enter the elements of Matrixt2");
for(i=0;i for(j=0;j scanf("%d",&Mat2[i][j]);

for(i=0;i {
for(j=0;j {
Mat3[i][j]=0;
for(k=0;k Mat3[i][j]=Mat3[i][j]+Mat1[i][k]*Mat2[k][j];
}
}
printf("Products of Matrix1 And Matrix2\n");
for(i=0;i {
for(j=0;j {
printf("\t%d",Mat3[i][j]);
}
printf("\n");
}
}

C PROGRAM TO FIND FACTORIAL OF N NUMBERS USING RECURSION

2013-03-22T22:53:00.000-07:00

#include<stdio.h>

int fact(int n)

{

return n==0?1:n*fact(n-1);

}

void main()

{

int n;

printf("enter n value\n");

scanf("%d",&n);

printf("factorial of %d is %d",n,fact(n));

}

C program to convert binary to decimal number

2013-03-22T22:45:00.001-07:00

#include
#include
main()
{
int bin=0,i=1,dec=0;
printf("enter bin num");
scanf("%d",&bin);
while(bin!=0)
{
dec=dec+(bin%10)*i;
i=i*2;
bin=bin/10;
}
printf("dec=%d",dec);
getch();
}

C PROGRAM TO COUNT THE NUMBER OF DIGITS IN A GIVEN NUMBER

2013-03-22T22:43:00.000-07:00

C program to Count the binary digits in a given decimal number

Count the binary digits in a given decimal number

#include<stdio.h>
void main()
{
int n,count=1;
double t;
printf("Enter A Number\n");
scanf("%d",&n);
while(n>1)
{
n/=2;
count++;
}
printf("Number Of Digits=%d",count);
}

C PROGRAM TO FIND GCD OF (M,N) USING CONSECUTIVE INTEGER CHECKING

2013-03-22T22:39:00.001-07:00

#include<stdio.h>

int gcd(int m,int n)
{
int t; if(m<n)
t=m;
else t=n;
while(t>0)
{
if(m%t==0)
{
if(n%t==0)
return t;
}
t--;
}
}
void main()
{
int m,n;
printf("ENTER THE TWO INTEGERS M AND N\n");
scanf("%d%d",&m,&n); printf("THE GCD OF (%d,%d)=%d",m,n,gcd(m,n));
}

Programmers blog

Towards Energy Efficient Big Data Gathering In Densely Distributed Sensor Networks

Motivation:- The following challenges and benefits give us the motivation to developing this product.

Architecture Diagram:-

IMPLEMENTATION:-

System Implementation:-

Maintenance:-

WRITE A C++ PROGRAM THAT USES A SINGLE FILE FOR BOTH READING AND WRITING THE DATA

C++ Program To Illustrate Manipulators

C++ Program To Add Two Complex Numbers

C++ Program To Illustrate Multiple Inheritence

C++ Program To Implement == Operator Overloading

C++ Program To Implement Matrix Operations

C++PROGRAM TO IMPLEMENT EMPLOYEE DATABASE

C++ Program To Add Two Times

C++ PROGRAM TO READ & DISPLAY A MATRIX OF SIZE mXn

C++ PROGRAM TO COMPUTE POWER(m,n) Using Function OverLoading

C++ PROGRAM TO SORT AN ARRAY OF INTEGER

C++ PROGRAM TO FIND THE LARGEST OF THREE NUMBERS USING INLINE FUNCTION

C++ PROGRAM TO DISPLAY A TABLE OF VALUES FOR A FUNCTION y=e^x WHERE X VARIES FROM 0 TO 1 IN STEPS OF 0.1

C++ PROGRAM WHICH CONVERTS GALLONS TO CUBIC FEET

C PROGRAM TO FIND GCD OF TWO NUMBERS RECURSIVELY USINGEUCLIDIAN ALGORITHM

C PROGRAM TO MULTIPLY TWO MATRICES

C PROGRAM TO FIND FACTORIAL OF N NUMBERS USING RECURSION

C program to convert binary to decimal number

C PROGRAM TO COUNT THE NUMBER OF DIGITS IN A GIVEN NUMBER

Count the binary digits in a given decimal number

C PROGRAM TO FIND GCD OF (M,N) USING CONSECUTIVE INTEGER CHECKING

int gcd(int m,int n) { int t; if(m<n) t=m; else t=n; while(t>0) { if(m%t==0) { if(n%t==0) return t; } t--; } } void main() { int m,n; printf("ENTER THE TWO INTEGERS M AND N\n"); scanf("%d%d",&m,&n); printf("THE GCD OF (%d,%d)=%d",m,n,gcd(m,n)); }

int gcd(int m,int n)
{
int t; if(m<n)
t=m;
else t=n;
while(t>0)
{
if(m%t==0)
{
if(n%t==0)
return t;
}
t--;
}
}
void main()
{
int m,n;
printf("ENTER THE TWO INTEGERS M AND N\n");
scanf("%d%d",&m,&n); printf("THE GCD OF (%d,%d)=%d",m,n,gcd(m,n));
}