Answer Posted / rajavel

16.5
this is abs value

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.

2079

---

What is polymorphism programming?

1069

---

Which method cannot be overridden?

1014

---

What is overloading and its types?

1078

---

What is abstraction example?

1041

---

Following are the class specifications: class {int a}; class {int b}; Using friend funtion,calculate the max of two objects and display it.

2407

---

What is balance factor?

1017

---

What is property in oops?

988

---

What is difference between abstraction and encapsulation?

1019

---

What is abstraction and encapsulation?

941

---

What is polymorphism what are the different types of polymorphism?

947

---

Where is pseudocode used?

1028

---

Is oop better than procedural?

974

---

What is the difference between static polymorphism and dynamic polymorphism?

1027

---

#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

2563

---