SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

Department Of Computer Science and Engineering

18CSC205J_OPERATING SYSTEMS: CT3
(Total : 100 Marks) Time : 90 minutes

Part A (30*1=30) : Max Time : 30 minutes

1)During execution of a program if program references a page that is not available in main memory, it is
called

A. Demand Paging
B. Frame Fault
C. page fault
D. processor fault

2) __________has ability to mark an entry invalid through a valid–invalid bit or a special value of
protection bits

A.Secondary memory
B.Swap Device
C.Page Table
D.None of the above

3) Below are the advantages of _________________

i. Large virtual memory.

ii. More efficient use of memory.
iii. There is no limit on degree of multiprogramming.

A.Demand Paging
B.Virtual Memory
C.Page Fault
D.None of the above

4) Consider the following sequence of addresses : 123,215,600,1234,76,96. If page size is 100, then the
reference string is?
A. 1,2,6,12
B. 12,21,60,123,7,9
C. 1,2,6,12,0,0
D. 0,2,6,12,0,0

5)Where does the Swap Space exists?

A. Primary Memory
B. secondary memory
C. virtual memory
D. CPU
6)If a process is spending more time paging than executing, then it is called
A.Thrashing
B.Page Fault
C.Processor Fault
D.Frame Fault

7) Effective access time is directly proportional to ____________

a) page-fault rate
b) hit ratio
c) memory access time
d) none of the mentioned

8)In page replacement the working set model is based on assumption of__________
a) modularity
b) locality
c) globalization
d) random access

9) Consider a disk queue with requests for I/O to blocks on cylinders.

98 183 37 122 14 124 65 67. Considering FCFS (first cum first served) scheduling, the total number of
head movements is, if the disk head is initially at 53 is?
a) 600
b) 620
c) 630
d) 640

10) Consider a disk queue with requests for I/O to blocks on cylinders.
98 183 37 122 14 124 65 67.Considering SSTF (shortest seek time first) scheduling, the total number of
head movements is, if the disk head is initially at 53 is?
a) 224
b) 236
c) 245
d) 240

11) In the ______ algorithm, the disk arm goes as far as the final request in each direction, then reverses
direction immediately without going to the end of the disk.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK

12) Total head movements in FCFS is ___________ ; SSTF is ____

A.632,232
B.234,286
C.331,234
D.232,632
13) The two main aspects of Virtual memory is _____________
A. Frame allocation and Page Replacement
B.Page Fault and Thrashing
C.Thrashing and Frame allocation
D.None of the above

14) The algorithm replaces the page which will not be referred for so long in future. This is ____
A. Optimal Page Replacement algorithm
B.LRU
C.FIFO
D.None of the above

15) The time taken to locate the disk arm to a specified track where the data is to be read or write.
A.Seek Time
B.Transfer Time
C.Disk Access Time
D.None of the Above

16)Local network that uses fibre channel to connect several data storage devices
A.Storage Area Network
B.Network attached Storage
C.Both A and B
D.None of the above

17) For systems that place a heavy load on the disk which algorithm can be selected?
A.SSTF
B.SCAN
C.C-SCAN
D.Both B and C

18) ________ is series or collection of bits where each bit corresponds to a disk block.
A.Bit Map
B.Bit Block
C.Worksheet
D.None of the above

19) __________allows both parent and child processes to initially share the same pages in memory
A.fork
B. Copy-on-Write
C.Demand Paging
D.None of the above
20)__________ works based on Locality of Reference
A. Working – set Model
B.Page Fault Frequency Model
C.Thrashing
D.None of the above

21) Dividing a disk into sectors that the disk controller can read and write is ________
A. Low-level formatting
B. Logical formatting
C. Partition
D.None of the above

22) In file attributes, only information stored in a human-readable form is __________

A.Identifier
B.Name
C. Location
D. Protection.

23) __________allows a user to transfer files without having an account on the remote system.
A. Anonymous access
B.Read access
C.Write access
D.None of the above

24) _________represent an important criterion for evaluating any file system that supports file sharing
A. Consistency semantics
B.File Sharing
C.Remote file systems
D. None of the above

25) Disk Access Time is calculated by_______

A. Seek time + Rotational latency + Transfer time
B. Seek time +Rotational latency
C. Seek time + Transfer time
D.None of the above

26. ___________is used to handle bad blocks

A.Boot strap loader
B.Sector sparing
C.Raw disk
D.None of the above
27) Bitmap or Bit vector can take two values 0 and 1: ____ indicates a free block and ____ indicates that
the block is allocated
A.0,1
B.1,0

28)_______ provide a common interface to multiple different file system types

A. Virtual File Systems
B.Directory
C.Hashtable
D.None of the above

29)Consider a main memory with five page frames and the following sequence of page references: 3, 8,
2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. which one of the following is true with respect to page replacement
policies First-In-First-out (FIFO) and Least Recently Used (LRU)?

A. Both incur the same number of page faults

B. FIFO incurs 2 more page faults than LRU
C. LRU incurs 2 more page faults than FIFO
D. FIFO incurs 1 more page faults than LRU

30)____________ stores the address of the free blocks in the first free block
A.Linked List
B.Grouping
C.Counting
D.None of the above

Part B (35*2=70) : Max Time : 60 minutes

1)Consider a system having 64 frames and there are 4 process with the following virtual memory sizes:
V(1)=16, V(2)=128,V(3)=64,V(4)=48. The number of frames for each process using Equal allocation and
Proportional allocation

A.16,256
B.12,124
C.256,24
D.12,16

2) Consider a disk queue with request for input/output to block on cylinders 98, 183, 37, 122, 14, 124,
65, 67in that order. Assume that disk head is initially positioned at cylinder 53 and moving towards
cylinder number 0. The total number of head movements using Shortest Seek Time First (SSTF) and
SCAN algorithms are respectively

A.236 and 252 cylinders

B.640 and 236 cylinders
C.235 and 640 cylinders
D.None of the above
3) On a disk with 1000 cylinders (0 to 999) find the number of tracks, the disk arm must move to satisfy
all the requests in the disk queue. Assume the last request service was at track 345 and the head is
moving toward track 0. The queue in FIFO order contains requests for the following tracks :123, 874,
692, 475, 105, 376(Assume SCAN algorithm)

A.2013
B.1219
C.1967
D.1507

4) Assuming that the disk head is located initially at 32, find the number of disk moves required with
FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67 :

A.310
B.324
C.320
D.321

5) Which of the following statements is not true about disk-arm scheduling algorithms ?
A.SSTF (shortest seek time first) algorithm increases performance of FCFS.
B.The number of requests for disk service are not influenced by file allocation method.
C.Caching the directories and index blocks in main memory can also help in reducing disk arm
movements.
D.SCAN and C-SCAN algorithms are less likely to have a starvation problem.

6) If the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk
queue of I/O blocks requests are 98, 37, 14, 124, 65, 67.

A.239
B.310
C.321
D.325

7.Consider the following page reference string: 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. calculate the total
number of page faults when allocated page blocks are 3

A.9
B.19
C.10
D.11
8. Consider a reference string: 4, 7, 6, 1, 7, 6, 1, 2, 7, 2. the number of frames in the memory is 3. the
number of page faults respective to Optimal Page Replacement Algorithm & c. LRU Page Replacement
Algorithm is

A.5,6
B.6,5
C.7,5
D.5,7

9. Consider the following disk request sequence for a disk with 100 tracks. 98, 137, 122, 183, 14, 133, 65,
78.Head pointer starting at 54 and moving in left direction. The number of head movements in cylinders
using SCAN & C-SCAN scheduling.

A.237,387
B.387,237
C.257,357
D.None of the above

10. The given instance of disk blocks as below. (where green blocks are allocated) can be represented by
a bitmap as

A. 0000111000000110
B. 0000111000000010
C. 0001111000000110
D. 0000111001011110

11. A CPU generates 32-bit virtual address. The page size is 4 KB. The processor has a TLB which can hold
a total of 128 page table entries and is a 4 way set associative. The minimum size of TLB tag is

A.11 bits
B.13 Bits
C.15 bits
D.20 bits
12.Match the following and select the appropriate answer

A.i)-d ; ii)-c;iii)-b;iv)a
B.i)-d ; ii)-c;iii)-a;iv)b
C.i)-b ; ii)-c;iii)-a;iv)d
D.i)-b ; ii)-a;iii)-c;iv)d

13) In Unix File Permission, -rwxr-xr-- represents that the owner has__________-rwxr-xr-- represents
that the group has_____________

A. read (r), write (w) and execute (x) permission; read (r) and execute (x) permission, but no write
permission
B. read (r) and execute (x) permission, but no write permission; read (r), write (w) and execute (x)
permission
C. read (r) only permission; read (r), write (w) and execute (x) permission
D.None of the above

14) VFS in Linux is based upon four key object types. Match appropriately.

A.i)-c ; ii)-d;iii)-b;iv)a
B.i)-d ; ii)-c;iii)-a;iv)b
C.i)-b ; ii)-c;iii)-a;iv)d
D.i)-b ; ii)-a;iii)-c;iv)d
15) What does the below graph indicate? What does it infer?

A. FIFO Page replacement Algorithm; if number of page frames increases page fault also increases
B. Belady’s Anomaly; if number of page frames increases page fault also increases
C. FIFO Page replacement Algorithm; if number of page frames decreases page fault increases
D. Belady’s Anomaly ; if number of page frames decreases page fault increases

16. Order of request is- (82,170,43,140,24,16,190) and current position of Read/Write head is : 50
total seek time using FCFS and SSTF is

A.642; 208
B.208;642
C.332;208
D.332;642

17)Which of the below statement about Acyclic graph directory is correct

i) is a graph with no cycle and allows to share subdirectories and files
ii) Searching is easy due to different-different paths
iii) when two programmers are working on a joint project and they need to access files. In this
situation acyclic graph can be used.
iv) In acyclic graph directory cycles are allowed within a directory structure where multiple
directories can be derived from more than one parent directory.

A.i,ii,ii are correct

B.ii,iii,iv are correct
C.i and iv are correct
D.All are correct

18)The first entry in the stack frame contains ______________ and second entry contains
______________
A.The previous value of the frame base; the return address of the function
B. the return address of the function; The previous value of the frame base
C. The previous value of the frame base; the next value of the frame base
D. the next value of the frame base; The previous value of the frame base
19) Match the following commands

A.i)-b ; ii)-c;iii)-a
B.i)-c ; ii)-b;iii)-a
C.i)-a ; ii)-b;iii)-c
D.i)-a ; ii)-c;iii)-b

20) Identify the directory structure from the below

A. I.Single level Directory Structure;II.Two-level directory;III.Acyclic;IV.General graph directory

B. I.Acyclic;II.Two-level directory;III.Single level Directory Structure;IV.General graph directory
C. I.Acyclic;II.General graph directory;III.Single level Directory Structure;IV.Two-level directory
D. I.General graph directory;II.Acyclic;III.Single level Directory Structure;IV.Two-level directory

21) Consider a typical disk that rotates at 15000 rotations per minute (RPM) and has a transfer rate of 50
× 106 bytes/sec. If the average seek time of the disk is twice the average rotational delay and the
controller’s transfer time is 10 times the disk transfer time, the average time (in milliseconds) to read or
write a 512 byte sector of the disk is _____________

A.6.1
B.7.1
C.5.1
D.8.1
22) Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 45,
20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the R/W head is on track 50. The
additional distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF)
algorithm is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves
towards 100 when it starts execution) is _________ tracks

A.8
B.9
C.10
D.11

23) Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at cylinder
100, and there is a queue of disk access requests for cylinders 30, 85, 90, 100, 105, 110, 135 and 145. If
Shortest-Seek Time First (SSTF) is being used for scheduling the disk access, the request for cylinder 90 is
serviced after servicing ____________ number of requests
A.1
B.2
C.3
D.4

24) A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed
number of frames to a process. Consider the following statements:

P: Increasing the number of page frames allocated to a

process sometimes increases the page fault rate.
Q: Some programs do not exhibit locality of reference.

Which one of the following is TRUE?

A.Both P and Q are true, and Q is the reason for P
B.Both P and Q are true, but Q is not the reason for P
C. P is false, but Q is true
D. Both P and Q are false

25) A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin
with. The system first accesses 100 distinct pages in some order and then accesses the same 100 pages
but now in the reverse order. How many page faults will occur?
A.192
B.195
C.186
D.196
26) A process has been allocated 3 page frames. Assume that none of the pages of the process are
available in the memory initially. The process makes the following sequence of page references
(reference string): 1, 2, 1, 3, 7, 4, 5, 6, 3, 1.If optimal page replacement policy is used, how many page
faults occur for the above reference string?
A.10
B.9
C.7
D.8

27) Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1.On a demand paged virtual
memory system running on a computer system that main memory size of 3 pages frames which are
initially empty. Let FIFO and OPTIMAL denote the number of page faults under the corresponding page
replacements policy. Then

A. OPTIMAL < FIFO < LRU

B. OPTIMAL < LRU < FIFO
C. OPTIMAL = LRU
D. OPTIMAL = FIFO

28) Consider a disk queue with I/O requests on the following cylinders in their arriving order:
6, 10, 12, 54, 97, 73, 128, 15, 44, 110, 34, 45 .The disk head is assumed to be at cylinder 23 and moving
in the direction of decreasing number of cylinders. Total number of cylinders in the disk is 150. The disk
head movement using SCAN-scheduling algorithm is:
A.172
B.173
C.151
D.228

29) Consider a virtual page reference string 1, 2, 3, 2, 4, 2, 5, 2, 3, 4. Suppose LRU page replacement
algorithm is implemented with 3 page frames in main memory. Then the number of page faults
are_________.

A.7
B.5
C.9
D.10

30. 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

Which of the following options, gives the correct number of page faults related to LRU, FIFO, and
optimal page replacement algorithms respectively, assuming 05 page frames and all frames are initially
empty ?
A. 7, 10, 8
B. 10, 14, 8
C. 7, 10, 7
D. 8, 10, 7
31.Identify the statements that are true for “Global replacement”
i)Process selects a replacement frame from the set of all frames; one process can take a frame
from another
ii)process execution time can vary greatly
iii)allows a high-priority process to increase its frame allocation at the expense of a low-priority process
iv)the number of frames allocated to a process does not change

A.i,ii,iii
B.ii,iii,iv
C.i,iii,iv
D.All statements are true

32) NFS is standard __________ & CIFS is standard _____________

A. Windows protocol; UNIX client-server file sharing protocol
B. UNIX client-server file sharing protocol; Windows protocol
C. Windows protocol; Windows protocol
D. UNIX client-server file sharing protocol; UNIX client-server file sharing protocol

33) The action of moving a process out from main memory to secondary memory is called ________&
the action of moving a process out from secondary memory to main memory is called ____________
A.Swap out, Swap in
B.Swap in, Swap out
C.Counting ,Gropuing
D.Grouping, Counting

34) Are the below statement true to control Thrashing

i) If actual rate is lower than lower bound, decrease the number of frames
ii)If actual rate is larger than upper bound, increase the number of frames.
A.TRUE
B.FALSE

35) A computer system supports 32-bit virtual addresses as well as 32-bit physical addresses. Since the
virtual address space is of the same size as the physical address space, the operating system designers
decide to get rid of the virtual memory entirely. Which one of the following is true?
A.Efficient implementation of multi-user support is no longer possible
B. The processor cache organization can be made more efficient now
C. CPU scheduling can be made more efficient now
D. Hardware support for memory management is no longer needed