Merge pull request #13 from virtual-labs/testing

Testing to Main branch merging

Author: shraddha

.gitignore

@@ -0,0 +1,5 @@
+node_modules/
+package.json
+package-lock.json
+build/
+DS_Store

experiment-descriptor.json

@@ -6,38 +6,59 @@
     {
       "unit-type": "aim"
     },
+    {
+      "target": "objective.html",
+      "source": "objective.md",
+      "label": "Objective",
+      "unit-type": "task",
+      "content-type": "text"
+    },
     {
       "target": "theory.html",
       "source": "theory.md",
       "label": "Theory",
       "unit-type": "task",
-      "content-type": "video"
+      "content-type": "text"
     },
     {
-      "target": "theory-test.html",
-      "source": "theorytest.json",
-      "label": "Theory-Test",
+      "target": "pretest.html",
+      "source": "pretest.json",
+      "label": "Pretest",
       "unit-type": "task",
       "content-type": "assesment"
     },
     {
-      "target": "practice.html",
+      "target": "procedure.html",
+      "source": "procedure.md",
+      "label": "Procedure",
+      "unit-type": "task",
+      "content-type": "text"
+    },
+    {
+      "target": "simulation.html",
       "source": "simulation/index.html",
-      "label": "Practice",
+      "label": "Simulation",
+      "unit-type": "task",
+      "content-type": "simulation"
+    },
+    {
+      "target": "towerofhanoi.html",
+      "source": "simulation/towerofhanoi.html",
+      "label": "Tower of Hanoi",
       "unit-type": "task",
       "content-type": "simulation"
     },
     {
       "target": "assignment.html",
       "source": "assignment.md",
-      "label": "Assignment",
+      "label": "Assignment",      
       "unit-type": "task",
-      "content-type": "text"
+      "content-type": "text"      
     },
     {
-      "target": "practical-test.html",
-      "source": "practicaltest.json",
-      "label": "Practical-Test",
+      "target": "posttest.html",
+      "source": "posttest.json",
+      "label": "Posttest",
       "unit-type": "task",
       "content-type": "assesment"
     },

experiment/Stanford_Assignment.pdf

@@ -1,23 +1,3 @@
-Welcome to this experiment on _Recursion_! In this experiment, you will learn how to use recursion to solve problems by breaking them down into smaller, similar sub-problems.
+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.
 
-> ### More information
-
-Recursion is a powerful technique that allows us to solve complex problems by dividing them into simpler ones. It works by defining a function that calls itself repeatedly until it reaches a base case that can be solved directly. By doing so, we can solve problems that would otherwise be too difficult or time-consuming to solve in one go.
-
-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.
-
-Here, we will explore the concept of recursion through interactive exercises. We will start with simple examples and gradually move on to more complex problems. Along the way, you will learn how to:
-
-- Identify problems that can be solved using recursion
-- Write recursive functions that solve problems by breaking them down into smaller sub-problems
-- Understand the role of base cases in terminating recursive functions
-- Use recursion to solve real-world problems
-- Appreciate the beauty and power of recursion in computer science
-
-By the end of this experiment, you will have gained hands-on experience in visualizing recursive code and understanding its inner workings. You will also develop problem-solving skills that will serve you well in your future.
-
-So let's get started and discover the magic of recursion together!
-
-> ### Pre-requisite
-
-To get the most out of this experiment, you should be familiar with the basics of programming in `Python/C/JavaScript`. You should also be comfortable with using functions and loops to solve problems.
+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/aim.md

@@ -2,14 +2,14 @@
 
 _Note_: Some of these problems can be solved using different other methods, but we would recommend you to use the method of recursion to solve these problems and get a better understanding of recursion.
 
-1. **Reversing a String** (Beginner)
+**Reversing a String** (Beginner)
 
     Write a function `reverseString(str)` that takes in a string argument and returns the reverse of the given string.
 
     _Input_ -> `"Calvin and Hobbes"` \
     _Output_ -> `"sebboH dna nivlaC"`
 
-1. **Greatest Common Divisor (GCD)** (Beginner)
+**Greatest Common Divisor (GCD)** (Beginner)
 
     Write a function `gcd(a, b)` that takes in two numbers and returns the greatest common divisor of the two numbers.
 
@@ -19,7 +19,7 @@ _Note_: Some of these problems can be solved using different other methods, but
     _Input_ -> `gcd(15, 10)` \
     _Output_ -> `5`
 
-1. **nextIsDouble** (Intermediate)
+**nextIsDouble** (Intermediate)
 
     Write a function that takes a list, and return the number of elements in data that are followed directly by double that element.
 
@@ -31,7 +31,7 @@ _Note_: Some of these problems can be solved using different other methods, but
     _Output_ -> `5` \
     _Explanation_ -> The elements 0, -5, 32, 64 and 9 are all followed directly by double their value.
 
-1. **MaxConsecutiveSum** (Advanced)
+**MaxConsecutiveSum** (Advanced)
 
     Write a function `maxConsecutiveSum(arr)` that takes a list of integers as input and returns the maximum sum of consecutive elements in the list. Consecutive elements are elements that appear in sequence without any gaps.
 
@@ -43,16 +43,12 @@ _Note_: Some of these problems can be solved using different other methods, but
     _Output_ -> `8` \
     _Explanation_ -> The maximum sum of consecutive elements in the list is 8. The consecutive elements are 4, -1, -2, 1, 5.
 
-1. **Binary Search** (Advanced)
+**Binary Search** (Advanced)
 
     Write a function binarySearch(data, target) that takes in a sorted list and a target value and returns the index of the target value in the list. If the target value is not present in the list, return -1.
 
     _Input_ -> `binarySearch({1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, 5)` \
     _Output_ -> `4`
 
     _Input_ -> `binarySearch({1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, 11)` \
-    _Output_ -> `-1`
-
-1. [Stanford Recursion Assignment](./Stanford_Assignment.pdf) 
-
-    [Reference: web.stanford.edu/class/archive/cs/cs106b/cs106b.1174/handouts/100%20Assignment%203.pdf]
+    _Output_ -> `-1`

experiment/assignment.md

@@ -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/objective.md

@@ -23,7 +23,7 @@
             "answers": {
                 "a": "20 40 60 80 60 40 20",
                 "b": "80 60 40 20",
-                "c": "20 40 60 80 80 60 40 20",
+                "c": "20 40 80 80 40 20",
                 "d": "20 40 60 80"
             },
             "correctAnswer": "c",

experiment/practicaltest.json experiment/posttest.jsonexperiment/practicaltest.json renamed to experiment/posttest.json

@@ -0,0 +1,38 @@
+#### Instructions for Using the Simulation:
+
+* **Problem Selection:** 
+Four problems are available, listed in the left column:
+    - Sum of Numbers
+    - Power of a Number
+    - Factorial of a Number
+    - Fibonacci Series
+    
+    Select one problem from the four options.
+    The problem objectives and detailed statements are provided in the center column.
+
+* **Simulation Instructions:**
+After selecting a problem, review the instructions for running the simulation, located in the top bar.
+
+* **Language Selection:**
+Choose one of the three programming languages (C, Python, or JavaScript) for the code block.
+
+* **Code Display:** 
+Upon language selection, the corresponding code will be displayed in the "Code Block" section.
+
+* **Code Completion:**
+Complete the code by filling in the options provided in the dropdown menus within the code. Ensure your selections align with the logic of the chosen problem.
+
+* **Navigation and Control:** 
+All control buttons are located in the bottom right corner of the page.
+
+* **Code Execution and Analysis:**
+Click "Run" to execute your code and check its correctness.  The following information will be displayed:
+    - **Variable Values:** Details of the program's variables.
+    - **Max-Size:** The value of 'n' selected.
+    - **Stack:** Visualization of stack usage for the provided values.
+
+* **Step-Through Execution:** 
+Use the "<" and ">" buttons to navigate backward and forward through the program's execution.
+
+* **Reset:** 
+Click "Reset" to reset the entire simulation.

experiment/theorytest.json experiment/pretest.jsonexperiment/theorytest.json renamed to experiment/pretest.json

@@ -1,3 +1,3 @@
-<!-- 1. [Recursion](http://www.exforsys.com/tutorials/c-language/c-pointers.html)
-2. [Recursion - Pointer](http://en.wikipedia.org/wiki/Pointer_%28computer_science%29) -->
-1. [MCQ Questions](https://www.geeksforgeeks.org/algorithms-gq/top-mcqs-on-recursion-algorithm-with-answers/)
+1. [Recursion](https://en.wikipedia.org/wiki/Recursion_(computer_science))
+2. [Stanford Recursion Assignment](web.stanford.edu/class/archive/cs/cs106b/cs106b.1174/handouts/100%20Assignment%203.pdf)
+2. [MCQ Questions](https://www.geeksforgeeks.org/algorithms-gq/top-mcqs-on-recursion-algorithm-with-answers/)