Answer Posted / baalu aanand

No, because
1) data types not declaring by object except String, data
types are declaring in Literal types
2) It not support Multilevel inheritance
3) It does n't support operator overloading


So, java is not purely OOP concept

What are the three parts of a simple empty class?

1462

---

What are the benefits of polymorphism?

626

---

what are the different types of qualifier in java?

1845

---

What are oops functions?

585

---

IS IT NECESSARY TO INITIALIZE VARIABLE? WHAT IF THE INSTANCE VARIABLE IS DECLARED final ? IS IT NECESSARY TO INITIALIZE THE final VARIABLE AT THE TIME OF THEIR DECLARATION?

1583

---

---

what is graphics

2013

---

What is cohesion in oop?

624

---

Write A Program to find the ambiguities in Multiple Inheritance? How are they resolved.(Virtual Functions)

3557

---

Give two or more real cenario of virtual function and vertual object

1855

---

Is enum a class?

607

---

What is the difference between a constructor and a destructor?

617

---

Why do we use encapsulation in oops?

524

---

What are the three main types of variables?

602

---

Question: Implement a base class Appointment and derived classes Onetime, Daily, Weekly, and Monthly. An appointment has a description (for example, “see the dentist”) and a date and time. Write a virtual function occurs_on(int year, int month, int day) that checks whether the appointment occurs on that date. For example, for a monthly appointment, you must check whether the day of the month matches. Then fill a vector of Appointment* with a mixture of appointments. Have the user enter a date and print out all appointments that happen on that date.

632

---

#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

2070

---