Answer Posted / vadivelt

Recursion will be useful when same kind of job has to be
continued for a finite no input or time.

Eg: calculating series, finding factorial etc..

Disadvantage would be,
1.Hard to analyse or understand the code.
2.If the recursive function is called for infinite no of
times and memory constrains are not taken care, then stack
overflow may occur So system may crash.

What is an array? What the different types of arrays in c?

1100

---

Are pointers really faster than arrays?

963

---

Which one to choose from 'initialization lists' or 'assignment', for the use in the constructor?

1014

---

Explain the process of converting a Tree into a Binary Tree.

2607

---

What are types of functions?

969

---

Differentiate between calloc and malloc.

1218

---

What is a void pointer? When is a void pointer used?

1018

---

Why is it that not all header files are declared in every C program?

1142

---

Can we increase size of array in c?

917

---

How can I ensure that integer arithmetic doesnt overflow?

1080

---

What is the difference between %d and %i?

1040

---

What is #pragma statements?

1050

---

.main() { char *p = "hello world!"; p[0] = 'H'; printf("%s",p); }

1224

---

What math functions are available for integers? For floating point?

1075

---

Explain what are the advantages and disadvantages of a heap?

1028

---