Answer Posted / vaishnavi varadarajan

Use of array: All the elements are lumped together in one
block of memory. Individual elements can be accessed thru
Array index. Random access & Dynamic allocation are
possible.

Use of Linked list: Linked list allocates space for each
element separately in its own block of memory called
a "linked list element" or "node". It gets the overall
structure by using pointers to connect all its nodes
together like the links in a chain. Here the elements of
list can be accessed thru memory address (Since the pointer
stores a reference to another variable)which improves the
efficiency. Size of the list can also be modified (ie) we
can insert/delete elements of the list.

What is meant by keywords in c?

1114

---

Where static variables are stored in memory in c?

1053

---

Why is c used in embedded systems?

1176

---

Write a program to swap two numbers without using third variable?

1351

---

What is queue in c?

1161

---

What is a static function in c?

1243

---

How do you redirect a standard stream?

1154

---

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

1932

---

Can main () be called recursively?

1180

---

What are the types of data files?

1253

---

Explain how can I pad a string to a known length?

1250

---

Explain is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?

1258

---

What is the scope of local variable in c?

1206

---

Explain what is page thrashing?

1161

---

What is bubble sort technique in c?

1039

---