Copiar y Editar

OS FULL 117

Descripción

YUNIKOVA
Axakalov Beksultan
Test por Axakalov Beksultan, actualizado hace más de 1 año
Axakalov Beksultan
Creado por Axakalov Beksultan hace más de 6 años
41
1
0

Resumen del Recurso

Pregunta 1

Pregunta
1. What is not a main structural element of a computer system?
Respuesta
  • Main Memory
  • I/O Modules
  • System Bus
  • Operating system
  • Processor

Pregunta 2

Pregunta
2. Which of the following registers are used by the processor to exchange data with memory?
Respuesta
  • I/OAR and I/OBR
  • Program status word
  • PC and IR
  • MAR and MBR

Pregunta 3

Pregunta
3. Which of the following registers are used by the processor to exchange data with input/output module?
Respuesta
  • I/OAR and I/OBR
  • MAR and MBR
  • Program status word
  • PC and IR

Pregunta 4

Pregunta
4. Which of the following element of a computer system controls the operation of the computer and performs its data processing functions?
Respuesta
  • Processor
  • System bus
  • I/O modules
  • Main memory

Pregunta 5

Pregunta
5. Which of the following element of a computer system stores data and programs?
Respuesta
  • I/O modules
  • Processor
  • System bus
  • Main memory

Pregunta 6

Pregunta
6. Which of the following provides for communication among elements of a computer system?
Respuesta
  • • I/O modules
  • • Processor
  • • System bus
  • • Main memory

Pregunta 7

Pregunta
7. Which of the following element of a computer system moves data between the computer and its external environment?
Respuesta
  • • Main memory
  • • Processor
  • • I/O modules
  • • System bus

Pregunta 8

Pregunta
8. The processor contains a single data register, called
Respuesta
  • • PSW
  • • AC
  • • IR
  • • PC

Pregunta 9

Pregunta
9. This register specifies a particular input/output device
Respuesta
  • • I/OBR
  • • Memory buffer register
  • • I/OAR
  • • Memory address register

Pregunta 10

Pregunta
10. This register is used for the exchange of data between an I/O module and the processor
Respuesta
  • • I/OBR
  • • Memory buffer register
  • • I/OAR
  • • Memory address register

Pregunta 11

Pregunta
11. This register contains the data to be written into memory or which receives the data read from memory
Respuesta
  • • I/OBR
  • • memory address register
  • • memory buffer register
  • • I/OAR

Pregunta 12

Pregunta
12. This register specifies the location in memory for the next read or write
Respuesta
  • • I/OBR
  • • Memory buffer register
  • • I/OAR
  • • Memory address register

Pregunta 13

Pregunta
14. Which register contains the address of the next instruction to be fetched?
Respuesta
  • • process counter
  • • program counter
  • • execution register
  • • instruction register

Pregunta 14

Pregunta
14. Which register contains the instruction most recently fetched?
Respuesta
  • • process counter
  • • instruction register
  • • execution register
  • • program counter

Pregunta 15

Pregunta
15. Which register contains condition codes set by the processor hardware as the result of operations?
Respuesta
  • • Stack pointer
  • • Program status word
  • • Accumulator
  • • Program counter

Pregunta 16

Pregunta
16. The fetched instruction is loaded into the
Respuesta
  • • PC
  • • Memory
  • • Accumulator
  • • IR

Pregunta 17

Pregunta
17. At the beginning of each instruction cycle, the processor fetches an instruction from the memory. The address of the instruction is held in
Respuesta
  • • PC
  • • MAR
  • • MBR
  • • IR

Pregunta 18

Pregunta
18. The processor is executing ‘Load AC from memory’ instruction. Choose the correct micro-instructions:
Respuesta
  • • PC -> MAR M -> MBR MBR -> AC IR -> MAR M -> MBR MBR -> AC
  • • PC -> MBR M -> MAR MAR -> IR IR -> MAR M -> MBR MBR -> AC
  • PC -> MAR M -> MBR MBR -> IR IR -> MAR M -> MBR MBR -> AC
  • • PC -> MAR M -> MBR MBR -> IR IR -> MBR M -> MAR MAR -> AC

Pregunta 19

Pregunta
19. When an I/O device completes an I/O operation, the device issues an interrupt signal to the processor and then:
Respuesta
  • • The processor stops execution of the current instruction without finishing it and responds to the interrupt
  • • The processor loads the program counter with the entry location of the interrupt-handling routine
  • • The processor saves information needed to resume the current program at the point if interrupt
  • • The processor finishes execution of the current instruction before responding to the interrupt

Pregunta 20

Pregunta
20. When the time required for the I/O operation is less that the time to complete the execution of instructions between write operations in the user program, it is:
Respuesta
  • • Short I/O wait
  • • Long I/O wait
  • • Slow I/O wait
  • • Fast I/O wait

Pregunta 21

Pregunta
21. When the time required for the I/O operation will take much more time than executing a sequence of user instructions, it is:
Respuesta
  • • Short I/O wait
  • • Fast I/O wait
  • • Long I/O wait
  • • Slow I/O wait

Pregunta 22

Pregunta
22. If there no interrupts, after each write operation, the processor must:
Respuesta
  • • Pause and remain idle until the I/O operation
  • • Save the PSW and PC onto control stack
  • • Finish execution of current instruction
  • • Load new PC value

Pregunta 23

Pregunta
23. Complete the relationship concerning the memory systems: faster access time –
Respuesta
  • • smaller cost per bit
  • • faster access speed
  • • greater cost per bit
  • • lower capacity

Pregunta 24

Pregunta
24. Complete the relationship concerning the memory systems: greater capacity –
Respuesta
  • • smaller cost per bit
  • • faster access speed
  • • greater cost per bit
  • • lower capacity

Pregunta 25

Pregunta
25. Complete the relationship concerning the memory systems: greater capacity –
Respuesta
  • • faster access speed
  • • greater cost per bit
  • • slower access time
  • • lower capacity

Pregunta 26

Pregunta
26. The smaller, more expensive, faster memory is:
Respuesta
  • • Register
  • • Main memory
  • • Cache
  • • Disk drive

Pregunta 27

Pregunta
27. If the accessed word is found in the faster memory, that is defined as a:
Respuesta
  • • evrika
  • • hit
  • • win
  • • bingo

Pregunta 28

Pregunta
28. If the accessed word is not found in the faster memory, that is defined as a:
Respuesta
  • • Loss
  • • zero
  • • miss
  • • ricochet

Pregunta 29

Pregunta
29. This type of memory is nonvolatile:
Respuesta
  • • Main memory
  • • Cache
  • • Secondary memory
  • • Register

Pregunta 30

Pregunta
30. When a processor attempts to read a byte or word of memory, it firstly checks the:
Respuesta
  • • Main memory
  • • Secondary memory
  • • Cache
  • • Register

Pregunta 31

Pregunta
31. This chooses which block to replace when a new block is to be loaded into the cache and the cache already had all slots filled with other blocks:
Respuesta
  • • locality of reference
  • • cache size
  • • write policy
  • • replacement algorithm

Pregunta 32

Pregunta
32. If the contents of a block in the cache are altered, then it is needed to save it back to main memory before replacing it. This is called:
Respuesta
  • • replacement algorithm
  • • locality of reference
  • • mapping function
  • • write policy

Pregunta 33

Pregunta
33. Which of the following is not a technique possible for I/O operations?
Respuesta
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Pregunta 34

Pregunta
34. The processor issues an I/O command to a module and waits, periodically checking the status of the I/O module until it finds that the operation is complete.
Respuesta
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Pregunta 35

Pregunta
35. The I/O module performs the requested action and then sets the appropriate bits in the I/O status register but takes no further action to alert the processor.
Respuesta
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Pregunta 36

Pregunta
36. The main disadvantage of this technique: it is a time-consuming process that keeps the processor busy needlessly.
Respuesta
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Pregunta 37

Pregunta
37. The processor issues an I/O command to a module and then go on to some other useful work.
Respuesta
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Pregunta 38

Pregunta
38. The I/O module performs the requested action and alerts the processor to request service when it is ready to exchange data with the processor.
Respuesta
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Pregunta 39

Pregunta
39. The main disadvantage of this technique: consumes a lot of processor time, because every word of data that goes from memory to I/O module or from I/O module to memory must pass through the processor.
Respuesta
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Pregunta 40

Pregunta
40. The processor issues an I/O command to a separate module, by sending the type of operation (read/write), the address of the I/O device, the starting location in memory for data, number of words. Then the processor continues with other work.
Respuesta
  • • Direct memory access (DMA)
  • • Manual memory access
  • • Programmed I/O
  • • Interrupt-driven I/O

Pregunta 41

Pregunta
41. The module transfers the entire block of data to/from memory without going through the processor.
Respuesta
  • • Direct memory access (DMA)
  • • Manual memory access
  • • Programmed I/O
  • • Interrupt-driven I/O

Pregunta 42

Pregunta
42. The main disadvantage of this technique: there is a competition for bus usage.
Respuesta
  • • Direct memory access (DMA)
  • • Manual memory access
  • • Programmed I/O
  • • Interrupt-driven I/O

Pregunta 43

Pregunta
43. A hardcopy sign-up sheet was used to reserve computer time with
Respuesta
  • • Time allocating
  • • Time slicing
  • • Time sliding
  • • Time scheduling

Pregunta 44

Pregunta
44. A system clock generates interrupts at a rate of approximately one every 0.2 seconds. At each clock interrupt, the OS regained control and could assign the processor to another user. This technique is known as
Respuesta
  • • Time allocating
  • • Time slicing
  • • Time sliding
  • • Time scheduling

Pregunta 45

Pregunta
45. Batch operating systems were used (years)
Respuesta
  • • In early 1960s
  • • From the mid-1950 to early 1960s
  • • From the late 1940s to the mid-1950s

Pregunta 46

Pregunta
46. Job control language was used
Respuesta
  • • From the mid-1950s to early 1960s
  • • From late 1940s to the mid-1950s
  • • used to provide instructions to the monitor,In early 1960s

Pregunta 47

Pregunta
47. Serial processing was used
Respuesta
  • • From the mid-1950s to early 1960s
  • • From late 1940s to the mid-1950s
  • • In early 1960s

Pregunta 48

Pregunta
48. The central idea in this system was the use of a piece of software known as the monitor
Respuesta
  • • Serial processing
  • • Multiprogrammed batch system
  • • Simple batch system
  • • Time-sharing-system

Pregunta 49

Pregunta
49. The concept of a batch operating system was developed to
Respuesta
  • • Minimize processor utilization
  • • Support interactive mode
  • • Minimize response time
  • • Maximize processor utilization (To improve utilization)

Pregunta 50

Pregunta
50. The concept of modes of operation (user mode, system mode) was introduced with
Respuesta
  • • Serial processing
  • • Multiprogrammed batch system
  • • Simple batch system
  • • Time-sharing-system

Pregunta 51

Pregunta
51. The principal objective of the time-sharing system is to
Respuesta
  • • Maximize processor utilization
  • • Maximize response time
  • • Minimize processor utilization
  • • Minimize response time

Pregunta 52

Pregunta
52. The processor was often idle waiting for the I/O instruction to conclude. To overcome the problem the following approach was introduced: when one job needs to wait for I/O, the processor can switch to the other job. This was a
Respuesta
  • • Time-sharing-system
  • • Serial processing
  • • Simple batch system
  • • Multiprogramming or multitasking batch system

Pregunta 53

Pregunta
53. The programmer interacted directly with the computer hardware with
Respuesta
  • • Multiprogrammed batch systems
  • • Time-sharing-systems
  • • Serial processing
  • • Simple batch systems

Pregunta 54

Pregunta
54. The serial processing presented two main problems:
Respuesta
  • • scheduling
  • • multiprogramming
  • • time slicing
  • • using a monitor
  • • setup time

Pregunta 55

Pregunta
55. There were no OS with
Respuesta
  • • Multiprogrammed batch systems
  • • Time-sharing-systems
  • • Serial processing
  • • Simple batch systems

Pregunta 56

Pregunta
56. This system handles multiple interactive jobs
Respuesta
  • • Multiprogrammed batch system
  • • Serial processing
  • • Simple batch system
  • • Time-sharing-system

Pregunta 57

Pregunta
57. This system was developed by General Motors for the use on an IBM 701
Respuesta
  • • Time-sharing system
  • • Multiprogrammed batch system
  • • Serial processing
  • • Simple Batch Systems or GM-NAA I/O

Pregunta 58

Pregunta
58 This type of system was developed at MIT by a group known as Project MAC for the IBM 709 in 1961
Respuesta
  • • Time-sharing-system
  • • Simple batch system
  • • Multiprogrammed batch system
  • • Serial processing

Pregunta 59

Pregunta
59. Lost signals, duplicate signals received'. This is
Respuesta
  • • Failed mutual exclusion
  • • Deadlocks
  • • Nondeterminate program operation
  • • Improper synchronization

Pregunta 60

Pregunta
60. 'Two or more programs hung up waiting for each other'. This is
Respuesta
  • • Improper synchronization
  • • Nondeterminate program operation
  • • Deadlocks
  • • Falled mutual exclusions

Pregunta 61

Pregunta
61. 'When programs share memory and their execution is interleaved by the processor, they may interfere with each other by overwriting common memory areas in unpredictable ways. The results of a particular program depend on the activities of other programs in a shared system'. This is
Respuesta
  • • Improper syncronization
  • • Nondeterminate program operation
  • • Deadlocks
  • • Falled mutual exclusions

Pregunta 62

Pregunta
. Choose the storage management responsibility for "Many application programs require means for storing information for extended periods of time, after the computer has been powered down"
Respuesta
  • • Support of modular programming
  • • Process isolation
  • • Automatic allocation and management
  • • Protection and access control
  • • Long-term storage

Pregunta 63

Pregunta
. Choose the storage management responsibility for "Programmers should be able to define program modules, and to create, destroy, and alter the size of modules dynamically"
Respuesta
  • • Support of modular programming
  • • Process isolation
  • • Automatic allocation and management
  • • Long-term storage
  • • Protection and access control

Pregunta 64

Pregunta
Choose the storage management responsibility for "The OS can achieve efficiency by assigning memory to jobs only as needed"
Respuesta
  • • Support of modular programming
  • • Process isolation
  • • Automatic allocation and management
  • • Long-term storage
  • • Protection and access control

Pregunta 65

Pregunta
. Choose the storage management responsibility for "The OS must allow portions of memory to be accessible in various ways by various users"
Respuesta
  • • Support of modular programming
  • • Process isolation
  • • Automatic allocation and management
  • • Long-term storage
  • • Protection and access control

Pregunta 66

Pregunta
Choose the storage management responsibility for "The OS must prevent independent processes from interfering with each other's memory, both data and instructions"
Respuesta
  • • Support of modular programming
  • • Process isolation
  • • Automatic allocation and management
  • • Long-term storage
  • • Protection and access control

Pregunta 67

Pregunta
In operating system security and protection, authenticity:
Respuesta
  • • Concerned with protecting the system against interruption
  • • Protection of data from unauthorized modification
  • • Assuring that users cannot read data for which access is unauthorized
  • • Concerned with the proper verification of the identity of users and the validity of messages or data

Pregunta 68

Pregunta
In operating system security and protection, availability is:
Respuesta
  • • Concerned with the proper verification of the identity of users and the validity of messages or data
  • • Assuring that users cannot read data for which access is unauthorized
  • • Protection of data from unauthorized modification
  • o Concerned with protecting the system against interruption

Pregunta 69

Pregunta
In operating system security and protection, confidentiality is:
Respuesta
  • • Concerned with the proper verification of the identity of users and the validity of messages or data
  • • Assuring that users cannot read data for which access is unauthorized
  • • Protection of data from unauthorized modification
  • • Concerned with protecting the system against interruption

Pregunta 70

Pregunta
In operating system security and protection, data integrity is:
Respuesta
  • • Concerned with protecting the system against interruption
  • • Protection of data from unauthorized modification
  • • Assuring that users cannot read data for which access is unauthorized
  • • Concerned with the proper verification of the identity of users and the validity of messages or data

Pregunta 71

Pregunta
Short-term scheduler, or dispatcher, picks a process. Each process in the queue is given some time in turn. This strategy is called:
Respuesta
  • • Merry-go-round technique
  • • Carousel technique
  • • Prioritizing
  • • Round-robin technique

Pregunta 72

Pregunta
The base register
Respuesta
  • • Contains the staring address of the region of memory occupied by the process
  • • Points to the next instruction in that process to be executed
  • • Contains the index into the process list of the process currently controlling the processor
  • • Defines the size of the region of (in bytes or words)

Pregunta 73

Pregunta
. The limit register
Respuesta
  • • Contains the staring address of the region of memory occupied by the process
  • • Points to the next instruction in that process to be executed
  • • Contains the index into the process list of the process currently controlling the processor
  • • Defines the size of the region of (in bytes or words)

Pregunta 74

Pregunta
The process index register
Respuesta
  • • Contains the index into a process list of the process currently controlling the processor
  • • Define the region in memory occupied by the process
  • • Points to the next instruction in that process to be executed
  • • Contains the starting address of the region of memory occupied by the process

Pregunta 75

Pregunta
This term was first used by the designers of Multics in the 1960s
Respuesta
  • • Time sharing
  • • Multiprogramming
  • • Process
  • • Monitor

Pregunta 76

Pregunta
'Ease of evolution of an OS' corresponds to the following objective:
Respuesta
  • • Ability to evolve
  • • Convenience
  • • Efficiency

Pregunta 77

Pregunta
'The OS as a resource manager' corresponds to the following objective:
Respuesta
  • • Ability to evolve
  • • Convenience
  • • Efficiency

Pregunta 78

Pregunta
'The OS as a User/Computer interface' corresponds to the following objective:
Respuesta
  • • Ability to evolve
  • • Convenience
  • • Efficiency

Pregunta 79

Pregunta
. An application programs is developed by the
Respuesta
  • • Hardware
  • • Operating system
  • • End user
  • • Application programmer

Pregunta 80

Pregunta
The end user views a computer system in terms of
Respuesta
  • • a set of applications
  • • a set of system programs
  • • utilities
  • • a set of machine instructions

Pregunta 81

Pregunta
The hardware and software used in providing applications to a user can be viewed in a:
Respuesta
  • • leveled fashion
  • • sandwich fashion
  • • layered fashion
  • • classified fashion

Pregunta 82

Pregunta
This contains the most frequently used functions in the OS:
Respuesta
  • • Centre
  • • Base
  • • Root
  • • Kernel (или nucleus)

Pregunta 83

Pregunta
Utilities are
Respuesta
  • • Processor registers
  • • Opcodes
  • • System programs
  • • Application program

Pregunta 84

Pregunta
Process is
Respuesta
  • • A program in execution
  • • A job in secondary memory
  • • Contents of main memory
  • • Program in High level language kept on disk
  • • contents of main memory
  • • a unit of activity characterized by execution of a sequence of instructions, a current state, and an associated set
  • • a job in secondary memory

Pregunta 85

Pregunta
A task in a blocked state
Respuesta
  • • is waiting for same temporarily unavailable resources
  • • must still be placed in the run queues
  • • is executable
  • • is running

Pregunta 86

Pregunta
The systems which allows only one process execution at a time, are called
Respuesta
  • ● unicasting systems
  • ● uniprogramming systems
  • ● uniprocessing systems
  • ● unitasking systems

Pregunta 87

Pregunta
The state of a process is defined by:
Respuesta
  • • the current activity of the process
  • • the activity to next be executed by the process
  • • the final activity of the process
  • • the activity is just executed by the process

Pregunta 88

Pregunta
Which of the following is not the state of a process?
Respuesta
  • • ready
  • • Old
  • • terminated
  • • running
  • • new

Pregunta 89

Pregunta
. Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the:
Respuesta
  • • Suspended state
  • • Terminated state
  • • Running state
  • • Ready state

Pregunta 90

Pregunta
. Which of the following state transitions is not possible?
Respuesta
  • • ready to running
  • • blocked to ready
  • • running to blocked
  • • blocked to running

Pregunta 91

Pregunta
If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
Respuesta
  • • synchronous exclusion
  • • mutual exclusion
  • • asynchronous exclusion
  • • critical exclusion

Pregunta 92

Pregunta
. Interprocess communication:
Respuesta
  • • allows processes to communicate and synchronize their actions without using the same address space
  • • allows processes to communicate and synchronize their actions when using the same address space
  • • allows the processes to only synchronize their actions without communication
  • • none of the above

Pregunta 93

Pregunta
A sequence of instructions, in a computer language, to get the desired result, is known as?
Respuesta
  • • program
  • • process
  • • instruction
  • • algorithm

Pregunta 94

Pregunta
In operating system, each process has its own:
Respuesta
  • • program code
  • • all of the mentioned
  • • set of data
  • • address space and global variables

Pregunta 95

Pregunta
For each process OS creates and manages:
Respuesta
  • • Thread control block
  • • Program
  • • Program code
  • • Process control block

Pregunta 96

Pregunta
The available vector defines
Respuesta
  • • total amount of each resource NOT allocated to any process
  • • total amount of each resource allocated to all processes
  • • total amount of each resource in the system
  • • total amount of resources required for all processes

Pregunta 97

Pregunta
The resource vector define
Respuesta
  • • total amount of each resource NOT allocated to any process
  • • total amount of each resource allocated to all processes
  • • total amount of each resource in the system
  • • total amount of resources required for all processes

Pregunta 98

Pregunta
This matrix defines the current allocation to process i of the resource j
Respuesta
  • • Claim matrix
  • • Request matrix
  • • Resource matrix
  • • Allocation matrix

Pregunta 99

Pregunta
This matrix defines the amount of resources of type j requested by process i
Respuesta
  • • Claim matrix
  • • Request matrix
  • • Resource matrix
  • • Allocation matrix

Pregunta 100

Pregunta
This matrix defines requirements of processes i for the resources j
Respuesta
  • • Claim matrix
  • • Request matrix
  • • Resource matrix
  • • Allocation matrix

Pregunta 101

Pregunta
The banker's algorithm is referred to as
Respuesta
  • • resource allocation refusal
  • • loan allocation denial
  • • resource allocation denial
  • • denial of service

Pregunta 102

Pregunta
'Hold and wait' condition for deadlock is defined as
Respuesta
  • • Each process holds resource needed by next process in chain
  • • Process holds a resource while awaiting for other resource
  • • No resource can be forcibly removed from process holding it
  • • Only one process may use a resource at a time

Pregunta 103

Pregunta
'Circular wait' condition for deadlock is defined as
Respuesta
  • • Each process holds resource needed by next process in chain
  • • Process holds a resource while awaiting for other resource
  • • No resource can be forcibly removed from process holding it
  • • Only one process may use a resource at a time

Pregunta 104

Pregunta
'No preemption' condition for deadlock is defined as
Respuesta
  • • Each process holds resource needed by next process in chain
  • • Process holds a resource while awaiting for other resource
  • • No resource can be forcibly removed from process holding it
  • • Only one process may use a resource at a time

Pregunta 105

Pregunta
'Mutual exclusion' condition for deadlock is defined as
Respuesta
  • • Each process holds resource needed by next process in chain
  • • Process holds a resource while awaiting for other resource
  • • No resource can be forcibly removed from process holding it
  • • Only one process may use a resource at a time

Pregunta 106

Pregunta
What is NOT an example of consumable resource?
Respuesta
  • • Messages
  • • Main memory
  • • Signals
  • • Information in I\O buffers

Pregunta 107

Pregunta
What is NOT an example of reusable resource?
Respuesta
  • • i/o channels
  • • interrupt
  • • processors
  • • semaphores

Pregunta 108

Pregunta
This resource can be created and destroyed
Respuesta
  • • finite resource
  • • restartable resource
  • • consumable resource
  • • resumable resource

Pregunta 109

Pregunta
This resource can be safely used by only one process at a time and is not depleted by that use
Respuesta
  • • refreshing resource
  • • reusable resource
  • • replenishing resource
  • • refurbished resource

Pregunta 110

Pregunta
Deadlock inevitable region can be referred to as a
Respuesta
  • ● false region
  • ● final region
  • ● fatal region
  • ● fun region

Pregunta 111

Pregunta
This illustrates the progress of two processes competing for two resources
Respuesta
  • ● joint progress diagram
  • ● joint regress diagram
  • ● joint ingres diagram
  • ● joint process diagram

Pregunta 112

Pregunta
When each process in the set is blocked awaiting for resource seized by another blocked process
Respuesta
  • ● it is a mortallock
  • ● it is a softlock
  • ● it is a deadlock
  • ● it is a deadend

Pregunta 113

Pregunta
Which of the following statements is false:
Respuesta
  • • the system must stop everything while it performs the compaction
  • • compaction is also known as garbage collection
  • • the technique of storage compaction involves moving all occupied areas of storage to one end or other of main storage
  • • compaction does not involve relocation of programs

Pregunta 114

Pregunta
. Memory is:
Respuesta
  • • is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
  • • is a device that performs a sequence of operations specified by instructions in memory
  • • is a sequence of the instructions
  • • is the device where information stored

Pregunta 115

Pregunta
Processor is:
Respuesta
  • • is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
  • • is a device that performs a sequence of operations specified by instructions in memory
  • • is a sequence of the instructions
  • • is the device where information stored

Pregunta 116

Pregunta
Program is:
Respuesta
  • • is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
  • • is a device that performs a sequence of operations specified by instructions in memory
  • • is a sequence of the instructions
  • • is the device where information stored

Pregunta 117

Pregunta
The memory allocation scheme subject to "external" fragmentation is?
Respuesta
  • • pure demand paging
  • • multiple contiguous fixed partitionings
  • • swapping
  • • segmentation
Mostrar resumen completo Ocultar resumen completo

¿Quieres crear tus propios Tests gratis con GoConqr? Más información.

Similar

Aparato DIGESTIVO
JL Cadenas
flash cards vocabulario inglés
Michael Villalobos
TEJIDO EPITELIAL
Juan José Fierro
AGUA
MARLENY OREJUELA CORTES
ANIMALES INVERTEBRADOS
Patssy Juliana Cabrera Rachen
LA METODOLOGÍA DE LAS BASES DE DATOS
Fernando Tapia
FGM-4. REALES ORDENANZAS PARA LAS FUERZAS ARMADAS (II)
antonio del valle
Prehistoria de la humanidad.
Katherine Forero
CÁLCULO MENTAL - De Mapa Mental
JL Cadenas
Ficha de libro.
Luis Alberto Barthe Lastra
HINDUISMOA 6B_ANE
Ane Núñez Escudero
Explorar la Librería