Discussion
Home ‣ C Programming ‣ Functions Comments
- Question
Usually recursion works slower than loops.
Options- A. Yes
- B. No
- Correct Answer
- Yes
ExplanationWhen a recursive call is made, the function/process clones itself and then process that funtion. This leads to time and space constrains.In a loop, there is no recursive call involved that saves a lot of time and space too.
Functions problems
Search Results
- 1. In a function two return statements should never occur.
Options- A. Yes
- B. No Discuss
Correct Answer: No
Explanation:
No, In a function two return statements can occur but not successively.Example:
#include <stdio.h> int mul(int, int); /* Function prototype */ int main() { int a = 0, b = 3, c; c = mul(a, b); printf("c = %d\n", c); return 0; } /* Two return statements in the mul() function */ int mul(int a, int b) { if(a == 0 || b == 0) { return 0; } else { return (a * b); } }Output:
c = 0- 2. Will the following functions work?
int f1(int a, int b) { return ( f2(20) ); } int f2(int a) { return (a*a); }
Options- A. Yes
- B. No Discuss
Correct Answer: Yes
Explanation:
Yes, It will return the value 20*20 = 400Example:
#include <stdio.h> int f1(int, int); /* Function prototype */ int f2(int); /* Function prototype */ int main() { int a = 2, b = 3, c; c = f1(a, b); printf("c = %d\n", c); return 0; } int f1(int a, int b) { return ( f2(20) ); } int f2(int a) { return (a * a); }Output:
c = 400- 3. Every function must return a value
Options- A. Yes
- B. No Discuss
Correct Answer: No
Explanation:
No, If a function return type is declared as void it cannot return any value.- 4. Maximum number of arguments that a function can take is 12
Options- A. Yes
- B. No Discuss
Correct Answer: No
Explanation:
No, C can accept upto 127 maximum number of arguments in a function.- 5. Functions cannot return a floating point number
Options- A. Yes
- B. No Discuss
Correct Answer: No
Explanation:
A function can return floating point value.Example:
#include <stdio.h> float sub(float, float); /* Function prototype */ int main() { float a = 4.5, b = 3.2, c; c = sub(a, b); printf("c = %f\n", c); return 0; } float sub(float a, float b) { return (a - b); }Output:
c = 1.300000- 6. Is it true that too many recursive calls may result into stack overflow?
Options- A. Yes
- B. No Discuss
Correct Answer: Yes
Explanation:
Yes, too many recursive calls may result into stack overflow. because when a function is called its return address is stored in stack.After sometime the stack memory will be filled completely. Hence stack overflow error will occur.
- 7. What will be the output of the program?
#include<stdio.h> int main() { char *str; str = "%d\n"; str++; str++; printf(str-2, 300); return 0; }
Options- A. No output
- B. 30
- C. 3
- D. 300 Discuss
Correct Answer: 300
- 8. What will be the output of the program?
#include<stdio.h> int main() { char *str; str = "%s"; printf(str, "K\n"); return 0; }
Options- A. Error
- B. No output
- C. K
- D. %s Discuss
Correct Answer: K
- 9. What will be the output of the program?
#include<stdio.h> int main() { char str1[] = "India"; char str2[] = "CURIOUSTAB"; char *s1 = str1, *s2=str2; while(*s1++ = *s2++) printf("%s", str1); printf("\n"); return 0; }
Options- A. CuriousTab
- B. BndiaBIdiaCURIOUSTABia
- C. India
- D. (null) Discuss
Correct Answer: BndiaBIdiaCURIOUSTABia
- 10. What will be the output of the program assuming that the array begins at the location 1002 and size of an integer is 4 bytes?
#include<stdio.h> int main() { int a[3][4] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 }; printf("%u, %u, %u\n", a[0]+1, *(a[0]+1), *(*(a+0)+1)); return 0; }
Options- A. 448, 4, 4
- B. 520, 2, 2
- C. 1006, 2, 2
- D. Error Discuss
Correct Answer: 1006, 2, 2
Comments
There are no comments.
More in C Programming:
Programming
Copyright ©CuriousTab. All rights reserved.