Full exam for Algorithms and parallel computing in the Mathematical Engineering degree programme at Politecnico di Milano. The document covers: Algorithms and Parallel Computing Course 052496 Prof. Danilo Ardagna Date: 14-06-2022 Last Name: ............................................................. First Name: ............................................................. Student ID:
Full exam for Algorithms and parallel computing in the Mathematical Engineering degree programme at Politecnico di Milano. The document covers: Algorithms and Parallel Computing Course 052496 Prof. Danilo Ardagna Date: 14-06-2022 Last Name: ............................................................. First Name: ............................................................. Student ID:
Import quality: text was extracted directly from the original document.
Representative passages recognised in different parts of the material. The full extracted text remains available to search, while this compact preview makes the page easier to read.
Algorithms and Parallel Computing Course 052496 Prof. Danilo Ardagna Date: 14-06-2022 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) A tensor is a data container which can store data inN dimensions. You have to develop a class implementing tensors up toN = 3 dimensions fordoubles. You have three main goals: i) your implementation should optimize the worst case complexity, ii) you need to supportrandom access, iii) your data structure will besparse. Considering that any index starts from 0, you have to: 1. implement the constructor which receives as input parameter the dimensions of yourTensorclass 2. provide the definition of the method: void set(double value, unsigned i, int j=-1, int k= -1) k has default value -1 to denote the scenarios where the tensor has one or two dimensions, while j de- fault value -1 characterizes one dimensional tensors. This method will add (for an unseen index) or update (in case the index already exists) values in your tensor objects. 3. implement the method: double get(unsigned i, int j=-1, int k= -1)const k has default value -1 to…
First page of the document.
