CdSINFORMATICA
Codice642AA
CFU9
PeriodoSecondo semestre
LinguaInglese
The advanced nature of this course focuses on developing algorithmic design skills, exposing the students to complex problems that cannot be directly handled by standard libraries (being aware that several basic algorithms and data structures are already covered by the libraries of modern programming languages), thus requiring a significant effort in problem solving. These problems involve all basic data types, such as integers, strings, (geometric) points, trees and graphs as a starting point.
Introductory course on algorithms and data structures.
Introductory course on discrete mathematics for computer science.
Introductory course on programming.
The syllabus is structured to highlight the applicative situations in which the corresponding algorithms can be successfully employed, making references to software applications and libraries. The level of detail in each argument can change year-by-year, and will be decided according to requests coming from other courses in the curriculum and/or specific issues arising in, possibly novel, applicative scenarios.
Written exam:
- choose one of the topics discussed in class
- write a very short to-do list and ask the instructor for approval
- if the instructor suggests some mods, modify the to-do list according to the instructor's comments and repeat step 2
- if the chosen topic and the to-do list are approved, expand the to-do list into a more detailed to-do list and repeat step 3
- make a written report in English and submit it to the instructor (recall to add at least 20% new content, when compared to what seen in class)
- meet the instructor to read together the report and get some comments on it
- make the necessary mods
Oral exam: topics discussed in class, please read the references in the notes.