JAVA Code:Query Operation In Binary Search Tree (BST)

/* Query operation in BST
*  1>Search
*  2>insert
*  3>delete
*  4>successor
*  5>predecessor
*  6>Tree Minimum
*  7>Tree Maximum
*  8> Tree travelsals- inorder,preorder,levelorder,postorder
***
*author...maulik gohil
*/

import java.util.Scanner;
import java.util.*;
public class Main {
public static void main(String args[])
{
Scanner s=new Scanner(System.in);
Qprocess qp=new Qprocess();

boolean flag=true;

while(flag)
{
System.out.println();
System.out.println("0-exit 1-insert 2-search 3-delete 4-successor 5-predecessor 6-                                                                  maximum 7-minimum");

int n=Integer.parseInt(s.nextLine());
if(n==1)
{
//insert
int entry=Integer.parseInt(s.nextLine());
Node node=new Node(entry);
qp.insert(node);
}
else if(n==2)
{
//search
int entry=Integer.parseInt(s.nextLine());
qp.search(entry);
}
else if(n==3)
{
//delete
int entry=Integer.parseInt(s.nextLine());
qp.delete(entry);
}
else if(n==4)
{
//successor
int entry=Integer.parseInt(s.nextLine());
qp.successor(entry);

}
else if(n==5)
{
//predecessor
 int entry=Integer.parseInt(s.nextLine());
qp.predecessor(entry);
}
else if(n==6)
{
//maximum
qp.maximum();
}
else if(n==7)
{
//minimum
qp.minimum();
}
if(n==0)
{
//termination of loop
flag=false;
}
}
        }
}

public class Qprocess {

public Node root=null;

public void insert(Node node)

{

Node y=null;

Node x=null;

x=root;

while(x!=null)

{

y=x;

if(node.key<x.key)

x=x.left;

else

x=x.right;

}

node.parent=y;

if(y==null)

root=node;

else if(node.key<y.key)

y.left=node;

else

y.right=node;

System.out.print("inorder  "+">> ");

this.Inorder(root); 

System.out.println();

System.out.print("preorder "+">> ");

this.Preorder(root);

System.out.println();

System.out.print("postorder"+">> ");

this.Postorder(root);

System.out.println();

System.out.print("levelorder"+">> ");

this.levelorder(root);

}

private void Inorder(Node x)

{

if(x==null)

return;

this.Inorder(x.left);

System.out.print(" "+x.key);

this.Inorder(x.right);

}

private void Preorder(Node x)

{

if(x==null)

return;

System.out.print(" "+x.key);

this.Preorder(x.left);

this.Preorder(x.right);

}

private void Postorder(Node x)

{

if(x==null)

return;

this.Postorder(x.left);

this.Postorder(x.right);

System.out.print(" "+x.key);

}

private void levelorder(Node x)

{

Queue queue=new LinkedList();

if(x==null)

return;

else

queue.add(x);

while(!queue.isEmpty())

{

Node current=(Node) queue.poll();

System.out.print(" "+current.key);

if(current.left!=null)

queue.add(current.left);

if(current.right!=null)

queue.add(current.right);

}

}

public void search(int x)

{

Node temp=root;

while(temp!=null && temp.key!=x)

{

if(x<temp.key)

temp=temp.left;

else

temp=temp.right;

}

if(temp!=null)

System.out.print(temp.key);

else

System.out.print("not found");

}

public void maximum()

{

Node temp=root;

while(temp.right!=null)

{

temp=temp.right;

}

System.out.print(temp.key);

}

public void minimum()

{

Node temp=root;

while(temp.left!=null)

{

temp=temp.left;

}

System.out.print(temp.key);

}

public void successor(int x) 

{

Node temp=root;

//search method to reach the node where key value match

while(temp!=null && temp.key!=x)

{

if(x<temp.key)

temp=temp.left;

else

temp=temp.right;

}

//successor code

if(temp.right!=null)

{

temp=temp.right;

//treeMIN

while(temp.left!=null)

{

temp=temp.left;

}

System.out.print(temp.key);

}

else

{

Node p=temp.parent;

while(p!=null && p.right==temp)

{

temp=p;

p=p.parent;

}

System.out.print(p.key);

}

}

public void predecessor(int x) 

{

Node temp=root;

//search method to reach the node where key value match

while(temp!=null && temp.key!=x)

{

if(x<temp.key)

temp=temp.left;

else

temp=temp.right;

}

//predecessor code

if(temp.left!=null)

{

temp=temp.left;

//treeMAX

while(temp.right!=null)

{

temp=temp.right;

}

System.out.print(temp.key);

}

else

{

Node p=temp.parent;

while(p!=null && p.left==temp)

{

temp=p;

p=p.parent;

}

System.out.print(p.key);

}

}

        public void delete(int x) 

{

Node t=null;

Node y=null;

Node temp=root;

while(temp!=null && temp.key!=x)

{

if(x<temp.key)

temp=temp.left;

else

temp=temp.right;

}

if(temp.left==null || temp.right==null)//one or no child

{

y=temp;

}

else

{

if(temp.right!=null)

{

temp=temp.right;

//treeMIN

while(temp.left!=null)

{

temp=temp.left;

}

y=temp;

System.out.println(y.key);

System.out.println("check22");

}

else

{

Node p=temp.parent;

while(p!=null && p.right==temp)

{

temp=p;

p=p.parent;

}

y=p;

}

}

if(y.left!=null)

{

t=y.left;

}

else

{

t=y.right;

}

if(t!=null)

{

t.parent=y.parent;

}

if(y.parent==null)

{

root=t;

}

else if(y==y.parent.left)

{

y.parent.left=t;

}

else

{

y.parent.right=t;

}

System.out.print("inorder  "+">> ");

this.Inorder(root); 

System.out.println();

System.out.print("preorder "+">> ");

this.Preorder(root);

System.out.println();

System.out.print("postorder"+">> ");

this.Postorder(root);

System.out.println();

System.out.print("levelorder"+">> ");

this.levelorder(root);

}

}

public class Node 

{

int key;

Node left;

Node right;

Node parent;

public Node(int x)

{

parent=null;

left=null;

right=null;

this.key=x;

}

}

JAVA Code : Reversing subsequence of LinkedList

/*
@ Used DATA Structure is Linked List
@ author: maulik gohil
*/

package ChanceSequence;
import java.util.Scanner;

public class Main
{
private static Scanner sc;

public static void main(String args[])throws Exception
{
LinkedList ls=new LinkedList();
sc = new Scanner(System.in);
System.out.println("enter length of linkedList ->");
int length=Integer.parseInt(sc.nextLine());

for(int i=1;i<=length;i++)
{
int data=Integer.parseInt(sc.nextLine());
ls.insert(data);
}

System.out.println("insert range which u want to reverse ->");
int r1=Integer.parseInt(sc.nextLine());
int r2=Integer.parseInt(sc.nextLine());
int test=1+(r2-r1);

ls.defineStart(r1);

ls.defineEnd(r2);

if((test%2)==0)
{
ls.doEven(r1,r2);  
}
else
{
ls.doOdd(r1,r2);
}
ls.display();
}

}

public class LinkedList 

{

        public static int count=0;
public Node Start;
public Node End;
public Node def;
private Node temp;
private Node head;
private Node tail;
public void insert(int data)
{
temp=new Node(data);
if(tail!=null)
{
tail.next=temp;
temp.previous=tail;
tail=temp;
}
else
{
def=temp;
head=temp;
tail=temp;
}
}
public void defineStart(int r1)
{

while(count!=r1)
{
def=def.next;
count++;
}
Start=def;
System.out.println("Start DATA>"+Start.data);
}
public void defineEnd(int r2)
{
while(count!=r2)
{
def=def.next;
count++;
}
End=def;
System.out.println("End DATA>"+End.data);
}
public void doEven(int r1,int r2)
{
int i=r1;
int j=r2;
for(i=r1;i<j;i++)
{
int store=Start.data;
Start.data=End.data;
End.data=store;
Start=Start.next;
End=End.previous;
j--;
}
}
public void doOdd(int r1,int r2)
{
int i=r1;
int j=r2;
for(i=r1;i!=j;i++)
{
int store=Start.data;
Start.data=End.data;
End.data=store;
Start=Start.next;
End=End.previous;
j--;
}
}
public void display()
{
//System.out.println("hello");
while(head!=null)
{
System.out.println(head.data);
head=head.next;
}
}

public class Node {

 int data,index=0;

Node next;

Node previous;

         public Node(int x)

{

this.data=x;

//this.index=index;

this.next=null;

this.previous=null;

}

}

7 tips to improve the way you search online

As the internet continues to grow with every passing second, the amount of content available online — such as text, pictures and even high-definition multimedia — keeps on increasing. The biggest problem we face, however, is accessing all this information when we need it.

This is where search engines come in. Most of us tend to use the usual services — Bing, Google and Yahoo. But did you know that there's more to web search than just these big names? Here's a quick primer that will help you...

1. Meta search

For better results, it is recommended that you use at least two or three search engines. But for most of us, querying different services can prove to be cumbersome. In such cases, it makes sense to use meta search engines, which pull data from multiple services, eliminate duplicates, and use their own algorithms to reorder the results. 

Here you could look at:Dogpile.com (queries Google and Yahoo)Zapmeta.com (Altavista, Entireweb, Gigablast and Yahoo, among other services)Search.com (Bing, Blekko, DMOZ aka Open Directory and Google).

If you're looking for multimedia, you could use search.creativecommons.org. This site is not a meta search engine in itself, but lets you query services such as Flickr, Fotopedia, Google Images, Open Clip Art Gallery and Pixabay for images; Jamendo, ccMixter and SoundCloud for music; and YouTube for videos.

2. Natural language search

Most search engines rely on keywords to carry out searches. But if you're looking for a service where you can ask questions in spoken English, try Ask.com. This engine understands queries in natural language to give you exactly the kind of result you were looking for.

Type "How large is a whale," for instance, and the site returns with "Whales reach lengths of 100 feet and can weigh up to 200 tons..."

3. Social search

Searching websites is one thing, but trawling blogs, social networks and tweets for content is quite something else.

Here, our favourite tool is Icerocket.com. Simply type your keyword or phrase, and you can then select from any one of its tabs: Blogs, Twitter, Facebook, or Search All for results. It's a great way to keep an eye on what's trending on the interweb.

4. Image search

Bing, Google and Yahoo let you search images, but you might want to try Tineye.com, which is a 'reverse' image search engine.

You can upload a picture, or send a web link to its servers, after which Tineye uses image identification technology to tell you where the picture came from, how it's being used, if modified versions exist and it even identifies higher resolution versions.

The site, which regularly crawls the web for new pictures, has indexed 7.3 billion images from the internet to help you find what you're looking for.

5. Video search

If it's online videos you're looking for, try Blinkx.com. This service helps you find clips from hosting services, v-logs, news channels and more.

You can search by category (news and politics, sports, science and nature, technology, movies, and celebrities), keywords and sometime even by content (like song lyrics) — and with your results, Blinkx also suggests possible channels to which you can subscribe.

6. Kid search

Kidrex.org is designed exclusively for youngsters and leads to content that's safe for kids.

Alternatively, most search engines provide filters that block content that might not be suitable for children. Bing, Google, and Yahoo have their SafeSearch option, which can be found under 'Preferences' on the respective sites.

Still, it should be noted that these filters are not perfect and some material does get past them, so keeping a parental eye on these is advised.

7. Medical search

iMedisearch.com is a customized Google engine specifically built to search medical-related resources. But unlike Google, which cannot distinguish between reputable and non-reputable medical sites, iMedisearch only displays data from credible websites that have been carefully selected by a practising clinical pharmacist.

Additionally, the site separates results based on users — whether general public, physician or nurse — to deliver relevant and accurate results.

Samsung to build $3 billion smartphone plant in Vietnam

South Korea's Samsung Electronics has applied for a license to invest $3 billion in building a second smartphone factory in northern Vietnam, a government official said on Monday.

Samsung Electronics Vietnam plans to build the factory in Thai Nguyen province, where it opened a $2 billion smartphone plant in March, said a senior official at the province's Planning and Investment Department.

"We are working on the project," said the official, confirming an earlier report by Dau Tu, a newspaper controlled by Vietnam's Planning and Investment Ministry. "There are still a few things to fix." The official was not authorized to speak to media on the matter and so declined to be identified by name.

A Samsung spokeswoman told Reuters the company is in discussions with Vietnam's government to invest up to $3 billion in its handset business. The schedule for the spending and how much will ultimately be spent have yet to be decided, she said.

Samsung has been increasing production in Vietnam to reduce costs and better compete with the low-priced smartphones of Chinese rivals in particular.

A subsidiary of the electronics giant, Samsung Display Co Ltd, said in July it received regulatory approval to build a $1 billion display module assembly plant in the country.

Samsung Electronics' latest move would bring its total investment pledges in Vietnam this year to around $11 billion, according to Dau Tu newspaper, whose controlling ministry oversees foreign investment.

Mobile phones and accessories became Vietnam's biggest cash earner last year, taking over textiles. In January-October this year, export revenue reached $19.2 billion, or around 15 percent of the country's total.

Samsung's first smartphone plant in Vietnam, built with an investment of $2 billion, generated $1.9 billion in export revenue in its first four months of operation, according to the Thai Nguyen provincial government.

The government, in a statement earlier this month, said the company's total revenue is expected to jump more than 67 percent to $13.4 billion next year from $8 billion projected for 2014.

Steve Jobs

Co-founder of Apple Computer Inc. 
Founded: 1976

"We started out to get a computer in the hands of everyday people, and we succeeded beyond our wildest dreams."-Steve Jobs

Steve Jobs' vision of a "computer for the rest of us" sparked the PC revolution and made Apple an icon of American business. But somewhere along the way, Jobs' vision got clouded -- some say by his ego -- and he was ousted from the company he helped found. Few will disagree that Jobs did indeed impede Apple's growth, yet without him, the company lost its sense of direction and pioneering spirit. After nearly 10 years of plummeting sales, Apple turned to its visionary founder for help, and a little older, little wiser Jobs engineered one of the most amazing turnarounds of the 20th century.

The adopted son of a Mountain View, Calif., machinist, Steve Jobs showed an early interest in electronics and gadgetry. While in high school, he boldly called Hewlett-Packard co-founder and president William Hewlett to ask for parts for a school project. Impressed by Jobs, Hewlett not only gave him the parts, but also offered him a summer internship at Hewlett-Packard. It was there that Jobs met and befriended Steve Wozniak, a young engineer five years his senior with a penchant for tinkering.

After graduating from high school, Jobs enrolled in Reed College but dropped out after one semester. He had become fascinated by Eastern spiritualism, and he took a part-time job designing video games for Atari in order to finance a trip to India to study Eastern culture and religion.

When Jobs returned to the U.S., he renewed his friendship with Wozniak, who had been trying to build a small computer. To Wozniak, it was just a hobby, but the visionary Jobs grasped the marketing potential of such a device and convinced Wozniak to go into business with him. In 1975, the 20-year-old Jobs and Wozniak set up shop in Jobs' parents' garage, dubbed the venture Apple, and began working on the prototype of the Apple I. To generate the $1,350 in capital they used to start Apple, Steve Jobs sold his Volkswagen microbus, and Steve Wozniak sold his Hewlett-Packard calculator.

Although the Apple I sold mainly to hobbyists, it generated enough cash to enable Jobs and Wozniak to improve and refine their design. In 1977, they introduced the Apple II -- the first personal computer with color graphics and a keyboard. Designed for beginners the user-friendly Apple II was a tremendous success, ushering in the era of the personal computer. First-year sales topped $3 million. Two years later, sales ballooned to $200 million.

But by 1980, Apple's shine was starting to wear off. Increased competition combined with less than stellar sales of the Apple III and its follow-up, the LISA, caused the company to lose nearly half its market to IBM. Faced with declining sales, Jobs introduced the Apple Macintosh in 1984. The first personal computer to feature a graphical-user interface controlled by a mouse, the Macintosh was a true breakthrough in terms of ease-of-use. But the marketing behind it was flawed. Jobs had envisioned the Mac as a home computer, but at $2,495, it was too expensive for the consumer market. When consumer sales failed to reach projections, Jobs tried pitching the Mac as a business computer. But with little memory, no hard drive and no networking capabilities, the Mac had almost none of the features corporate America wanted.

For Jobs, this turn of events spelled serious trouble. He clashed with Apple's board of directors and, in 1983, was ousted from the board by CEO John Sculley, whom Jobs had handpicked to help him run Apple. Stripped of all power and control, Jobs eventually sold his shares of Apple stock and resigned in 1985.

Later that year, using a portion of the money from the stock sale, Jobs launched NeXT Computer Co., with the goal of building a breakthrough computer that would revolutionize research and higher education. Introduced in 1988, the NeXT computer boasted a host of innovations, including notably fast processing speeds, exceptional graphics and an optical disk drive. But priced at $9,950, the NeXT was too expensive to attract enough sales to keep the company afloat. Undeterred, Jobs switched the company's focus from hardware to software. He also began paying more attention to his other business, Pixar Animation Studios, which he had purchased from George Lucas in 1986.

After cutting a three-picture deal with Disney, Jobs set out to create the first ever computer-animated feature film. Four years in the making, "Toy Story" was a certified smash hit when it was released in November 1995. Fueled by this success, Jobs took Pixar public in 1996, and by the end of the first day of trading, his 80 percent share of the company was worth $1 billion. After nearly 10 years of struggling, Jobs had finally hit it big. But the best was yet to come.

Within days of Pixar's arrival on the stock market, Apple bought NeXT for $400 million and re-appointed Jobs to Apple's board of directors as an advisor to Apple chairman and CEO Gilbert F. Amelio. It was an act of desperation on Apple's part. Because they had failed to develop a next-generation Macintosh operating system, the firm's share of the PC market had dropped to just 5.3 percent, and they hoped that Jobs could help turn the company around.

At the end of March 1997, Apple announced a quarterly loss of $708 million. Three months later, Amelio resigned and Jobs took over as interim CEO. Once again in charge of Apple, Jobs struck a deal with Microsoft to help ensure Apple's survival. Under the arrangement, Microsoft invested $150 million for a nonvoting minority stake in Apple, and the companies agreed to "cooperate on several sales and technology fronts." Next, Jobs installed the G3 PowerPC microprocessor in all Apple computers, making them faster than competing Pentium PCs. He also spearheaded the development of the iMac, a new line of affordable home desktops, which debuted in August 1998 to rave reviews. Under Jobs' guidance, Apple quickly returned to profitability, and by the end of 1998, boasted sales of $5.9 billion.

Against all odds, Steve Jobs pulled the company he founded and loved back from the brink. Apple once again was healthy and churning out the kind of breakthrough products that made the Apple name synonymous with innovation.

But Apple's innovations were just getting started. Over the next decade, the company rolled out a series of revolutionary products, including the iPod portable digital audio player in 2001, an online marketplace called the Apple iTunes Store in 2003, the iPhone handset in 2007 and the iPad tablet computer in 2010. The design and functionality of these devices resonated with users worldwide. Apple says it has sold more than 300 million iPods, over 100 million iPhones and more than 15 million iPad devices. The company has sold billions of songs from its iTunes Store.

Despite his professional successes, Jobs struggled with health issues. In mid-2004, he announced in an email to Apple employees that he had undergone an operation to remove a cancerous tumor from his pancreas. In January 2011, following a liver transplant, Jobs said he was taking a medical leave of absence from Apple but said he'd continue as CEO and "be involved in major strategic decisions for the company."

Eight months later, on August 24, Apple’s board of directors announced that Jobs had resigned as CEO and that he would be replaced by COO Tim Cook. Jobs said he would remain with the company as chairman.

"I have always said if there ever came a day when I could no longer meet my duties and expectations as Apple’s CEO, I would be the first to let you know," Jobs said in a letter announcing his resignation. "Unfortunately, that day has come."

Jobs once described himself as a "hopeless romantic" who just wanted to make a difference. Quite appropriately like the archetypal romantic hero who reaches for greatness but fails, only to find wisdom and maturity in exile, an older, wiser Steve Jobs returned triumphant to save his kingdom.

Difference between an Intel Core i3, i5 and i7

'What's the difference between an Intel Core i3, i5 and i7?' is a pretty confusing and intimidating question for the majority of people. On the surface, processors are a little tougher to get your head around than, say, a hard drive, as they are not measured by a metric as simple as GB size. However, once you've spent a couple of minutes reading this article, you can be confident of knowing 'What's the difference between an Intel Core i3, i5 and i7?' 

Intel Core i3, Core i5, and Core i7 CPUs have been around for over a year now, but some buyers still get stumped whenever they attempt to build their own systems and are forced to choose among the three. With the more recent Sandy Bridge architecture now on store shelves, we expect the latest wave of buyers to ask the same kind of questions.

What the difference between Intel Cores: Core i3, Core i5, Core i7 — the difference in a nutshell

Advertisement

If you want a plain and simple answer, then generally speaking, Core i7s are better than Core i5s, which are in turn better than Core i3s. Nope, Core i7 does not have seven cores nor does Core i3 have three cores. The numbers are simply indicative of their relative processing powers. 

Their relative levels of processing power are also signified by their Intel Processor Star Ratings, which are based on a collection of criteria involving their number of cores, clockspeed (in GHz), size of cache, as well as some new Intel technologies like Turbo Boost and Hyper-Threading.

Core i3s are rated with three stars, i5s have four stars, and i7s have five. If you’re wondering why the ratings start with three, well they actually don’t. The entry-level Intel CPUs — Celeron and Pentium — get one and two stars respectively.

Note: Core processors can be grouped in terms of their target devices, i.e., those for laptops and those for desktops. Each has its own specific characteristics/specs. To avoid confusion, we’ll focus on the desktop variants. Note also that we’ll be focusing on the 2nd Generation (Sandy Bridge) Core CPUs.

Number of cores

The more cores there are, the more tasks (known as threads) can be served at the same time. The lowest number of cores can be found in Core i3 CPUs, i.e., which have only two cores. Currently, all Core i3s are dual-core processors.

Currently all Core i5 processors, except for the i5-661, are quad cores in Australia. The Core i5-661 is only a dual-core processor with a clockspeed of 3.33 GHz. Remember that all Core i3s are also dual cores. Furthermore, the i3-560 is also 3.33GHz, yet a lot cheaper. Sounds like it might be a better buy than the i5. What gives?

At this point, I’d like to grab the opportunity to illustrate how a number of factors affect the overall processing power of a CPU and determine whether it should be considered an i3, an i5, or an i7.

Even if the i5-661 normally runs at the same clockspeed as Core i3-560, and even if they all have the same number of cores, the i5-661 benefits from a technology known as Turbo Boost.

Intel Turbo Boost

The Intel Turbo Boost Technology allows a processor to dynamically increase its clockspeed whenever the need arises. The maximum amount that Turbo Boost can raise clockspeed at any given time is dependent on the number of active cores, the estimated current consumption, the estimated power consumption, and the processor temperature.

For the Core i5-661, its maximum allowable processor frequency is 3.6 GHz. Because none of the Core i3 CPUs have Turbo Boost, the i5-661 can outrun them when it needs to. Because all Core i5 processors are equipped with the latest version of this technology — Turbo Boost 2.0 — all of them can outrun any Core i3.

Cache size

Whenever the CPU finds that it keeps on using the same data over and over, it stores that data in its cache. Cache is just like RAM, only faster — because it’s built into the CPU itself. Both RAM and cache serve as holding areas for frequently used data. Without them, the CPU would have to keep on reading from the hard disk drive, which would take a lot more time.

Basically, RAM minimises interaction with the hard disk, while cache minimises interaction with the RAM. Obviously, with a larger cache, more data can be accessed quickly. All Core i3 processors have 3MB of cache. All Core i5s, except again for the 661 (only 4MB), have 6MB of cache. Finally, all Core i7 CPUs have 8MB of cache. This is clearly one reason why an i7 outperforms an i5 — and why an i5 outperforms an i3.

Hyper-Threading

Only one thread can be served by one core at a time. So if a CPU is a dual core, then supposedly only two threads can be served simultaneously. However, Intel has introduced a technology called Hyper-Threading. This enables a single core to serve multiple threads.

For instance, a Core i3, which is only a dual core, can actually serve two threads per core. In other words, a total of four threads can run simultaneously. Thus, even if Core i5 processors are quad cores, since they don’t support Hyper-Threading (again, except the i5-661) the number of threads they can serve at the same time is just about equal to those of their Core i3 counterparts.

This is one of the many reasons why Core i7 processors are the creme de la creme. Not only are they quad cores, they also support Hyper-Threading. Thus, a total of eight threads can run on them at the same time. Combine that with 8MB of cache and Intel Turbo Boost Technology, which all of them have, and you’ll see what sets the Core i7 apart from its siblings.

The upshot is that if you do a lot of things at the same time on your PC, then it might be worth forking out a bit more for an i5 or i7. However, if you use your PC to check emails, do some banking, read the news, and download a bit of music, you might be equally served by the cheaper i3.

At DCA Computers, we regularly hear across the sales counter, “I don’t mind paying for a computer that will last, which CPU should I buy?” The sales tech invariably responds “Well that depends on what you use your computer for.” If it’s the scenario described above, we pretty much tell our customers to save their money and buy an i3 or AMD dual core.

Another factor in this deliberation is that more and more programs are being released with multithread capability. That is they can use more than one CPU thread to execute a single command. So things happen more quickly. Some photo editors and video editing programs are multi-threaded, for example. However, the Internet browser you use to access Netbank or your email client is not, and is unlikely to be in the foreseeable future.

Hopefully this gives you some insight for your next CPU selection. Happy computing!