Academic year2016/17
CourseCOMPUTER SCIENCE
Code316AA
Credits9
PeriodSemester 1
LanguageEnglish
| Modules | Area | Type | Hours | Teacher(s) |
| ALGORITMICA II | INF/01 | LEZIONI | 72 | |
Programma non disponibile nella lingua selezionata
Knowledge
The advanced nature of this course focuses on developing algorithmic design skills. The students are exposed to complex problems that require a significant effort in problem solving. One “brainstorming” lecture per week is devoted to a full immersion in this activity, and it is highly recommend to attend it.
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
- Continuous assessment
Teaching methods
Delivery: face to face
Learning activities:
- attending lectures
- preparation of oral/written report
- participation in discussions
- group work
- Bibliography search
Attendance: Advised
Teaching methods:
- Lectures
- Task-based learning/problem-based learning/inquiry-based learning
Syllabus
We will study, design and analyze advanced 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. This course deepens and extends the algorithmic notions of students. The syllabus is structured to highlight the applicative scenarios in which the studied algorithms and data structures can be successfully applied. The level of detail with which each argument will be dealt with can change year-by-year, and will be decided according to requests coming from other courses and/or specific issues arising in, possibly novel, applicative scenarios.
Bibliography
Most of the material is state of the art that appears as chapter books or articles on journal or conferences.
Updated: 14/11/2016 17:27
