Thursday 23 January 2014

Improve Web Browsing Experience with OneTab for Chrome

We all browse internet everyday for exploring information and we go through a lot of websites and in addition we are logged into our social network accounts like Facebook , Google + .

After opening a no of tabs in our browser the memory used by it increases and the browser slows down. But actually we will be on a single tab any instance of time.

OneTab is an extension for chrome that groups all the opened tabs into a single tab in a list form. By this it reduces almost 95% of memory used by web-browser.

As tabs are grouped into a single page as list , no scripts will be running when in background. This also improves the performance of your system when it is resuming from sleep mode.

You can also share all the links as a webpage instead of copying and pasting each and every link !!!!!!

It is free and no signup is required. Your data is not sent anywhere. So you need not worry about privacy.


OneTab Extension for Chrome



Hope this post helps improving your browsing experience... :)

Thank You :)

Wednesday 22 January 2014

Euclidean Algorithm to compute GCD of 2 numbers

Euclidean Algorithm

Here we assume that a is greater than b

(a>b)

gcd_euclid(int a, int b)
{
         if( b is 0) return a
     
        else
            {
              set value of a as b
              set value of b as a modulo b
            }
}

When 2 prime no's are taken,GCD is usually 1 and it can be seen from below example.... 

  1. gcd_euclid(19,5)
  2. gcd_euclid(5,19%5)
  3. gcd_euclid(5,4)
  4. gcd_euclid(4,5%4)
  5. gcd_euclid(4,1)
  6. gcd_euclid(1,4%1)
  7. gcd_euclid(1,0)
return 1; //as b is 0.



GCD when 2 non prime no's are taken.....

  1. gcd_euclid(30,5)
  2. gcd_euclid(5,30%5)
  3. gcd_euclid(5,0)
return 5; // as b is 0


Programmatic Implementation:

int euclid(int a, int b)
{
   while (b!=0)
   {
       int temp = b;
       int b = a%b;
       int a = temp;
   }

return a;
}

Thank You :)