Operating System Practice Test 7

Question 1 of 20

1. In the tree structured directories _____________

the tree has the root directory

the tree has the leaf directory

the tree has the stem directory

all of the mentioned

Question 1 of 20

Question 2 of 20

2. When using counters to implement LRU, we replace the page with the ____________

none of the mentioned

smallest time value

largest time value

greatest size

Question 2 of 20

Question 3 of 20

3. Which file is a sequence of bytes organized into blocks understandable by the system's linker?

text file

source file

object file

executable file

Question 3 of 20

Question 4 of 20

4. When a user job starts in a two level directory system, or a user logs in _____________

the system's master file directory is not searched

the master file directory is indexed by user name or account number, and each entry points to the UFD for that user

all of the mentioned

the users user file directory is searched

Question 4 of 20

Question 5 of 20

5. System wide table in UNIX contains process independent information such as ____________

location of file on disk

all of the mentioned

file size

access dates

Question 5 of 20

Question 6 of 20

6. Consider the following page reference string.
1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6
For Optimal page replacement algorithms with 3 frames, the number of page faults is?

Question 6 of 20

Question 7 of 20

7. What will happen in the two level directory structure?

none of the mentioned

the system doesn't its own master file directory

each user has his/her own user file directory

all of the mentioned

Question 7 of 20

Question 8 of 20

8. The directory can be viewed as a _________ that translates file names into their directory entries.

swap space

symbol table

cache

partition

Question 8 of 20

Question 9 of 20

9. A relative block number is an index relative to ____________

none of the mentioned

the beginning of the file

the last written position in file

the end of the file

Question 9 of 20

Question 10 of 20

10. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed, then the page replacement algorithm used is ____________

None of the mentioned

LFU

LRU

FIFO

Question 10 of 20

Question 11 of 20

11. If the memory access time is denoted by 'ma' and 'p' is the probability of a page fault (0 <= p <= 1). Then the effective access time for a demand paged memory is ____________

ma + page fault time

p x ma + (1-p) x page fault time

(1-p) x ma + p x page fault time

none of the mentioned

Question 11 of 20

Question 12 of 20

12. Increasing the RAM of a computer typically improves performance because ____________

Fewer page faults occur

Virtual memory increases

None of the mentioned

Larger RAMs are faster

Question 12 of 20

Question 13 of 20

13. What is raw disk?

disk having file system

disk lacking logical file system

disk without file system

empty disk

Question 13 of 20

Question 14 of 20

14. Consider the following page reference string.
1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6
For LRU page replacement algorithm with 4 frames, the number of page faults is?

Question 14 of 20

Question 15 of 20

15. Applying the LRU page replacement to the following reference string.
1 2 4 5 2 1 2 4
The main memory can accommodate 3 pages and it already has pages 1 and 2. Page 1 came in before page 2.
How many page faults will occur?

Question 15 of 20

Question 16 of 20

16. Data cannot be written to secondary storage unless written within a ______