Corso attualmente non disponibile

Algorithms & Data Structures 2

Corso

A Mendrisio ()

Prezzo da consultare

Chiama il centro

Hai bisogno di un coach per la formazione?

Ti aiuterà a confrontare vari corsi e trovare l'offerta formativa più conveniente.

Descrizione

  • Tipologia

    Corso

Descrizione This course covers a variety of topics on algorithms and data structures, building upon the material of the first year course “Algorithms and Data Structures”. Algorithms and data structures are fundamental to computer science and the essence of computer programs. The performance of any software system depends on the efficiency of its algorithms and data structures. This course extends the students' knowledge on fundamental algorithms by focusing on several important topics such as data structures for disjoint sets and union-find, interval trees, graphs and graph algorithms such as shortest paths and matchings, intractability and NP completeness, how to deal with intractability and approximation algorithms.

Domande e risposte

Aggiungi la tua domanda

I nostri consulenti e altri utenti potranno risponderti

Inserisci i tuoi dati per ricevere una risposta

Pubblicheremo solo il tuo nome e la domanda

Opinioni

Successi del Centro

2018

Tutti i corsi devono essere aggiornati

La media delle valutazioni dev'essere superiore a 3,7

Più di 50 opinioni degli ultimi 12 mesi

8 anni del centro in Emagister.

Programma

Descrizione

This course covers a variety of topics on algorithms and data structures, building upon the material of the first year course “Algorithms and Data Structures”. Algorithms and data structures are fundamental to computer science and the essence of computer programs. The performance of any software system depends on the efficiency of its algorithms and data structures. This course extends the students' knowledge on fundamental algorithms by focusing on several important topics such as data structures for disjoint sets and union-find, interval trees, graphs and graph algorithms such as shortest paths and matchings, intractability and NP completeness, how to deal with intractability and approximation algorithms.

REFERENCES

  • Introduction to Algorithms, 3rd edition, by T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, MIT Press, 2009.

Other useful books (not required):

  • Algorithms, by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani, McGraw-Hill, 2006.
  • Algorithm Design, by J. Kleinberg, E. Tardos, Addison Wesley, 2005.

Chiama il centro

Hai bisogno di un coach per la formazione?

Ti aiuterà a confrontare vari corsi e trovare l'offerta formativa più conveniente.

Algorithms & Data Structures 2

Prezzo da consultare