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.

Why can't we have instance(stack) of a class as a member of the same class like eg.Class A{A obj;} as we can have self refential pointer

2146

---

What are benefits of oop?

1127

---

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

1011

---

How do you achieve runtime polymorphism?

1045

---

explain sub-type and sub class? atleast u have differ it into 4 points?

2306

---

Why is object oriented programming so hard?

1072

---

What are main features of oop?

1118

---

What is multilevel inheritance explain with example?

1139

---

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

2323

---

What is destructor give example?

1049

---

Why do we use class in oops?

957

---

Why multiple inheritance is not possible?

1064

---

What is encapsulation example?

1048

---

What is encapsulation c#?

1072

---

What is encapsulation and abstraction? How are they implemented in C++?

1125

---