Write an algorithm that determines whether or not an almost
complete binary tree is a heap.
No Answer is Posted For this Question
Be the First to Post Answer
Consider the following code fragment: int main(void) { int m = 4; mystery ( m ); mystery ( m ); printf("%d", m); return 0; } What is the output on the monitor if mystery is defined as follows ? void mystery (int m) { m = m+3; }
given the code segment below void main() { cout<<"my no. is"; } question is how can we get the output hai aravind my no. is 99999999999 without editig the main().
Write a program to encrypt the data in a way that inputs a four digit number and replace each digit by (the sum of that digit plus 7) modulus 10. Then sweep the first digit with the third, second digit with the fourth and print the encrypted number.
How would you use the functions sin(), pow(), sqrt()?
How to change constant values?
catch(exception &e) { . . . } Referring to the sample code above, which one of the following lines of code produces a written description of the type of exception that "e" refers to? a) cout << e.type(); b) cout << e.name(); c) cout << typeid(e).name(); d) cout << e.what(); e) cout << e;
What is an accessor in c++?
What happens if an exception is throws from an object's constructor and from object's destructor?
What is the best free c++ compiler for windows?
How does java differ from c and c++?
Is c++ still in demand?
Which operator can not be overloaded in C++?