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
- [11/10/21, the] Introduction to the course
- slides: HTML
- [13/10/21, the] Introduction to Computational Thinking
- [15/10/21, the] Algorithms
- [18/10/21, lab] 1st Lesson
- book chapter: HTML
- [20/10/21, the] Computability
- [22/10/21, the] Programming languages
- book chapter: PDF, Google Docs
- slides: HTML
- from How To Code in Python:
- Chapter "Understanding Data Types": introductory paragraphs and sections "Background", "Numbers", "Floating-Point Numbers", "Booleans", "Strings"
- Chapter "How To Use Variables": introductory paragraphs and sections "Understadning Variables", "Naming Variables: Rules and Style", "Reassigning Variables", "Multiple Assignment"
- Chapter "Understanding Boolean Logic": all content
- Chapter "How To Write Conditional Statements": all content
- Chapter "How To Define Functions": introductory paragraphs and sections "Defining a Function", "Working with Parameters", "Returning a Value"
- Python: first_algorithm_empty.py, first_algorithm_no_assignments.py, first_algorithm.py
- exercises: 1, 2, 3
- solutions: 1, 2, 3
- [25/10/21, the] Organising information: ordered structures
- book chapter: PDF, Google Docs
- slides: HTML
- from How To Code in Python:
- Chapter "How To Write Comments": all content
- Chapter "How To Import Modules": all content
- Chapter "Understanding Data Types": section "Lists"
- Chapter "Understanding Lists": introductory paragraphs and section "Indexing Lists"
- Chapter "How To Use List Methods": introductory paragraphs and sections "list.append()", "list.extend()", "list.remove()"
- Python: define_functions.py, list_instructions.py, stack_instructions.py, queue_instructions.py
- exercises: 1, 2, 3
- solutions: 1, 2, 3
- [27/10/21, lab] 2nd Lesson
- [29/10/21, the] Brute-force algorithms
- book chapter: PDF, Google Docs
- slides: HTML
- from How To Code in Python:
- Chapter "How To Construct While Loops": all content
- Chapter "How To Construct For Loops": all content
- Chapter "Understanding Tuples": all content
- Chapter "Understanding Lists": section "Constructing a List with List Items"
- Chapter "How To Use List Methods": section "list.insert()"
- Python: stack_from_list.py, run_forever.py, linear_search.py, insertion_sort.py
- exercises: 1, 2, 3, 4, 5
- solutions: 1, 2, 3, 4, 5
- [08/11/21, lab] 3rd Lesson
- book chapter: HTML
- Python: main.py, functions.py
- [10/11/21, the] Organising information: unordered structures
- book chapter: PDF, Google Docs
- slides: HTML
- from How To Code in Python:
- Chapter "Understanding Data Types": section "Dictionaries"
- Chapter "Understanding Dictionaries": all content
- Chapter "How To Construct Classes and Define Objects": all content
- Python: set_instructions.py, dictionary_instructions.py
- exercises: 1, 2, 3
- solutions: 1, 2, 3
- [15/11/21, the] Recursion
- book chapter: PDF, Google Docs
- slides: HTML
- Python: run_forever_recursive.py, multiplication.py
- exercises: 1, 2
- solutions: 1, 2
- [17/11/21, lab] 4th Lesson
- [22/11/21, lab] 5th Lesson
- [24/11/21, the] Divide and conquer algorithms
- book chapter: PDF, Google Docs
- slides: HTML
- Python: immutable_values.py, mutable_values.py, immutable_and_mutable_variables.py, merge.py, merge_sort.py
- exercises: 1, 2, 3
- solutions: 1, 2, 3
- [29/11/21, lab] 6th Lesson
- book chapter: HTML
- [01/12/21, the] Dynamic programming algorithms
- book chapter: PDF, Google Docs
- slides: HTML
- Python: fib_dc.py, fib_dp.py
- exercises: 1, 2
- solutions: 1, 2
- [06/12/21, the] Organising information: trees
- book chapter: PDF, Google Docs
- slides: HTML
- Python: tree_instructions.py
- exercises: 1, 2
- solutions: 1, 2
- [13/12/21, the] Backtracking algorithms
- book chapter: PDF, Google Docs
- slides: HTML
- Python: peg_solitaire.py
- exercises: 1, 2
- solutions: 1, 2
- [15/12/21, the] Organising information: graphs
- book chapter: PDF, Google Docs
- slides: HTML
- Python: graph_instructions.py, multigraph_instructions.py, graph_attribute_instructions.py
- exercises: 1, 2
- solutions: 1, 2
- [20/12/21, the] Greedy algorithms
- book chapter: PDF, Google Docs
- slides: HTML
- Python: line_wrap.py
- exercises: 1, 2
- solutions: 1, 2
| 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 |
- 28 January 2022
- 14 March 2022
- 16 May 2022
- 20 June 2022
- 15 July 2022
- 5 September 2022
- Official book of the course
- Twitter profile of the course
- Workshop
- Written examinations: text and solutions