16692 - Laboratory of Informatics

Learning outcomes

At the end of the course, the student will be acquainted with algorithms and advanced computer programming (in particular: imperative, and structured programming) in a programming language. The student will be able to design and implement iterative and recursive algorithms and advanced data structures (lists) and to handle standard I/O (files).

Course contents

Introduction to advanced of algorithms and data structures: advanced data structures (lists, trees); recursive algorithms and complexity analysis.

The C programming language: advanced programming aspects: iteration and recursion; algorithms on lists (insertion, deletion, search, sorting); IO and data persistence on file.

Readings/Bibliography

• Paul J. Deitel, Harvey M. Deitel, "Il linguaggio C: fondamenti e tecniche di programmazione", 8/ed, Pearson, ISBN 978-8891901651

Further materials will be provided by the professor.

For further topics on the theory and fundamentals of informatics:

• Brookshear, J. Glenn. Computer science: an overview. Boston: Addison-Wesley, 2012.

For further topics on the C programming language:

• Brian W. Kernighan and Dennis M. Ritchie, "The C Programming Language, Second Edition", Prentice Hall, Inc., 1988. ISBN 0-13-110362-8 (paperback), 0-13-110370-9 (hardback).

Teaching methods

The teaching method consists of lectures, covering the theory and practice of computer science and programming, accompanied by practice through exercises at the computer.

Assessment methods

The course examination consists of a written/practical test with questions as well as practical exercises to be solved at a computer in the C programming language.

Teaching tools

The professors will provide materials to facilitate learning, including slides, lecture notes, and exercises. Laboratory classes will support practice. Tutoring will be provided to support learning throughout the coursework.

Office hours

See the website of Matteo Francia