Kopieren und bearbeiten

OS FULL 117

Beschreibung

YUNIKOVA
Axakalov Beksultan
Quiz von Axakalov Beksultan, aktualisiert more than 1 year ago
Axakalov Beksultan
Erstellt von Axakalov Beksultan vor mehr als 6 Jahre
41
1
0

Zusammenfassung der Ressource

Frage 1

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

Frage 2

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

Frage 3

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

Frage 4

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

Frage 5

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

Frage 6

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

Frage 7

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

Frage 8

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

Frage 9

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

Frage 10

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

Frage 11

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

Frage 12

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

Frage 13

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

Frage 14

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

Frage 15

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

Frage 16

Frage
16. The fetched instruction is loaded into the
Antworten
  • • PC
  • • Memory
  • • Accumulator
  • • IR

Frage 17

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

Frage 18

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

Frage 19

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

Frage 20

Frage
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:
Antworten
  • • Short I/O wait
  • • Long I/O wait
  • • Slow I/O wait
  • • Fast I/O wait

Frage 21

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

Frage 22

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

Frage 23

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

Frage 24

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

Frage 25

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

Frage 26

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

Frage 27

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

Frage 28

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

Frage 29

Frage
29. This type of memory is nonvolatile:
Antworten
  • • Main memory
  • • Cache
  • • Secondary memory
  • • Register

Frage 30

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

Frage 31

Frage
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:
Antworten
  • • locality of reference
  • • cache size
  • • write policy
  • • replacement algorithm

Frage 32

Frage
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:
Antworten
  • • replacement algorithm
  • • locality of reference
  • • mapping function
  • • write policy

Frage 33

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

Frage 34

Frage
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.
Antworten
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Frage 35

Frage
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.
Antworten
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Frage 36

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

Frage 37

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

Frage 38

Frage
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.
Antworten
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Frage 39

Frage
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.
Antworten
  • • Programmed I/O
  • • Interrupt-driven I/O
  • • Manual memory access
  • • Direct memory access (DMA)

Frage 40

Frage
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.
Antworten
  • • Direct memory access (DMA)
  • • Manual memory access
  • • Programmed I/O
  • • Interrupt-driven I/O

Frage 41

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

Frage 42

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

Frage 43

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

Frage 44

Frage
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
Antworten
  • • Time allocating
  • • Time slicing
  • • Time sliding
  • • Time scheduling

Frage 45

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

Frage 46

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

Frage 47

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

Frage 48

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

Frage 49

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

Frage 50

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

Frage 51

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

Frage 52

Frage
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
Antworten
  • • Time-sharing-system
  • • Serial processing
  • • Simple batch system
  • • Multiprogramming or multitasking batch system

Frage 53

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

Frage 54

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

Frage 55

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

Frage 56

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

Frage 57

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

Frage 58

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

Frage 59

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

Frage 60

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

Frage 61

Frage
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
Antworten
  • • Improper syncronization
  • • Nondeterminate program operation
  • • Deadlocks
  • • Falled mutual exclusions

Frage 62

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

Frage 63

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

Frage 64

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

Frage 65

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

Frage 66

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

Frage 67

Frage
In operating system security and protection, authenticity:
Antworten
  • • 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

Frage 68

Frage
In operating system security and protection, availability is:
Antworten
  • • 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

Frage 69

Frage
In operating system security and protection, confidentiality is:
Antworten
  • • 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

Frage 70

Frage
In operating system security and protection, data integrity is:
Antworten
  • • 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

Frage 71

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

Frage 72

Frage
The base register
Antworten
  • • 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)

Frage 73

Frage
. The limit register
Antworten
  • • 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)

Frage 74

Frage
The process index register
Antworten
  • • 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

Frage 75

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

Frage 76

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

Frage 77

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

Frage 78

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

Frage 79

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

Frage 80

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

Frage 81

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

Frage 82

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

Frage 83

Frage
Utilities are
Antworten
  • • Processor registers
  • • Opcodes
  • • System programs
  • • Application program

Frage 84

Frage
Process is
Antworten
  • • 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

Frage 85

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

Frage 86

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

Frage 87

Frage
The state of a process is defined by:
Antworten
  • • 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

Frage 88

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

Frage 89

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

Frage 90

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

Frage 91

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

Frage 92

Frage
. Interprocess communication:
Antworten
  • • 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

Frage 93

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

Frage 94

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

Frage 95

Frage
For each process OS creates and manages:
Antworten
  • • Thread control block
  • • Program
  • • Program code
  • • Process control block

Frage 96

Frage
The available vector defines
Antworten
  • • 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

Frage 97

Frage
The resource vector define
Antworten
  • • 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

Frage 98

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

Frage 99

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

Frage 100

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

Frage 101

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

Frage 102

Frage
'Hold and wait' condition for deadlock is defined as
Antworten
  • • 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

Frage 103

Frage
'Circular wait' condition for deadlock is defined as
Antworten
  • • 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

Frage 104

Frage
'No preemption' condition for deadlock is defined as
Antworten
  • • 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

Frage 105

Frage
'Mutual exclusion' condition for deadlock is defined as
Antworten
  • • 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

Frage 106

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

Frage 107

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

Frage 108

Frage
This resource can be created and destroyed
Antworten
  • • finite resource
  • • restartable resource
  • • consumable resource
  • • resumable resource

Frage 109

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

Frage 110

Frage
Deadlock inevitable region can be referred to as a
Antworten
  • ● false region
  • ● final region
  • ● fatal region
  • ● fun region

Frage 111

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

Frage 112

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

Frage 113

Frage
Which of the following statements is false:
Antworten
  • • 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

Frage 114

Frage
. Memory is:
Antworten
  • • 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

Frage 115

Frage
Processor is:
Antworten
  • • 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

Frage 116

Frage
Program is:
Antworten
  • • 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

Frage 117

Frage
The memory allocation scheme subject to "external" fragmentation is?
Antworten
  • • pure demand paging
  • • multiple contiguous fixed partitionings
  • • swapping
  • • segmentation
Zusammenfassung anzeigen Zusammenfassung ausblenden

Möchten Sie mit GoConqr kostenlos Ihre eigenen Quiz erstellen? eigenen Mehr erfahren.

ähnlicher Inhalt

Modul 2C FernUni Hagen Entwicklungspsychologische Grundlagen und Vorstellung, Spiel & Phantasie
Anni T-Pünktchen
Wahrscheinlichkeit
barbara91
BM13
Veronika T Rollinger
Φαρμακολογία Ι Σεπτεμβρίου 2017
Christina Martzi
PR 2017/18
Carmen Mai
Vetie Pharma 2017
Tropsi B
Steop Meko Fragen
Adrienne Tschaudi
Vetie - Innere Medizin 2012
Fioras Hu
Vetie Para 2010,2011,2013 (1/2)
Ali Na
Vetie Repro Bilderspaß
Tropsi B
Vetie Berufsrecht 2021
Mascha K.
Bibliothek durchsuchen