Answer / mubin ahmed shaik

Limitations of Recursive Approach:
1. Recursive solutions may involve extensive overhead because they use function calls. Each function call requires push of return memory address, parameters, returned result,etc. and every function return requires that many pops.
2. Each time you call a function you use up some of your memory allocation may be in stack or heap. If there are large number of recursive calls – then you may run out of memory.

write a function to find whether a string is palindrome or not and how many palindrome this string contain?

2 Answers   Aptech,

---

in case any function return float value we must declare a) the function must be declared as 'float' in main() as well b) the function automatically returned float values c) function before declared 'float' keyword d) all the above

0 Answers  

---

a direct address that identifies a location by means of its displacement from a base address or segment a) absolute address b) relative address c) relative mode d) absolute mode

0 Answers  

---

Write code for initializing one dimentional and two dimentional array in a C Program?

5 Answers   Deshaw, Edutech, GMD,

---

What is putchar() function?

0 Answers  

---

Do you know pointer in c?

0 Answers  

---

#define f(x) main() { printf("\n%d",f(2+2)); }

5 Answers  

---

Define VARIABLE?

0 Answers   ADP,

---

What is extern variable in c with example?

0 Answers  

---

i want explaination about the program and its stack reprasetaion fibbo(int n) { if(n==1 or n==0) return n; else return fibbo(n-1)+fibbo(n-2); } main() { fibbo(6); }

2 Answers  

---

write a program for size of a data type without using sizeof() operator?

22 Answers   HCL, IBM,

---

What are run-time errors?

0 Answers  

---