Csse 1502
Quiz by , created more than 1 year ago

Operating Systems (OS) Quiz on OS_test_for_screens, created by Csse 1502 on 18/12/2017.

46
1
0
Csse 1502
Created by Csse 1502 over 6 years ago
Close

OS_test_for_screens

Question 1 of 21

1

The segment of code in which the process may change common variables, update tables, write into files is known as?

Select one of the following:

  • critical section

  • mutual exclusion

  • non-critical section

  • program

Explanation

Question 2 of 21

1

A problem encountered in multitasking when a process is perpetually denied necessary resources is called:

Select one of the following:

  • starvation

  • inversion

  • aging

  • deadlock

Explanation

Question 3 of 21

1

What is the reusable resource:

Select one of the following:

  • that can be used by one process at a time and is not depleted by that use

  • that can be used by more than one process at a time

  • none of the above

  • that can be shared between various threads

Explanation

Question 4 of 21

1

A minimum_______ variables is/are required to be shared between processes to solve the critical section problem?

Select one of the following:

  • three

  • two

  • one

  • four

Explanation

Question 5 of 21

1

For non-sharable resources like a printer, mutual exclusion:

Select one of the following:

  • must exist

  • none of the above

  • may exist

  • must not exist

Explanation

Question 6 of 21

1

Part of a program where the shared memory is accessed and which should be executed invisibly, is called:

Select one of the following:

  • critical section

  • semaphores

  • directory

  • mutual exclusion

Explanation

Question 7 of 21

1

Memory partitioning algorithm that uses binary tree as a data structure is called: (не точно, примеры есть только с ним, если не правильно поменяйте)

Select one of the following:

  • First-fit algorithm

  • Buddy system

  • Next-fit algorithm

  • Best-fit algorithm

Explanation

Question 8 of 21

1

Current allocation of resources to processes where there is no sequence that does not result in deadlock is called: (не точно)

Select one of the following:

  • Alternative state

  • Unsafe state

  • Ambiguous state

  • Safe state

Explanation

Question 9 of 21

1

The context of a process in the PCB of a process DOESN’T contain:

Select one of the following:

  • memory- management information

  • the value of the CPU registers

  • the process state

  • context switch time

Explanation

Question 10 of 21

1

The link between two processes P and Q to send and receive messages is called:

Select one of the following:

  • communication link

  • message-passing link

  • synchronization link

  • all of the above

Explanation

Question 11 of 21

1

When free memory is split into many unconnected pieces we call it: (не точно)

Select one of the following:

  • compaction

  • external fragmentation

  • memory distribution

  • internal fragmentation

Explanation

Question 12 of 21

1

To avoid the race condition, the number of processes that may be simultaneously inside their critical section is:

Select one of the following:

  • 0

  • 1

  • 10

  • 2

Explanation

Question 13 of 21

1

What thread approach does Java runtime environment use?

Select one of the following:

  • Multiple processes, multiple threads per process

  • One process, one thread

  • One process, multiple threads

  • multiple processes, single thread per process

Explanation

Question 14 of 21

1

The primary distinction between the short-term scheduler and the long-term scheduler is:

Select one of the following:

  • The frequency of their execution

  • None of the above

  • The length of their queues

  • The type of processes they schedule

Explanation

Question 15 of 21

1

Paging:

Select one of the following:

  • allows multiple programs to reside in separate areas of core at the time

  • consists of those addresses that may be generated by a processor execution of a computation

  • is a method of allocating process time

  • is a method of memory allocation by which the program is subdivided into equal portions, or pages and core is subdivided into equal portions or blocks

Explanation

Question 16 of 21

1

Which of the replacement algorithms selects for replacement that page for which the time to the next reference is the longest?

Select one of the following:

  • optimal

  • Clock

  • LRU

  • FIFO

Explanation

Question 17 of 21

1

Which of the replacement algorithms treats the page frames allocated to a process as a circular buffer?

Select one of the following:

  • optimal

  • Clock

  • LRU

  • FIFO

Explanation

Question 18 of 21

1

Virtual memory takes advantage of: (не точно)

Select one of the following:

  • Fast CPU

  • Large secondary memory

  • Scheduling

  • Modular programming

Explanation

Question 19 of 21

1

The size of virtual storage is limited by…

Select one of the following:

  • the number of processors in a system

  • the actual number of main storage locations

  • the addressing scheme of the computer system and by the amount of secondary memory

  • the amount of main memory and secondary memory

Explanation

Question 20 of 21

1

What is trashing?

Select one of the following:

  • Guessing, based on recent history, which pieces are least likely to be used in the near future

  • Assumption that only a few pieces of a process will be needed over a short period of time

  • Condition when the system spends most of its time swapping pieces rather than executing instructions

  • Saving time by swapping unused pieces of process out of the memory

Explanation

Question 21 of 21

1

What is the real address?

Select one of the following:

  • physical address in cache memory

  • virtual address in main memory

  • virtual address in secondary memory

  • physical address in main memory

Explanation

Previous
Check answer
Next