## Data Structures Introduction

In computer terms, a data structure is a Specific way to store and organize data in a computer’s memory so that these data can be used efficiently later.

In computer terms, a data structure is a Specific way to store and organize data in a computer’s memory so that these data can be used efficiently later.

For doing data structure and implementing its various concepts in this upcoming chapters, you need to have a compiler to perform all the concepts in the form of programs.

The present generation digital computer was made and planned as a device which can make easy and speed up complex and time-consuming computations. In the majority of applications or programs, it has the ability to store and access huge amount […]

In greedy algorithm technique, choices are being made from the given result domain. As being greedy, the next to possible solution that looks to supply optimum solution is chosen. Greedy method is used to find restricted most favorable result which may finally land in globally optimized answers. But usually greedy algorithms do not gives globally optimized solutions.

You have seen so far that data structure uses some algorithms and need storage for storing values. For storing these values, programmers must need to have the fundamental data type’s names such as char, int, float & double. As you […]

The linked list or one way list is a linear set of data elements which is also termed as nodes. Here, the linear order is specified by means of pointers. Each node is separated into two different parts: The first […]

Polynomials and Sparse Matrix are two important applications of arrays and linked lists. A polynomial is composed of different terms where each of them holds a coefficient and an exponent. This tutorial chapter includes the representation of polynomials using linked lists and […]

This chapter starts with the basic information regarding the fundamental knowledge required to solve various problems. Algorithm design is one of the primary steps in solving problems. Algorithms are set of steps or instructions required and designed to solve a […]

In this chapter you will learn about the different algorithmic approaches that are usually followed while programming or designing an algorithm. Then you will get the basic idea of what Big-O notation is and how it is used. Finally there […]

In this chapter you will explore one of the most important data structures which are used in many fields of programming and data handling i.e. the Stack. It falls under the category of abstract data type which serves as a […]

Queue is a linear data structure used to represent a linear list. It allows insertion of an element to be done at one end and deletion of an element to be performed at the other end. In this chapter you […]