Data Structure Interview Question and Answers

11. What are the disadvantages of sequential storage?
 
  • Fixed amount of storage remains allocated to the data structure even if it contains less element.
  • No more than fixed amount of storage is allocated causing overflow.
12. Define circular list?
 
  • In linear list the next field of the last node contain a null pointer, when a next field in the last node contain a pointer back to the first node it is called circular list.
13. What does abstract Data Type Mean?
 
  • Data type is a collection of values and a set of operations on these values.
  • Abstract data type refer to the mathematical concept that define the data type.
14. What do you mean by recursive definition?
  The definition which defines an object in terms of simpler cases of itself is called recursive definition.
15. What actions are performed when a function is called?
 
    When a function is called
  • arguments are passed
  • local variables are allocated and initialized
  • transferring control to the function
12345

Page 3 of 5