Week 11 - Operating Systems #1
No description yet. This curated deck is ready for daily study.
Card preview (13)
• ) Define Application Software. • ) Define System Software. • ) What does System software provide?
• Software written to address the needs of the user. • Software written to manage the hardware of the computer system. For example, The Operating System and BIOS. • An Interface Between the User and System.
• What is the function of The Boot Program? • The BIOS is managed by the CPU for what purpose? 3 Drivers Are Used By The OS, But What For?
• ) To load The OS into memory (RAM) • ) The BIOS manages the data flow between the peripherals and primary memory (E.g. The HDD, The Mouse, The Keyboard ETC.)
What are the three main functions of the operating system (Remember! MII)
• Manage the Hardware and system resources (CPU, I/O devices) • Provides and interface for the user to interact with the computer. • Allows the application to interact with system resources.
• ) A modern OS can support which feature? 2. ) The Operating System must perform which action to ensure each process has sufficient time to run on the CPU?
• ) Multi-tasking 2. ) Scheduling.
• ) Define a Physical Address 2. ) Define a Logical Address.
• ) A Physical Address is the ACTUAL location in memory. 2. ) A Logical Address is the location of the memory RELATIVE to the start of the program.
What is The Name For Converting A Logical Address To A Physical Address?
Address Binding
• ) How does The Single Contiguous Memory Management Technique Function? (What can be loaded into memory?) • ) How is the Physical Address Of A Section Of Code In The Program Calculated? • ) What is The Advantage Of Single Contiguous Memory? (1 Answer) • ) What Are The Two Main Disadvantages Of Single Contiguous Memory?
• ) Single Contiguous Memory Stores Only Has Operating System and A Single Application In Memory At Any One Time. • ) The Logical Address of The Code Is Added To The Physical Address Of The Starting Point Of The Program. • ) Single Contiguous Memory is Simple To Implement And Manage. • ) - Single Contiguous Memory Can Only Run One Program At A Time. - Single Contiguous Memory Is Wasteful In Terms Of Memory And CPU resources (all of it gets dedicated to a single program regardless of its size).
• ) How Many Programs Can Run At A Time In Partitioned Memory? • ) Define A Fixed Partitioning. • ) Define a Dynamic Partitioning. • ) The Operating System Maintains Two Registers Containing Two Fields For Each Partition. What are These Fields, And What Do They Represent?
• ) Multiple Programs (as long as there’s space) • ) A Fixed Partition Is Where A Fixed Number of Partitions In Which Programs Can Be Loaded. Any Space Left Over By A Program In A Fixed Partition Cannot Be Used To Create A New Partition. • ) A Dynamic Partition Is Where Partitions Of Varying Size Are Created As And When Needed. Any Space Left Over By A Program In A Dynamic Partitions Can Be Used To Create Another Partition. 4.) Base - Physical Address Of The Beginning Of The Partition. Boundary - Physical Address Of The Length Of The Partition.
Portioned Memory Management Uses Three Management Algorithms To Assign Memory - What are they, and how do they work?
Best Fit - Programs Are Stored In The Smallest Available Partition That Is Large Enough To Hold It. Worst Fit - Programs Are Stored In The Largest Partition Available That Is Large Enough To Store The Program. First Fit - Programs Are Stored In The First Partition That Is Large Enough To Hold The Program.
Explain Which Memory Allocation Method Works Best For Both Dynamic And Fixed Partitioning And Why.
Dynamic Partitioning - Worst Fit, as more portions are created using the Space Left Over Which means more Programs can be allocated to memory. Fixed Partitioning- Best Fit, Any unused space Cannot be reallocated as another Partition. As such, to minimise wasted memory, the smallest program is fitted into the smallest slot.
• ) What is the main advantage of using partitioned memory? 2. ) What are the Two Main Disadvantages To Using Partitioned Memory?
1.) Makes Efficient Use Of Memory By Allowing More Than One Program To Run At Once. • ) - A Program That Is Large Enough To Fit Into The Memory Might In Fact Be Too Large To Fit Into An Individual Partition. • Fixed Partitions Are Easier To Manage Than Dynamic Partitions, But Are Very Restrictive.
What Are The Steps For Calculating The Physical Location Of A Program Using It’s Logical Address And It’s Page Number?
• ) - Divide The Logical Address By The Size Of Each Page. - Calculate Any Remainder To Calculate The Offset. - Use The PMT Table To See Which Frame Holds The Page Number You Have Calculated. - Multiply The Frame Size By The Frame Number That Holds The Page And Add The Offset.
• ) What Is Page Swapping • ) What Is Dynamic Page Swapping? • ) What Is Page Thrashing?
• ) Page Swapping Is Moving A Stored Page From The Hard Drive To RAM (or Vice Versa) • ) Moving A Stored Page From The Hard Drive To RAM ONLY WHEN NEEDED. • ) Page Thrashing Is Where Multiple Programs Are Ran With Insufficient Memory. Pages Are Rapidly Swapped Backwards And Forwards Resulting In Lower Performance.