Answer Posted / bipin pandey

node *reverse(node *first)


{
node *cur,*temp;


cur=NULL;

while(first!=NULL)


{temp=first;

first=first->link;

temp->link=cur;

cur=temp;
}

return cur;

}

List the issue that the auto_ptr object handles?

1073

---

What are advantages of c++?

1056

---

What is the use of bit fields in structure declaration?

1029

---

What is a NULL Macro? What is the difference between a NULL Pointer and a NULL Macro?

1157

---

What is & in c++ function?

1122

---

Can we make copy constructor private in c++?

1094

---

In the derived class, which data member of the base class are visible?

1161

---

What is the type of 'this' pointer? When does it get created?

997

---

A prime number is a number which is divisible only by itself and 1. Examples of the first few primes are 2, 3, 5, 7, 11. Consider writing a program which can generate prime numbers for you. Your program should read in and set a maximum prime to generate and a minimum number to start with when looking for primes. This program should be able to perform the following tasks: 1. Read the maximum number from user (keyboard input) to look for primes. The program should not return any primes greater than this number. 2. Read the minimum number from user (keyboard input) to look for primes. The program should not return any primes less than this number. 3. Generate and print out every prime number between the maximum prime and minimum number specified by the user.

2238

---

How delete [] is different from delete?

1050

---

Explain stack & heap objects?

1094

---

Where are setjmp and longjmp used in c++?

1169

---

What are friend functions in C++?

1115

---

Describe the advantages of operator overloading?

1079

---

How would you differentiate between a pre and post increment operators while overloading?

1195

---