Important Data Structure Interview Questions & Answers for Freshers -


Wednesday, October 28, 2015

Important Data Structure Interview Questions & Answers for Freshers

1.What is data structure?
A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data.

2.List out the areas in which data structures are applied extensively?
Compiler Design, Operating System, Database Management System, Statistical analysis package, Numerical Analysis, Graphics, Artificial Intelligence, Simulation.

3.Convert the expression ((A + B) * C - (D - E) ^ (F + G)) to equivalent Prefix and Postfix notations.
1.Prefix Notation: - * +ABC ^ - DE + FG
2.Postfix Notation: AB + C * DE - FG + ^ -

4.What is the type of the algorithm used in solving the 8 Queens problem?

5.What is a spanning Tree?
A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree organized so that the total edge weight between nodes is minimized.

6.What is priority queues?
A priority queue is a collection of elements such that each element has been assigned a priority.

7.What is a linked list?
Linked list is a data structure which store same kind of data elements but not in continuous memory locations and size is not fixed. The linked lists are related logically.

8.What is a queue ?
A Queue is a sequential organization of data. A queue is a first in first out type of data structure. An element is inserted at the last position and an element is always taken out from the first position.

9.What are the methods available in storing sequential files ?
Straight merging, Natural merging, Polyphase sort, Distribution of Initial runs.

10.Mention some of the problem solving strategies?
The most widely strategies are listed below
i)Divide and conquer
ii)Binary doubling strategy
iii)Dynamic programming

11.What is binary tree?
Binary tree is a tree which has maximum no. of childrens either 0 or 1 or 2. i.e., there is at the most 2 branches in every node.

12.What is meant by sorting?
Ordering the data in an increasing or decreasing fashion according to some relationship among the data item is called sorting.

13.What is mean by d-queue?
D-queue stands for double ended queue. It is a abstract data structure that implements a queue for which elements can be added to front or rear and the elements can be removed from the rear or front. It is also called head-tail linked list

14.What is AVL tree?
Avl tree is self binary tree in which balancing factor lie between the -1 to 1.It is also known as self balancing tree.

15.What is Brute Force algorithm?
Algorithm used to search the contents by comparing each element of array is called Brute Force algorithm

No comments:

Post a Comment