# Category Archives: Data Structure

## Difference Between Repeater, DataList and GridView

To display and modify data in our Asp.Net web application, we can use Data-bound controls such as Repeater, DataList and GridView. All these three Data-bound controls are bounded to data source control such as LinqDataSource and SqlDataSource. These control also contain some other basic Asp.net control which includes DropdownList, Labels, Textbox, etc. Difference Between Repeater, DataList and GridView… Read More »

## Data Structure Interview Questions

Every year many computer science graduates apply for the job related to programming, coding and software development in big tech companies such as Google, Microsoft, Amazon, Netflix, etc., but many graduates have no idea what kind of programming questions they might have to face in the interview. Most of the coding interviews mainly comprised of Data Structure and… Read More »

## DSA: Hashing

Though using an Array, we can search an element with time complexity O(1), but the array has its limitation such as it stores similar data types, each cell of array occupies the same amount of space and to find an element we require its index value. To find the Index value of an element itself can take a… Read More »

## Data Structure & Algorithm: Interpolation Search

Interpolation search is a searching algorithm that applies on a sorted & equally distributed array, and it is an Improved variant of Binary Search. Like binary search, it uses the divide and conquers algorithm, but unlikely, it does not divide the array into two equal parts to search the element. As compared to a linear search, binary search… Read More »

## Bellman-Ford Algorithm

Bellman-Ford Algorithm, which can apply on weighted Graph Data Structure, to find the shortest path between a source vertex to all other vertices. The algorithms can be only be applied on the weighted Graph, with negative weight edges. Though we have Dijkstra’s Algorithm to find the shortest path between vertices, it can not find the shortest path if… Read More »

## What is Structured Programming?

There are many Programming paradigms we use in programming languages, and the Programming paradigm deals with how the problem will be solved using a programming language. A Programming language can consist of more than one programming paradigm which makes it more efficient. The programming paradigm also controls the flow of program execution, and here in this article, we… Read More »

## Circular Doubly Linked List

A circular doubly list is a combination of doubly and circular list, which mean it consists of the properties of both the Data structures, which make this data structure more complex. Similar to the circular linked list while performing traversing in the circular doubly linked list could lead to an infinite loop so while writing the traversal operation… Read More »

## Fibonacci Series

A fibonacci series is a special number of series which follow a pattern in which the next number of series is the sum of the previous two numbers. The Fibonacci series starts with two numbers 0 and 1. There is are two rules we need to follow to create a Fibonacci series: The series must start with 0… Read More »

## DSA: Program for Tower of Hanoi

Tower of Hanoi is a popular math puzzle in which we have given 3 towers and one of those towers has n number of rings of a different shape. We need to move those rings from one tower to another and collect all rings in another tower in the exact same sequence. All the rings are of different… Read More »

## DSA: Recursion

In Programming, we have a concept that is super important when we deal with the implementation of trees and graph data structure and it is called recursion. Recursion is a technique offered by many programming languages in which a user-defined function can call itself again and again until a base condition gets satisfied.