Data Structures Interview Preparation Guide
Data structure is a specialized format for organizing and storing some data. Generally Data Structure types include array, file, record, table, tree, and so on. Interview Questions and Answers about any data structure is designed to organize your data to suit a specific knowledge so that it can be help full to you in your career. Data Structures Interview Questions and Answers are a simple guide to learn the basics of the Data Structures.
48 Data Structures Questions and Answers:
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.
Compiler Design, Operating System, Database Management System, Statistical analysis package, Numerical Analysis, Graphics, Artificial Intelligence, Simulation
3 :: If you are using C language to implement the heterogeneous linked list, what pointer type will you use?
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.
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.
Straight merging, Natural merging, Polyphase sort, Distribution of Initial runs.
The manipulation of Arithmetic expression, Symbol Table construction, Syntax analysis.
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.
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.
9 :: Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
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.
According to Access strategies Linked list is a linear one. According to Storage Linked List is a Non-linear one.