Answer Posted / yj

While answering such questions dont become too sentimental maintain ur EQ(Emotional Quotient). Dont try to gain sympathy from interviwer. Just be straight forward and be clear what do you actually feel just tell dat....

which feature are not hold visual basic of oop?

2200

---

Advantage and disadvantage of routing in telecom sector

1310

---

what are the different types of qualifier in java?

2279

---

What is a function in oop?

1091

---

What is object-oriented programming? Webopedia definition

1273

---

What language is oop?

1025

---

How can you overcome the diamond problem in inheritance?

1184

---

What is purpose of inheritance?

1118

---

What does sksksk mean in text slang?

2128

---

What does and I oop mean in text?

1236

---

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.

2129

---

Which is not an object oriented programming language?

1006

---

What is object and example?

1182

---

What is cohesion in oop?

1071

---

#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

2557

---