DATA STRUCTURE NOTES I DATA STRUCTURE STUDY MATERIALS I DOWNLOAD DATA STRUCTURE QUESTIONS I DOWNLOAD RGTU DATA STRUCTURE QUESTION ANSWERS I DATA STRUCTURE STUDY MATERIALS IN PDF I DATA STRUCTURE IMPORTANT QUESTIONS I DATA STRUCTURE INTERVIEW QUESTIONS I DATA STRUCTURE EXAM PAPERS I DATA STRUCTURE SHORT NOTES I DATA STRUCTURE MODEL PAPERS I DATA STRUCTURE TEST PAPERS I DATA STRUCTURE MODEL ANSWERS I DATA STRUCTURE IMPORTANT QUESTIONS WITH ANSERS I

DATA STRUCTURE AND ALGORITHMS

QUESTION & ANSWERS 

QUESTION:-.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:-List out the areas in which data structures are applied extensively?   
ANSWERS:- 

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

QUESTION:-What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model.
ANSWER:-

• RDBMS                              – Array  (i.e. Array of structures) 
• Network data model         – Graph 
• Hierarchical data model   – Trees

QUESTION:-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: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.

QUESTION:-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:-What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms?
 ANSWER:-   Polish and Reverse Polish notations.

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

QUESTION:-Sorting is not possible by using which of the following methods? 

• Insertion 
• Selection
• Exchange
• Deletion 

ANSWER:-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.

META TAGS:-DATA STRUCTURE OLD EXAM PAPERS I DATA STRUCTURE IMPORTANT QUESTIONS I DATA STRUCTURE TEST PAPERS I DATA STRUCTURE MODEL TEST PAPERS I DATA STRUCTURE SAMPLE PAPERS I DATA STRUCTURE OLD PAPERS I DATA STRUCTURE SAMPLE PAPERS I DATA STRUCTURE GUESSING PAPERS I DATA STRUCTURE INTERVIEW QUESTIONS I DATA STRUCTURE INTERVIEW PREPARATIONS I DATA STRUCTURE CAMPUS QUESTIONS I DATA STRUCTURE MOST IMPORTANT QUESTIONS I DATA STRUCTURE SAMPLE PAPERS I