Answer Posted / irfan jafree

oops concepts means to provide security of our data.
oops concepts are following ways:
Encapsulation: wrapping up of data and member function
together into a single unit class.
Abstraction: Showing essential feature without background
detail.
Inheritance: The property of one class inherited property
of other class.
Polymorphism: it means many form .They are two forms as:
Operator overloading and Function overloading.

class type to basic type conversion

2340

---

#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 encapsulation c#?

1015

---

Why is there no multiple inheritance?

956

---

write knight tour problem which is present in datastructure

2599

---

What is a class in oop?

1048

---

What is purpose of inheritance?

1054

---

hi, this is raju,iam studying b.tech 2nd year,iam want know about group1 and group2 details, and we can studying without going to any instutions? please help me.

1907

---

What is encapsulation in oop?

990

---

Give two or more real cenario of virtual function and vertual object

2289

---

Advantage and disadvantage of routing in telecom sector

1251

---

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

2131

---

#include #include #include #include void insert(char *items, int count); int main(void) { char s[255]; printf("Enter a string:"); gets(s); insert(s, strlen(s)); printf("The sorted string is: %s.\n", s); getch(); return 0; } void insert(char *items, int count) { register int a, b; char t; for(a=1; a < count; ++a) { t = items[a]; for(b=a-1; (b >= 0) && (t < items[b]); b--) items[b+1] = items[b]; items[b+1] = t; } } design an algorithm for Insertion Sort

2565

---

What is the difference between a mixin and inheritance?

936

---

What is the difference between abstraction and polymorphism?

1051

---