Answer Posted / rakesh jena

Hi,
I am rakesh Kumar jena.I have been working in inautix for
last 2 year.Total I have I have very strong knowledge on
Mainframe Environment in both Batch & Online.I did my
engineering from Utkal University In 2002-2006.I am very
self postitive and passion to work with people.

what is the sylabus for priliminaries?

1369

---

Can we create object of abstract class?

342

---

What is polymorphism in oops?

334

---

How to hide the base class functionality in Inheritance?

401

---

Why is polymorphism needed?

350

---

---

What are the components of marker interface?

355

---

What is encapsulation c#?

354

---

#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

1787

---

#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

1730

---

What is pure oop?

344

---

Why multiple inheritance is not allowed?

361

---

What are the types of abstraction?

341

---

any one please tell me the purpose of operator overloading

1731

---

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

355

---

What is meant by oops concept?

344

---