Answer Posted / guest

In c++,
Data is encapsulated(hidden) in the form of specifiers such as:

private: accessible only to members of class.

public: accessible everywhere.

protected :accessible only to the members that are
inherited(see inheritance)

Where You Can Use Interface in your Project

1893

---

What is a null tree?

1141

---

is there any choice in opting subjects like 4 out of 7

2193

---

Write a program to implement OOPS concepts such as inheritance, polymorphism, friend function, operator overloading?

4752

---

Explain the concepts involved in Object Oriented programming.

1245

---

Whats oop mean?

1054

---

How do you answer polymorphism?

1067

---

Write a program to reverse a string using recursive function?

2351

---

Explain virtual inheritance?

1209

---

What is class and object in oops?

1147

---

Write a program to compute for numeric grades for a course. The course records are in a file that will serve as the input file. The input file is in exactly the following format: Each line contains a student's first name, then one space, then ten quiz scores all on one line. The quiz scores are in whole number and are separated by one space. Your program will take it input from this file and sends it output to a second file. The data in the output file will be exactly the same as the data in the input file except that there will be one additional number (of type double) at the end of each line. This number will be the average of the student's ten quiz scores. Use at least one function that has file streams as all or some of its arguments.

3086

---

What are benefits of oop?

1138

---

Write a program to sort the number with different sorts in one program ??

2375

---

#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

2554

---

write a program that takes input in digits and display the result in words from 1 to 1000

2432

---