Posted by Muhammad Nasir on 07:34
Classes by SizeMicrocomputers (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:Desktop computers – A case and a display, put under and on a desk.
In-car computers (“carputers”) – Built into a car, for entertainment, navigation, etc.
Game consoles – Fixed computers specialized for entertainment purposes (computer games).
A separate...
Posted by Muhammad Nasir on 06:57
Hello,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...
Posted by Muhammad Nasir on 09:57
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&nbs...
Posted by Muhammad Nasir on 09:57
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&nbs...
Posted by Muhammad Nasir on 09:52
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&nbs...
Posted by Muhammad Nasir on 09:52
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&nbs...
Posted by Muhammad Nasir on 09:49
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 Sor...
Posted by Muhammad Nasir on 09:34
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&nbs...
Posted by Muhammad Nasir on 09:33
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 So...
Posted by Muhammad Nasir on 09:32
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)&nbs...
Posted by Muhammad Nasir on 09:31
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)&nbs...
Posted by Muhammad Nasir on 09:29
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&nbs...
Posted by Muhammad Nasir on 09:23
Oracle 11g SecureFilesIntroduction 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.......
Oracle 11g SecureFiles ...
