DS unit1 and 2

123456789
Across
  1. 4. It is an English-like presentation of the code required for an algorithm.
  2. 6. a function that describes the algorithm's efficiency in terms of the amount of data it must process.
  3. 7. One type of data structure
  4. 8. A matrix in which number of zero elements are higher than ----------elements is called Sparse Matrix
Down
  1. 1. a Data Structure which does not store previous versions of the Data Structure.
  2. 2. Step by step instructions/Procedure
  3. 3. Some Programming languages supports ----major of physical view.
  4. 5. A special type of string.
  5. 9. The list having inherent order