Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
41 Cards in this Set
- Front
- Back
What operating system part is unique to each operating system.
|
Interface
|
|
Linux, Netware, Unix, and Windows are commonly used for what operating system platform.
|
Network Platform
|
|
A combination of batch and interactive make up a.
|
Hybrid System
|
|
What Introduced the need for control cards.
|
Job Scheduling
|
|
The control unit was introduced during second generation why.
|
Reduce descretpy and speed between the IO and CPU
|
|
What is firmware.
|
Program permanently keep in rom.
|
|
What sparked the demand for network capabilities in the mid 1990.
|
The internet
|
|
What is the kernel.
|
The core part of the OS
|
|
In fixed partition what is the first step in loading a job.
|
Determine the jobs requested memory
|
|
HHow does best fit memory allocation work?
|
Looks at the job scheduler and all partitions that are open to use the best fit so we have the least amount of internal fragmentation.
|
|
How does the memory manager deallocated in a fixed partition scheme.
|
resets the memory block to free.
|
|
What is compaction.
|
Reclaiming fragmented segments.
|
|
What is a problem associated with compaction.
|
overhead, takes up alot time
|
|
What are the three options to perform compaction.
|
Time, Percentage, jobs are waiting.
|
|
What are the biggest advantage for storing programs in non contigues memory locations
|
Main Memory is more efficient
|
|
What is the problem with setting page sizes to small.
|
Very long page map tables
|
|
Under page defaults what most be done with any pages that have been swapped if its been modified?
|
It has to be rewritten to the disk
|
|
What is thrashing?
|
Constite swapping
|
|
How does the first in first out policy work for page swapping
|
First in first out.
|
|
How does the Least Recently Used policy work
|
Swaps the one with least amount of activity
|
|
What is ment by locality of reference?
|
No reason to load the entire program all the time.
|
|
What is the makeup of a address for segmented memory management?
|
Segment number and displacement
|
|
What does the system use as a main memory between cpu?
|
Cache
|
|
What is a thread?
|
A lightweight process or a portion of a process that can be run independitly.
|
|
Trying to balances cpu bound process and IO bound process fall under which scheduler?
|
Job Scheduler
|
|
5 states of a scheduler.
|
Hold Ready Running Waiting Finish
|
|
When a job is accepted by the system which happens first?
|
Goes into hold than into a que
|
|
What is the purpose of accounting in a PCB?
|
Billing and perfomance measurments or statistics
|
|
What is considered a schedule wait in a multi-program enviroment?
|
A IO Request
|
|
A first come first serve algorithium uses what kind of que?
|
First in First out que
|
|
What is aging?
|
When a process sits in a waiting que it raises it prioritys
|
|
What is the advantage and disadvantage of using dynamic resource sharing in a interative system?
|
Uses resources better but can lead to deadlocks
|
|
Deadlocks become critical for what kind of systems?
|
Real-time
|
|
A race can happen in a database if you fail to do what?
|
Lock the record
|
|
Control the flow of messages threwout the network?
|
Protocols
|
|
What is ment by mualtile exclusion?
|
Only one process is giving a dedicated resource
|
|
No premeption means?
|
Cannot be interupted dedicated for aslong as its need
|
|
What is a circular wait?
|
Waiting for a job that will never finish.
|
|
what is another name for multiprocessing?
|
Parrell processing
|
|
What is a critical region of a process?
|
Has to be processed as a unit
|
|
Threads are compossed of what? Process Regisers,
|
Process Regisers, Program Counters, Stats and Stacks share data area, code, and original resources allocated.
|