Quiz
INT-1700 Study Guide I
Erstelle ein kostenloses Konto, um dieses Quiz zu beenden
Speichere deinen Fortschritt und sieh dir dein Endergebnis an.
oder mit deiner E-Mail registrieren
Schon ein Konto? Anmelden
Fragen in diesem Quiz (39)
1An important function of the Professor Manager is to keep track of the status of each job, process, and thread.
- ARichtig
- BFalsch
2The central processing unit (CPU) is the brains of the computer with the circuitry to control the interpretation and execution of instructions.
- ARichtig
- BFalsch
3Single-user contiguous allocation schemes have the problem of partition intrusion.
- ARichtig
- BFalsch
4Dual core or quad core multi-core chips are larger than a single-processor chip but produce less current leakage and heat.
- ARichtig
- BFalsch
5Context switching is required by all preemptive algorithms.
- ARichtig
- BFalsch
6With demand paging, three additional fields are introduced for each page in each PMT: one to determine if the page being requested is already in memory, a second to determine if the page contents have been modified while in memory and a third to determine if the page has been referenced most recently.
- ARichtig
- BFalsch
7The content of a random access memory (RAM) chip is nonvolatile, meaning that it is not erased when the power is turned off.
- ARichtig
- BFalsch
8Operating systems with networking capability have a fifth essential manager called the Network Manager that provides a convenient way for authorized users to share resources.
- ARichtig
- BFalsch
9The Processor Manager is a composite of at least two submanagers: one in charge of job scheduling and the other in charge of program scheduling
- ARichtig
- BFalsch
10Research continues to focus on finding the optimum allocation scheme.
- ARichtig
- BFalsch
11The best-fit allocation method keeps the free/busy lists organized by memory locations, low-order memory to high-order memory.
- ARichtig
- BFalsch
12In a fixed partition scheme, large jobs will need to wait if the large partitions are already booked, and they will be rejected if they're too big to fit into the largest partition.
- ARichtig
- BFalsch
13The first-fit algorithm assumes that the Memory Manager keeps only one list containing free memory blocks.
- ARichtig
- BFalsch
14A variation of the LRU page replacement algorithm known as the clock page replacement policy is implemented using a pointer to step through the reference bits of the active pages, simulating a clockwise motion.
- ARichtig
- BFalsch
15Networking was not always an integral part of operating systems.
- ARichtig
- BFalsch
16If one job monopolizes the system, the extent of its overall effect on system performance depends on the scheduling policy and whether the job is CPU-bound or I/O-bound.
- ARichtig
- BFalsch
17The bounds register is used to store the highest ( or lowest, depending on the specific system) location in memory accessible by each program.
- ARichtig
- BFalsch
18The optimal selection of cache size and replacement algorithm can result in 80 to 90 percent of all requests being in the cache.
- ARichtig
- BFalsch
19Cache memory is based on the concept of using a large, fast, and expensive memory to supplement the workings of the main memory.
- ARichtig
- BFalsch
20When using a FIFO scheme, adding more memory always results in better performance.
- ARichtig
- BFalsch
21In the 1980s, as a result of multiprocessing techniques, it became possible to execute two programs at the same time in parellel.
- ARichtig
- BFalsch
22A job's state moves from HOLD to WAITING when it's ready to run but is waiting for the CPU.
- ARichtig
- BFalsch
23Batch systems date from early computers, when each job consisted of a stack of chips entered into the system as a unit known as a stack.
- ARichtig
- BFalsch
24With demand paging, if there are no empty page frames available, to move in a new page, one of the current resident pages must be placed into main memory.
- ARichtig
- BFalsch
25In Round Robin scheduling, if processing isn't finished when time expires, the job is preempted and put at the end of the READY queue and its information is saved in its Process Control Block.
- ARichtig
- BFalsch
26A program is an active entity that requires a set of resources, including a processor and special registers, to perform its function.
- ARichtig
- BFalsch
27Virtual memory can be implemented with both paging and segmentation.
- ARichtig
- BFalsch
28In the relocatable dynamic partitions scheme, the Memory Manager relocates programs to gather together all of the empty blacks and compact them to make one block of memory large enough to accommodate some or all of the jobs, waiting to get in.
- ARichtig
- BFalsch
29In a dynamic partition system, a null entry in the busy list occurs when a memory block between two other busy memory blocks is returned to the free list.
- ARichtig
- BFalsch
30A large job can have problems with a first-fit memory allocation scheme.
- ARichtig
- BFalsch
31There are two primary types of user interfaces: the graphical user interfaces and the command line interface.
- ARichtig
- BFalsch
32The operating system manages each and every piece of hardware and software
- ARichtig
- BFalsch
33As a process moves through the system, its status changes. Possible process statuses include HOLD, READY, RUNNING, WAITING, and FINISHED.
- ARichtig
- BFalsch
34With distributed operating systems, users need to be aware of which processor is actually running their applications.
- ARichtig
- BFalsch
35The buffers use in the 1950s to reduce the discrepancy in speed between the I/O and the CPU were conceptually similar to those now used routinely by Web browsers to make video and audio playback smoother.
- ARichtig
- BFalsch
36Most computer programs alternate between CPU cycles and I/O cycles.
- ARichtig
- BFalsch
37It is possible to minimize response time by running only interactive jobs and letting batch jobs wait until the interactive load ceases.
- ARichtig
- BFalsch
38Memory defragmentation is performed by the operating system to reclaim fragmented space.
- ARichtig
- BFalsch
39In a paged memory allocation scheme, to find the actual position of an instruction in memory, first the page number and displacement are determined. Then the operating system refers to the job's PMT to correlate the page with its page frame.
- ARichtig
- BFalsch
Informationen
- Beschreibung
- Computer Science Quiz am INT-1700 Study Guide I, erstellt von Tre Brown am 25/02/2018.
- Autor
- Tre Brown
- Sprache
- English
- Aufrufe
- 1
- Schlagwörter
- Bewertung
- Noch keine Bewertungen Bewerte dieses Quiz