by Dinesh Thakur
Category: Searching And Sorting

In heap sort the file to be sorted is interpreted as a binary tree. The sorting technique is implemented using array, which is a sequential representation of binary tree. The positioning of a node is given as follows

by Dinesh Thakur
Category: Searching And Sorting

Searching is a process of locating a particular element present in a given set of elements. The element may be a record, a table, or a file.

by Dinesh Thakur
Category: Searching And Sorting

In Linear Search the list is searched sequentially and the position is returned if the key element to be searched is available in the list, otherwise -1 is returned. The search in Linear Search starts at the beginning of an array and move to the end, testing for a match at each item.

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: 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

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: 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: 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