Suomeksi toisella puolella
Operating Systems II
Course examination 2.5.2006
Write in each answer sheet your name, signature, id-number, course name,
and page nr/total nr of pages.
NOTE: Answer only to four (4) questions out of five (5). If you answer to all questions, then the best answer is left out.
The recommended maximum length for each answer is 2 pages.
The exam is worth 60 exam points and they will be scaled down to 50 points towards your grade.
- [15 p] Scheduling
- SMP
- Real time systems
- [15 p] Consider virtual memory Clock page replacement algorithm, when each page has both R-bit (viitattu, referenced or accessed recently) and M-bit (modified).
- What is the original problem that this algorithm solves? How does this Clock page replacement algorithm work?
- When is this Clock algoritmi activated? Who activates it? Does it always terminate?
- Who sets new values for R- and M-bits and when?
- [15 p] Linux ext2fs file system
- What is an inode and what information does it have?
- What is a hard link and how is it implemented in this system?
- What is a soft link and how is it implemented in this system?
- What advantages/disadvantages do hard links have when compared to soft links?
- Compare ext3fs to this system? Advantages? Disadvantages?
- [15 p] Windows 2000 (W2K) File System (NTFS)
- NTFS Master File Table (MFT): basic idea and use, location on disk
- MFT implementation of very small, normal size and very large files
- How is NTFS error recoverability implemented? What types of errors can be recovered from?
- [15 p] Operating system data and utility program protection in Linux and in Windows 2000.
- How is operating system data and utility program protection implemented in these systems?
- How can a user level program access these services?
- For example, a user wants to change his/her password. How is this type of access to protected data (e.g., password) implemented in these systems?