Answer Posted / shruti

the main differance between arrays and linked list is:

In array we follow static memory allocation.
i.e we assign memory to the particular element in advance.


in linked list -> dynamic memory allocation.
i.e we assign memory to the particular element at run-time..


hence we reserve only the amount of memory which is
required.

there is no problem of memory shortage or wastage, in
linked list. which we very frequently come accross in the
arrays..

What is the use of typedef in structure in c?

965

---

What is the difference between fread and fwrite function?

1076

---

What is the advantage of using #define to declare a constant?

1089

---

The number of bytes of storage occupied by short, int and long are a) 2, 2 and 4 b) 2, 4 and 4 c) 4, 4 and 4 d) none

1241

---

Which one would you prefer - a macro or a function?

1072

---

Explain what is a 'null pointer assignment' error? Explain what are bus errors, memory faults, and core dumps?

1097

---

What is union and structure?

1114

---

‘ C’ PROGRAME TO SHOW THE TYPE OF TRANGLE BY ACCEPTING IT’S LENGTH .

2876

---

Is r written in c?

1149

---

What is the benefit of using an enum rather than a #define constant?

1230

---

What are structure types in C?

1094

---

What does *p++ do? What does it point to?

1056

---

Explain goto?

1146

---

What is maximum size of array in c?

1031

---

Dont ansi function prototypes render lint obsolete?

1120

---