Your PC can get to data in RAM hundreds of times faster than it can fetch something from the Hard-Drive. If you are like me and have open at least 10 different application at the same time, plus playing around with 2 or 3 virtual machine, which, by the way, consume lots of memory space; also, all the usual application running in the background, your memory will run out pretty fast, and your PC will start to drag pretty soon. So Vista has a little tool called “ReadyBoost” that pretty much lets you use a USB Flash Drive as additional memory. Well, You might be wondering; what happens if someone pulls out the drive and tries to snoop out your data; well, don’t worry Vista encrypts the data on the Flash Drive. Read the rest of this entry »

Disk time percentage and disk queue length

IT professionals think of hard disk corruption or inadequate disk space as the cause of most system performance problems, but disk time is an equally important performance factor. Disk time is represented as a percentage of time that the hard disk is in use. If the hard disk is running 80 percent of the time, for example, you can be sure that system performance is suffering.

Another factor to consider is the average disk queue length, which refers to the number of processes that are waiting to use the hard disk. Using the disk time percentage in conjunction with the disk queue length will tell you not only how much the hard disk is being used but also if the heavy usage is a problem. For example, if the disk time is 40 percent but the average disk queue length has a factor of two or less, then the hard disk is keeping up with the demand that’s being placed on it. Read the rest of this entry »

Well after moving on to Vista, there are a few features of Windows XP that I miss. One of them is the Backup Utility of XP. Although Vista has its own backup utility, it has some disadvantages over xp NTbackup utility. Lets say you want to create a backup of just one folder containing images and docuements that you just finished working on. How would you do this in Vista? Well you can’t. Vista will not allow you to create backup of individual files, and here is where the flexibility of XP Backup Utility comes in handy. Another reasone is the fact that you can’t backup EFS protected files in Vista. So here is a step by step article on how to restore your NTbackup utility from XP to Vista. Read the rest of this entry »

I’ve been meaning to do a tutorial on cracking WPA wireless for quite a while, but I found this video that explains the methodology really simple. Let me say that cracking WPA is not like cracking WEP, in WEP you’re exploiting a vulnerability in the way the encryption algorithm is implemented, but in WPA the only vulnerability will be in the strength of the user passphrase. Yes you’ve guessed it, when cracking WPA basically what you’re doing is brute-forcing the user password, in other words the success of your attack will depend on your dictionary or password list. If the user’s passphrase is not in your dictionary, you will never crack the WPA key. There are several types of WPA dictionary list out there, but I highly recommend using rainbow-tables which can be several Gigs in size. How to find them?… Google is your friend! Read the rest of this entry »

Just the other day, I deleted my recycle bin on accident. It took me awhile to find it but this is how you recover the recycle bin if you delete it from your desktop.

1- Right-click on the Windows Vista desktop and choose Personalize.

Read the rest of this entry »

Here’s a simple code that prints out the first 1000 Prime numbers, now keep in mind that Prime numbers start at 2, we exclude 0, and 1, because they are not prime numbers. A prime number is a positive integer that has exactly two factors, 1 and the number itself. We know 0 is neither a positive nor a negative number. Otherwise, 0 is a neutral number. So, it is not a prime number, and 1 is not a prime number, 1 has only one factor, that’s 1.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

public static void main(String[] args){
    int num = 2;//2 is the first prime number
    int primeCounter = 0;
    boolean prime;
    while(primeCounter < 1000)
    {
       prime = true;
         for(int i = 2; i < num; i++)
        {
            if(num % i == 0)//checking for non prime numbers
            {
                prime = false;
                break;
            }
        }
        if(prime == true)
        {
            System.out.println(num+" is a prime number!");
            primeCounter++;//keeping count of primes numbers
        }
      num++;
    }
 }

A palindromic number reads the same both ways eg. 10201, 12321, 14641, 40804, 44944, 69696
, here is a Java code that displays the largest Palindrome numbers from the product of two 3 digits numbers.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

public static void main(String[] args) {
        int palin = 0;
        ArrayList<Integer> allPalin = new ArrayList<Integer>();
        String strPalin1 = "", strPalin2 = "";
        for(int i = 100; i <= 999; i++)
        {
            palin = i * i ;
            strPalin1 = Integer.toString(palin);
            strPalin2 = new StringBuffer(strPalin1).reverse().toString();
            if(strPalin1.equals(strPalin2))//finding palindromes
            {
                int aPalin = Integer.parseInt(strPalin1);//converting back to int to find biggest
                allPalin.add(aPalin);
            }
        }
        int largestYet = allPalin.get(0);//finding the largest palindrome in array
        for(int i = 0; i < allPalin.size(); i++)
        {
            int a = allPalin.get(i);
            if( a > largestYet )
                largestYet = a;
        }
        System.out.println(largestYet+" is the largest Palindrome!");
    }
}