Copiar e Editar

OS FULL 117

Descrição

YUNIKOVA
Axakalov Beksultan
Quiz por Axakalov Beksultan, atualizado more than 1 year ago
Axakalov Beksultan
Criado por Axakalov Beksultan mais de 6 anos atrás
41
1
0

Resumo de Recurso

Questão 1

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

Questão 2

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

Questão 3

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

Questão 4

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

Questão 5

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

Questão 6

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

Questão 7

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

Questão 8

Questão
8. The processor contains a single data register, called
Responda
  • • PSW
  • • AC
  • • IR
  • • PC

Questão 9

Questão
9. This register specifies a particular input/output device
Responda
  • • I/OBR
  • • Memory buffer register
  • • I/OAR
  • • Memory address register

Questão 10

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

Questão 11

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

Questão 12

Questão
12. This register specifies the location in memory for the next read or write
Responda
  • • I/OBR
  • • Memory buffer register
  • • I/OAR
  • • Memory address register

Questão 13

Questão
14. Which register contains the address of the next instruction to be fetched?
Responda
  • • process counter
  • • program counter
  • • execution register
  • • instruction register

Questão 14

Questão
14. Which register contains the instruction most recently fetched?
Responda
  • • process counter
  • • instruction register
  • • execution register
  • • program counter

Questão 15

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

Questão 16

Questão
16. The fetched instruction is loaded into the
Responda
  • • PC
  • • Memory
  • • Accumulator
  • • IR

Questão 17

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

Questão 18

Questão
18. The processor is executing ‘Load AC from memory’ instruction. Choose the correct micro-instructions:
Responda
  • • 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

Questão 19

Questão
19. When an I/O device completes an I/O operation, the device issues an interrupt signal to the processor and then:
Responda
  • • 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

Questão 20

Questão
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:
Responda
  • • Short I/O wait
  • • Long I/O wait
  • • Slow I/O wait
  • • Fast I/O wait

Questão 21

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

Questão 22

Questão
22. If there no interrupts, after each write operation, the processor must:
Responda
  • • 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

Questão 23

Questão
23. Complete the relationship concerning the memory systems: faster access time –
Responda
  • • smaller cost per bit
  • • faster access speed
  • • greater cost per bit
  • • lower capacity

Questão 24

Questão
24. Complete the relationship concerning the memory systems: greater capacity –
Responda
  • • smaller cost per bit
  • • faster access speed
  • • greater cost per bit
  • • lower capacity

Questão 25

Questão
25. Complete the relationship concerning the memory systems: greater capacity –
Responda
  • • faster access speed
  • • greater cost per bit
  • • slower access time
  • • lower capacity

Questão 26

Questão
26. The smaller, more expensive, faster memory is:
Responda
  • • Register
  • • Main memory
  • • Cache
  • • Disk drive

Questão 27

Questão
27. If the accessed word is found in the faster memory, that is defined as a:
Responda
  • • evrika
  • • hit
  • • win
  • • bingo

Questão 28

Questão
28. If the accessed word is not found in the faster memory, that is defined as a:
Responda
  • • Loss
  • • zero
  • • miss
  • • ricochet

Questão 29

Questão
29. This type of memory is nonvolatile:
Responda
  • • Main memory
  • • Cache
  • • Secondary memory
  • • Register

Questão 30

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

Questão 31

Questão
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:
Responda
  • • locality of reference
  • • cache size
  • • write policy
  • • replacement algorithm

Questão 32

Questão
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:
Responda
  • • replacement algorithm
  • • locality of reference
  • • mapping function
  • • write policy

Questão 33

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

Questão 34

Questão
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.
Responda
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Questão 35

Questão
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.
Responda
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Questão 36

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

Questão 37

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

Questão 38

Questão
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.
Responda
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Questão 39

Questão
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.
Responda
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Questão 40

Questão
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.
Responda
  • • Direct memory access (DMA)
  • • Manual memory access
  • • Programmed I/O
  • • Interrupt-driven I/O

Questão 41

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

Questão 42

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

Questão 43

Questão
43. A hardcopy sign-up sheet was used to reserve computer time with
Responda
  • • Time allocating
  • • Time slicing
  • • Time sliding
  • • Time scheduling

Questão 44

Questão
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
Responda
  • • Time allocating
  • • Time slicing
  • • Time sliding
  • • Time scheduling

Questão 45

Questão
45. Batch operating systems were used (years)
Responda
  • • In early 1960s
  • • From the mid-1950 to early 1960s
  • • From the late 1940s to the mid-1950s

Questão 46

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

Questão 47

Questão
47. Serial processing was used
Responda
  • • From the mid-1950s to early 1960s
  • • From late 1940s to the mid-1950s
  • • In early 1960s

Questão 48

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

Questão 49

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

Questão 50

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

Questão 51

Questão
51. The principal objective of the time-sharing system is to
Responda
  • • Maximize processor utilization
  • • Maximize response time
  • • Minimize processor utilization
  • • Minimize response time

Questão 52

Questão
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
Responda
  • • Time-sharing-system
  • • Serial processing
  • • Simple batch system
  • • Multiprogramming or multitasking batch system

Questão 53

Questão
53. The programmer interacted directly with the computer hardware with
Responda
  • • Multiprogrammed batch systems
  • • Time-sharing-systems
  • • Serial processing
  • • Simple batch systems

Questão 54

Questão
54. The serial processing presented two main problems:
Responda
  • • scheduling
  • • multiprogramming
  • • time slicing
  • • using a monitor
  • • setup time

Questão 55

Questão
55. There were no OS with
Responda
  • • Multiprogrammed batch systems
  • • Time-sharing-systems
  • • Serial processing
  • • Simple batch systems

Questão 56

Questão
56. This system handles multiple interactive jobs
Responda
  • • Multiprogrammed batch system
  • • Serial processing
  • • Simple batch system
  • • Time-sharing-system

Questão 57

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

Questão 58

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

Questão 59

Questão
59. Lost signals, duplicate signals received'. This is
Responda
  • • Failed mutual exclusion
  • • Deadlocks
  • • Nondeterminate program operation
  • • Improper synchronization

Questão 60

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

Questão 61

Questão
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
Responda
  • • Improper syncronization
  • • Nondeterminate program operation
  • • Deadlocks
  • • Falled mutual exclusions

Questão 62

Questão
. 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"
Responda
  • • Support of modular programming
  • • Process isolation
  • • Automatic allocation and management
  • • Protection and access control
  • • Long-term storage

Questão 63

Questão
. 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"
Responda
  • • Support of modular programming
  • • Process isolation
  • • Automatic allocation and management
  • • Long-term storage
  • • Protection and access control

Questão 64

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

Questão 65

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

Questão 66

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

Questão 67

Questão
In operating system security and protection, authenticity:
Responda
  • • 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

Questão 68

Questão
In operating system security and protection, availability is:
Responda
  • • 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

Questão 69

Questão
In operating system security and protection, confidentiality is:
Responda
  • • 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

Questão 70

Questão
In operating system security and protection, data integrity is:
Responda
  • • 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

Questão 71

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

Questão 72

Questão
The base register
Responda
  • • 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)

Questão 73

Questão
. The limit register
Responda
  • • 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)

Questão 74

Questão
The process index register
Responda
  • • 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

Questão 75

Questão
This term was first used by the designers of Multics in the 1960s
Responda
  • • Time sharing
  • • Multiprogramming
  • • Process
  • • Monitor

Questão 76

Questão
'Ease of evolution of an OS' corresponds to the following objective:
Responda
  • • Ability to evolve
  • • Convenience
  • • Efficiency

Questão 77

Questão
'The OS as a resource manager' corresponds to the following objective:
Responda
  • • Ability to evolve
  • • Convenience
  • • Efficiency

Questão 78

Questão
'The OS as a User/Computer interface' corresponds to the following objective:
Responda
  • • Ability to evolve
  • • Convenience
  • • Efficiency

Questão 79

Questão
. An application programs is developed by the
Responda
  • • Hardware
  • • Operating system
  • • End user
  • • Application programmer

Questão 80

Questão
The end user views a computer system in terms of
Responda
  • • a set of applications
  • • a set of system programs
  • • utilities
  • • a set of machine instructions

Questão 81

Questão
The hardware and software used in providing applications to a user can be viewed in a:
Responda
  • • leveled fashion
  • • sandwich fashion
  • • layered fashion
  • • classified fashion

Questão 82

Questão
This contains the most frequently used functions in the OS:
Responda
  • • Centre
  • • Base
  • • Root
  • • Kernel (или nucleus)

Questão 83

Questão
Utilities are
Responda
  • • Processor registers
  • • Opcodes
  • • System programs
  • • Application program

Questão 84

Questão
Process is
Responda
  • • 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

Questão 85

Questão
A task in a blocked state
Responda
  • • is waiting for same temporarily unavailable resources
  • • must still be placed in the run queues
  • • is executable
  • • is running

Questão 86

Questão
The systems which allows only one process execution at a time, are called
Responda
  • ● unicasting systems
  • ● uniprogramming systems
  • ● uniprocessing systems
  • ● unitasking systems

Questão 87

Questão
The state of a process is defined by:
Responda
  • • 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

Questão 88

Questão
Which of the following is not the state of a process?
Responda
  • • ready
  • • Old
  • • terminated
  • • running
  • • new

Questão 89

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

Questão 90

Questão
. Which of the following state transitions is not possible?
Responda
  • • ready to running
  • • blocked to ready
  • • running to blocked
  • • blocked to running

Questão 91

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

Questão 92

Questão
. Interprocess communication:
Responda
  • • 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

Questão 93

Questão
A sequence of instructions, in a computer language, to get the desired result, is known as?
Responda
  • • program
  • • process
  • • instruction
  • • algorithm

Questão 94

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

Questão 95

Questão
For each process OS creates and manages:
Responda
  • • Thread control block
  • • Program
  • • Program code
  • • Process control block

Questão 96

Questão
The available vector defines
Responda
  • • 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

Questão 97

Questão
The resource vector define
Responda
  • • 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

Questão 98

Questão
This matrix defines the current allocation to process i of the resource j
Responda
  • • Claim matrix
  • • Request matrix
  • • Resource matrix
  • • Allocation matrix

Questão 99

Questão
This matrix defines the amount of resources of type j requested by process i
Responda
  • • Claim matrix
  • • Request matrix
  • • Resource matrix
  • • Allocation matrix

Questão 100

Questão
This matrix defines requirements of processes i for the resources j
Responda
  • • Claim matrix
  • • Request matrix
  • • Resource matrix
  • • Allocation matrix

Questão 101

Questão
The banker's algorithm is referred to as
Responda
  • • resource allocation refusal
  • • loan allocation denial
  • • resource allocation denial
  • • denial of service

Questão 102

Questão
'Hold and wait' condition for deadlock is defined as
Responda
  • • 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

Questão 103

Questão
'Circular wait' condition for deadlock is defined as
Responda
  • • 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

Questão 104

Questão
'No preemption' condition for deadlock is defined as
Responda
  • • 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

Questão 105

Questão
'Mutual exclusion' condition for deadlock is defined as
Responda
  • • 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

Questão 106

Questão
What is NOT an example of consumable resource?
Responda
  • • Messages
  • • Main memory
  • • Signals
  • • Information in I\O buffers

Questão 107

Questão
What is NOT an example of reusable resource?
Responda
  • • i/o channels
  • • interrupt
  • • processors
  • • semaphores

Questão 108

Questão
This resource can be created and destroyed
Responda
  • • finite resource
  • • restartable resource
  • • consumable resource
  • • resumable resource

Questão 109

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

Questão 110

Questão
Deadlock inevitable region can be referred to as a
Responda
  • ● false region
  • ● final region
  • ● fatal region
  • ● fun region

Questão 111

Questão
This illustrates the progress of two processes competing for two resources
Responda
  • ● joint progress diagram
  • ● joint regress diagram
  • ● joint ingres diagram
  • ● joint process diagram

Questão 112

Questão
When each process in the set is blocked awaiting for resource seized by another blocked process
Responda
  • ● it is a mortallock
  • ● it is a softlock
  • ● it is a deadlock
  • ● it is a deadend

Questão 113

Questão
Which of the following statements is false:
Responda
  • • 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

Questão 114

Questão
. Memory is:
Responda
  • • 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

Questão 115

Questão
Processor is:
Responda
  • • 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

Questão 116

Questão
Program is:
Responda
  • • 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

Questão 117

Questão
The memory allocation scheme subject to "external" fragmentation is?
Responda
  • • pure demand paging
  • • multiple contiguous fixed partitionings
  • • swapping
  • • segmentation

Quer criar seus próprios Quizzes gratuitos com a GoConqr? Saiba mais.

Semelhante

Princípios Direito Penal
Carlos Moradore
FATORES NEUROPSICOLÓGICOS (anexo neuropsicologia)
Lorena S. Sousa
Expressões em inglês #2
Eduardo .
DIREITO ADMINISTRATIVO LEI 10.261/68
Joelma Silva
Orações Subordinadas
vini_camargo0
Música
Philosophus Rex
Inquérito policial
Marcelo Llaberia
O que estudar para Exame da Ordem
GoConqr suporte .
HISTÓRIA DO BRASIL COLONIAL (1ª PARTE)
Lucas Villar
Tipos: Reprodução
Andrea Barreto M. Da Poça
Simulado CTFL- Agile Tester
Larissa Trindade
Explore a Biblioteca