From 959380165a93ead1a7754c5d5afdffff7bb06e76 Mon Sep 17 00:00:00 2001
From: Monil Gokani <Monil Gokani>
Date: Mon, 1 Apr 2019 02:52:27 +0530
Subject: [PATCH] fixed prerequisites

---
 src/lab/index.html | 11 -----------
 src/lab/style.css  | 13 +++----------
 2 files changed, 3 insertions(+), 21 deletions(-)

diff --git a/src/lab/index.html b/src/lab/index.html
index e4d8d957..df875ea6 100644
--- a/src/lab/index.html
+++ b/src/lab/index.html
@@ -80,7 +80,6 @@
     <p class="experiment-outcome"><i>Objectives of this experiments are :</i><br>
       1. To understand that for some problems an approximate numerial solution is as good as the exact solution for practical purposes.<br>
     </p>
-    <p class="experiment-prereq">Prerequisite : </p>
 
   </div>
 </div>
@@ -101,7 +100,6 @@
       <p class="experiment-outcome"><i>Objectives of this experiments are :</i><br>
         1. To understand that a big program can be broken up into independent modules.<br>
         2. To learn to define functions and call them with appropriate parameters. </p>
-      <p class="experiment-prereq">Prerequisite : </p>
 
 
     </div>
@@ -129,7 +127,6 @@
         1. To learn how decision making is done while programming.<br>
         2. To learn about the various advanced constructs used for control flow.
       </p>
-      <p class="experiment-prereq">Prerequisite : </p>
     </div>
   </div>
   </a>
@@ -150,7 +147,6 @@
     <p class="experiment-outcome"><i>Objectives of this experiments are :</i><br>
       1. To learn how to use arrays for storing large amount of data.<br>
       2. To learn how to use array to create a common reference for a large number of variables. </p>
-    <p class="experiment-prereq">Prerequisite : </p>
   </div>
 </div>
 </a>
@@ -173,7 +169,6 @@
         1. To understand how to use structures as a compund datatype.<br>
         2. To be able to design structures according to your requirement.
       </p>
-      <p class="experiment-prereq">Prerequisite : </p>
 
 
     </div>
@@ -196,7 +191,6 @@
         <p class="experiment-outcome"><i>Objectives of this experiments are :</i><br>
           1. To learn how decision making is done while programming.<br>
           2. To learn about the various simple constructs used for control flow. </p>
-        <p class="experiment-prereq">Prerequisite : </p>
         
 
       </div>
@@ -223,7 +217,6 @@
       1. To understand the concept of strings and how they are a special type of character arrays.<br>
       2. To understand the usage of string libraries to do common string operations.
     </p>
-    <p class="experiment-prereq">Prerequisite : </p>
 
   </div>
 </div>
@@ -244,7 +237,6 @@
         1. To understand the concept of memory adddress associated with every variable.<br>
         2. To understand pointer referencing and dereferencing.
       </p>
-      <p class="experiment-prereq">Prerequisite : </p>
 
 
     </div>
@@ -267,7 +259,6 @@
 	  1. To understand that some problems can be broken down into smaller similar problems.<br>
       	  2. To solve such problems using recursive procedures.
         </p>
-        <p class="experiment-prereq">Prerequisite : </p>   
       </div>
     </div>
 </a>
@@ -292,7 +283,6 @@
      1. To learn about different types of operators<br>
      2. To learn about the precedence of the operators.
     </p>
-    <p class="experiment-prereq">Prerequisite : </p>
   </div>
 </div>
 </a>
@@ -312,7 +302,6 @@
         <p>When a polygon is transformed from a set of edges in the continous form of y = mx + c into a set of pixels occupied by the interior of the polygon, this transformation is called polygon rasterization. When we rasterize a polygon, we obtain the set of pixels that are required to fill the interior area of a bounded polygon. This experiment demonstrates the working of Scan-Line Polygon Fill algorithm.</p>
       </div>
       <p class="experiment-outcome">The objective of this experiment is to understand the steps of filling a polygon in a 2D frame buffer. Given the vertices of the polygon, the experiment outputs a filled polygon. Here we have demonstrated the steps of Scan Line Poylgon Fill algorithm.</p>
-      <p class="experiment-prereq">Prerequisite : Exp1, Exp2, Exp3</p>
 
 
     </div>
diff --git a/src/lab/style.css b/src/lab/style.css
index 1cb602c0..bd083789 100644
--- a/src/lab/style.css
+++ b/src/lab/style.css
@@ -132,21 +132,14 @@ hr{
 }
 
 .experiment-outcome{
-   padding: 1em 1em 0em 1em;
-   margin: 0em 1em 0em 1em;
+   padding: 1em 1em 2em 1em;
+   margin: 0em 1em 2em 1em;
    font-family: 'Source Sans Pro', sans-serif;
    /*border-radius: 1em;
    border: 1px solid #aaa;*/
 }
 
-.experiment-prereq{
-   padding: 1em 1em 1em 1em;
-   margin: 0.5em 1em 1em 1em;
-   /*border-radius: 1em;
-   border: 1px solid #aaa;*/
-   font-weight: bold;
-   text-align: right;
-}
+
 
 @media (max-width: 480px) {
   body {