← Indietro
EsameEsame completoTesto d’esame

05 09 2024 E TS

Esame completo di Algorithms and parallel computing per il corso di Mathematical Engineering presso Politecnico di Milano. Materiale proveniente dall’archivio storico Studwiz e classificato per la consultazione online.

Algorithms and parallel computingEsame completo

Informazioni sul documento

Cosa trovi in questo materiale

Esame completo di Algorithms and parallel computing per il corso di Mathematical Engineering presso Politecnico di Milano. Materiale proveniente dall’archivio storico Studwiz e classificato per la consultazione online.

Qualità dell’importazione: il testo è stato estratto direttamente dal documento originale.

Contenuti estratti dal documento

Passaggi rappresentativi riconosciuti nelle diverse parti del materiale. Il testo completo resta presente nella pagina per la ricerca, mentre l’anteprima compatta rende più semplice la lettura.

Pagina 1

Algorithms and Parallel Computing Course 052496 Prof. Danilo Ardagna, Prof. Damian Tamburri Date: 05-09-2024 Last Name: ............................................................. First Name: ............................................................. Student ID: ............................................................. Signature: ............................................................... Exam duration: 2 hours and 30 minutes Students can use a pen or a pencil for answering questions. Students are NOT permitted to use books, course notes, calculators, mobile phones, and similar connected devices. Students are NOT permitted to copy anyone else’s answers, pass notes amongst themselves, or engage in other forms of misconduct at any time during the exam. Writing on the cheat sheet is NOT allowed. Exercise 1: Exercise 2: Exercise 3: Exercise 1 (12 points) PoliMi has initiated a new collaboration with the National Astronomical Observatory and requires you to implement a planetarium management system—PoliStars—where you can manage celestial bodies and their relationships while they move on a 2D plane. In particular, the trajectory of a celestial body is a collection of 2D coordinates, each representing its position at a certain time instant. You can assume these collections to all have the same length since they cover a fixed time window. Moreover, a planet and a star shall be linked if the planet orbits the star. Use shared pointers to manage the memory of the celestial bodies. Use STL containers to store the stars and planets. The system is structured as follows: • the CelestialBody base class represents a generic celestial body with virtual methods for displaying and getting the name (i.e., astd::string), mass (i.e., adouble), and trajectory (i.e., a vector of…

Anteprima

Prima pagina del documento.

Prima pagina: 05 09 2024 E TS