From 7c1379a071e37e0395ad5d67e2211fc442033bc3 Mon Sep 17 00:00:00 2001
From: sridhar2k1 <sridharvanga2001@gmail.com>
Date: Thu, 28 Mar 2019 21:20:07 +0530
Subject: [PATCH 1/2] fixed in quizresults.php

---
 src/lab/exp6/quizresults.php | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

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 @@
 		<li><b>For every recursive solution, there is a corresponding iterative solution</b></li>
 		True<br>
 		<br>
-		
+
 		<li><b>What will be the ouptut of the following function call: fun2(20); where fun2 is defined as: </b> </li>
 		20 40 60 80 80 60 40 20<br>
-		<br>	
+		<br>
 
 		<li><b>What will be the ouptut of the following function call: fun3(100); where fun3 is defined as: </b> </li>
 		6<br>
 		<br>
 
 		 <li><b>What will be the ouptut of the following function call: fun4(4,3); where fun4 is defined as: </b> </li>
-		 14<br>
+		 13<br>
 		 <li><b>A recursive function must necessarily make a call to itself. </b> </li>
 		 <li><b>A base case (or end-condition) is required so that there is no infinite recursive calling of the same function.</b> </li>
 		 <br>

From d1e6471bbea1c6424b289dee5d018ca14413fad3 Mon Sep 17 00:00:00 2001
From: sridhar2k1 <sridharvanga2001@gmail.com>
Date: Thu, 28 Mar 2019 22:18:51 +0530
Subject: [PATCH 2/2] answer for 4th question is corrected

---
 src/lab/exp8/quizresults.php | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

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);
                 </pre>
-                segmentation fault<br>
+                indian<br>
                 <br>
 
                 <li><b> What will the follwing function output if word is "heLlO_WOrLd !" ?</b> </li>