Academic Year 2021/2022 - 1° Year - Elaborazione Dati e Applicazioni Curriculum and Sistemi e Applicazioni Curriculum

9 CFU - 2° Semester

**PROGRAMMAZIONE II**The goal of this class is to provide a strong background of C++ programming and basic data structures.

The goals of this course in terms of expected results are

**Knowledge and understanding**. Students will be able to understand the fundamental ideas and the basic principles of object oriented programming. More specifically students will learn basic data structures and how to write programs in C++.**Applying knowledge and understanding**Students will learn how to properly use concepts related to object oriented programming (such as polymorphisms and inheritance). Also, students will be able to use and implement basic data structures such as linked lists, stacks, queues and binary trees**Making judgements**. By studying concrete examples students will learn how to, autonomously, use what studied in class.**Communication Skills**. Students will learn how to properly communicate using the technical language of C++ programming.**Learning Skills**. A goal of this course is to provide a good theoretical and practical background of basic data structures and object oriented programming. It is expected that students will learn how to autonomously address problems that require the usage of basic data structures and object oriented programming.

**LABORATORIO**The goal of this class is to provide a strong background of C++ programming and basic data structures.

The goals of this course in terms of expected results are

**Knowledge and understanding**. Students will be able to understand the fundamental ideas and the basic principles of object oriented programming. More specifically students will learn basic data structures and how to write programs in C++.**Applying knowledge and understanding**Students will learn how to properly use concepts related to object oriented programming (such as polymorphisms and inheritance). Also, students will be able to use and implement basic data structures such as linked lists, stacks, queues and binary trees**Making judgements**. By studying concrete examples students will learn how to, autonomously, use what studied in class.**Communication Skills**. Students will learn how to properly communicate using the technical language of C++ programming.**Learning Skills**. A goal of this course is to provide a good theoretical and practical background of basic data structures and object oriented programming. It is expected that students will learn how to autonomously address problems that require the usage of basic data structures and object oriented programming.

**PROGRAMMAZIONE II**Teaching will be carried out through lectures (for a total of 72 hours) during which the contents of the course will be presented, also through practical demonstrations. In addition, the students will have access to a learning platform. The platform will allow students to practice and self- evaluate themselves on the contents of the course. The same platform provides a valid tool for the exam preparation.

**LABORATORIO**Teaching will be carried out through lectures (for a total of 72 hours) during which the contents of the course will be presented, also through practical demonstrations. In addition, the students will have access to a learning platform. The platform will allow students to practice and self- evaluate themselves on the contents of the course. The same platform provides a valid tool for the exam preparation.

**PROGRAMMAZIONE II**The course will introduce the concepts of abstract data structures and will investigate different data structures such as stacks, queues , lists, trees and graphs. In addition to data structures, the basic concepts of computational complexity will be introduced.

The course will focus also to the main data structure management algorithms, and specifically, sorting algorithms, including bubble sort, insertion sort, quicksort and mergesort.The C ++ language will be used as the main underlying programming language to present the implementations of data structures and algorithms.

**LABORATORIO**The course will introduce the concepts of abstract data structures and will investigate different data structures such as stacks, queues , lists, trees and graphs. In addition to data structures, the basic concepts of computational complexity will be introduced.

The course will focus also to the main data structure management algorithms, and specifically, sorting algorithms, including bubble sort, insertion sort, quicksort and mergesort.The C ++ language will be used as the main underlying programming language to present the implementations of data structures and algorithms.

**PROGRAMMAZIONE II**The reference book is "Fondamenti di programmazione in C++", written by Luis Joyanes Aguilar and published by McGraw-Hill. The book introduces the principles of programming and choose the C++ language to teach them. The reason that drives us in this direction is the desire to reduce the training time of programmers, making then apply, since the early algorithms, to a professional language actually used in large software suites.

**Fondamenti di Programmazione in C++**

Algoritmi, strutture dati e oggetti

Autore: Luis Joyanes Aguilar

Casa Editrice: McGraw-Hill

sito web del libro**Introduction to Algorithms**T. H Cormen

C. E. Leiserson

R. L. Rivest

C. Stein

The MIT Press**LABORATORIO**The reference book is "Fondamenti di programmazione in C++", written by Luis Joyanes Aguilar and published by McGraw-Hill. The book introduces the principles of programming and choose the C++ language to teach them. The reason that drives us in this direction is the desire to reduce the training time of programmers, making then apply, since the early algorithms, to a professional language actually used in large software suites.

**Fondamenti di Programmazione in C++**

Algoritmi, strutture dati e oggetti

Autore: Luis Joyanes Aguilar

Casa Editrice: McGraw-Hill

sito web del libro**Introduction to Algorithms**T. H Cormen

C. E. Leiserson

R. L. Rivest

C. Stein

The MIT Press