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: 11-02-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: 11-02-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: 11-02-2022 Last Name: ............................................................. First Name: ............................................................. Student ID: ............................................................. Signature: ............................................................... Exam duration: 2 hours 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 have to design the system used by a National Postal Office (PO) for managing the access to its branches. In particular, your goal is to manage the queue of the citizens who accessa single branchwith or without an appointment. In the latter scenario (without appointment), when a user enters a PO branch she/he gets a ticket from a totem and then she/he is served according to a first in first out policy (i.e., according to the order they arrive at the branch). Ticket codes are generated sequentially like "P1", "P2", "P3", etc., and always start from "P1" at the beginning of the day. In the former scenario, users with an appointment entering the branch show a QR code to the totem and then they are served according to the time of their appointment regardless of the status of the queue of the users who entered the branch without an appointment. In other words: • users with a reservation are served according to their booking time and hence a user who…
First page of the document.
