## What is Circular Linked Lists

by Dinesh Thakur Category: Linked Lists

In a circularly-linked list, the first and final nodes are linked together. In another words, circularlylinked lists can be seen as having no beginning or end. To traverse a circular linked list, begin at any node and follow the list in either direction until you return to the original node.

## What is Singly-circularly-linked list

by Dinesh Thakur Category: Linked Lists

In a singly-circularly-linked list, each node has one link, similar to an ordinary singly-linked list, except that the link of the last node points back to the first node. As in a singly-linked list, new nodes can only be efficiently inserted after a node we already have a reference to.

## What is Doubly-circularly-linked list

by Dinesh Thakur Category: Linked Lists

In a doubly-circularly-linked list, each node has two links, similar to a doubly-linked list, except that the previous link of the first node points to the last node and the next link of the last node points to the first node. As in doubly-linked lists, insertions and removals can be done at any point with access to any nearby node.

## Circularly-linked list vs. linearly-linked list

by Dinesh Thakur Category: Linked Lists

Circularly linked lists are useful to traverse an entire list starting at any point. In a linear linked list, it is required to know the head pointer to traverse the entire list. The linear linked list cannot be traversed completely with the help of an intermediate pointer.

## What is Hashing?

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.

## What is Stack

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’.

## What is Sorting? Type of Sorting

by Dinesh Thakur Category: Searching And Sorting

Sorting refers to ordering data in an increasing or decreasing fashion according to some linear relationship among the data items.

## What is the quickest sorting method to use

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.

## What is Bubble Sort

by Dinesh Thakur Category: Searching And Sorting

This sorting technique is named so because of the logic is similar to the bubble in water. When a bubble is formed it is small at the bottom and when it moves up it becomes bigger and bigger i.e. bubbles are in ascending order of their size from the bottom to the top.

## What is Quick Sort

by Dinesh Thakur Category: Searching And Sorting

In this sort an element called pivot is identified and that element is fixed in its place by moving all the elements less than that to its left and all the elements greater than that to its right. Since it partitions the element sequence into left, pivot and right it is referred as a sorting by partitioning.

## What is Heap Sort

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

## What is Searching

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.

## What is Linear Search

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.

## What is Binary Search

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.

## What is Queue

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.

## What is b-tree?

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.

## What is Tree ? Explian Binary Tree.

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.

## Explain Shortest Path Algorithm.

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.

## What is Graph Traversals ? Explain Depth First Traversal and Breadth First Traversal

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.

Page 2 of 2

About Dinesh Thakur

Dinesh Thakur holds an B.C.A, MCSE, MCDBA, CCNA, CCNP, A+, SCJP certifications. Dinesh authors the hugely popular 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.