Answer Posted / bhaskar diwakar

Linked list->1.insertion & Deletion is very easy compare to
Array.
2.only Sequential Searching Allow
3.Dynamic memory allocation
4.collection of non homogenous data
Array->use to both sequential & non sequential
searching(binary search)
2.collection of homogenous data

Explain how does free() know explain how much memory to release?

1016

---

What do you mean by command line argument?

1101

---

What is const keyword in c?

1124

---

what is the significance of static storage class specifier?

2186

---

Why we write conio h in c?

967

---

Explain goto?

1095

---

Are there constructors in c?

973

---

why to assign a pointer to null sometimes??how can a pointer we declare get assigned with a garbage value by default???

1916

---

Who invented bcpl language?

1122

---

What is the difference between malloc() and calloc()?

1699

---

What is indirection? How many levels of pointers can you have?

1093

---

FILE *fp1,*fp2; fp1=fopen("one","w") fp2=fopen("one","w") fputc('A',fp1) fputc('B',fp2) fclose(fp1) fclose(fp2)} a.error b. c. d.

1708

---

Explain two-dimensional array.

1014

---

How many types of functions are there in c?

1066

---

Write a code of a general series where the next element is the sum of last k terms.

993

---