27-Final_Review

27-Final_Review - 1 CSE 421/521 - Operating Systems Fall...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 1 CSE 421/521 - Operating Systems Fall 2011 Tevfik Ko ş ar University at Buffalo December 8 th , 2011 Lecture - XXVII Final Review 2 Quiz-5 Solutions a) r2 happens before p4 : b) p1 happens before r3 : c) p2 happens before r4 : d) p1 and r4 are concurrent processes : e) r1 and p4 are concurrent processes : 3 4 Considering the above local wait-for graphs at sites S1 and S2, is the system D in a deadlocked state? If so, which processes are involved in the deadlock? Show how you would check the existence of a deadlock. 5 Consider the asymmetric encryption algorithm. You are given two prime numbers: p= 5 , q = 7 and assume the public key is given for you: Public key, ke = 5 Suppose we want to send the message, M=27 to you over the network. a) How do we calculate the encrypted message (cyphertext)? 6 b) How would you calculate your private key? c) How do you calculate the decrypted message (cleartext) from the cyphertext? 7 Final Exam December 15th, Thursday 8:00am - 11:00am @NSC 215 Chapters included in Final • Ch. 3.2-3.4 (Processes) • Ch. 4.2-4.4 (Threads) • Ch. 5.2-5.3 (CPU Scheduling) • Ch. 6.2-6.7 (Synchronization) • Ch. 7-2-7.6 (Deadlocks) • Ch. 8.1-8.6 (Main Memory) • Ch. 9.1-9.6 (Virtual Memory) • Ch. 11.1-11.5, 11.8 (File Systems) • Ch. 12.1-12.7 (Mass Storage & IO) • Ch. 15.1-15.5 (Security) • Ch. 17.1-17.6 (Distr. File Systems) • Ch. 18.1,18.2,18.5 (Distr. Coordination) ~ 20% ~ 80% 8. Main Memory – Contiguous Allocation – Dynamic Allocation Algorithms – Fragmentation – Address Binding – Address Protection – Paging – Segmentation 10 9. Virtual Memory – Demand Paging – Page Faults – Page Replacement – Page Replacement Algorithms (FIFO, LRU, SC, LFU, MFU, Optimal) – Performance of Demand Paging 11 11. File Systems • Directory structure & implementation • File allocation methods – contiguous, linked, indexed • Free space management – bit vectors, linked lists, grouping, counting 12 12. Mass Storage & I/O • Disk Mechanism & Structure • Disk Scheduling Algorithms – FCFS, SSTF, SCAN, LOOK, C-SCAN, C-LOOK • Hierarchical Storage Management • RAID Architectures – RAID 0-6, RAID 0+1, RAID 1+0 13 15. Security • Security Violation Categories • Security Violation Methods • Program & Network Threats • Cryptography • Symmetric & Asymmetric Encryption • Key distribution 14 18. Distributed Coordination • Event Ordering – Happened before relationship • Distributed Mutual Exclusion – Centralized & Fully Distributed Approaches • Distributed Deadlock Prevention – Resource Ordering – Timestamp Ordering (Wait-die & Wound-wait) • Distributed Deadlock Detection – Centralized & Fully Distributed Approaches 15 Exercise Questions 16 Question 1 • In terms of reliability and performance, compare bit vector implementation of a free block list with keeping a list of free blocks where the first few bytes of each free block provide the logical sector number of the next free block....
View Full Document

This note was uploaded on 02/27/2012 for the course CSE 421/521 taught by Professor Binar during the Fall '11 term at SUNY Buffalo.

Page1 / 7

27-Final_Review - 1 CSE 421/521 - Operating Systems Fall...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online