Answer Posted / atul kumar gupta

1-:array is working the concept of sequential.but linked
list is not provid the go directaly access the any alement.
2-:linked list are very complicated comparing the array
becouse the consist the two part which frst part is contain
the item and second is contain address of next node,so that
these are complicated compare then array.

Which is better struts or spring?

624

---

How do you define a class in oop?

634

---

Is data hiding and abstraction same?

575

---

what type of question are asked in thoughtworks pair programming round ?

1766

---

What is super in oop?

601

---

---

What is polymorphism oop?

626

---

How to improve object oriented design skills?

573

---

What is the real life example of polymorphism?

611

---

Why is polymorphism used?

588

---

What is byval and byref? What are differences between them?

1694

---

What are the 3 principles of oop?

624

---

What is the full form of oops?

620

---

#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

2073

---

What is a superclass in oop?

673

---

what is different between oops and c++

2006

---