First cycle
degree courses
Second cycle
degree courses
Single cycle
degree courses
School of Engineering
COMPUTER ENGINEERING
Course unit
ALGORITHMS FOR ENGINEERING
INP5071701, A.A. 2019/20

Information concerning the students who enrolled in A.Y. 2017/18

Information on the course unit
Degree course First cycle degree in
COMPUTER ENGINEERING
IN0508, Degree course structure A.Y. 2011/12, A.Y. 2019/20
N0
bring this page
with you
Degree course track Common track
Number of ECTS credits allocated 6.0
Type of assessment Mark
Course unit English denomination ALGORITHMS FOR ENGINEERING
Department of reference Department of Information Engineering
Mandatory attendance No
Language of instruction Italian
Branch PADOVA
Single Course unit The Course unit can be attended under the option Single Course unit attendance
Optional Course unit The Course unit can be chosen as Optional Course unit

Lecturers
Teacher in charge DOMENICO SALVAGNIN MAT/09

ECTS: details
Type Scientific-Disciplinary Sector Credits allocated
Basic courses INF/01 Computer Science 2.0
Basic courses ING-INF/05 Data Processing Systems 4.0

Course unit organization
Period Second semester
Year 3rd Year
Teaching method frontal

Type of hours Credits Teaching
hours
Hours of
Individual study
Shifts
Lecture 6.0 48 102.0 No turn

Calendar
Start of activities 02/03/2020
End of activities 12/06/2020
Show course schedule 2019/20 Reg.2011 course timetable

Syllabus
Prerequisites: Introduction to programming, data structures.
Target skills and knowledge: Computational problem solving. How to tackle the solution process of a computational problem with objective tools based on general-purpose algorithmic paradigms. Knowledge of algorithmic primitives of large applicability in information engineering.
Examination methods: - Written exam
- (Optional) Oral exam
Assessment criteria: Both exams evaluate the familiarity with the concepts taught in class e the ability of applying the algorithmic techniques to new scenarios.
Course unit contents: - Algorithmic paradigms: techniques and analysis
- Noteworthy case studies
Planned learning activities and teaching methods: 1. Introduction to course. Basic definitions: problem, algorithm, computational model, cost model, pseudolanguage.

2. Divide-and-conquer
- Definition and properties
- Case studies
- Algorithm for computer arithmetic
- Fast Fourier Transform

3. Dynamic programming
- Definition and properties
- Case studies
- Problems on sequences: Longest Common Subsequence.

4. Greedy
- Definition and properties
- Case studies
- Huffman codes for data compression.
Additional notes about suggested reading: Textbook and web page with additional material and exercises.
Textbooks (and optional supplementary readings)
  • Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford, Introduction to algorithms. Cambridge, Massachussetts USA: The MIT Press, 2009. Third Edition Cerca nel catalogo

Innovative teaching methods: Teaching and learning strategies
  • Lecturing
  • Problem solving

Innovative teaching methods: Software or applications used
  • Latex

Sustainable Development Goals (SDGs)
Quality Education