by Dinesh Thakur
Category: Searching And Sorting

In a linear search the search is done over the entire list even if the element to be searched is not available. Some of our improvements work to minimize the cost of traversing the whole data set, but those improvements only cover up what is really a problem with the algorithm.

by Dinesh Thakur
Category: Searching And Sorting

The answer depends on what you mean by quickest. For most sorting problems, it just doesn't matter how quick the sort is because it is done infrequently or other operations take significantly more time anyway.

by Dinesh Thakur
Category: Searching And Sorting

An important subclass of lists permits the insertion and deletion of an element to occur only at one end. A linear list of this type is known as ‘stack’.

by Dinesh Thakur
Category: Searching And Sorting

A class of algorithm that helps to provide very rapid access to data items that can be distinguished by some KEY value, for example a person's name, or a filename. This key value is passed through a HASH FUNCTION which creates from it a number that is used as an index into a HASH TABLE containing pointers to the actual data items.

by Dinesh Thakur
Category: Queues

The information in this list is processed in the same order as it was received, that is first in first out order (FIFO) or a first – come first – served (FCFS) basis.

by Dinesh Thakur
Category: Trees

An important class of digraph, which involves for the description of hierarchy. A directed tree is an acyclic digraph which has one node called *root* with in degree 0, while other nodes have in degree Every directed tree must have at least one node.

by Dinesh Thakur
Category: Trees

The term **b-tree **refers to a way of organizing database information so that you can quickly search through it to find exactly what you're looking for. B-tree is a way of organizing database *keys *so you can quickly search them on disk.

by Dinesh Thakur
Category: Graphs

**Shortest path** can be calculated only for the weighted graphs. The edges connecting two vertices can be assigned a nonnegative real number, called the weight of the edge. A graph with such weighted edges is called a weighted graph.

by Dinesh Thakur
Category: Graphs

Processing a graph requires the ability to traverse the graph. Traversing a graph is similar to traversing a binary tree, except that traversing a graph is a bit more complicated. Recall that a binary tree has no cycles. Also, starting at the root node, we can traverse the entire tree.

About Dinesh Thakur

Dinesh Thakur holds an B.SC (Computer Science), MCSE, MCDBA, CCNA, CCNP, A+, SCJP certifications. Dinesh authors the hugely popular Computer Notes blog. Where he writes how-to guides around Computer fundamental , computer software, Computer programming, and web apps. For any type of query or something that you think is missing, please feel free to Contact us.

Basic Courses

Advance Courses