The course aims at deepening and completing the contents of the introductory class on Programming and Algorithms, presenting the main techniques for designing and analyzing algorithms and data structures when solving combinatorial problems that involve various kinds of data such as integers, strings, trees, graphs and multidimensional data. Students will acquire the skills to design efficient algorithms for problems arising from the applications in various domains.