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
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.
Select appropriate Question to view its more answers in this category of
Do you find any Answer incorrect or incomplete? Please e-mail us or
place your comment and mention the number of question or if you have correct answer then
open the appropriate question by clicking on question and then place your answer in comment
regarding particular question in this category "Data Structures Interview Questions and Answers" To ensure quality,
each change is checked by our team, before it enters the main website
database. If you desire so, the changes will be credited to your name.
Subscribe your email to receive free updates:
Enter your email address and get free web tutorials, job hunting tips, career advices, job vacancies and interview questions updates directly delivered to your email inbox