← Indietro
EsameEsame completoTesto d’esame

03 02 2023 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 Date: 03-02-2023 Last Name: ............................................................. First Name: ............................................................. Student ID: ............................................................. Signature: ............................................................... Exam duration: 2 hours and 15 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 (14 points) You work for Cookle, a recipe indexing portal for cooking good recipes of typical Italian cooking. Your task is to develop the basic system powering the key operations of the portal for its intended users. The key functions that the portal is designed to support are: (1) storage for recipes, (2) rank recipes based on their star-rating (in the range [1-5] stars). For simplicity, you can think of recipes—which are stored using unique titles to avoid duplicates—as represented in a single web-page each, characterized by a (unique) title, ingredients, and a vector of text descriptions (called “procedures”) which explain the several possible ways to cook that recipe. Each description is authored by a different cook via the portal. Note that recipe procedures, recipes, and cooks shall be stored in astd::vector whose objects will needsharing, for increased memory efficiency (in order words, assume that many objects might be potentially…

Anteprima

Prima pagina del documento.

Prima pagina: 03 02 2023 E TS