Exam3
Which level provides a view of data that focuses on solving a particular problem? A. implementation level B. logical level C. array level D. linked level E. application level
- application level
Which of the following describes a partition selection algorithm in which the program is allocated to the smallest partition big enough to hold it? A. best fit B. worst fit C. shortest fit D. first fit E. last fit
- best fit
Which of the following best describes a partitioning approach that uses the base register to store the beginning address of the current partition? A. dynamic partitions B. fixed partitions C. both A and B D. neither A or B
. both A and B
Distinguish between a file type and a file extension
A file type is a description of the information contained in the file. A file extension is a part of the file name that follows a dot and identifies the file type.
Which of the following describes a collection of similar programs processed at the same time?
A. batch
Which of the following describes a partition selection algorithm in which the program is allocated to the smallest partition big enough to hold it? A. best fit B. worst fit C. shortest fit D. first fit E. last fit
A. best fit
Which of the following tracks the progress of a program during execution? A. process management B. memory management C. multiprogramming D. timesharing E. CPU scheduling
A. process management
54 To which state does the currently executing process return when it is interrupted by the operating system? A. ready B. new C. waiting D. terminated E. running
A. ready
Which of the following is the time it takes for the read/write head of a disk drive to get into position over a specified track? A. seek time B. latency C. transfer rate D. spindle time
A. seek time
Which of the following is a CPU scheduling algorithm that gives priority to the process with the smallest estimated remaining run time? A. shortest-job-next B. first-come, first-served C. time slice D. round robin E. turnaround time
A. shortest-job-next
Which of the following describes the act of storing register values for the currently executing process and loading the register values for the process taking over the CPU? A. swapping B. context switch C. demand paging D. thrashing E. virtual memory
B. context switch
Which of the following is the time it takes for the specified sector to rotate to the read/write head of a disk drive? A. seek time B. latency C. transfer rate D. spindle time E. access time
B. latency
Which of the following describes a reference made by a program relative to itself?
B. logical address
Which of the following describes a reference made by a program relative to itself? A. single contiguous B. logical address C. physical address D. partition E. paged
B. logical address
Which of the following describes a reference made by a program relative to itself? A. single contiguous B. logical address C. physical address D. partition E. paged
B. logical address
Which of the following describes a reference made by a program relative to itself? A. single contiguous B. logical address C. physical address D. partitionE. paged
B. logical address
Which of the following keeps track of where in memory a process is stored? A. process management B. memory management C. multiprogramming D. timesharing E. CPU scheduling
B. memory management
Which of the following describes a partition selection algorithm in which the program is allocated to the largest partition big enough to hold it? A. best fit B. worst fit C. shortest fi tD. first fit E. last fit
B. worst fit
Which of the following best describes a partitioning approach that uses the base register to store the beginning address of the current partition? A. dynamic partitions B. fixed partitions C. both A and B D. neither A or B
C. both A and B
Which of the following describes a memory management technique in which all parts of a process need not be in memory at the same time? A. swapping B. context switch C. demand paging D. thrashing E. virtual memory
C. demand paging
Which of the following is a technique for keeping more than one process in memory at the same time?
C. multiprogramming
Which of the following describes a reference made to an actual location in main memory? A. single contiguous B. logical address C. physical address D. partition E. paged
C. physical address
Which of the following describes a reference made to an actual location in main memory? A. single contiguous B. logical address C. physical address D. partitionE. paged
C. physical address
Which of the following is managed in a FIFO manner? A. list B. stack C. queue D. binary search treeE. graph
C. queue
Which of the following determines which process is allocated to the CPU?
CPU scheduling
Which of the following describes a monitor and keyboard used to interact with a computer? A. batch B. operator C. job D. dumb terminal E. mainframe
D. dumb terminal
Which of the following best describes a partitioning approach that uses the bounds register to store the last address of the current position? A. dynamic partitions B. fixed partitions C. both A and B D. neither A or B
D. neither A or B
Which of the following describes a memory management technique in which main memory is divided into multiple, different sized sections? A. single contiguous B. logical address C. physical address D. partition E. paged
D. partition
Which of the following is a preemptive CPU scheduling algorithm? A. shortest-job-next B. first-come, first-served C. time slice D. round robin E. turnaround time
D. round robin
Which of the following describes a degradation of system performance because too many pages are moving to and from memory?
D. thrashing
Which of the following shares CPU time among multiple processes to create the illusion that each user has a dedicated machine? A. process management B. memory management C. multiprogramming D. timesharing E. CPU scheduling
D. timesharing
Which of the following best describes a partitioning approach in which a new partition is created to accommodate a new process?
DYNAMIC PARTITION
Which of the following describes a memory management technique in which main memory is divided into multiple, different sized sections? A. single contiguous B. logical address C. physical address D. partition E. paged
E
Which of the following determines which process is allocated to the CPU? A. process management B. memory management C. multiprogramming D. timesharing E. CPU scheduling
E. CPU scheduling
Which of the following describes a memory management technique in which a program is divided into fixed sized sections and stored into areas of memory called frames?
E. paged
Which of the following describes a memory management technique in which a program is divided into fixed sized sections and stored into areas of memory called frames? A. single contiguous B. logical address C. physical address D. round robin E. paged
E. paged
In which state does a process reside if it is waiting only for its turn to use the CPU?
E. ready
In which state does a process reside if it is waiting only for its turn to use the CPU? A. new B. waiting C. terminated D. running E. ready
E. ready
In which state does a process reside if it is waiting only for its turn to use the CPU? A. new B. waiting C. terminated D. running E. ready
E. ready
59 To which state does a process move when the CPU scheduling algorithm determines it may next use the CPU? A. ready B. new C. waiting D. terminated E. running
E. running
Which of the following describes the situation in which memory appears to be unlimited because the program size is not restricted? A. swapping B. context switch C. demand paging D. thrashing E. virtual memory
E. virtual memory
? In a demand paging strategy, the entire program must be in memory at the same time.
F
A relative path is relative to the root of the directory hierarchy.
F
An absolute path and a relative path will always be the same length.
F
In partitioned memory management, an application program is separated into pieces and loaded into multiple partitions.
F
In partitioned memory management, the bounds register holds the address of the end of a program's partition.
F
Multiprogramming is the technique of allowing more than one programmer to work on a single computer at the same time.
F
The shortest-seek-time-first disk scheduling algorithm moves the heads the minimum amount it can to satisfy a pending request.
F
An array is a named collection of homogeneous items in which individual items are accessed by name
False
True or False? Stacks and queues can be implemented only as a linked structure.
False
25. Which level provides a view that deals with the underlying data structure used to manage the data?
Implementation Level
A queue is similar to a waiting line at a bank
T
System software manages the environment in which application software is created and run.
T
The shortest-job-next CPU scheduling algorithm is provably optimal, but requires knowledge of the future.
T
The shortest-seek-time-first disk scheduling algorithm moves the heads the minimum amount it can to satisfy a pending request.
T
True or False? Disk blocks are made up of one or more sectors.
T
Which level provides a view that deals with the underlying data structure used to manage the data?
a - implementation level
22. Which level provides a view of data that focuses on solving a particular problem
aPPLICATION
Which of the following describes the act of storing register values for the currently executing process and loading the register values for the process taking over the CPU? A. swapping B. context switch C. demand paging D. thrashing E. virtual memory
b - context switch
Which of the following is managed in a LIFO manner?
b - stack
Which of the following is a CPU scheduling algorithm that allocates processes to the CPU in the order in which they arrive? A. shortest-job-next B. first-come, first-served C. time slice D. round robin E. turnaround time
b- first-come, first-served
Which of the following describes a partition selection algorithm in which the program is allocated to the smallest partition big enough to hold it? A. best fit B. worst fit C. shortest fit D. first fit E. last fit
best fit
Which of the following best describes a partitioning approach that uses the base register to store the beginning address of the current partition? A. dynamic partitions B. fixed partitions C. both A and B D. neither A or B
c - both A and B
Which of the following describes a memory management technique in which all parts of a process need not be in memory at the same time? A. swapping B. context switch C. demand paging D. thrashingE. virtual memory
c - demand paging
Which of the following describes the amount of time a process uses the CPU before being interrupted by the operating system? A. shortest-job-next B. first-come, first-served C. time slice D. round robinE. turnaround time
c - time slice
Which of the following shares CPU time among multiple processes to create the illusion that each user has a dedicated machine? A. process management B. memory management C. multiprogramming D. timesharingE. CPU scheduling
d
Which of the following best describes a partitioning approach in which all partitions are the same size? A. dynamic partitions B. fixed partitions C. both A and B D. neither A or B
d - neither A or B
When a credit card reader inputs your number, what property is being exhibited?
data abstraction
What is the name of the standard Linux file system?
extended file system (ext3 / ext4)
? A linker puts a program's instructions into memory where they can be executed.
f
A program may often make references to a variables physical address in memory.
f
Application software interacts directly with the computer hardware.
f
The current file pointer indicates the end of a file.
f
The first-come, first-served (FCFS) CPU scheduling algorithm is a preemptive approach.
f
The operations on a list differ depending on the implementation strategy used
f
The process control block (PCB) contains the algorithm that determines which process will gain control of the CPU.
f
Which of the following best describes a partitioning approach in which partitions can have different sizes, but each keeps its original size? A. dynamic partitions B. fixed partitions C. both A and B D. neither A or B
fixed partitions
Which of the following is a technique for keeping more than one process in memory at the same time? A. process management B. memory management C. multiprogramming D. timesharing E. CPU scheduling
multiprogramming
Which of the following describes a reference made to an actual location in main memory? A. single contiguous B. logical address C. physical address D. partition E. paged
physical address
To which state does the currently executing process return when it is interrupted by the operating system?
ready
Which of the following describes a memory management technique in which only one application program was loaded into memory? A. single contiguous B. logical address C. physical address D. partition E. paged
single contiguous
2. A program written in a high-level language is stored in a text file that is also called a source file.
t
? In preemptive CPU scheduling, a process may be forced to wait even though all its necessary resources are available.
t
? System software manages the environment in which application software is created and run.
t
A systems programmer writes programs that make it easier for others to program.
t
A text file stores binary data that is organized into groups of 8 or 16 bits that are interpreted as characters.
t
An operating system is the core part of the system software of a computer.
t
In a multiprogramming environment, more than one program is in main memory at the same time.
t
In early computer systems, user jobs were organized into batches with similar characteristics or needs.
t
In fixed-partition memory management, the number of partitions and the size of each are fixed.
t
The CPU can be executing only one program at any instance in time.
t
The shortest-job-next CPU scheduling algorithm is provably optimal, but requires knowledge of the future.
t
The two general approaches for implementing a container are array-based and linked implementations
t
The type of a file determines which kinds of operations can be performed on it.
t
The worst-fit partition selection strategy makes sense for dynamic partitions but not for fixed partitions.
t
Dynamic partitions allow jobs to be shuffled around in memory to create one large free partition.
true
In fixed-partition memory management, the number of partitions and the size of each are fixed.
true
In which state does a process reside if it does not have a needed resource, such as a page from secondary memory? A. ready B. new C. waiting D. terminated E. running
waiting
Which of the following describes a partition selection algorithm in which the program is allocated to the largest partition big enough to hold it? A. best fit B. worst fit C. shortest fit D. first fit E. last fit
worst fit
