Merge pull request #1 from virtual-labs/dev

Dev

Author: sravanthimodepu

experiment-descriptor.json

@@ -0,0 +1,60 @@
+{
+  "unit-type": "lu",
+  "label": "",
+  "basedir": ".",
+  "units": [
+    {
+      "unit-type": "aim"
+    },
+    {
+      "target": "theory.html",
+      "source": "theory.md",
+      "label": "Theory",
+      "unit-type": "task",
+      "content-type": "text"
+    },
+    {
+      "target": "objective.html",
+      "source": "objective.md",
+      "label": "Objective",
+      "unit-type": "task",
+      "content-type": "text"
+    },
+    {
+      "target": "pretest.html",
+      "source": "pretest.json",
+      "label": "Pretest",
+      "unit-type": "task",
+      "content-type": "assesment"
+    },
+    {
+      "target": "procedure.html",
+      "source": "procedure.md",
+      "label": "Procedure",
+      "unit-type": "task",
+      "content-type": "text"
+    },
+    {
+      "target": "simulation.html",
+      "source": "simulation/index.html",
+      "label": "Simulation",
+      "unit-type": "task",
+      "content-type": "simulation"
+    },
+    {
+      "target": "posttest.html",
+      "source": "posttest.json",
+      "label": "Posttest",
+      "unit-type": "task",
+      "content-type": "assesment"
+    },
+    {
+      "target": "references.html",
+      "source": "references.md",
+      "label": "References",
+      "unit-type": "task",
+      "content-type": "text"
+    }
+  ]
+}
+

experiment/aim.md

@@ -1 +1,4 @@
-### Aim of the experiment
+Sometimes solving a big problem may require us to solve smaller problems of similar nature. For example, computing the xth number in the fibonacci sequence may require us to find the x-1th and the x-2th numbers in the sequence. If we are able to break the main problem into smaller instances of the same problem again and again, so that eventually the smaller problems become trivial, then we can use the solutions to the trivial problems to progressively build bigger solutions. Consequently, we can reach the solution of our main problem. This concept when used in coding is called recursion.
+
+For writing a recursive code for a problem, we simply call a function inside the definition of the same function. Thus the definition of GNU (the source of much free software) is said to be recursive because GNU stands for 'GNU's Not Unix', i.e. GNU is part of the definition of GNU! Or maybe two mirrors placed parallely! The nested images are a form of infinite recursion.
+

experiment/experiment-name.md

@@ -1 +1 @@
-## Experiment name
+## Recursion

experiment/images/code1.png

@@ -0,0 +1,2 @@
+- To understand that some problems can be broken down into smaller similar problems.
+- To solve such problems using recursive procedures.

experiment/images/code3.png

@@ -1,18 +1,12 @@
 [
-{"question":"This is a Sample Question 1?",
+{"question":"1. What will be the ouptut of the following function call: fun3(100); where fun3 is defined as: <br/>  <img src='images/code5.png'>",
 "answers":{
-            "a":"answer1",
-            "b":"answer2",
-            "c":"answer3",
-            "d":"answer4"
+            "a":"13",
+            "b":"14",
+            "c":"3",
+            "d":"7"
           },
-"correctAnswer":"a"},
-{"question":"This is a Sample Question 2?",
-"answers":{
-            "a":"answer1",
-            "b":"answer2",
-            "c":"answer3",
-            "d":"answer4"
-          },
-"correctAnswer":"c"} 
+
+"correctAnswer":"a"}
+
 ]

experiment/images/code4.png

@@ -1,18 +1,43 @@
-[
-{"question":"This is a Sample Question 1?",
-"answers":{
-            "a":"answer1",
-            "b":"answer2",
-            "c":"answer3",
-            "d":"answer4"
-          },
-"correctAnswer":"a"},
-{"question":"This is a Sample Question 2?",
-"answers":{
-            "a":"answer1",
-            "b":"answer2",
-            "c":"answer3",
-            "d":"answer4"
-          },
-"correctAnswer":"c"} 
+[{
+		"question": "1. How many stars will the following code output for a given positive value of n: <br/>  <img src='images/code1.png'>",
+		"answers": {
+			"a": "n",
+			"b": "n^2",
+			"c": "n(n-1)/2",
+			"d": "n(n+1)/2"
+		},
+		"correctAnswer": "d"
+	},
+
+	{
+		"question": "2. For every recursive solution, there is a corresponding iterative solution?",
+		"answers": {
+			"a": "True",
+			"b": "False"
+		},
+		"correctAnswer": "a"
+	},
+
+	{
+		"question": "3. What will be the ouptut of the following function call: fun2(20); where fun2 is defined as:  <br/>  <img src='images/code3.png'>",
+		"answers": {
+			"a": "20 40 60 80 60 40 20",
+			"b": "80 60 40 20",
+			"c": "20 40 60 80 80 60 40 20",
+			"d": "20 40 60 80"
+		},
+		"correctAnswer": "c"
+	},
+
+	{
+		"question": "4. What will be the ouptut of the following function call: fun3(100); where fun3 is defined as:  <br/>  <img src='images/code4.png'>",
+		"answers": {
+			"a": "6",
+			"b": "7",
+			"c": "5",
+			"d": "4"
+		},
+		"correctAnswer": "a"
+	}
+
 ]