Vertex, Tablet 'Four Brains' Successor of HTC Flyer

From the photos it is known, the latest HTC tablet may be called Vertex. As for specifics, there was a display that supports HD 128 - x 752 pixels.

McAfee Anti-virus Plus 2012-2013 6 months trial

McAfee Anti-virus Plus 2012-2013 6 months trial

McAfee Anti-virus Plus 2012-2013 6 months trial 

McAfee is presently giving one all told their best product with a six month bonus without charge.

The system desires consists of running:

Windows Xp with SP3 

Windows prospect 

Windows seven,also you would like a 

Minimum of 512MB Ram and a 

Processor with 1GHz or further.

The major advantage of this product area unit the:

Antivirus Protection – this complete feature protects you against net threats like trojans,malwares and spywares but owing to the McAfee Active protection all the suspicious files area unit analyzed even before being downloaded to your computer.Also all the removable devices along side USB’s,are scanned to seek out even the best crafted malware.

Firewall – the two day firewall is improbably effective in interference potential harmful web traffic or applications,that want to connect to net.Also when you would like to travel looking on-line the safe website} area unit marked with inexperienced supported SSL certificates and their trustworthy belongings you acknowledge if you run throughout a phishing website,a scamming internet site or a legit one.

Email protection – If you are exploitation Outlook then McAfee will scan the emails for your and permit you to acknowledge if one factor is strange.

Beside those blessings McAfee throws a handful of bonus {the computer|the computer} Tune-up that helps your pc to reinforce the booting speed and additionally the digital data device.

Now if you wish to do for a full six months.

macafer antivirus key serial 2012-13,mcafee v8 update,download macfee key serial updates,mcafee security tired one free key serial 2012-2013,mcafee info update 2012-13,internetsecurity 2012-13 Key Serial Updates Latest,free transfer mcafee enterprise 9 full 

To Download McAfee Anti-virus Plus 2012-2013 6 months trial Click Here 

Follow the steps:

1. Go to Promo Page and click “Get Started Now”
2. Create a new account, filling the spaces.
3. Check your email for activation link.
4. Click download button,accept the ToS and then click again the download button.

We square measure sharing some McAfee Key Serial Updates Free 2012-2013

Update and Register your mcafee antivirus exploitation blow provided License key serials.

If anyone key not work comment blow for additional data..............

License Key: 03GK-S3KR-7FUUH-6J26-0G0N 

License Key: 1CHD-23CR-K493R-UGM6-0G1F

S/N: 193746

Download Required File through Downloader (Fast Instalation)

How to Install Windows 7 on VirtualBox

Following on from our article about running Windows 7 within Microsoft Virtual PC, this tutorial will show you how to run Windows 7 by using the more powerful VirtualBox application.

VirtualBox is an open-source tool from which you can create a virtual computer, enabling you to run a separate operating system within your existing OS. In this example, the host PC is running Windows Vista .
To get started you will need to download the latest version of VirtualBox

Click “next” once you have read the introduction text:

You can now enter a name for your Virtual installation. In this example we have chosen “Windows 7” and selected the “Windows 7” version, as the current version of VirtualBox does not list W7. Once you have done this, click “next”: 

Now choose the amount of RAM you wish to dedicate to the virtual PC.512MB is the minimum, and a sensible value to start with (if you have plenty of memory, you could try 1024MB). Then click “next”: 

A virtual hard disk file is needed to store the OS. Click “new” to create a dynamically expanding storage file in a location of your choice. 20GB is a sensible value for a test operating system, assuming you have plenty of spare drive space. Once you have returned to the completed VHD menu, click “next”: 

The initial setup is now complete, click “finish” to complete the installation. The main VirtualBox menu will then be displayed, where you can launch the virtual PC or change settings. To configure the Windows 7 VPC, slick “settings”: 

To get the most out of the Windows 7 virtual PC the following configuration changes are recommended: 

• Increase the Video Memory to 64MB and enable 3D acceleration
• Enable audio, and change driver to “Windows Direct Sound”
• Change network adapter to “Intel PRO/1000 MT Desktop”

 Then, click CD/DVD-ROM to mount your Windows 7 installation CD (or ISO in this example): 

Once these changes have been made, click “ok” to return to the main screen. Then, click “start” (or double click the Windows 7 icon). This will boot the virtual PC and automatically load the Windows 7 setup menu if you have correctly mounted the installation DVD: 

You can then proceed to install Windows 7 as if it was a real PC, safe in the knowledge that it is all done in a virtual environment that won’t interfere with your normal boot OS. If you are an advanced user and wish to install the Guest Additions package, make sure you do this in Vista Compatibility mode for it to work 

How To:Password Protect your Google Chrome Browser

Password Protect your Chrome Browser to protect you personal browsing data. Chrome saves and keeps a record of your browsing data.

It stores saved passwords, browsing history, download history, cache, autofill form data. And this data could be easily accessed by anyone who uses your computer.


So its very important to protect this info from unauthorized access. ‘Simple Startup Password’ Chrome Extension lets you password protect your chrome browser by adding a functionality to ask for a password before opening and using Chrome browser.

Password Protected Google Chrome 

Step 1: From Google Chrome browser open Simple Startup Password webpage.
Step 2: Install the extension by clicking Install button
Step 3: After the installation click wrench icon at the top right corner and goto Tools -> Extensions.
Step 4: Search for Simple Startup Password extension and click on Options
Step 5: Enter the login password.
Step 6: That’s it! You’re done.

Now close and open the chrome browser again. You will now be prompted to enter the login password. And you will only be allowed to enter the browser on providing the correct password.

Permutation Iterative : Java : BlueJ

Permutation Iterative : Java : BlueJ

Objective :

The class PermutationIterative computes all the Unique Permutations of a string removing duplicates characters and white spaces. The Algorithm is a simple one ! All the permutations are  printed in lexicographic form.

Here the Original string is validated (duplicate and white spaces are removed) and sorted using bubble sort technique. It finds the next Permutation of a given string by the following set of rules:

• Start scanning the string from the end such that arr[i] < arr[i+1]. Here it is advisable to start counting from S.length-1.
• If i occurs to be less than 0, no more permutations are possible.
• Start scanning from end such that arr[j]>arr[i].
• Swap the elements arr[i] and arr[j]
• reverse the elements after arr[i].
• Now you have the next permutation and run a loop until the function return false.

The program will automatically run !n times and all the inputs will be in lexicographic form. This program is faster and memory efficient and can be easily applied in other languages.

BlueJ Program Screenshot :

Java Program Source Code :

/**
 * The class PermutationIterative computes all the Unique Permutations
 * of a string removing duplicates characters and whitespaces.
 * @AUTHOR SHANTANU KHAN 
 * @DATE  
 */
import java.util.*;
public class PermutationIterative
{
    private char[] S; // INSTANCE VARIABLE
    private int count;
    public PermutationIterative(String Word){ // CONSTRUCTOR
        S=removeInvalid(Word).toCharArray();
        bubbleSort();
    }
    
    private boolean permuteNext()
    {
        int i,j;
        i=S.length-2; // 1. STARTING FROM END FINDING i SUCH THAT S[i]<S[i+1]
        while(i>=0 && S[i]>S[i+1])
            i--;
        if(i<0) // NO MORE PERMUTATIONS POSSIBLE
            return false;
        j=S.length-1; // 2. ITERATING BACK FINDING j S[j]>S[i]
        while((int)S[j]<(int)S[i])
            j--;
        char temp=S[i]; // 3. SWAPPING arr[i] AND arr[j]
        S[i]=S[j];
        S[j]=temp;
        int f=i+1,b=S.length-1; // 4. REVERSING ELEMENTS AFTER i
        while(f<b){
            temp=S[f];
            S[f++]=S[b];
            S[b--]=temp;
        }
        return true;
    }
    
    public void permute(){
        System.out.println(S); // PRINT THE ORIGINAL WORD
        count++; // FOR THE FIRST PERMUTATION
        while(permuteNext()){ // EXECUTION ENDS WITHIN THE permuteNext()
            System.out.println(S);
            count++;
        }
        System.out.println("\nNo. of Permutations : "+count);
    }
    
    private static String removeInvalid(String s){
        String output="";
        for(int i=0;i<s.length();i++){
            if(!Character.isWhitespace(s.charAt(i))&&(output==""||output.indexOf(s.charAt(i))<0))
                output+=s.charAt(i);
        }
        return output;
    }
    
    public void bubbleSort()
    {
        for(int i=S.length-1;i>0;i--){ // NUMBER OF PASSES
            for(int j=0;j<i;j++){        // NUMBER OF COMPARISONS IN EACH PASS
                if(S[j]>S[j+1]){     // IF GREATER, SWAPPING J AND J+1 ELEMENT
                    char temp=S[j];    S[j]=S[j+1];    S[j+1]=temp; // SWAPPING ELEMENTS
                }
            } // END OF COMPARISION (j) LOOP
        } // END OF PASS (i) LOOP
    }
    
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        System.out.print("Enter the Word : ");
        PermutationIterative obj=new PermutationIterative(sc.nextLine());
        obj.permute();

Tower Of Hanoi Iterative : Java : BlueJ

Objective :

The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower, and sometimes pluralised) is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape.

• Only one disk may be moved at a time.

• Each move consists of taking the upper disk from one of the rods and sliding it onto another rod, on top of the other disks that may already be present on that rod.

• No disk may be placed on top of a smaller disk.

The objective of the puzzle is to move the entire stack to another rod, obeying the following rules:

With three disks, the puzzle can be solved in seven moves.

BlueJ Program Screenshot :

Java Program Source Code :

/**
 * The class TowerOfHanoiIterative computes smallest number 
 * of moves using iteration and without any stack.
 * @author  SHANTANU KHAN 
 * @version 1.0.0
 */
import java.util.*;
public class TowerOfHanoiIterative
{
    private int nDisks; // INSTANCE VARIABLE
    
    public TowerOfHanoiIterative(int nDisks){ // CONSTRUCTOR
        this.nDisks=nDisks;
    }
    
    public void execute(){
        int n=nDisks; // NUMBER OF DISKS
        int limit = (int)Math.pow(2,n)-1; // NUMBER OF ITERATIONS = 2^n - 1
        for(int i=0;i<limit;i++){
            int disk = disk(i); // DISK TO BE MOVED
            int source = ( movements(i,disk)*direction(disk,n))%3; // SOURCE PEG
            int destination = (source + direction(disk,n))%3; // DESTINATION PEG
            move(disk,source,destination);
        }      
    }
    private int disk(int i) { // RETURNS THE DISK TO BE MOVED IN i
        int C, x= i+1; // SINCE FOR STARTS WITH 0, ADDING 1
        for(C=0;x%2==0;C++){ // CONTINUOUS DIVISION BY 2 UNTIL ODD OCCURS
            x/=2;
        }
        return C; // RETURNS THE COUNTER C
    }
    private int movements(int i, int d) { // HOW MANY TIMES DISK d HAS MOVED BEFORE STAGE i
        while(d--!=0)
            i/=2;
        return (i+1)/2;
    }
    private int direction(int d,int n) { // EACH DISK MOVES IN SAME DIRECTION CW=1, ACW=2
        return 2 - (n + d)%2;
    }
    private void move(int disk, int source, int destination) {
        System.out.println("Move Disk " + (disk+1)+ " from Tower " + (source+1) + " to Tower " + (destination+1));
    }
    
    public static void main(String[] args){
       Scanner sc=new Scanner(System.in);
       System.out.print("Enter the No. of Disks : ");
       TowerOfHanoiIterative toh=new TowerOfHanoiIterative(sc.nextInt());
       toh.execute();
    }
}

System Utility : TAIL : Java

Objective :

Syntax: tail [-n] filename.ext 

This Program will print the last n lines of the Specified file. If the switch n is omitted, it will show the last 10 lines. If the file contains less, It Shows the Full Content. The Program here has been done by first reading the number of lines and then skipping lines which are not to be printed. The other way around would be to use a circular link list of size n but this process is faster as it doesn't stores the lines extracted by the file reader object.

BlueJ Program Screenshot :

Java Program Source Code :

/**
 * < Syntax: [-h] filename.ext > will print the last n lines of the Specified file.
 * If the switch n is omitted, it will show the last 10 lines. If the file contains less,
 * It Shows the Full Content.
 * Author SHANTANU KHAN
 * Date   26/06/2012
 */
import java.io.*;
public class tail
{
    // INSTANCE VARIABLES
    private int lines,present; // FILE SIZE AND EXISTING NO. OF LINES
    private String file;    // FILE NAME OR LOCATION TO BE READ
    public tail(String file){ // CONSTRUCTOR
        this.file=file;
        present=countLines(file); // COUNTS THE NO. OF LINES PRESENT IN THE FILE.
        lines=10; // DEFAULT NO. OF LINES
    }
    public tail(String file,int printLines){ // CONSTRUCTOR
        this.file=file;
        present=countLines(file);
        lines=printLines;
    }
    
    public static int countLines(String file){ // COUNT AND RETURN THE NUMBER OF LINES
        try{
            BufferedReader rFile=new BufferedReader(new FileReader(file));
            int count=0; String s;
            while(rFile.readLine()!=null) // READING THE FILE LINE-WISE
                count++; // INCREMENTING COUNTER
            rFile.close();  return count;
        }
        catch(Exception E){
            System.out.println("\nFile Not Found or UnReadAble.\n"+E);
            System.exit(-1); return -1; // RETURN STATEMENT NECESSARY
        }
    }
    
    private void printLine(){ // PRINT THE DATA IN THE SPECIFIED FILE
        int skip=0; // DEFAULT IF LINES >=AVAILABLE, SKIPS NOTHING
        if(lines<0){ // IF PARAMETER WITH SWITCH HAS NEGATIVE NUMBER : --23 TEST.TXT
            System.out.println("Error : Parameter Was Below Minimum Limit Of 0.");
            System.exit(-1);    } // EXITS IF n NEGATIVE
        else if(lines<present)
            skip=present-lines; // WILL SKIP PRINTING OF THE LINES
        try{ // EXCEPTION MAY BE THROWN IN RARE CASES, ALREADY FILE CHECKED DURING COUNT LINES
            BufferedReader rFile=new BufferedReader(new FileReader(file));
            String s;
            while(skip-->0) // READING THE FILE LINE-WISE
                s=rFile.readLine();
            while((s=rFile.readLine())!=null) // READING THE FILE LINE-WISE
                System.out.println(s);
            rFile.close();
        }
        catch(Exception E){;}
    }
    
    public static void main(String[] args){
        if(args.length==0){
            System.out.println("\nSyntax : tail [-n] fileName.ext\nn = Number of Lines to Print."); 
            System.exit(-1); // STOP EXECUTION
        }
        if(args.length==1){ // 1 PARAMETER PROVIDED 
            if(args[0].charAt(0)=='-'){ // ONLY SWITCH PROVIDED AS INPUT
                System.out.println("\nFileName Missing in Parameter.\nSyntax : tail [-n] fileName.ext\nn = Number of Lines to Print.");
                System.exit(-1); // STOP EXECUTION
            }
            else{ // ONLY FILENAME PROVIDED IN PARAMETER
                System.out.println("\nFile Accessed : "+args[0]+"\n");
                tail obj=new tail(args[0]);
                obj.printLine();
            }
        }
        else if(args.length>=2){
            if(args.length>2)
                System.out.println("\nExcess Parameters Will Be Ignored.");
            if(args[0].charAt(0)=='-'){
                int n=Integer.parseInt(args[0].substring(1));
                System.out.println("\nFile Accessed : "+args[1]+"\n");
                tail obj=new tail(args[1],n);
                obj.printLine();
            }
            else{
                System.out.println("\nFile Accessed : "+args[0]+"\n");
                tail obj=new tail(args[0]);
                obj.printLine();