Answer Posted / sumeet choudhury

Arrays have random access and less overheads compared to
Linked list have sequential access only with too much
overheads and no cache memory support.
On the other hand, arrays allow random access, while linked
lists allow only sequential access to elements. Singly-
linked lists, in fact, can only be traversed in one
direction. This makes linked lists unsuitable for
applications where it's useful to look up an element by its
index quickly, such as heapsort. Sequential access on
arrays is also faster than on linked lists on many machines
due to locality of reference and data caches. Linked lists
receive almost no benefit from the cache.

Another disadvantage of linked lists is the extra storage
needed for references, which often makes them impractical
for lists of small data items such as characters or boolean
values. It can also be slow, and with a naïve allocator,
wasteful, to allocate memory separately for each new
element, a problem generally solved using memory pools.

What is multilevel inheritance explain with example?

1088

---

What is difference between oop and pop?

1102

---

What is abstraction in oop?

1084

---

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

971

---

when to use 'mutable' keyword and when to use 'const cast' in c++

2109

---

Why is oop better than procedural?

1021

---

What is inheritance and how many types of inheritance?

1041

---

program for insertion ,deletion,sorting in double link list

2636

---

• What are the desirable attributes for memory managment?

2166

---

What is encapsulation with real life example?

977

---

What is inheritance write a program to show use of inheritance?

1087

---

i=20;k=0; for(j=1;k-i;k+=j<10?4:3) { cout<

1810

---

write knight tour problem which is present in datastructure

2596

---

#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

2493

---

What is solid in oops?

1040

---