Answer Posted / subhashish sen

The inline function is a special function which is basically
used for small function body.If a function with large body
is defined as inline then it would be treated as a normal
function.

The advantage is that the code gets inserted at the place of
function call so it will reduce the time taken for control
to go back and forth from function call to function
definition.So as a result it will make execution faster.

Note: When we declare a function as inline we merely send a
request to the compiler,so its up to the compiler whether
our request is is accepted or not.So its better to define an
inline function for a small function.

Why is oop better than procedural?

1069

---

Why it is called runtime polymorphism?

1123

---

What are the 4 main oop principles?

1219

---

What is object and class in oops?

1054

---

What is the highest level of cohesion?

1038

---

What is coupling in oop?

1016

---

Why is destructor used?

1014

---

What is a superclass in oop?

1169

---

What exactly is polymorphism?

1122

---

#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

2612

---

#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

2539

---

How Do you Code Composition and Aggregation in C++ ?

25442

---

Can you explain polymorphism?

1102

---

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.

2114

---

What is pointer in oop?

1041

---