Answer Posted / sachin shinde

you are a good company, i would like to learn new
technologies & new domain. Better careen opportunities

Why is polymorphism important in oop?

627

---

Can we override main method?

597

---

Which type does string inherit from?

608

---

What are the components of marker interface?

598

---

What is the importance of oop?

605

---

---

What is data binding in oops?

577

---

Why is oop better than procedural?

600

---

Explain the concepts involved in Object Oriented programming.

624

---

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.

1630

---

There are two base class B1,B2 and there is one class D which is derived from both classes, Explain the flow of calling constructors and destructors when an object of derived class is instantiated.

1448

---

why reinterpret cast is considered dangerous?

1894

---

#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

---

What is difference between data abstraction and encapsulation?

610

---

How do you define social class?

594

---

What is the use of oops?

614

---