Data structure are specialised format for manipulating data like organising, processing, retrieving and storing data. There are several basic and advanced structure types, any data structures are available to be used by specific scenario. Each data structure contains information about the data values, relationships between the data and functions that can be applied to the data.

Data structure is backbone of Programming and Implementation. So it plays a very important or we can say a crucial role in any programming interview. Almost the interview for Software Engineer , Software developer, Programmer and Web Developer posts are gone through a phase of Data Structure Interview Questions. And Most of the time your interview performance decided by your data structures concepts.

This is not a complete tutorial of data structures but an overview of what are the topics and basic questions that can be asked in a Data Structure Interview. our purpose is to educate our readers about the importance of data structure in Interviews. Below we have given few questions and answers, hope you will find them useful:

#### What is Data Structure?

Data Structure is an organisation of data in such a way that manipulation and operations over the data can be done easily. There are many ways to achieve this goal. We have two broad categories as Linear and Non-Linear. The data structure is equally useful in analysing the complexity of heavy applications running over huge traffic and data.

#### What are the Characteristics of data structures?

Data structures are grouped by their characteristics. The Possible characteristics of data structures are:

**1#Linear or non-linear data structures:** That means whether the data items are arranged in chronological sequence, or in an unordered sequence. For Example Array is Linear and Graph is non Linear.

**2#Homogeneous or non-homogeneous data structures:** This describes the types of data in structures. Whether all data in a given structure are of the same type or of various types.

**3#Static or dynamic data structures**: That is the data structures are compiling style. Static data structures have fixed sizes, structures and memory are allocated at compile time where as Dynamic data structures sizes, structures and memory locations are decided at run time.

#### What is linear and Non-linear data structures?

Linear Data Structures are the structures where data is arranged in a sequential manner and can be added or delete in a sequence. But not leaner is fashion to arrange data in a non-sequential manner. We can randomly add or delete data from the structure.

#### What is an Array?

An array is a Linear type Data Structure which is used to collect the similar type of elements and stored in contiguous in memory locations identified by the index. Index of the array starts from zero(0). We can randomly access the element of the array using these indices.

#### What is a Stack?

The stack is an ordered collection of elements where addition and removal of elements happen at the same end. Such type of arrangement called LIFO, last-in-first-out.A linked list is Suitable for operations such as add, delete, and update.

There are two elementary operations performed on Stacks

**push**: add a new element at the top of the stack**pop**: remove the top element fro the top of the stack

Click For More stack interview questions

#### What is a Linked List?

A Data structure where elements are connected via links. Links contains Items and reference to another link. There are three types of Linked lists:

- Simple Linked List
- Double Linked List
- Circular Linked List

#### What is the Queue?

A Queue is a Data Structure opened at its ends. One end is open to insert new items in the queue and another is open to release existing items for queue. The basic operations of enqueue() and dequeue() work in FIFO- First In First Out Fashion. enqueue() is used to add new items in queue whereas dequeue() is used to remove existing items from queue.

#### How many types of Linked List are there?

There are three types of Linked lists:

- Simple Linked List
- Double Linked List
- Circular Linked List

#### What is a Tree?

A tree is a collection of nodes connected to each other and in a hierarchy to maintain parent and child type relationship.

A tree is a nonlinear data structure.

There is a root node and next nodes are connected to root by directed edges and so on. A tree without a node is an empty tree.

Parent->Children.

#### What is a Heap?

A heap is a Non-Linear Data Structure based on tree and containing properties of Heap.

#### What is a Graph?

Collection of Nodes arranged as vertices and edges known as Graph. A graph is a Non-Linear type Data Structure. The relationship found between vertices is known as adjacency.

Thanks very nice blog!

This is my first time visit at here and i am in fact happy to read everthing at one place.|

I simply couldn’t depart your web site prior to suggesting that I extremely enjoyed the usual information an individual provide on your guests? Is going to be again steadily to investigate cross-check new posts|

Aw, this was an incredibly nice post. Finding the time and actual effort to generate a really good article… but what can I say… I procrastinate a lot and never manage to get anything done.

Keep Motivating Us. Great Thanks.

Heya! I just wanted to ask if you ever have any issues with hackers? My last blog (WordPress) was hacked and I ended up losing a few months of hard work due to no data backup. Do you have any methods to protect against hackers?

Contact us at interviewsortout@gmail.com

Wow, fantastic blog layout! How long have you been blogging for? you make blogging look easy. The overall look of your site is magnificent, as well as the content!

Thank you very much, Keep your motivation on.

thanx for brief and useful content

Thanks mohit