diff --git a/src/lab/exp6/quizresults.php b/src/lab/exp6/quizresults.php
index 646b6c3..3cd5fc9 100644
--- a/src/lab/exp6/quizresults.php
+++ b/src/lab/exp6/quizresults.php
@@ -64,17 +64,17 @@
For every recursive solution, there is a corresponding iterative solution
True
-
+
What will be the ouptut of the following function call: fun2(20); where fun2 is defined as:
20 40 60 80 80 60 40 20
-
+
What will be the ouptut of the following function call: fun3(100); where fun3 is defined as:
6
What will be the ouptut of the following function call: fun4(4,3); where fun4 is defined as:
- 14
+ 13
A recursive function must necessarily make a call to itself.
A base case (or end-condition) is required so that there is no infinite recursive calling of the same function.
diff --git a/src/lab/exp8/quizresults.php b/src/lab/exp8/quizresults.php
index a976b1f..2f47e7d 100644
--- a/src/lab/exp8/quizresults.php
+++ b/src/lab/exp8/quizresults.php
@@ -95,7 +95,7 @@
w[5] = \'n\';
printf("%s\n",w);
- segmentation fault
+ indian
What will the follwing function output if word is "heLlO_WOrLd !" ?