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 happens if header file is included twice?

1092

---

Do you know pointer in c?

996

---

Tell us the use of fflush() function in c language?

1089

---

What is storage class?

1019

---

What is function prototype in c language?

987

---

What is the sizeof () operator?

1024

---

What is c language & why it is used?

1037

---

When is a “switch” statement preferable over an “if” statement?

1073

---

int main() { Int n=20,i; For(i=0;i<=n;i--) { Printf(“-“); Return 0;

1731

---

How can I avoid the abort, retry, fail messages?

1086

---

What is a wrapper function in c?

1079

---

any C program contains only one function, it must be a) void () b) main () c) message () d) abc ()

1080

---

Can a function be forced to be inline? Also, give a comparison between inline function and the C macro?

1050

---

The performance of an operation in several steps with each step using the output of the preceding step a) recursion b) search c) call by value d) call by reference

1170

---

What is putchar() function?

1080

---