Test
OS FULL 117
Crea una cuenta gratis para terminar este test
Guarda tu progreso y consulta tu resultado final.
¿Ya tienes cuenta? Inicia sesión
Preguntas del test (117)
11. What is not a main structural element of a computer system?
- AMain Memory
- BI/O Modules
- CSystem Bus
- DOperating system
- EProcessor
22. Which of the following registers are used by the processor to exchange data with memory?
- AI/OAR and I/OBR
- BProgram status word
- CPC and IR
- DMAR and MBR
3
3. Which of the following registers are used by the processor to exchange data with input/output module?
- AI/OAR and I/OBR
- BMAR and MBR
- CProgram status word
- DPC and IR
4
4. Which of the following element of a computer system controls the operation of the computer and performs its data processing functions?- AProcessor
- BSystem bus
- CI/O modules
- DMain memory
55. Which of the following element of a computer system stores data and programs?
- AI/O modules
- BProcessor
- CSystem bus
- DMain memory
66. Which of the following provides for communication among elements of a computer system?
- A• I/O modules
- B• Processor
- C• System bus
- D• Main memory
77. Which of the following element of a computer system moves data between the computer and its external environment?
- A• Main memory
- B• Processor
- C• I/O modules
- D• System bus
88. The processor contains a single data register, called
- A• PSW
- B• AC
- C• IR
- D• PC
99. This register specifies a particular input/output device
- A• I/OBR
- B• Memory buffer register
- C• I/OAR
- D• Memory address register
1010. This register is used for the exchange of data between an I/O module and the processor
- A• I/OBR
- B• Memory buffer register
- C• I/OAR
- D• Memory address register
11
11. This register contains the data to be written into memory or which receives the data read from memory- A• I/OBR
- B• memory address register
- C• memory buffer register
- D• I/OAR
1212. This register specifies the location in memory for the next read or write
- A• I/OBR
- B• Memory buffer register
- C• I/OAR
- D• Memory address register
1314. Which register contains the address of the next instruction to be fetched?
- A• process counter
- B• program counter
- C• execution register
- D• instruction register
1414. Which register contains the instruction most recently fetched?
- A• process counter
- B• instruction register
- C• execution register
- D• program counter
1515. Which register contains condition codes set by the processor hardware as the result of operations?
- A• Stack pointer
- B• Program status word
- C• Accumulator
- D• Program counter
16
16. The fetched instruction is loaded into the- A• PC
- B• Memory
- C• Accumulator
- D• IR
1717. At the beginning of each instruction cycle, the processor fetches an instruction from the memory. The address of the instruction is held in
- A• PC
- B• MAR
- C• MBR
- D• IR
1818. The processor is executing ‘Load AC from memory’ instruction. Choose the correct micro-instructions:
- A• PC -> MAR
M -> MBR
MBR -> AC
IR -> MAR
M -> MBR
MBR -> AC - B• PC -> MBR
M -> MAR
MAR -> IR
IR -> MAR
M -> MBR
MBR -> AC - CPC -> MAR
M -> MBR
MBR -> IR
IR -> MAR
M -> MBR
MBR -> AC - D• PC -> MAR
M -> MBR
MBR -> IR
IR -> MBR
M -> MAR
MAR -> AC
- A• PC -> MAR
1919. When an I/O device completes an I/O operation, the device issues an interrupt signal to the processor and then:
- A• The processor stops execution of the current instruction without finishing it and responds to the interrupt
- B• The processor loads the program counter with the entry location of the interrupt-handling routine
- C• The processor saves information needed to resume the current program at the point if interrupt
- D• The processor finishes execution of the current instruction before responding to the interrupt
2020. 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:
- A• Short I/O wait
- B• Long I/O wait
- C• Slow I/O wait
- D• Fast I/O wait
2121. When the time required for the I/O operation will take much more time than executing a sequence of user instructions, it is:
- A• Short I/O wait
- B• Fast I/O wait
- C• Long I/O wait
- D• Slow I/O wait
2222. If there no interrupts, after each write operation, the processor must:
- A• Pause and remain idle until the I/O operation
- B• Save the PSW and PC onto control stack
- C• Finish execution of current instruction
- D• Load new PC value
2323. Complete the relationship concerning the memory systems: faster access time –
- A• smaller cost per bit
- B• faster access speed
- C• greater cost per bit
- D• lower capacity
2424. Complete the relationship concerning the memory systems: greater capacity –
- A• smaller cost per bit
- B• faster access speed
- C• greater cost per bit
- D• lower capacity
2525. Complete the relationship concerning the memory systems: greater capacity –
- A• faster access speed
- B• greater cost per bit
- C• slower access time
- D• lower capacity
2626. The smaller, more expensive, faster memory is:
- A• Register
- B• Main memory
- C• Cache
- D• Disk drive
2727. If the accessed word is found in the faster memory, that is defined as a:
- A• evrika
- B• hit
- C• win
- D• bingo
2828. If the accessed word is not found in the faster memory, that is defined as a:
- A• Loss
- B• zero
- C• miss
- D• ricochet
2929. This type of memory is nonvolatile:
- A• Main memory
- B• Cache
- C• Secondary memory
- D• Register
3030. When a processor attempts to read a byte or word of memory, it firstly checks the:
- A• Main memory
- B• Secondary memory
- C• Cache
- D• Register
3131. 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:
- A• locality of reference
- B• cache size
- C• write policy
- D• replacement algorithm
3232. 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:
- A• replacement algorithm
- B• locality of reference
- C• mapping function
- D• write policy
3333. Which of the following is not a technique possible for I/O operations?
- A• Programmed I/O
- B• Interrupt-driven I/O
- C• Manual memory access
- D• Direct memory access (DMA)
3434. 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.
- A• Programmed I/O
- B• Interrupt-driven I/O
- C• Manual memory access
- D• Direct memory access (DMA)
3535. 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.
- A• Programmed I/O
- B• Interrupt-driven I/O
- C• Manual memory access
- D• Direct memory access (DMA)
3636. The main disadvantage of this technique: it is a time-consuming process that keeps the processor busy needlessly.
- A• Programmed I/O
- B• Interrupt-driven I/O
- C• Manual memory access
- D• Direct memory access (DMA)
3737. The processor issues an I/O command to a module and then go on to some other useful work.
- A• Programmed I/O
- B• Interrupt-driven I/O
- C• Manual memory access
- D• Direct memory access (DMA)
3838. 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.
- A• Programmed I/O
- B• Interrupt-driven I/O
- C• Manual memory access
- D• Direct memory access (DMA)
3939. 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.
- A• Programmed I/O
- B• Interrupt-driven I/O
- C• Manual memory access
- D• Direct memory access (DMA)
4040. 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.
- A• Direct memory access (DMA)
- B• Manual memory access
- C• Programmed I/O
- D• Interrupt-driven I/O
4141. The module transfers the entire block of data to/from memory without going through the processor.
- A• Direct memory access (DMA)
- B• Manual memory access
- C• Programmed I/O
- D• Interrupt-driven I/O
4242. The main disadvantage of this technique: there is a competition for bus usage.
- A• Direct memory access (DMA)
- B• Manual memory access
- C• Programmed I/O
- D• Interrupt-driven I/O
4343. A hardcopy sign-up sheet was used to reserve computer time with
- A• Time allocating
- B• Time slicing
- C• Time sliding
- D• Time scheduling
4444. 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
- A• Time allocating
- B• Time slicing
- C• Time sliding
- D• Time scheduling
4545. Batch operating systems were used (years)
- A• In early 1960s
- B• From the mid-1950 to early 1960s
- C• From the late 1940s to the mid-1950s
4646. Job control language was used
- A• From the mid-1950s to early 1960s
- B• From late 1940s to the mid-1950s
- C• used to provide instructions to the monitor,In early 1960s
4747. Serial processing was used
- A• From the mid-1950s to early 1960s
- B• From late 1940s to the mid-1950s
- C• In early 1960s
4848. The central idea in this system was the use of a piece of software known as the monitor
- A• Serial processing
- B• Multiprogrammed batch system
- C• Simple batch system
- D• Time-sharing-system
4949. The concept of a batch operating system was developed to
- A• Minimize processor utilization
- B• Support interactive mode
- C• Minimize response time
- D• Maximize processor utilization (To improve utilization)
5050. The concept of modes of operation (user mode, system mode) was introduced with
- A• Serial processing
- B• Multiprogrammed batch system
- C• Simple batch system
- D• Time-sharing-system
5151. The principal objective of the time-sharing system is to
- A• Maximize processor utilization
- B• Maximize response time
- C• Minimize processor utilization
- D• Minimize response time
5252. 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
- A• Time-sharing-system
- B• Serial processing
- C• Simple batch system
- D• Multiprogramming or multitasking batch system
5353. The programmer interacted directly with the computer hardware with
- A• Multiprogrammed batch systems
- B• Time-sharing-systems
- C• Serial processing
- D• Simple batch systems
5454. The serial processing presented two main problems:
- A• scheduling
- B• multiprogramming
- C• time slicing
- D• using a monitor
- E• setup time
5555. There were no OS with
- A• Multiprogrammed batch systems
- B• Time-sharing-systems
- C• Serial processing
- D• Simple batch systems
5656. This system handles multiple interactive jobs
- A• Multiprogrammed batch system
- B• Serial processing
- C• Simple batch system
- D• Time-sharing-system
5757. This system was developed by General Motors for the use on an IBM 701
- A• Time-sharing system
- B• Multiprogrammed batch system
- C• Serial processing
- D• Simple Batch Systems or GM-NAA I/O
5858 This type of system was developed at MIT by a group known as Project MAC for the IBM 709 in 1961
- A• Time-sharing-system
- B• Simple batch system
- C• Multiprogrammed batch system
- D• Serial processing
5959. Lost signals, duplicate signals received'. This is
- A• Failed mutual exclusion
- B• Deadlocks
- C• Nondeterminate program operation
- D• Improper synchronization
6060. 'Two or more programs hung up waiting for each other'. This is
- A• Improper synchronization
- B• Nondeterminate program operation
- C• Deadlocks
- D• Falled mutual exclusions
6161. '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
- A• Improper syncronization
- B• Nondeterminate program operation
- C• Deadlocks
- D• Falled mutual exclusions
62. 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"
- A• Support of modular programming
- B• Process isolation
- C• Automatic allocation and management
- D• Protection and access control
- E• Long-term storage
63. 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"
- A• Support of modular programming
- B• Process isolation
- C• Automatic allocation and management
- D• Long-term storage
- E• Protection and access control
64Choose the storage management responsibility for "The OS can achieve efficiency by assigning memory to jobs only as needed"
- A• Support of modular programming
- B• Process isolation
- C• Automatic allocation and management
- D• Long-term storage
- E• Protection and access control
65. Choose the storage management responsibility for "The OS must allow portions of memory to be accessible in various ways by various users"
- A• Support of modular programming
- B• Process isolation
- C• Automatic allocation and management
- D• Long-term storage
- E• Protection and access control
66Choose the storage management responsibility for "The OS must prevent independent processes from interfering with each other's memory, both data and instructions"
- A• Support of modular programming
- B• Process isolation
- C• Automatic allocation and management
- D• Long-term storage
- E• Protection and access control
67In operating system security and protection, authenticity:
- A• Concerned with protecting the system against interruption
- B• Protection of data from unauthorized modification
- C• Assuring that users cannot read data for which access is unauthorized
- D• Concerned with the proper verification of the identity of users and the validity of messages or data
68In operating system security and protection, availability is:
- A• Concerned with the proper verification of the identity of users and the validity of messages or data
- B• Assuring that users cannot read data for which access is unauthorized
- C• Protection of data from unauthorized modification
- Do Concerned with protecting the system against interruption
69In operating system security and protection, confidentiality is:
- A• Concerned with the proper verification of the identity of users and the validity of messages or data
- B• Assuring that users cannot read data for which access is unauthorized
- C• Protection of data from unauthorized modification
- D• Concerned with protecting the system against interruption
70In operating system security and protection, data integrity is:
- A• Concerned with protecting the system against interruption
- B• Protection of data from unauthorized modification
- C• Assuring that users cannot read data for which access is unauthorized
- D• Concerned with the proper verification of the identity of users and the validity of messages or data
71Short-term scheduler, or dispatcher, picks a process. Each process in the queue is given some time in turn. This strategy is called:
- A• Merry-go-round technique
- B• Carousel technique
- C• Prioritizing
- D• Round-robin technique
72The base register
- A• Contains the staring address of the region of memory occupied by the process
- B• Points to the next instruction in that process to be executed
- C• Contains the index into the process list of the process currently controlling the processor
- D• Defines the size of the region of (in bytes or words)
73. The limit register
- A• Contains the staring address of the region of memory occupied by the process
- B• Points to the next instruction in that process to be executed
- C• Contains the index into the process list of the process currently controlling the processor
- D• Defines the size of the region of (in bytes or words)
74The process index register
- A• Contains the index into a process list of the process currently controlling the processor
- B• Define the region in memory occupied by the process
- C• Points to the next instruction in that process to be executed
- D• Contains the starting address of the region of memory occupied by the process
75 This term was first used by the designers of Multics in the 1960s
- A• Time sharing
- B• Multiprogramming
- C• Process
- D• Monitor
76'Ease of evolution of an OS' corresponds to the following objective:
- A• Ability to evolve
- B• Convenience
- C• Efficiency
77'The OS as a resource manager' corresponds to the following objective:
- A• Ability to evolve
- B• Convenience
- C• Efficiency
78'The OS as a User/Computer interface' corresponds to the following objective:
- A• Ability to evolve
- B• Convenience
- C• Efficiency
79. An application programs is developed by the
- A• Hardware
- B• Operating system
- C• End user
- D• Application programmer
80 The end user views a computer system in terms of
- A• a set of applications
- B• a set of system programs
- C• utilities
- D• a set of machine instructions
81The hardware and software used in providing applications to a user can be viewed in a:
- A• leveled fashion
- B• sandwich fashion
- C• layered fashion
- D• classified fashion
82This contains the most frequently used functions in the OS:
- A• Centre
- B• Base
- C• Root
- D• Kernel (или nucleus)
83Utilities are
- A• Processor registers
- B• Opcodes
- C• System programs
- D• Application program
84Process is
- A• A program in execution
- B• A job in secondary memory
- C• Contents of main memory
- D• Program in High level language kept on disk
- E• contents of main memory
- F• a unit of activity characterized by execution of a sequence of instructions, a current state, and an associated set
- G• a job in secondary memory
85A task in a blocked state
- A• is waiting for same temporarily unavailable resources
- B• must still be placed in the run queues
- C• is executable
- D• is running
86The systems which allows only one process execution at a time, are called
- A● unicasting systems
- B● uniprogramming systems
- C● uniprocessing systems
- D● unitasking systems
87The state of a process is defined by:
- A• the current activity of the process
- B• the activity to next be executed by the process
- C• the final activity of the process
- D• the activity is just executed by the process
88Which of the following is not the state of a process?
- A• ready
- B• Old
- C• terminated
- D• running
- E• new
89. Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is completed, it goes to the:
- A• Suspended state
- B• Terminated state
- C• Running state
- D• Ready state
90. Which of the following state transitions is not possible?
- A• ready to running
- B• blocked to ready
- C• running to blocked
- D• blocked to running
91If a process is executing in its critical section, then no other processes can be executing in their critical section. This condition is called
- A• synchronous exclusion
- B• mutual exclusion
- C• asynchronous exclusion
- D• critical exclusion
92. Interprocess communication:
- A• allows processes to communicate and synchronize their actions without using the same address space
- B• allows processes to communicate and synchronize their actions when using the same address space
- C• allows the processes to only synchronize their actions without communication
- D• none of the above
93A sequence of instructions, in a computer language, to get the desired result, is known as?
- A• program
- B• process
- C• instruction
- D• algorithm
94In operating system, each process has its own:
- A• program code
- B• all of the mentioned
- C• set of data
- D• address space and global variables
95For each process OS creates and manages:
- A• Thread control block
- B• Program
- C• Program code
- D• Process control block
96The available vector defines
- A• total amount of each resource NOT allocated to any process
- B• total amount of each resource allocated to all processes
- C• total amount of each resource in the system
- D• total amount of resources required for all processes
97The resource vector define
- A• total amount of each resource NOT allocated to any process
- B• total amount of each resource allocated to all processes
- C• total amount of each resource in the system
- D• total amount of resources required for all processes
98This matrix defines the current allocation to process i of the resource j
- A• Claim matrix
- B• Request matrix
- C• Resource matrix
- D• Allocation matrix
99This matrix defines the amount of resources of type j requested by process i
- A• Claim matrix
- B• Request matrix
- C• Resource matrix
- D• Allocation matrix
100This matrix defines requirements of processes i for the resources j
- A• Claim matrix
- B• Request matrix
- C• Resource matrix
- D• Allocation matrix
101The banker's algorithm is referred to as
- A• resource allocation refusal
- B• loan allocation denial
- C• resource allocation denial
- D• denial of service
102'Hold and wait' condition for deadlock is defined as
- A• Each process holds resource needed by next process in chain
- B• Process holds a resource while awaiting for other resource
- C• No resource can be forcibly removed from process holding it
- D• Only one process may use a resource at a time
103'Circular wait' condition for deadlock is defined as
- A• Each process holds resource needed by next process in chain
- B• Process holds a resource while awaiting for other resource
- C• No resource can be forcibly removed from process holding it
- D• Only one process may use a resource at a time
104 'No preemption' condition for deadlock is defined as
- A• Each process holds resource needed by next process in chain
- B• Process holds a resource while awaiting for other resource
- C• No resource can be forcibly removed from process holding it
- D• Only one process may use a resource at a time
105'Mutual exclusion' condition for deadlock is defined as
- A• Each process holds resource needed by next process in chain
- B• Process holds a resource while awaiting for other resource
- C• No resource can be forcibly removed from process holding it
- D• Only one process may use a resource at a time
106What is NOT an example of consumable resource?
- A• Messages
- B• Main memory
- C• Signals
- D• Information in I\O buffers
107What is NOT an example of reusable resource?
- A• i/o channels
- B• interrupt
- C• processors
- D• semaphores
108This resource can be created and destroyed
- A• finite resource
- B• restartable resource
- C• consumable resource
- D• resumable resource
109This resource can be safely used by only one process at a time and is not depleted by that use
- A• refreshing resource
- B• reusable resource
- C• replenishing resource
- D• refurbished resource
110Deadlock inevitable region can be referred to as a
- A● false region
- B● final region
- C● fatal region
- D● fun region
111This illustrates the progress of two processes competing for two resources
- A● joint progress diagram
- B● joint regress diagram
- C● joint ingres diagram
- D● joint process diagram
112When each process in the set is blocked awaiting for resource seized by another blocked process
- A● it is a mortallock
- B● it is a softlock
- C● it is a deadlock
- D● it is a deadend
113Which of the following statements is false:
- A• the system must stop everything while it performs the compaction
- B• compaction is also known as garbage collection
- C• the technique of storage compaction involves moving all occupied areas of storage to one end or other of main storage
- D• compaction does not involve relocation of programs
114. Memory is:
- A• is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
- B• is a device that performs a sequence of operations specified by instructions in memory
- C• is a sequence of the instructions
- D• is the device where information stored
115Processor is:
- A• is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
- B• is a device that performs a sequence of operations specified by instructions in memory
- C• is a sequence of the instructions
- D• is the device where information stored
116Program is:
- A• is typically characterized by interactive processing and time-slicing of the CPU’s time to allow quick response to each user
- B• is a device that performs a sequence of operations specified by instructions in memory
- C• is a sequence of the instructions
- D• is the device where information stored
117The memory allocation scheme subject to "external" fragmentation is?
- A• pure demand paging
- B• multiple contiguous fixed partitionings
- C• swapping
- D• segmentation
Información
- Descripción
- YUNIKOVA
- Autor
- Axakalov Beksultan
- Idioma
- English
- Visitas
- 56
- Valoración
- Aún sin valoraciones Valora este test