Set - 1

Question 1 :

What is data structure?

Answer :

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.

Question 2 :

List out the areas in which data structures are applied extensively?

Answer :

Compiler Design, Operating System, Database Management System, Statistical analysis package, Numerical Analysis, Graphics, Artificial Intelligence, Simulation

Question 3 :

If you are using C language to implement the heterogeneous linked list, what pointer type will you use?

Answer :

The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to connect them. It is not possible to use ordinary pointers for this. So we go for void pointer. Void pointer is capable of storing pointer to any type as it is a generic pointer type.

Question 4 :

What is the data structures used to perform recursion?

Answer :

Stack. Because of its LIFO (Last In First Out) property it remembers its caller, so knows whom to return when the function has to return. Recursion makes use of system stack for storing the return addresses of the function calls. Every recursive function has its equivalent iterative (non-recursive) function. Even when such equivalent iterative procedures are written, explicit stack is to be used.

Question 5 :

What are the methods available in storing sequential files ?

Answer :

Straight merging, Natural merging,  Polyphase sort, Distribution of Initial runs.

Question 6 :

List out few of the Application of tree data-structure?

Answer :

The manipulation of Arithmetic expression, Symbol Table construction, Syntax analysis.

Question 7 :

In RDBMS, what is the efficient data structure used in the internal storage representation?

Answer :

B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching easier. This corresponds to the records that shall be stored in leaf nodes.

Question 8 :

What is a spanning Tree?

Answer :

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.

Question 9 :

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

Answer :

Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn't mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.

Question 10 :

Whether Linked List is linear or Non-linear data structure?

Answer :

According to Access strategies Linked list is a linear one. According to Storage Linked List is a Non-linear one.

Question 11 :

What is the quickest sorting method to use?

Answer :

The answer depends on what you mean by quickest. For most sorting problems, it just doesn't matter how quick the sort is because it is done infrequently or other operations take significantly more time anyway. Even in cases in which sorting speed is of the essence, there is no one answer. It depends on not only the size and nature of the data, but also the likely order. No algorithm is best in all cases. There are three sorting methods in this author's toolbox that are all very fast and that are useful in different situations. Those methods are quick sort, merge sort, and radix sort.

The Quick Sort
The quick sort algorithm is of the divide and conquer type. That means it works by reducing a sorting problem into several easier sorting problems and solving each of them. A dividing value is chosen from the input data, and the data is partitioned into three sets: elements that belong before the dividing value, the value itself, and elements that come after the dividing value. The partitioning is performed by exchanging elements that are in the first set but belong in the third with elements that are in the third set but belong in the first Elements that are equal to the dividing element can be put in any of the three sets the algorithm will still work properly.

The Merge Sort
The merge sort is a divide and conquer sort as well. It works by considering the data to be sorted as a sequence of already-sorted lists (in the worst case, each list is one element long). Adjacent sorted lists are merged into larger sorted lists until there is a single sorted list containing all the elements. The merge sort is good at sorting lists and other data structures that are not in arrays, and it can be used to sort things that don't fit into memory. It also can be implemented as a stable sort. 

The Radix Sort
The radix sort takes a list of integers and puts each element on a smaller list, depending on the value of its least significant byte. Then the small lists are concatenated, and the process is repeated for each more significant byte until the list is sorted. The radix sort is simpler to implement on fixed-length data such as ints.

Question 12 :

How can I search for data in a linked list?

Answer :

Unfortunately, the only way to search a linked list is with a linear search, because the only way a linked list's members can be accessed is sequentially. Sometimes it is quicker to take the data from a linked list and store it in a different data structure so that searches can be more efficient.

Question 13 :

What is the bucket size, when the overlapping and collision occur at same time?

Answer :

One. If there is only one entry possible in the bucket, when the collision occurs, there is no way to accommodate the colliding value. This results in the overlapping of values.

Question 14 :

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

Answer :

If the pivotal value (or the Height factor) is greater than 1 or less than 1.

Question 15 :

Minimum number of queues needed to implement the priority queue?

Answer :

Two. One queue is used for actual storing of data and another for storing priorities.