1 / 7

Comprehensive Review for Final Exam: Exam Date December 15th

Prepare for your upcoming final exam on Tuesday, December 15th, covering Chapters 1-10 and key topics including Event Tracing for Windows, Java code for Semaphores and Mutexes, Design Patterns, and Threading issues like Deadlocks and Race Conditions. The exam will consist of 9-12 questions, with a closed book format featuring large, medium, and small topics. Critical subjects such as Paging vs. Segmentation, Resource Allocation Graphs, and File System implementation details will be addressed. Don't miss this comprehensive review session intended to boost your confidence and understanding.

hoshi
Télécharger la présentation

Comprehensive Review for Final Exam: Exam Date December 15th

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Final Exam Review • Exam Date: Next Tuesday, December 15th • This room, Same time

  2. Scope • Chapters 1-10 • One special topic: Event Tracing for Windows • Homeworks & Lecture

  3. Format • 9-12 questions • Closed book • 3-5 large • 3-5 medium • 2-5 small

  4. Topics • Java code for • Semaphores, Mutexes • Design patterns • Thread pools, etc • Deadlocks, race conditions • Paging versus Segmentation • Frames versus Pages • Paging algorithms (Fifo, Optimal, LRU)

  5. Topics • Working set windows and sizes • Thrashing • Resource Allocation Graphs • Wait-for graphs • Hardware Optimization Problems • MMUs • When a TLB works and when it doesn’t • Adding and removing CPUs, paging disks, etc. • Matrix multiplication and cache /speed ramifications • See the book problem for this &| slides

  6. Topics • AMAT: p*hitRate *hitCost + q * missRate * missCost • Where q = 1-p • File System implementation details • Windows Versus Unix high-level details • Page size pros and cons • Segmentation with paging • Internal & External Fragmentation

  7. Topics

More Related