← Indietro
EsameEsame completoTesto d’esame

03 09 2024 E TS

Esame completo di Advanced Operating Systems per il corso di Computer Engineering presso Politecnico di Milano. Materiale proveniente dall’archivio storico Studwiz e classificato per la consultazione online.

Advanced Operating SystemsEsame completo

Informazioni sul documento

Cosa trovi in questo materiale

Esame completo di Advanced Operating Systems per il corso di Computer 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

Advanced Operating Systems - Part A, Sept. 3, 2024 Exercises and solutions Exam finalization Question 1.1 This is part A of the AOS’s exam and today you are finalising your entire grade. You must express now how you have finalised part B. The answer is mandatory for the entire exam. Exercise 2 — General knowledge - Closed questions (Points 7) Question 2.1 (Points 7) Select the correct answer in the following quiz on general knowledge of operating systems. 0 correct answers will get you a D, up to two 2 correct answers will get you C, up to 4 you’ll get a B, above that you’ll get an A. Solution Which of the following statements about the usage of locks in the Linux kernel is correct? • □ Reader-writer locks allow one writer and multiple concurrent readers but can suffer from writer starva- tion. Which of the following BEST describes the buddy allocator in Linux memory management? • □ The buddy allocator avoids splitting large free blocks unless necessary for smaller requests. What do we mean with “Copy on Write” in the context of Linux process management? • □ It is implemented by changing VMAs to readonly, intercepting page faults, and copying the memory only when data modification is necessary. Which of the following best describes how Linux handles pages in virtual memory when the system is running low on free pages? • □ Linux uses a clock algorithm, where pages are examined based on a referenced bit to approximate LRU behavior. *Which memory consistency model allows for the possibility that both registers in a multi-threaded program can read outdated values due to queuing of their operations, potentially resulting in unexpected old values being read in concurrent threads?* • □ TSO Consistency Which of the following is an essential function of the Read-Copy Update…

Anteprima

Prima pagina del documento.

Prima pagina: 03 09 2024 E TS