Thursday, 22 September 2011

Types of Computers

Classes by Size

Microcomputers (Personal computers)

Microcomputers are the most common type of computers used by people today, whether in a workplace, at school or on the desk at home. The term “microcomputer” was introduced with the advent of single chip microprocessors. The term “microcomputer” itself is now practically an anachronism.
These computers include:
A separate class is that of mobile devices:

Minicomputers (Midrange computers)

minicomputer (colloquially, mini) is a class of multi-user computers that lies in the middle range of the computing spectrum, in between the smallest multi-user systems (mainframe computers) and the largest single-user systems (microcomputers or personal computers). The contemporary term for this class of system is midrange computer, such as the higher-end SPARCPOWER and Itanium -based systems from Sun MicrosystemsIBM and Hewlett-Packard.

Mainframe computers

The term mainframe computer was created to distinguish the traditional, large, institutional computer intended to service multiple users from the smaller, single user machines. These computers are capable of handling and processing very large amounts of data quickly. Mainframe computers are used in large institutions such as government, banks and large corporations.


supercomputer is focused on performing tasks involving intense numerical calculations such as weather forecasting, fluid dynamics, nuclear simulations, theoretical astrophysics, and complex scientific computations. A supercomputer is a computer that is at the frontline of current processing capacity, particularly speed of calculation. The term supercomputer itself is rather fluid, and the speed of today's supercomputers tends to become typical of tomorrow's ordinary computer. Supercomputer processing speeds are measured in floating point operations per second or FLOPS. An example of a floating point operation is the calculation of mathematical equations in real numbers. In terms of computational capability, memory size and speed, I/O technology, and topological issues such as bandwidth and latency, supercomputers are the most powerful, are very expensive, and not cost-effective just to perform batch or transaction processing. Transaction processing is handled by less powerful computers such as server computers or mainframes.

Classes by function


Server usually refers to a computer that is dedicated to providing a service. For example, a computer dedicated to a database may be called a "database server". "File servers" manage a large collection of computer files. "Web servers" process web pages and web applications. Many smaller servers are actually personal computers that have been dedicated to providing services for other computers.


Workstations are computers that are intended to serve one user and may contain special hardware enhancements not found on a personal computer.

Information appliances

Information appliances are computers specially designed to perform a specific user-friendly function —such as playing musicphotography, or editing text. The term is most commonly applied to mobile devices, though there are also portable and desktop devices of this class.

Embedded computers

Embedded computers are computers that are a part of a machine or device. Embedded computers generally execute a program that is stored in non-volatile memory and is only intended to operate a specific machine or device. Embedded computers are very common. Embedded computers are typically required to operate continuously without being reset or rebooted, and once employed in their task the software usually cannot be modified. An automobile may contain a number of embedded computers; however, a washing machine and a DVD playerwould contain only one. The central processing units (CPUs) used in embedded computers are often sufficient only for the computational requirements of the specific application and may be slower and cheaper than CPUs found in a personal computer.

Google adsense help, How to generate more revenue from google ads

In the next month, we'll introduce the +1 button and personal recommendations to display ads. The +1 button will begin to appear on AdSense for Content and AdSense for Mobile Content display ad formats -- image, animated gif, and Flash. +1s will be one additional signal to help determine an ad's relevance and we'll continue to show the ads that will generate the most revenue for you.
We previously launched the +1 button on Google search and for publisher sites to make it easier for people to share and discover content across the web. Soon, your users will be able to endorse specific ads and make the ads more likely to appear to their social connections. We believe that these recommendations could help your readers notice ads on your site more, leading to higher returns for you over time.
If you prefer not to show the +1 buttons on display ads on your pages, you can opt out in your account. For more information please visit the Inside AdSense blog.
The Google AdSense team
Reference: Google AdSense team

Monday, 19 September 2011

C Algorithms - Heap Sort

Heapsort is a comparison based algorithm. It bases on building a heap tree from the data set and then it removes the greatest element from the tree and adds it to the end of the sorted list. .....
C Algorithms - Heap Sort 

C Algorithms - Selection Sort

Selection sort also called naive selection sort is an in-place comparison sort. It may look pretty similar to insertion sort but it performs worse. It is a quite simple sorting algorithm and may perform....
Algorithms - Selection Sort 

C Algorithms - Bucket Sort

Bucket sort is a sorting algorithm that works by inserting the elements of the sorting array intro buckets then each bucket is sorted individually. The idea behind bucket sort is that ........
Algorithms - Bucket Sort 

C Algorithms - Bucket Sort

Bucket sort is a sorting algorithm that works by inserting the elements of the sorting array intro buckets then each bucket is sorted individually. The idea behind bucket sort is that ........
Algorithms - Bucket Sort 

C Algorithms - Quick Sort

Quick Sort
Quick sort is a comparison sort developed by Tony Hoare. Also like merge sort it is a divide and conquer algorithm and just like merge sort it uses recursion to sort the lists. It uses a pivot chosen by............
 C Algorithms - Quick Sort

C Algorithms - Graph Theory

The graph theory refers to the study of graphs. A graph is a mathematical object that captures the notion of connection. For example you want to connect two or more dots.........
 C Algorithms - Graph Theory 

C Algorithms - Topological Sort

Let us say that the order relation that was defined the in introduction lesson was a partial one for example a1 a0 a1 a2 a3. The problem is to determine a list of order in which if ai aj then ai will come before aj in the final sorted list .Read More..........
C Algorithms - Topological Sort

C Algorithms - Depth-First Search (DFS)

Depth-first search DFS and breadth-first search BFS are two algorithms for traversing a graph. Graph traversal refers to the problem of visiting all the nodes in a graph in a particular manner. Read More.........
Algorithms - Depth-First Search (DFS) 

C Algorithms - Breadth-First Search (BFS)

Depth-first search DFS and breadth-first search BFS are two algorithms for traversing a graph. A breadth-first search BFS begins at the root node and explores all the neighboring nodes. Read More......
Algorithms - Breadth-First Search (BFS) 

C Algorithms - Dijkstra's Algorithm

Dijkstra's Algorithm 
This algorithm is a graph search algorithm that solves the shortest path problem for a graph. In the graph the path between vertices has a cost or a length so Dijkstra s algorithm simply determines the path with the lowest cost between a vertex and another. Read More..............
Algorithms - Dijkstra's Algorithm 

Oracle 11g SecureFiles

Introduction With the whirling phases of application development its content has to be efficient to handle both relational and unstructured data in accessible form. Read More.......

Free Host | lasik surgery new york