What is the concept of data structures in computer science, and how are they used in programming? Discuss the different types of data structures, including arrays, linked lists, trees, and graphs, and provide examples of how they are applied in various programming tasks, such as searching and sorting algorithms.

What is the metaphor that first introduces the term "systolic arrays"? Why is the metaphor such a perfect representation of reality?

Application of data structures to fast image recognition (very simplified) • The setting is that some image processing device gives you a 5 × 6 matrix M of bits. • We categorise these images into YES and NO answers, and this categorisation is fixed. The questions are: 1. What is the fastest data structure from the module to compute from the matrix the YES/NO answers? And how much time does an answer take?  2. How can the matrix be transformed into a standard input for the data structure? And what is the size of the data structure?

Data structures such as arrays, lists, stacks, queues, and trees are all examples of abstractions; nevertheless, it is not always clear why they are considered to be abstractions.