Suddivisione dell'attività didattica
LIMONGELLI CARLA
Obiettivi
To provide the basics of "computer culture" through the introduction of effective methodological and conceptual tools, aiming to face in a flexible way the evolution of technology and the broad world of applications, emphasizing the role of Computer Science as a discipline for the automatic solution of problems.Specific objectives:
- To understand the essential elements related to computer architecture and operating systems, as well as information representation;
- To gain the ability to design and code simple algorithms using structured programming and basic programming techniques such as iteration, as well as elementary data structures;
- To understand and use testing methodologies (debugging) for the produced code.
Programma
* Basic concepts *Top-down design principles
Decompositions and reductions between problems
Recursion
*Operations*
Basic operations for persistent data management (CRUD)
Use and manipulation of collections
*Data Structures*
Sets
Lists
Maps
* Advanced concepts *
Asymptotic notation
Recursion
Integrated development environments
Libraries
Files
Prerequisiti
The course does not require any prerequisite.Testi Adottati
A. Bellini, A. Guidi, "Linguaggio C. Una guida alla programmazione con elementi di Python", VI Edition, McGraw-Hill.Bibliografia Di Riferimento
A. Bellini, A. Guidi Titolo: "Linguaggio C. Una guida alla programmazione con elementi di Python", VI Edition, McGraw-Hill. Kernighan, Ritchie - The C programming languageModalità Frequenza
Attendance is not compulsory, but it is strongly recommended.Modalità Valutazione
The exam consists of some multiple-choice answers (25 minutes, 17 questions, up to grade 8,5 points) and of some programming exercises (120 minutes, 3 questions, up to 24 grade points), to be realized on a computer. Two intermediate examinations, together with a preliminary one, replace the exam, if passed with success. Student assessment is based on the Dublin Descriptors and takes into account the level of knowledge, understanding, and critical processing of the topics covered in the course. Students who demonstrate that they have acquired the fundamental concepts and are able to apply them in simple contexts will receive a passing grade. Average grades will be awarded to those who, in addition to mastering the basics, show the ability to analyze and independently elaborate on more complex concepts. The highest grades are reserved for students who demonstrate in-depth understanding, synthesis skills, critical thinking, and autonomy in solving problems, including new ones or those not explicitly addressed during the course.Esempi Domande
Build an application to manage a list of tennis players.Define two structures to represent a tennis player and a list node. For each player, the player's name (a string), ATP ranking (an integer), and preferred surface type (a string) must be represented. Define a main function that creates the list and manages user interaction. The main function is already partially implemented in a liste.c file that can be downloaded from Moodle.
Define a function that displays the list of players.
Define a function that inserts a new player at the end of the list.
Define a function that deletes all players immediately preceding a player whose name begins with S. If this operation does not result in any deletion, the user must be informed of this. For example, if the list initially contains the players [Flavio Cobolli] -> [Francisco Cerundolo] -> [Sascha Zverev] -> [Ignacio Buse] -> [Sebastian Korda] -> [Stefanos Tsitsipas], the operation transforms the list to [Flavio Cobolli] -> [Sascha Zverev] -> [Stefanos Tsitsipas]. Note that Sebastian Korda is deleted because he precedes Stefanos Tsitsipas, and that, after the deletion, it is still possible for a player whose name begins with S to be followed.
Submit only the .c file containing the source code.
FRATI FABRIZIO
Obiettivi
To provide the basics of "computer culture" through the introduction of effective methodological and conceptual tools, aiming to face in a flexible way the evolution of technology and the broad world of applications, emphasizing the role of Computer Science as a discipline for the automatic solution of problems.Specific objectives:
- To understand the essential elements related to computer architecture and operating systems, as well as information representation;
- To gain the ability to design and code simple algorithms using structured programming and basic programming techniques such as iteration, as well as elementary data structures;
- To understand and use testing methodologies (debugging) for the produced code.
Risultati Apprendimento Attesi
At the end of the course, students will be able to design and implement recursive algorithms. They will also be able to analyze the computational cost of simple algorithms and programs, and to evaluate and compare the efficiency of different algorithms. They will learn to use and assess fundamental sorting and searching algorithms, as well as apply the divide-and-conquer technique. Furthermore, they will acquire skills in pointer manipulation and dynamic memory allocation, data organization using structures and files, and the implementation and manipulation of dynamic data structures, such as singly and doubly linked lists. Finally, they will be able to select appropriate algorithms and data structures according to the problem to be solved and their computational efficiency.Programma
RecursionComputational Complexity
- Big O Notation
Sorting and Searching Algorithms
Notable Divide and Conquer Algorithms (Karatsuba, Strassen)
Pointers and Dynamic Memory Allocation
Data Set Management, Structs, and Files
Singly and Doubly Linked Lists
Prerequisiti
NoneTesti Adottati
Autore: Bellini, GuidiTitolo: Linguaggio C - Guida alla programmazione con elementi di Python
Edizione: Settima edizione
Editore: McGraw-hill
Anno: 2025
Bibliografia Di Riferimento
Author: Kernighan, Ritchie Title: Il linguaggio C. Principi di programmazione e manuale di riferimento Edition: Seconda edizione Editor: Pearson Year: 2004Modalità Erogazione
live and online lectures, live and online exercise sessionsModalità Frequenza
attending is not mandatoryModalità Valutazione
The exam consists of some multiple-choice answers (25 minutes, 17 questions, up to grade 8,5 points) and of some programming exercises (120 minutes, 3 questions, up to 24 grade points), to be realized on a computer. Two intermediate examinations, together with a preliminary one, replace the exam, if passed with success. Student assessment is based on the Dublin Descriptors and takes into account the level of knowledge, understanding, and critical processing of the topics covered in the course. Students who demonstrate that they have acquired the fundamental concepts and are able to apply them in simple contexts will receive a passing grade. Average grades will be awarded to those who, in addition to mastering the basics, show the ability to analyze and independently elaborate on more complex concepts. The highest grades are reserved for students who demonstrate in-depth understanding, synthesis skills, critical thinking, and autonomy in solving problems, including new ones or those not explicitly addressed during the course.Esempi Domande
Build an application to manage a list of tennis players.Define two structures to represent a tennis player and a list node. For each player, the player's name (a string), ATP ranking (an integer), and preferred surface type (a string) must be represented. Define a main function that creates the list and manages user interaction. The main function is already partially implemented in a liste.c file that can be downloaded from Moodle.
Define a function that displays the list of players.
Define a function that inserts a new player at the end of the list.
Define a function that deletes all players immediately preceding a player whose name begins with S. If this operation does not result in any deletion, the user must be informed of this. For example, if the list initially contains the players [Flavio Cobolli] -> [Francisco Cerundolo] -> [Sascha Zverev] -> [Ignacio Buse] -> [Sebastian Korda] -> [Stefanos Tsitsipas], the operation transforms the list to [Flavio Cobolli] -> [Sascha Zverev] -> [Stefanos Tsitsipas]. Note that Sebastian Korda is deleted because he precedes Stefanos Tsitsipas, and that, after the deletion, it is still possible for a player whose name begins with S to be followed.
Submit only the .c file containing the source code.
