PROGRAMMING AND ALGORITHMS 2

Università degli Studi
"G. d'Annunzio"

Chieti - Pescara

Error message

User error: Failed to connect to memcache server: druportbe01:11211 in dmemcache_object() (line 415 of /production/drupal/dim_prod/drupal/d7cl4/prod/unich/releases/7/web/sites/all/modules/contrib/memcache/dmemcache.inc).

General Module

Course Sheet

Course code:

000298LM1

Academic Year of enrolment:

2018

Year of supply:

2019/2020

Type of Course:

Related/Supplementary

Degree:

Course of 1st Cycle Degree in ECONOMICS AND BUSINESS INFORMATICS

Disciplinary Sector:

Computer Science

Is part of:

PROGRAMMING AND ALGORITHMS 2

Location:

PESCARA

Credits:

Programme Year:

Professor and Collaborators:

MOSCARDELLI Luca

Cycle:

First semester

Hours of classroom activity:

Individual study hours:

102

Prerequisites:

None

Objectives

The learning objectives can be associated with the following expected learning outcomes:
*Knowledge and understanding*
The course aims to provide the basic methodological and application knowledge of the main tools for object -oriented programming, and for the analysis and design of algorithms.
*Applying knowledge and understanding*
Even if it is taking as a reference language the Java language, the course aims to provide students with the tools to understand and use any object-oriented programming language. Moreover, also with the help concrete case studies carried out in the laboratory, the student will be able to analyze and develop algorithms for solving fundamental problems, even using non-trivial data structures such as trees and graphs.

Contents

- Introduction to object-oriented programming
- Inheritance and Polymorphism
- The String class the ArrayList class
- Exceptions and file management
- Introduction to Graphs
- Dynamic programming and Greedy Algorithms
- Fundamental algorithms for graphs

Extended Syllabus

- Introduction to object-oriented programming
- Inheritance: subclasses and superclasses
- Constructors
- The class hierarchy in Java
- Polymorphism: overloading and overriding
- Late binding
- Abstract classes and interfaces
- Instanceof and cast operator
- The packages
- The String class and the ArrayList class
- Exceptions: throwing and catching exceptions
- File management
- Graphs and their representation in memory
- Graph visits: Breadth-first search and Depth-first search
- Topological ordering of a DAG
- Dynamic programming
- Greedy algorithms
- Fundamental algorithms on graphs: minimum spanning tree problem and shortest path problem

Recommended Bibliography

- S. Mizzaro. Introduzione alla programmazione con il linguaggio Java. FrancoAngeli. ISBN: 978-88-464-1696-1
- A. Bertossi e A. Montresor. Algoritmi e strutture dati. Seconda edizione. CittàStudi Edizioni. ISBN: 978-88-251-7356-7

Teaching Methods

Lectures

Evaluation methods

Verification of learning:

*Knowledge and understanding*
The verification of the learning outcomes will be carried out through a written and oral examination (the latter being optional or potentially required by the teacher). The score of the exam is assigned by a mark expressed in 30ths and is based on both the written and oral examinations.
*Applying knowledge and understanding*
During the exam, students' ability to apply the knowledge given in the course is verified. In particular, students should be able to write object-oriented programs in the Java language, and to design and analyze algorithms and data structures.

Università degli Studi
"G. d'Annunzio"

Chieti - Pescara

Aree

Error message