Tuesday, October 30, 2012

Win 4000+ Backlinks Free [Giveaway]

Hello buddies.. As KnowCrazy.com is going to enter into 3rd awesome year on 9th November 2012 we have decided to give the return gift for the gift of love and support we have received in last two years. We have a giveaway of a more than 4000 backlinks!!.. We have thousands of quality backlinks waiting just for you.. :)) :))..

Instructions for Giveaway:
All you have to do to enter in this contact is filling the details about your blog / website / facebook page / about me page / etc.. that are mentioned in this post. You can either email us these details or fill out the form.
Once received your information we will make a post for it on our blog. You have to share and promote that post.
The winner will be decided on the base of total Shares (Likes, Tweets, +1's) he/she gets on his post.
You can either fill out this form

-OR-

You can fill the following details and email on knowcrazy.com@outlook.com
* := Required Fields

  • Full Name*
  • Email*
  • Social Profile (optional)
  • Blog Title*
  • Blog URL*
  • Keyword (optional)


I hope, you have understood this simple rules..if not mail me on knowcrazy.com@outlook.com or comment over here.. :)

The Top 15 Winners will be decided on sum of the total shares on the post.
The prize list is given below:

  1. 1st Winner: 4000 Backlinks
  2. 2nd Winner: 3750 Backlinks
  3. 3rd Winner: 3500 Backlinks
  4. 4th Winner: 3250 Backlinks
  5. 5th Winner: 3000 Backlinks
  6. 6th Winner: 2750 Backlinks
  7. 7th Winner: 2500 Backlinks
  8. 8th Winner: 2250 Backlinks
  9. 9th Winner: 2000 Backlinks
  10. 10th Winner: 1750 Backlinks
  11. 11th Winner: 1500 Backlinks
  12. 12th Winner: 1250 Backlinks
  13. 13th Winner: 1000 Backlinks
  14. 14th Winner: 750 Backlinks
  15. 15th Winner: 500 Backlinks


=> The Giveaway opens from: 1st November 2012

=> The last date for submission is: 31st December 2012

=>The winner will be declared on: 1st January 2013


++ Learn more about backlinks and giveaway.

What are BackLinks??


Backlinks, also known as incoming linksinbound linksinlinks, and inward links, are incoming links to a website or web page. In basic link terminology, a backlink is any link received by a web node (web page, directory, website, or top level domain) from another web node.

Backlinks enable you to keep track of other pages on the web that link to your posts. For instance, suppose Alice writes a blog entry that Bob finds interesting. Bob then goes to his own blog and writes a post of his own about it, linking back to Alice's original post. Now Alice's post will automatically show that Bob has linked to it, and it will provide a short snippet of his text and a link to his post. What it all works out to is a way of expanding the comment feature such that related discussions on other sites can be included along with the regular comments on a post.

For example, if a webmaster has a website about how to rescue orphaned kittens, and received a backlink from another website about kittens, then that would be more relevant in a search engine's assessment than say a link from a site about car racing. The more relevant the site is that is linking back to your website, the better the quality of the backlink.

Building quality backlinks is extremely important to Search Engine Optimization, and because of their importance, it should be very high on your priority list in your SEO efforts. We hope you have a better understanding of why you need good quality inbound links to your site, and have a handle on a few helpful tools to gain those links.

Free 4000 Backlinks Registration Form

Stop the National Investment Board

This is urgent. The government proposes to set up a National Investment Board (NIB) which will allow big companies in India and around the world to destroy our forests. The process of environmental clearances will become a sham, greater than it is already.
We need to send out a strong message to our Prime Minister and his cabinet that the NIB will only do more harm than good. Luckily the Environment and Tribal Affairs ministers of India are against the idea of the NIB and we need to support their statements. [1] Sign and share this petition with your network and lets ensure a strong voice reaches our PM.
You should ask Prime Minister Manmohan Singh: Stop the National Investment Board
As if the threat from coal mining was not enough, the creation of this body will only hasten the end of our forests. Wildlife, especially endangered species will be pushed closer to extinction and lacs of people will lose their livelihoods.
The NIB is being proposed in the hope of improving India’s economy but allowing the destruction of our natural wealth only makes lacs of Indians, and the country as a whole, poorer. Big coal projects will get easy access to plunder our forests and with impacted communities not even getting a say in these clearances it undermines India’s democracy! We know the long term costs of coal on our environment and people’s health far outweighs the short run economic benefits of exploiting coal!
Since last year, over 250,000 have pledged our support for saving forests. This is yet another opportunity to let our leaders know that we don’t want them to destroy our national wealth for their profit making plans.


Thanks!
Brikesh Singh
Greenpeace India

Environment Minister Jayanthi Natarajan has written a letter to Prime Minister Manmohan Singh opposing any move to bypass required green clearances for mega project approvals by the proposed National Investment Board (NIB) mooted by Finance Minister P Chidambaram. Read more at: http://indiatoday.intoday.in/story/jayanthi-natarajan-manmohan-singh-national-investment-board/1/224078.html

Java Aptitude Questions


-> What will be the output of the program?

class Exc0 extends Exception { } 
class Exc1 extends Exc0 { } /* Line 2 */
public class Test 
{  
    public static void main(String args[]) 
    { 
        try 
        {  
            throw new Exc1(); /* Line 9 */
        } 
        catch (Exc0 e0) /* Line 11 */
        {
            System.out.println("Ex0 caught"); 
        } 
        catch (Exception e) 
        {
            System.out.println("exception caught");  
        } 
    } 
}

Explanation:
An exception Exc1 is thrown and is caught by the catch statement on line 11. The code is executed in this block. There is no finally block of code to execute.

-> What will be the output of the program?

public class X 
{  
    public static void main(String [] args) 
    {
        try 
        {
            badMethod();  
            System.out.print("A");  
        } 
        catch (RuntimeException ex) /* Line 10 */
        { 
            System.out.print("B"); 
        } 
        catch (Exception ex1) 
        { 
            System.out.print("C"); 
        } 
        finally 
        {
            System.out.print("D"); 
        } 
        System.out.print("E"); 
    } 
    public static void badMethod() 
    { 
        throw new RuntimeException(); 
    } 
}

Explanation:
A Run time exception is thrown and caught in the catch statement on line 10. All the code after the finally statement is run because the exception has been caught.

-> What will be the output of the program (when you run with the -ea option) ?

public class Test 
{  
    public static void main(String[] args) 
    {
        int x = 0;  
        assert (x > 0) : "assertion failed"; /* Line 6 */
        System.out.println("finished"); 
    } 
}

Explanation:
An assertion Error is thrown as normal giving the output "assertion failed". The word "finished" is not printed (ensure you run with the -ea option)
Assertion failures are generally labeled in the stack trace with the file and line number from which they were thrown, and also in this case with the error's detail message "assertion failed". The detail message is supplied by the assert statement in line 6.

-> What will be the output of the program?

class BoolArray 
{
    boolean [] b = new boolean[3];
    int count = 0;

    void set(boolean [] x, int i) 
    {
        x[i] = true;
        ++count;
    }

    public static void main(String [] args) 
    {
        BoolArray ba = new BoolArray();
        ba.set(ba.b, 0);
        ba.set(ba.b, 2);
        ba.test();
    }

    void test() 
    {
        if ( b[0] && b[1] | b[2] )
            count++;
        if ( b[1] && b[(++count - 2)] )
            count += 7;
        System.out.println("count = " + count);
    }
}

Explanation:
The reference variables b and x both refer to the same boolean array. count is incremented for each call to the set() method, and once again when the first if test is true. Because of the && short circuit operator, count is not incremented during the second if test.

-> What will be the output of the program?

class BitShift 
{
    public static void main(String [] args) 
    {
        int x = 0x80000000;
        System.out.print(x + " and  ");
        x = x >>> 31;
        System.out.println(x);
    }
}

Explanation:
Option A is correct. The >>> operator moves all bits to the right, zero filling the left bits. The bit transformation looks like this:
Before: 1000 0000 0000 0000 0000 0000 0000 0000
After: 0000 0000 0000 0000 0000 0000 0000 0001
Option C is incorrect because the >>> operator zero fills the left bits, which in this case changes the sign of x, as shown.
Option B is incorrect because the output method print() always displays integers in base 10.
Option D is incorrect because this is the reverse order of the two output numbers.