Data Structures Interview Questions, Answers for Freshers and Experienced asked in various Company Job Interviews

Data Structures Interview Questions

Questions Answers Views Company eMail

What is linked list ?

944

Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?

967

Mention one advantage and disadvantage of using quadratic probing?

1011

Define adjacent nodes?

1051

How do you assign an address to an element of a pointer array ?

990

Define heap?

1074

Explain what are the types of collision resolution techniques and the methods used in each of the type?

920

What do you mean by primary clustering?

1008

Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?

977

What is the relationship between a queue and its underlying array?

1269

What are the types of collision resolution strategies in open addressing?

1017

What do you mean by linear probing?

1054

In an avl tree, at explain what condition the balancing is to be done?

954

What do you mean by rehashing?

1174

What method is used to place a value onto the top of a stack?

1024

Post New Data Structures Questions

Un-Answered Questions { Data Structures }

Tell us the difference between merge and quick sort. Which one would you prefer and why?

1019

List out the disadvantages of using a linked list?

939

Which sorting is best for large data?

929

Describe queue operation.

974

List the limitations of linear probing?

931

Define internal nodes?

923

Why do we use data structures?

904

Which searching algorithm is best?

890

What do you mean by 2-3 tree?

920

Is priority queue sorted?

959

Is arraylist heterogeneous?

882

How memory is reserved using a declaration statement ?

1192

Explain binary searching and Fibinocci search?

957

Why is data structure important?

1005

Which is better hashmap or arraylist?

1004

For More Un-Answered { Data Structures } Questions Click Here