DS

12345678910
Across
  1. 2. A linear collection of data elements where the linear node is given by means of pointer is called as ___.
  2. 3. How many pointers requires to modify while inserting an element in circular linked list?
  3. 6. Elements in an array are accessed_____________
  4. 8. ______is a linear data structure
  5. 10. _____sort is one of the divide and Conquer sorting algorithm
Down
  1. 1. linear node is given by means of pointer is called as in linked list each node contains a minimum of two fields. One field is data field to store the data second field is?
  2. 4. memory is allocated dynamically to a data structure during execution by _____ function
  3. 5. Linked list is considered as an example of ___________ type of memory allocation.
  4. 7. ______sort algorithm provide the best time complexity in the worst-case scenario
  5. 9. _______sort method would be most suitable for sorting a list which is almost sorted