Latest C & Data Structures Interview Questions Part – 3

In Rdbms, What Is The Efficient Data Structure Used In The Internal Storage Representation?

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.

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.

Does The Minimum Spanning Tree Of A Graph Give The Shortest Distance Between Any 2 Specified Nodes?

No. The 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.

Which Is The Simplest File Structure? (sequential, Indexed, Random)

Sequential is the simplest file structure.

Whether Linked List Is Linear Or Non-linear Data Structure?

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

In Tree Construction Which Is The Suitable Efficient Data Structure? (array, Linked List, Stack, Queue)
Linked list is the suitable efficient data structure.

What Is The Type Of The Algorithm Used In Solving The 8 Queens Problem?

Backtracking.

List Out Few Of The Applications That Make Use Of Multilinked Structures?

Sparse matrix.
Index generation.

What Are The Types Of Collision Resolution Techniques And The Methods Used In Each Of The Type?

Open addressing (closed hashing), The methods used include: Overflow block.
Closed addressing (open hashing), The methods used include: Linked list, Binary tree.

Sorting Is Not Possible By Using Which Of The Following Methods? (insertion, Selection, Exchange, Deletion)

Sorting is not possible in Deletion. Using insertion we can perform insertion sort, using selection we can perform selection sort, using exchange we can perform the bubble sort (and other similar sorting methods). But no sorting method can be done just using deletion.

What Are The Methods Available In Storing Sequential Files?

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

List Out Few Of The Application Of Tree Data-structure?

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