Answer Posted / heemanshubhalla

Look at here Difference Between C and C++

http://geeksprogrammings.blogspot.in/2013/06/difference-between-c-programming-and-c.html

What is stream in oop?

841

---

explain sub-type and sub class? atleast u have differ it into 4 points?

1836

---

What is ambiguity in inheritance?

625

---

What does it mean when someone says I oop?

587

---

when to use 'mutable' keyword and when to use 'const cast' in c++

1644

---

---

What is destructor give example?

605

---

How can you overcome the diamond problem in inheritance?

768

---

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.

2575

---

why reinterpret cast is considered dangerous?

1903

---

How do you define a class in oop?

628

---

Will I be able to get a picture in D drive to the c++ program? If so, help me out?

1657

---

How is polymorphism achieved?

586

---

i am getting an of the type can not convert int to int *. to overcome this problem what we should do?

1837

---

Why is object oriented programming so hard?

616

---

#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

2068

---