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 @@

Objectives of this experiments are :
1. To understand that for some problems an approximate numerial solution is as good as the exact solution for practical purposes.

-

Prerequisite :

@@ -101,7 +100,6 @@

Objectives of this experiments are :
1. To understand that a big program can be broken up into independent modules.
2. To learn to define functions and call them with appropriate parameters.

-

Prerequisite :

@@ -129,7 +127,6 @@ 1. To learn how decision making is done while programming.
2. To learn about the various advanced constructs used for control flow.

-

Prerequisite :

@@ -150,7 +147,6 @@

Objectives of this experiments are :
1. To learn how to use arrays for storing large amount of data.
2. To learn how to use array to create a common reference for a large number of variables.

-

Prerequisite :

@@ -173,7 +169,6 @@ 1. To understand how to use structures as a compund datatype.
2. To be able to design structures according to your requirement.

-

Prerequisite :

@@ -196,7 +191,6 @@

Objectives of this experiments are :
1. To learn how decision making is done while programming.
2. To learn about the various simple constructs used for control flow.

-

Prerequisite :

@@ -223,7 +217,6 @@ 1. To understand the concept of strings and how they are a special type of character arrays.
2. To understand the usage of string libraries to do common string operations.

-

Prerequisite :

@@ -244,7 +237,6 @@ 1. To understand the concept of memory adddress associated with every variable.
2. To understand pointer referencing and dereferencing.

-

Prerequisite :

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

-

Prerequisite :

@@ -292,7 +283,6 @@ 1. To learn about different types of operators
2. To learn about the precedence of the operators.

-

Prerequisite :

@@ -312,7 +302,6 @@

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.

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.

-

Prerequisite : Exp1, Exp2, Exp3

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 {