This space contains all the material related to the Computational Thinking and Programming course of the Digital Humanities and Digital Knowledge degree at the University of Bologna.
The official book of the course, Computational Thinking and Programming book, is available online in PDF format. Google Docs links are provided for each chapter, to enable students to comment and suggest improvements. The suggested accompanying book for Python coding, How To Code in Python by Lisa Tagliaferri, is also freely available online in PDF and EPUB formats.
Keys:
[11/10/21, the] Introduction to the course
[13/10/21, the] Introduction to Computational Thinking
[15/10/21, the] Algorithms
[18/10/21, lab] 1st Lesson
[20/10/21, the] Computability
[22/10/21, the] Programming languages
[25/10/21, the] Organising information: ordered structures
[27/10/21, lab] 2nd Lesson
[29/10/21, the] Brute-force algorithms
[08/11/21, lab] 3rd Lesson
[10/11/21, the] Organising information: unordered structures
[15/11/21, the] Recursion
[17/11/21, lab] 4th Lesson
[22/11/21, lab] 5th Lesson
[24/11/21, the] Divide and conquer algorithms
[29/11/21, lab] 6th Lesson
[01/12/21, the] Dynamic programming algorithms
[06/12/21, the] Organising information: trees
[13/12/21, the] Backtracking algorithms
[15/12/21, the] Organising information: graphs
[20/12/21, the] Greedy algorithms
Date | Time | Title |
---|---|---|
11/10/21 | 09:30-11:30 | Introduction to the course |
13/10/21 | 09:30-11:30 | Introduction to Computational Thinking |
15/10/21 | 12:30-14:30 | Algorithms |
18/10/21 | 09:30-11:30 | Laboratory |
20/10/21 | 09:30-11:30 | Computability |
22/10/21 | 12:30-14:30 | Programming languages |
25/10/21 | 09:30-11:30 | Organising information: ordered structures |
27/10/21 | 09:30-11:30 | Laboratory |
29/10/21 | 12:30-14:30 | Brute-force algorithms |
08/11/21 | 09:30-11:30 | Laboratory |
10/11/21 | 09:30-11:30 | Organising information: unordered structures |
15/11/21 | 09:30-11:30 | Recursion |
17/11/21 | 09:30-11:30 | Laboratory |
22/11/21 | 09:30-11:30 | Laboratory |
24/11/21 | 09:30-11:30 | Divide and conquer algorithms |
29/11/21 | 09:30-11:30 | Laboratory |
01/12/21 | 09:30-11:30 | Dynamic programming algorithms |
06/12/21 | 09:30-11:30 | Organising information: trees |
13/12/21 | 09:30-11:30 | Backtracking algorithms |
15/12/21 | 09:30-11:30 | Organising information: graphs |
20/12/21 | 09:30-11:30 | Greedy algorithms |