Answer Posted / mital trivedi

Java is a OOP language and it is not a pure Object Based
Programming Language
There are seven qualities to be satisfied for a programming
language to be pure Object Oriented. They are:
1.Encapsulation/Data Hiding
2.Inheritance
3.Polymorphism
4.Abstraction
5.All predifined types are objects
6.All operations are performed by sending messages to
objects
7.All user defined types are objects.
JAVA is not because it supports Primitive datatype such as
int, byte, long... etc, to be used, which are not objects.

Can we define a class within the interface?

555

---

What is pointer in oop?

539

---

Advantage and disadvantage of routing in telecom sector

790

---

Is data hiding and abstraction same?

569

---

What is abstraction encapsulation?

659

---

---

This program numbers the lines found in a text file. Write a program that reads text from a file and outputs each line preceded by a line number. Print the line number right-adjusted in a field of 3 spaces. Follow the line number with a colon, then one space, then the text of the line. You should get a character at a time and write code to ignore leading blanks on each line. You may assume that the lines are short enough to fit within a line on the screen. Otherwise, allow default printer or screen output behavior if the line is too long (i.e., wrap or truncate). A somewhat harder version determines the number of spaces needed in the field for the line numbers by counting lines before processing the lines of the file. This version of the program should insert a new line after the last complete word that will fit within a 72-character line.

1641

---

What is object in oop?

681

---

What is a class in oop?

606

---

What is super in oop?

599

---

#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

---

What is the full form of oops?

612

---

What are the advantages of polymorphism?

577

---

What is encapsulation with example?

581

---

What is abstract class in oop?

536

---

What is protected in oop?

604

---