This workshop forms part of an ongoing series of in-depth discussions about current developments in theoretical computer science. Participants will learn more about those topics and discuss possible integrations and improvements within our systems. This workshop is of particular interest for the fields of Data Science, Computer Science, and Data Engineering.
About the workshop:
Data structures and algorithms are the studies of commonly used computational methods and their computational efficiency.
In computer science, a data structure is a data organization, management, and storage format that enables efficient access and modification. More precisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.
In mathematics and computer science, an algorithm is a finite sequence of well-defined, computer-implementable instructions, typically to solve a class of problems or to perform a computation. Algorithms are always unambiguous and are used as specifications for performing calculations, data processing, automated reasoning, and other tasks. As an effective method, an algorithm can be expressed within a finite amount of space and time, and in a well-defined formal language for calculating a function. Starting from an initial state and initial input (perhaps empty), the instructions describe a computation that, when executed, proceeds through a finite number of well-defined successive states, eventually producing "output" and terminating at a final ending state. The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate random input.
Source: https://en.wikipedia.org/wiki/Computer_science, https://en.wikipedia.org/wiki/Algorithm, https://en.wikipedia.org/wiki/Data_structure