Section 4: Operating Systems & File Systems

Modern software can be divided into two categories:

a. application software	b. system software
c. digital software	d. analog software

a. application software

b. system software

programs that help us solve real-world problems.

a. application software

b. system software

a. application software

Word processing programs, games, inventory control systems, automobile diagnostic programs, and missile guidance programs are all examples of _____.

a. application software

b. system software

a. application software

programs that manage a computer system and interact with hardware.

a. application software

b. system software

b. system software

Provides the tools and an environment where application software can be created and run; interacts directly with the hardware and provides more functionality than the hardware itself does.

system software

The _____ of a computer is the core of its system software.

Operating System

manages computer resources, such as memory and input/output devices; provides an interface through which a human can interact with the computer; allows an application program to interact with these other system resources.

Operating System

The technique of keeping multiple programs in main memory at the same time

Multiprogramming

To keep track of which programs are in memory and where in memory they reside.

Memory Management

A program in execution; dynamic entity that represents the program while it is being executed; an instance of a running program, including its current state and memory information.

Process

To carefully track the progress of a process and all of its intermediate states; the act of keeping track of information for active purposes.

Process Management

the method where an operating system decides which processes should be executed by the CPU and in what order.

CPU Scheduling

A system where programs and system resources are coordinated and executed without interaction between the user and the program; contains a set of jobs that need the same or similar resources

• the operator doesn’t have to reload and prepare the same resources over and over.

Batch Processing

A system that allows multiple users to interact with a computer at the same time.

a. batch processing	b. CPU scheduling
c. timesharing	d. multiprogramming

c. timesharing

______ allowed multiple processes to be active at once, which gave rise to the ability for programmers to interact with the computer system directly, while still sharing its resources.

Multiprogramming

______ systems create the illusion that each user has exclusive access to the computer.

• Each user does not have to actively compete for resources, though that is exactly what is happening behind the scenes.

Timesharing

The _____ manages the sharing of the resources, including the CPU, behind the scenes.

Operating System

means “in effect, though not in essence.”

Virtual

Software emulation of a physical computer, providing the same functionality as a physical machine.

Virtual Machine

A large, powerful computer that can handle many simultaneous users and tasks.

a. CPU	b. mainframe
c. desktop	d. operating system

b. mainframe

A monitor display and a keyboard.

a. desktop	b. dumb terminal
c. mainframe	d. virtual machine

b. dumb terminal

A users sits as a ______ and “logs in” to the _____. The _______ might be spread throughout a building, with the _____ residing in its own dedicated room. The ______ resides on the _______, and all processing occurs there.

a. mainframe	b. terminal	c. mainframe
d. operating system	e. dumb terminals	f. mainframe

1. terminal

2. mainframe

3. dumb terminals

4. mainframe

5. operating system

6. mainframe

_____ computers gave rise to minicomputers.

a. desktop	b. laptop
c. mainframe	d. operating system

c. mainframe

_____ became the basic hardware platform for timesharing systems.

a. mainframe	b. desktops
c. minicomputers	d. laptops

c. minicomputers

A system that must provide a guaranteed minimum response time to the user; a system where response time is crucial given the nature of the application domain.

Real-Time System

There are two kind addresses in the main memory:

a. digital address	b. logical address
c. named address	d. physical address

b. logical address

d. physical address

An address generated by the CPU during a program’s execution that is then translated to a physical address.

a. physical address	b. logical address
c. identifier	d. address binding

b. logical address

An actual address in the main memory device.

a. physical address	b. logical address
c. identifier	d. address binding

a. physical address

The mapping of a logical address to a physical address.

a. CPU Scheduling	b. memory management
c. identifier	d. address binding

d. address binding

A memory management method where all processes are loaded into a single continuous block of memory.

a. dynamic-partition technique	b. fixed-partition technique
c. single contiguous memory management	d. memory management

c. single contiguous memory management

It is the ______’s job to ensure that one program doesn’t access another memory space.

a. operating system	b. memory management
c. CPU	d. mainframe

a. operating system

Two strategies can be used to partition memory:

a. flexible partitions	b. single partitions
c. fixed partitions	d. dynamic partitions

c. fixed partitions

d. dynamic partitions

With a ______ technique, main memory is divided into a particular number of partitions.

a. flexible partition	b. single partition
c. fixed partition	d. dynamic partition

c. fixed partition

A memory management technique where memory is divided into a specific number of partitions or fixed-sized partitions with each one holding one process.

a. fixed-partition technique	b. dynamic-partition technique
c. single contiguous memory management	d. complex memory management

a. fixed-partition technique

With the _______, the partitions are created to fit the unique needs of the programs.

a. flexible-partition technique	b. single-partition technique
c. fixed-partition technique	d. dynamic-partition technique

d. dynamic-partition techniqueA

A memory management technique where memory is divided into variable-sized partitions based on the needs of processes.

a. flexible-partition technique	b. single-partition technique
c. fixed-partition technique	d. dynamic-partition technique

d. dynamic-partition technique

What is a benefit to using paged memory management?

a. It allows multiple processes in memory without splitting them into pieces.	b. It does not require a translation between logical and physical addresses.
c. It is the simplest of all techniques to implement and manage.	d. A process no longer needs to be stored in a single memory block.

d. A process no longer needs to be stored in a single memory block.

What is one characteristic of the dynamic-partition technique for creating partitions in partition memory management?

a. Memory is divided into fixed-size frames to minimize fragmentation.	b. The operating system's table of partition addresses will change as programs load and finish their execution.
c. The operating system's table of partition addresses does not change once it is set.	d. Address binding only needs to consider the location of the operating system.

b. The operating system's table of partition addresses will change as programs load and finish their execution.

What is the name of the CPU scheduling method in which a running process is not interrupted and is allowed to finish before another process starts?

a. nonpreemptive	b. highest response ratio next
c. round-robin	d. first come, first served

a. nonpreemptive

Which statement describes a characteristic of sequential file access?

a. Files are conceptually divided into numbered logical records.	b. The user can read and write records in any particular order.
c. The file pointer can be set to any record using the record number.	d. The file is seen as a linear structure with no random access.

d. The file is seen as a linear structure with no random access.

What is known as a path that specifies the location of a file or a directory starting from the current working directory?

a. relative path	b. root path
c. tree path	d. working path

a. relative path

What is one thing that all file systems are responsible for?

a. Managing the storage of data in primary memory	b. Providing users with a graphical interface for file access
c. Organizing the storage of data on memory storage devices	d. Directly interacting with hardware for data access

c. Organizing the storage of data on memory storage devices

Which file extension is commonly used for program source files?

a. mp3	b. py
c. png	d. html

b. py

In a _____, as programs are loaded, space is “carved out“, using only the space needed to accommodate the program and leaving a new, smaller empty partition, which may be used by another program later.

a. framed memory technique	b. fixed-partition technique
c. dynamic-partition technique	d. paged memory technique

c. dynamic-partition technique

In _____ the address information changes as programs come and go.

a. framed memories	b. fixed partitions
c. dynamic partitions	d. paged memories

c. dynamic partitions

There are various ways an Operating System might handle the details of the address translation. One way it to use 2 special-purpose registers in the CPU to help manage addressing.

What are the two registers?

a. base register	b. fixed register
c. bounds register	d. dynamic register

a. base register

c. bounds register

When a program becomes active on the CPU, the OS stores the address of the beginning of that program’s partition into the _____. Similarly, the length of the partition is stored in the _____.

a. base register	b. fixed register
c. bounds register	d. dynamic register

a. base register; c. bounds register

A register in the CPU that holds the beginning address of the current partition.

a. base register	b. fixed register
c. bounds register	d. dynamic register

a. base register

A register that holds the length of the current partition; a register that holds the ending address of a memory segment.

a. base register	b. fixed register
c. bounds register	d. dynamic register

c. bounds register

There are three general approaches to partition selection when trying to decide which partition to allocate to a new program:

a. first fit	b. good fit	c. neutral fit
d. best fit	e. worst fit	f. great fit

a. first fit

d. best fit

e. worst fit

A partition selection approach where the program is allocated to the first partition big enough to hold it.

First Fit

A partition selection approach where the program is allocated to the smallest partition big enough to hold it.

Best Fit

A partition selection approach where the program is allocated to the largest partition big enough to hold it.

Worst Fit

____ and ____ both work for fixed partitions. In dynamic partitions, _____ often works best because it leaves the largest possible empty partition, which may accommodate another program later on.

a. first fit

b. best fit

c. worst fit

first fit; best fit; worst fit

_______ places more of the burden on the operating system to keep track of allocated memory and to resolve addresses.

a. partition memory management

b. paged memory management

c. single contiguous memory management

b. paged memory management

In the _____ memory technique, main memory is divided into small fixed-size blocks of storage called frames.

a. partition memory management

b. paged memory management

c. single contiguous memory management

b. paged memory management

A memory management technique where processes are divided into fixed-sized pages and stored in memory frames when loaded.

Paged Memory Management

A fixed-size portion of main memory that holds a process page.

Frames.

A process is divided into _____ that we assume are the same size as a frame.

a. portions	b. partitions
c. pages	d. blocks

c. pages

A fixed-sized portion of a process that is stored into a memory frame.

Pages

The table used by the operating system to keep track of page/frame relationships; it maps each page to the frame in which it is loaded.

Page-Map-Table (PMT)

An extension to paged memory management where pages are brought into memory only when references (on demand).

d. page mapping	b. demand paging
c. instant paging	d. excessive page swapping

b. demand paging

The act of bringing a page into memory from secondary memory.

Page Swap

The illusion that there are no restrictions on the size of a program (because the entire program is not necessarily in memory at the same time.

A memory management technique that creates an illusion of a large contiguous memory space by using disk storage to extend physical memory.

Virtual MemoryE

Excessive page swapping is called

Thrashing

The stages a process moves through as it is managed by the operating system.

a. CPU scheduling	b. process control blocks
c. memory processing	d. process states

d. process states

What are the 5 process states?

New, Ready, Running, Waiting, Terminated.

In the ___ state, a process is being created.

a. new	b. waiting	c. ready
d. running	e. terminated	e. finished

a . new

A process that has no barriers to its executions is in the _____ state. A process in this state is not waiting for an event to occur or for data to be brought in from secondary memory. Instead, it is waiting for its chance to use the CPU.

a. new	b. waiting	c. ready
d. running	e. terminated	d. finished

c. ready

A process in the _____ state is currently being executed by the CPU.

a. new	b. waiting	c. ready
d. running	e. terminated	d. finished

d. running

A process in the _____ state is currently waiting for resources (other than the CPU).

a. new	b. waiting	c. ready
d. running	e. terminated	d. finished

b. waiting

A process in the _____ state has completed its execution and is no longer active.

a. new	b. waiting	c. ready
d. running	e. terminated	d. finished

e. terminated

The operating system must manage a large amount of data for each active process. Usually, this data is stored in a data structure called a _______.

a. file	b. process control block
b. file system	d. directory

b. process control block

A data structure used by the operating system to manage information about a process or store all information about a process.

Process Control Block (PCB)

The act of determining which processes in the ready state should be moved to the running state.

CPU Scheduling

A CPU scheduling method where a process once started cannot be interrupted by another process and must run to completion before the CPU can be allocated to another process.

a. nonpreemptive	b. preemptive
c. first come, first served	d. round-robin

a. nonpreemptive

A CPU scheduling method where a running process can be interrupted and replaced by another process before it is finished.

a. nonpreemptive	b. preemptive
c. first come, first served	d. round-robin

b. preemptive

The CPU scheduling metric that measures the elapsed time between a process’s arrival in the ready state and its ultimate completion.

Turnaround Time

Three approaches to determine which process gets chosen first to move from the ready state to the running state:

a. nonpreemptive	b. preemptive	c. shortest job next
d. first come, first served	e. round-robin	f. last job first

c. shortest job next

d. first come, first served

e. round-robin

In the _______ scheduling approach, processes are moved to the CPU in the order in which they arrive in the running state.

a. nonpreemptive	b. preemptive	c. shortest job next
d. first come, first served	e. round-robin	f. last job first

d. first come, first served

True or False: First come, first served is preemptive.

False. It’s nonpreemptive.

True or False: The turnaround time for each process would be its completion time minus arrival time.

True.

The ______ CPU-scheduling approach looks at all processes in the ready state and dispatches the one with the smallest service time.

a. nonpreemptive	b. preemptive	c. shortest job next
d. first come, first served	e. round-robin	f. last job first

c. shortest job next

A scheduling approach that distributes the processing time equitably among all ready processes.

a. nonpreemptive	b. preemptive	c. shortest job next
d. first come, first served	e. round-robin	f. last job first

e. round-robin

The amount of time each process receives before it is preempted (prevented from happening by stopping it) and returned to the ready state to allow another process to take its turn.

Time Slice

Which best describes nonvolatile memory?

a. the data stored on it is not maintained and lost when the power is not on.

b. the data stored on it is maintained even when power is not on.

b. the data stored on it is maintained even when power is not on.

A named collection of related data.

a. file system	b. list
c. file	d. record

c. file

The logical view that an operating system provided so that users can manage data as a collection of file.

a. file	b. file system
c. record	d. directories

b. file system

A file system is often organized by grouping files into ____.

a. systems	b. directories
c. lists	d. records

b. directories

A named group of files; a container used to organized file into a hierarchical structure on a computer system.

a. file system	b. directories
c. system	d. records

b. directories

A file that contains characters.

a. list	b. record
c. text file	d. file system

c. text file

A file that contains data in a specific format, requiring a special interpretation of its bits.

a. text file	b. binary file
c. file system	d. directory

b. binary file

The specific kind of information contained in a file; the classification or category of a file based on its content and format that determines how it can be used or opened.

a. file type	b. data type
c. identifier	d. record

a. file type

File names are often separated, usually by a period, into two parts:

a. the main name	b. the computer name
c. the file location	d. the file extension

a. the main name

d. the file extension

What is the file extension in MyProg.java?

java

The part of a file name that indicates the file type.

File Extension

The data in a file can be accessed in several different ways. Two primary techniques are:

a. linear access	b. sequential access
c. insertion access	d. direct access

b. sequential access

d. direct access

The most common access technique, and the simplest to implement, is _____, which views the file as a linear structure; it requires that the data in the file be processed in order.

a. linear access	b. sequential access
c. insertion access	d. direct access

b. sequential access

The directory containing another directory.

a. subdirectory	b. root directory
c. working directory	d. parent directory

d. parent directory