Answer Posted / akshay

Algorithm:
1.Take last used value into string variable.
2. Use String function to remove alphabet from value and store in temp string.
3. convert remaining part into int32.
4. increment by 1.
5. Append temp string and incremented value.

What is pure oop?

599

---

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

1670

---

can inline function declare in private part of class?

3658

---

What is polymorphism what is it for and how is it used?

576

---

What is encapsulation in oop?

609

---

---

Get me a number puzzle game-program

1694

---

#include #include #include #include void insert(struct btreenode **, int); void inorder(struct btreenode *); struct btreenode { struct btreenode *leftchild; struct btreenode *rightchild; int data; }; main() { struct btreenode *bt; bt=(struct btreenode *)NULL; int req,i=1,num; clrscr(); printf("Enter number of nodes"); scanf("%d",&req); while(i<=req) { printf("Enter element"); scanf("%d",&num); insert(&bt,num); i++; } inorder(bt); } void insert(struct btreenode **sr, int num) { if(*sr==NULL) { *sr=(struct btreenode *)malloc (sizeof(struct btreenode)); (*sr)->leftchild=(struct btreenode *)NULL; (*sr)->rightchild=(struct btreenode *)NULL; (*sr)->data=num; return; } else { if(num < (*sr)->data) insert(&(*sr)->leftchild,num); else insert(&(*sr)->rightchild,num); } return; } void inorder(struct btreenode *sr) { if(sr!=(struct btreenode *)NULL) { inorder(sr->leftchild); printf("\n %d",sr->data); inorder(sr->rightchild); } else return; } please Modify the given program and add two methods for post order and pre order traversals.

3254

---

What is oops and why we use oops?

573

---

What is a class and object?

600

---

What is cohesion in oop?

624

---

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.

631

---

What type of loop is a for loop?

682

---

Whats is abstraction in oops?

593

---

State what is encapsulation and friend function?

699

---

What is basic concept of oop?

700

---