Data Structures_27.09.2021

12345678910
Across
  1. 3. To represent sparse matrix in linked list there are _____ fields in a node.
  2. 4. The field that is used to link to the next nonzero element in the same ROW.
  3. 7. The field that is used to link to the next nonzero element in the same column.
  4. 9. In Doubly Linked List,each node now has ______ link fields.
  5. 10. The process of collecting all unused nodes and returning them to available space.
Down
  1. 1. Phase 1 of Garbage Collection is called ___________ phase.
  2. 2. A node in a doubly linked list has at least ______ fields.
  3. 5. A special node added in the doubly linked list
  4. 6. Garbage collection process is carried out in ______ phases.
  5. 8. In order to be able to carry out the marking, we need a ____ bit in each node.