Valutami
Scheda programma d'esame
ALGORITMI E STRUTTURE DEI DATI
ROBERTO GROSSI
Anno accademico2016/17
CdSMATEMATICA
Codice039AA
CFU6
PeriodoSecondo semestre
LinguaItaliano

ModuliSettore/iTipoOreDocente/i
ALGORITMI E STRUTTURE DATIINF/01LEZIONI60
ROBERTO GROSSI unimap
Programma non disponibile nella lingua selezionata
Learning outcomes
Knowledge
Students are expected to increase their problem solving skills with the methodology of algorithms and data structures. A programming project will also help to design efficient programming code based on these skills.
Assessment criteria of knowledge
- The student will be assessed on his/her demonstrated ability to discuss the main course contents using the appropriate terminology. - During the oral exam the student must be able to demonstrate his/her knowledge of the course material and be able to discuss the reading matter thoughtfully and with propriety of expression. - The student's ability to explain correctly the main topics presented during the course at the board will be assessed. - In the written exam, the student must demonstrate his/her knowledge of the course material and to organise an effective and correctly written reply. - With the oral presentation, to be made to the teacher and the other students, the student must demonstrate the ability to approach a circumscribed research problem, and organise an effective exposition of the results. - The student must demonstrate the ability to put into practice and to execute, with critical awareness, the activities illustrated or carried

Methods:

  • Final oral exam
  • Final written exam
  • Laboratory report

Further information:
50% oral exam; 50% written test/programming project.
Teaching methods

Delivery: face to face

Learning activities:

  • attending lectures
  • preparation of oral/written report
  • individual study
  • Laboratory work

Attendance: Advised

Teaching methods:

  • Lectures
  • laboratory
  • project work
Syllabus
In this course we will study, design and analyze algorithms and data structures for the efficient solution of combinatorial problems involving all basic data types, such as integers, strings, (geometric) points, trees and graphs.
Bibliography
Course based on an Italian book but American-English books can be adopted, such as Cormen, Leiserson, Rivest, and Stein, Introduction to Algorithms, MIT Press.
Work placement
Associated programming project.
Ultimo aggiornamento 14/11/2016 17:27