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

Function calling procedures? and their differences? Why should one go for Call by Reference?

1081

---

Describe the complexity of Binary search, Quicksort and various other sorting and searching techniques..

1028

---

In which language linux is written?

1222

---

will u please send me the placement papers to my mail???????????????????

1834

---

What does the function toupper() do?

1119

---

What is static memory allocation?

1169

---

program to convert a integer to string in c language'

2452

---

Is it better to use malloc() or calloc()?

1106

---

Explain argument and its types.

1058

---

How do you determine whether to use a stream function or a low-level function?

1120

---

What is the difference between text and binary i/o?

1047

---

Why void main is used in c?

1046

---

How can I sort more data than will fit in memory?

1098

---

What is calloc() function?

1091

---

a construct the"else" part of "if" statement contains anoth "if else" statement is called a) if-else b) else-if-else c) if-else-if-else d) chain if/if-else-if

1138

---