Answer Posted / c++ coder

in addition to the advantage mentioned above , there is one
more that the namespace is local to the file and one cannot
use it into another by 'using namespace' since it is
unnamed.

write a programe to calculate the simple intrest and compund intrest using by function overlading

2259

---

What is abstraction in oop?

1188

---

#include #include #include #include void insert(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); insert(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void insert(char *items, int count) { register int a, b; char t; for(a=1; a < count; ++a) { t = items[a]; for(b=a-1; (b >= 0) && (t < items[b]); b--) items[b+1] = items[b]; items[b+1] = t; } } design an algorithm for Insertion Sort

2685

---

What is the difference between a constructor and a destructor?

1343

---

What is byval and byref? What are differences between them?

2269

---

Why is static class not inherited?

1152

---

Can enum be null?

1071

---

Why is destructor used?

1079

---

What are the benefits of oop?

1347

---

What exactly is polymorphism?

1182

---

What is class and object with example?

1220

---

#include #include #include #include void select(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); select(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void select(char *items, int count) { register int a, b, c; int exchange; char t; for(a = 0; a < count-1; ++a) { exchange = 0; c = a; t = items[ a ]; for(b = a + 1; b < count; ++b) { if(items[ b ] < t) { c = b; t = items[ b ]; exchange = 1; } } if(exchange) { items[ c ] = items[ a ]; items[ a ] = t; } } } design an algorithm for Selection Sort

2604

---

What is a function in oop?

1136

---

Which type does string inherit from?

1157

---

What are the 3 pillars of oop?

1245

---