Algoritmi e strutture dati by Camil Demetrescu; Irene Finocchi; Giuseppe F. Italiano and a great selection of related books, art and collectibles available now at. Algoritmi E Strutture Dati Seconda edizione (Italian Edition) [Camil Demetrescu] on *FREE* shipping on qualifying offers. Dipartimento di Ingegneria Civile e Ingegneria Informatica · Università C. Demetrescu, I. Finocchi, G.F. Italiano Progetto di Algoritmi e Strutture Dati in Java.

Author: Nelrajas Dailabar
Country: Bulgaria
Language: English (Spanish)
Genre: Literature
Published (Last): 26 October 2006
Pages: 344
PDF File Size: 14.73 Mb
ePub File Size: 4.40 Mb
ISBN: 763-8-64870-570-3
Downloads: 6263
Price: Free* [*Free Regsitration Required]
Uploader: Sakasa

Thanks for telling us about the problem.

Giuseppe F. Italiano

A basic understanding of programming in Java and a background in discrete mathematics are necessary prerequisites to this module. Interfaces and abstract classes.

Browse the Teaching site: The Java Collection Framework Interfaces and classes. Stefano rated it liked it Mar 20, Trivia About Algoritmi E Strut The formative assessment is performed via interaction between teacher and students during lectures.


The course profile, written following the Tuning international methodologyis available here. Java implementation of heap-sort.

Click here to access the teaching material available on this site last update: Open Preview See a Problem? Be the first to ask a question about Algoritmi E Strutture Dati. Learning Outcomes Dublin Descriptors On successful completion of this course, the student should Module Algoritmi e Strutture Dati By the end of this module students will be able to: Balmung rated it it was amazing Feb 13, Monica Colangelo added it Jan 11, This involves writing program code with pen and paper.


Demonstrate the capability of formally presenting and modeling concrete problems and explain the most important characteristics concerning the standard data structures, their analyses, and their Java implementations. Online Teaching Resources Homepage: The main goal is to present and discuss the content that is covered in this module, and illustrate the concepts using specific code examples. Roberto Capannelli rated it really liked it Aug 20, Fondamenti di Programmazione con Laboratorio.

The course will encourage the development of the following skills of the student: There is no formal pre-assessment, but Course pre-requisites are clearly stated on the Module website. The course aims to develop in undergraduate students competencies and abilities necessary in their future studies, especially with respect to advanced algorithmic courses.

Fabio Ticconi rated it really liked it Jan 05, Through the presentation and the comparison of different solutions to a given probelm, students will be guided to learn and to identify independently their most efficient solution. Finally, to develop an intuition about how to solve efficiently a computational problem.

To ask other readers questions about Algoritmi E Strutture Datiplease sign up.

I agree I want to find out more. Lectures and exercises will be held two times a week.


DISIM Teaching Website – University of L’Aquila :: Course Detail

Cmuzzini added it Jun 08, Fabrizio rated it really liked it Sep 11, Wikimedia Italia added it Dec 31, Blu added it May 24, Resources marked with an asterisk belong to other courses indicated between brackets. The module encourages students to develop implementations using the Java language, understand their performance characteristics, and estimate their potential effectiveness in applications using lectures and exercises.

Searching and sorting algorithms and their implementation in Java: Browse the Department site: Both parts provides also an optional intermediate written examination. Know classical algorithms and data structures for information processing and their implementations, with particular focus on computational complexity aspects, and be aware of the effects of data organization and algorithms on program efficiency; Be familiar with standard techniques for designing algorithms, including the techniques of recursion, divide-and-conquer, and greedy and understand how apply them to design efficient algorithms for different kinds of problems.

Lists with This Book.