Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
#include "stdafx.h"
#include iostream
using namespace std;
int _tmain(int argc, _TCHAR* argv[])
{
int NumbHold[5];
int * ptrNumb;
ptrNumb= NumbHold;
*ptrNumb= 10;
ptrNumb++;
*ptrNumb= 20;
ptrNumb= &NumbHold[2];
*ptrNumb= 30;
ptrNumb= NumbHold + 3;
*ptrNumb= 40;
*(ptrNumb+4) = 50;
for (int n=0; n<5; n++)
cout << NumbHold[n] << ", ";
cout << endl;
return 0;
}
Output:
10, 20, 30, 40, 50,
Project Description: My project is about telephone billing system. This project was my project in my college life. The project is quite easy, i needed C++ programming language..
The rPeANUt simulator provides buffering of the characters that are typed into the terminal. However, this would generally not be the case so if the program did not consume a chara
How do you declare an integer variable? Explain with an example.
Q: How can one encourage his (older) compiler to check new to see automatically if it returns NULL? A: His compiler eventually will. If he contain an old compiler wh
how to justify strategic information system
find area uder the curve y=f(x) between x=a and x=b #include float start_point, /* GLOBAL VARIABLES */ end_point, total_area; in
Threaded binary tree: Consider the linked illustration of a binary tree 'T. Approximately half of the entries is the pointer fields 'LEFT' and 'RIGHT' will have null elements. Th
algorithem push and pop
show algorathim
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with thes
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd