20934 - ALGORITHMS FOR AI - PREPARATORY COURSE
Department of Computing Sciences
Course taught in English
Go to class group/s: 1
Course Director:
FABRIZIO IOZZI
FABRIZIO IOZZI
Mission & Content Summary
MISSION
This preparatory course introduces students to the basic mathematical techniques and some basic results of the theory of algorithms.
CONTENT SUMMARY
Asymptotic Notation
Algorithms of Arithmetic
Divide and Conquer Algorithms
Introduction to Graphs
Depth-first search
Connectivity in Graphs
Paths in Graphs
Breadth-first search
Dijkstra's Algorithm
Intended Learning Outcomes (ILO)
KNOWLEDGE AND UNDERSTANDING
At the end of the course student will be able to...
Define what is an algorithm, what is efficiency in algorithms
Describe the vaiours types of graphs and their properties
Describe connectivity in graphs
Describe the functioning of the algorithms presented in the course.
APPLYING KNOWLEDGE AND UNDERSTANDING
At the end of the course student will be able to...
Correctly apply the algorithms to the problems presented in the course
Evaluate the running time of the algorithms presented in the course.
Teaching methods
- Lectures
DETAILS
Classes are taken online, with a set of prerecorded video lectures.
Assessment methods
| Continuous assessment | Partial exams | General exam | |
|---|---|---|---|
|
x |
ATTENDING AND NOT ATTENDING STUDENTS
Teaching materials
ATTENDING AND NOT ATTENDING STUDENTS
Textbook:
Algorithms (chapters 0-4)
by Sanjoy Dasgupta, Christos Papadimitriou and Umesh Vazirani
McGrawHill
Last change 17/07/2024 15:18