Is it true that too many recursive calls may result into stack overflo – McqOptions

MCQOPTIONS

1.	Is it true that too many recursive calls may result into stack overflow?
A.	Yes
B.	No
Answer» B. No

Discussion

No Comment Found

Related MCQs

<p>Which bitwise operator is suitable for turning on a particular bit in a number?</p>
<p>In which numbering system can the binary number <i class="C-code">1011011111000101</i> be easily converted to?</p>
<p>Which bitwise operator is suitable for turning off a particular bit in a number?</p>
<p>Which bitwise operator is suitable for checking whether a particular bit is on or off?</p>
<p>What is the purpose of <i class="C-code">"rb"</i> in <i class="C-code">fopen()</i> function used below in the code? </p><pre><code class="cpp">FILE *fp; fp = fopen("source.txt", "rb"); </code></pre>
<p>Out of <i class="C-code">fgets()</i> and <i class="C-code">gets()</i> which function is safe to use?</p>
<p>Consider the following program and what will be content of <i class="C-code">t</i>? </p><pre><code class="cpp">#include<stdio.h> int main() { FILE *fp; int t; fp = fopen("DUMMY.C", "w"); t = fileno(fp); printf("%d n", t); return 0; } </code></pre>
<p>Which of the following function is more appropriate for reading in a multi-word string?</p>
<p>The operator used to get value at address stored in a pointer variable is</p>
<p>What would be the equivalent pointer expression for referring the array element <i class="C-code">a[i][j][k][l]</i></p>