Answer Posted / sampath

there is only one perfect oop lnguage in the world.
that is smalltalk.
why not java............
because we can access the variable with out using object.
how..........???????
answer is
if a variable declare in main function we can call it with
out using object. may be u can argue with me even variable
declare in class. the perfect oops supports any operation
only with objects

Why do we use polymorphism in oops?

572

---

Can you inherit a private class?

629

---

What are the 4 pillars of oop?

660

---

What is inheritance and how many types of inheritance?

610

---

Explain virtual inheritance?

680

---

---

Why is polymorphism important in oop?

625

---

What are oops functions?

575

---

Do you know about multiple inheritance?

634

---

What is a class and object?

589

---

What is oops?what is its use in software engineering?

551

---

How to handle exception in c++, For example in a functions i am assigning memory to some variables and also in next instructions in am dividing one variable also. If this functions generates a error while allocating memory to those variable and also while dividing the variable if i divide by zero then catch block how it will identify that this error has cone from perticular instruction

1650

---

What is meant by oops concept?

601

---

What is inheritance write a program to show use of inheritance?

606

---

#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

2056

---

How to hide the base class functionality in Inheritance?

630

---