Answer Posted / madhu

divide balls as 3 + 3 + 1 and
1. weight them 3 balls and 3 balls if both are equal the
outer ball is bigger one. else
2. Add the single ball which is not weighted before to the
higher weight 3 balls and now it total balls will be 3+ 1
and divide them as 2 + 2
3. In second attempt weight them and find which is having
higher weight then take the higher weight group and in 3rd
attempt compare them individual and you will get the bigger
ball in three attempts.

How to hide the base class functionality in Inheritance?

1093

---

What is a class in oop?

1048

---

Question: Implement a base class Appointment and derived classes Onetime, Daily, Weekly, and Monthly. An appointment has a description (for example, “see the dentist”) and a date and time. Write a virtual function occurs_on(int year, int month, int day) that checks whether the appointment occurs on that date. For example, for a monthly appointment, you must check whether the day of the month matches. Then fill a vector of Appointment* with a mixture of appointments. Have the user enter a date and print out all appointments that happen on that date.

1244

---

write a programe to calculate the simple intrest and compund intrest using by function overlading

2133

---

write knight tour problem which is present in datastructure

2599

---

what type of questions

2068

---

What is the difference between a mixin and inheritance?

936

---

What are classes oop?

978

---

What is encapsulation with real life example?

979

---

#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

2496

---

What is abstract class in oop?

956

---

just right the logic of it 1--> If few people are electing then every time ur candidate should win 2--> arrange books in box, if box carry weight == books weight then take another box..... find the no of box required.

6880

---

What does it mean when someone says I oop?

1018

---

How do you explain polymorphism?

1017

---

What is the real time example of inheritance?

1082

---