Theory and Fundamentals of OS Exam 1

_____ operating systems are designed primarily to maximize resource utilization.

Mainframe

Network

Handheld computer

The most common secondary storage device is _____.

Dynamic random access memory

Magnetic disk

Tape drives

Random access memory

A ____ can be used to prevent a user program from never returning control to the operating system.

Program counter

Portal

Firewall

Timer

Embedded computers typically run on a ____ operating system.

Clustered

Real-time

Windows XP

Network

Bluetooth and 802.11 devices use wireless technology to communicate over several feet, in essence creating a ____.

Wide-area network

Metropolitan-area network

Local-area network

Small-area network

A clustered system ____.

Is an operating system that provides file sharing across a network

Gathers together multiple CPUs to accomplish computational work

Can only operate one application at a time

Is used when rigid time requirements are present

Which of the following is a property of peer-to-peer systems?

Clients and servers are not distinguished from one another

Separate machines act as either the client of the server but not both

They do not offer any advantages over traditional client-server systems

They suffer from the server acting as the bottleneck in performance

Two important design issues for cache memory are ____.

Size and replacement policy

Speed and volatility

Size and access privileges

Power consumption and resuability

What are some examples of multimedia?

Audio and video files

DVD's

Live video over the Internet

All of the above

Which of the following statements concerning open source operating systems is true?

All open source operating systems share the same set of goals

They are always more secure than commercial, closed systems

Solaris is open source

Source code is freely available

Which of the following operating systems is not open source?

Linux

PCLinuxOS

Windows XP

BSD UNIX

A ____ provides a file-system interface which allows clients to create and modify files.

Network computer

File-server system

Wireless network

Compute-server system

The operating system kernel consists of all system and application programs in a computer.

True

False

Flash memory is slower than DRAM but needs no power to retain its contents.

False

True

Interrupts may be triggered by either hardware or software.

False

True

A _____ is an example of a systems program.

Database system

Web browser

Text formatter

Command interpreter

If a program terminates abnormally, a dump of memory may be examined by a ___ to determine the cause of the problem.

Module

Control card

Debugger

Shell

A microkernel is a kernel ____.

That is stripped of all nonessential components

Containing many components that are optimized to reduce resident memory size

That is compressed before loading in order to reduce its resident memory size

That is compiled to produce the smallest size possible when stored to disk

A boot block _____.

Tyipically only knows the location and length of the rest of the bootstrap program

Typically is sophisticated enough to load the operating system and begin its execution

Is composed of multiple disk blocks

Is composed of multiple disk cylinders

In a virtual machine, each program believes that it has ____.

Its own memory

More memory than is physically available on the machine

Multiple processors

Another "virtual" computer to assist in its operations

Java technology is

A specification of a virtual machine

A programming language specification and a specification of a virtual machine

A programming language specification

A virtual machine

_____ is not an example of a benefit of virtual machines.

Protects the host system from guest operating systems

The ability to run several different operating systems that all share the same hardware

The ability to concurrently run several different operating systems

Uses less physical memory than an actual operating system

____ provide(s) an interface to the services provided by an operating system.

Simulators

System calls

Shared memory

Communication

_____ is not one of the major categories of system calls.

Security

Protection

Communications

Process control

____ allow operating system services to be loaded dynamically.

Modules

Files systems

Graphical user interfaces

Virtual machines

Microkernels use ____ for communication.

Message passing

Shared memory

System calls

Virtualization

The Windows CreateProcess()system call creates a new process. What is the equivalent system call in UNIX:

Process()

NTCreateProcess()

Fork()

Getpid()

An initial bootstrap program is in the form of random-access memory (RAM).

True

False

System calls can be run in either user mode or kernel mode.

False

True

Application programmers typically use an API rather than directory invoking system calls.

True

False

The ____ of a process contains temporary data such as function parameters, return addresses, and local variables.

Program counter

Stack

Text section

Data section

A process control block ___.

Determines which process is to be executed next

Is an example of a process queue

Includes information on the process's state

Stores the address of the next instruction to be processed by a different process

The list of processes waiting for a particular I/O device is called a(n) ____.

Ready queue

Standby queue

Device queue

Interrupt queue

The ____ refers to the number of processes in memory.

Process count

Degree of multiprogramming

CPU scheduler

Long-term scheduler

When a child process is created, which of the following is a possibility in terms of the execution or address space of the child process?

The child process runs concurrently with the parent

The child process has a new program loaded into it

The child is a duplicate of the parent

All of the above

A _____ saves the state of the currently running process and restores the state of the next process to run.

Save-and-restore

State switch

Context switch

None of the above

A process may transition to the Ready state by which of the following actions?

Completion of an I/O event

Awaiting its turn on the CPU

Newly-admitted process

All of the above

Which of the following statements is true?

Message passing is most useful for exchanging large amounts of data

Message passing is typically faster than shared memory

Shared memory is typically faster than meassage passing

Shared memory is far more common in operating systems than message passing

The difference between a program and a process is that a program is an active entity while a process is a passive entity.

False

True

For a single-processor system, there will never be more than one process in the Running state.

False

True

Using a section object to pass messages over a connection port avoids data copying.

True

False

A socket is identified by an IP address concatenated with a port number.

False

True

Sockets are considered a high-level communications scheme.

False

True

The ____ multithreading model multiplexes many user-level threads to a smaller or equal number of kernel threads.

Many-to-some model

Many-to-one model

Many-to-many model

One-to-one model

Which of the following would be an acceptable signal handling scheme for a multithreaded program?

Deliver the signal to the thread to which the signal applies

Deliver the signal to every thread in the process

Deliver the signal to only certain threads in the process

All of the above

LWP is ____.

Short for lightweight processor

Placed between system and kernel threads

Placed between user and kernel threads

Common in systems implementing one-to-one multithreading models

____ is not considered a challenge when designing applications for multicore systems.

Determining if data can be separated so that it is accessed on separate cores

Identifying data dependencies between tasks

Deciding which activities can be run in parallel

Ensuring there is a sufficient number of cores

The ___ model allows a user-level thread to be bound to one kernel thread.

Two-level

One-to-one

Many-to-one

Many-to-many

The most common technique for writing multithreaded Java programs is ____.

Implementing the Runnable interface and defining its run() method

Using the CreateThread() function

Extending the Thread class and overriding the run() method

Designing your own Thread class

A ___ uses an existing thread - rather than creating a new one - to complete a task.

Lightweight process

Asynchronous procedure call

Thread pool

Scheduler activation

Calling the start() method of a Java thread

The start() method cannot be called directly

Only creates the thread

Creates the thread and invokes its run() method

Can be either (A) or (C)

A traditional (or heavyweight) process has a single thread of control.

True

False

Which of the following is true of cooperative scheduling?

A process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state

A process switches from the running state to the ready state when an interrupt occurs

It requires a timer

It incurs a cost associated with access to shared data

___ is the number of processes that are completed per time unit.

Response time

Throughput

CPU utilization

Turnaround time

____ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts.

Multileveled queue

FCFS

SJF

The ____ scheduling algorithm is designed especially for time-sharing systems.

FCFS

SJF

Multilevel queue

Which of the following scheduling algorithms must be nonpreemptive?

Priority algorithms

SJF

FCFS

Which of the following is true of multilevel queue scheduling?

Each queue has its own scheduling algorithm

A queue cannot have absolute priority over lower-priority queues

It is the most general CPU-scheduling algorithm

Processes can move between queues

____ allows a thread to run on only one processor.

Processor set

NUMA

Load balancing

Processor affinity

With ____ a thread executes on a processor until a long-latency event (i.e. A memory stall) occurs.

Fine-grained multithreading

Coarse-grained multithreading

Multicore processors

Virtualization

A significant problem with priority scheduling algorithms is ____.

Complexity

Determining the length of the time quantum

Determining the length of the next CPU burst

Starvation

The _____ occurs in first-come-first-served scheduling when a process with a long CPU burst occupies the CPU.

System-contention scope

Convoy effect

Dispatch latency

Waiting time

In RR scheduling, the time quantum should be small with respect to the context-switch time.

True

False

The most complex scheduling algorithm is the multilevel feedback-queue algorithm.

False

True

SMP systems that use multicore processors typically run faster than SMP systems that place each processor on separate cores.

False

True

What does a CPU do when there are no programs to run?

The OS parks the disk and shuts itself down gracefully

The OS hangs

The OS keeps waiting for an interrupt

The OS prompts the user and asks for his/her decision

Virtualization does not allow a single-CPU system to appear as a multiporcessor system.

False

True

Unlock and Upgrade

Remove all limits from your Quizzes

Theory and Fundamentals of OS Exam 1

More Quizzes