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:
- the = theoretical lecture
- lab = laboratory session
- [14/10/20, the] Introduction to the course
- slides: HTML
- [14/10/20, the] Introduction to Computational Thinking
- [16/10/20, the] Algorithms
- [19/10/20, the] Computability
- book chapter: PDF, Google Docs
- [21/10/20, the] Programming languages
- book chapter: PDF, Google Docs
- [23/10/20, lab] 1st Lesson
- [26/10/20, the] Organising information: ordered structures
- book chapter: PDF, Google Docs
- [28/10/20, lab] 2nd Lesson
- [30/10/20, the] Brute-force algorithms
- book chapter: PDF, Google Docs
- [09/11/20, the] Organising information: unordered structures
- book chapter: PDF, Google Docs
- [11/11/20, lab] 3rd Lesson
- [13/11/20, the] Recursion
- book chapter: PDF, Google Docs
- [16/11/19, lab] 4th Lesson
- [20/11/20, the] Divide and conquer algorithms
- book chapter: PDF, Google Docs
- [23/11/20, the] Dynamic programming algorithms
- book chapter: PDF, Google Docs
- [25/11/20, lab] 5th Lesson
- [27/11/20, the] Organising information: trees
- book chapter: PDF, Google Docs
- [30/11/20, lab] 6th Lesson
- [02/12/20, the] Backtracking algorithms
- book chapter: PDF, Google Docs
- [04/12/20, lab] 7th Lesson
- [09/12/20, the] Organising information: graphs
- book chapter: PDF, Google Docs
- [11/11/20, lab] 8th Lesson
- [14/12/20, the] Project: specification
- [16/12/20, the] Greedy algorithms
- book chapter: PDF, Google Docs
Date | Time | Title |
---|---|---|
14/10/20 | 9:30-11:30 | Introduction to Computational Thinking |
16/10/20 | 12:30-14:30 | Algorithms |
19/10/20 | 9:30-11:30 | Computability |
21/10/20 | 9:30-11:30 | Programming Languages |
23/10/20 | 12:30-14:30 | Laboratory |
26/10/20 | 9:30-11:30 | Organising information: ordered structures |
28/10/20 | 9:30-11:30 | Laboratory |
30/10/20 | 12:30-14:30 | Brute-force algorithms |
09/11/20 | 9:30-11:30 | Organising information: unordered structures |
11/11/20 | 9:30-11:30 | Laboratory |
13/11/20 | 12:30-14:30 | Recursion |
16/11/20 | 9:30-11:30 | Laboratory |
20/11/20 | 12:30-14:30 | Divide and conquer algorithms |
23/11/20 | 9:30-11:30 | Dynamic programming algorithms |
25/11/20 | 9:30-11:30 | Laboratory |
27/11/20 | 12:30-14:30 | Organising information: trees |
30/11/20 | 9:30-11:30 | Laboratory |
02/12/20 | 9:30-11:30 | Backtracking algorithms |
04/12/20 | 12:30-14:30 | Laboratory |
09/12/20 | 9:30-11:30 | Organising information: graphs |
11/12/20 | 12:30-14:30 | Laboratory |
14/12/20 | 9:30-11:30 | Project: specification |
16/12/20 | 9:30-11:30 | Greedy algorithms |