Answer Posted / kiran

The Main advantage of array data structure is which is used
to hold like kind of data. in other words arrays hold
(save) similar kind of data items and array items stored in
contigues locations in memory. on the other hand link list
may hold unlike kind of data (group of data) and items
stored is not contigues in linked list.

What does <> mean pseudocode?

1265

---

What does I oop mean?

1129

---

How do you define social class?

1117

---

What is the renewal class?

2823

---

What is meant by oops concept?

1112

---

What is encapsulation in oop?

1104

---

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.

1425

---

What is class in oop with example?

1162

---

What is destructor in oop?

1082

---

What is abstract class in oops?

1078

---

Why do we use oops?

1071

---

What is multilevel inheritance in oop?

1090

---

What is difference between multiple inheritance and multilevel inheritance?

1197

---

What is difference between abstraction and encapsulation?

1136

---

#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

2606

---