DS

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