Week 8:

1. An un-interruptible unit is known as ____________

● single
● atomic
● static
● none of the mentioned

2. TestAndSet instruction is executed ____________

● after a particular process

● periodically
● atomically
● none of the mentioned

3. Semaphore is a/an _______ to solve the critical section problem.

● hardware for a system

● special program for a system
● integer variable
● none

4. What are Spinlocks?

● CPU cycles wasting locks over critical sections of programs

● Locks that avoid time wastage in context switches
● Locks that work better on multiprocessor systems
● All of the mentioned

5. What is the main disadvantage of spinlocks?

● they are not sufficient for many process

● they require busy waiting
● they are unreliable sometimes
● they are too complex for programmers

6. The wait operation of the semaphore basically works on the basic _______ system
call.

● stop()
● block()
● hold()
● wait()

7. The signal operation of the semaphore basically works on the basic _______ system
call.
 ● continue()
● wakeup()
● getup()
● start()

8. If the semaphore value is negative ____________

● its magnitude is the number of processes waiting on that semaphore

● it is invalid
● no operation can be further performed on it until the signal operation is performed on
it
● none of the mentioned

9. The circular wait condition can be prevented by ____________

● defining a linear ordering of resource types

● using thread
● using pipes
● all of the mentioned

10. Which one of the following is the deadlock avoidance algorithm?

● banker's algorithm
● round-robin algorithm
● elevator algorithm
● karn's algorithm

Week 9:

1. What is the drawback of banker's algorithm?

● in advance processes rarely know how much resource they will need
● the number of processes changes as time progresses
● resource once available can disappear
● all of the mentioned

2. For an effective operating system, when to check for deadlock?

● every time a resource request is made

● at fixed time intervals
● every time a resource request is made at fixed time intervals
● none of the mentioned

3. A problem encountered in multitasking when a process is perpetually denied

necessary resources is called ____________
● deadlock
● starvation
● inversion
● aging

4. Which one of the following is a visual ( mathematical ) way to determine the deadlock
occurrence?

● resource allocation graph

● starvation graph
● inversion graph
● none of the mentioned

5. To avoid deadlock ____________

● there must be a fixed number of resources to allocate

● resource allocation must be done only once
● all deadlocked processes must be aborted
● inversion technique can be used

6. The wait-for graph is a deadlock detection algorithm that is applicable when

____________

● all resources have a single instance

● all resources have multiple instances
● all resources have a single 7 multiple instances
● all of the mentioned

7. An edge from process Pi to Pj in a wait for graph indicates that ____________

● Pi is waiting for Pj to release a resource that Pi needs

● Pj is waiting for Pi to release a resource that Pj needs
● Pi is waiting for Pj to leave the system
● Pj is waiting for Pi to leave the system

8. If the wait for graph contains a cycle ____________

● then a deadlock does not exist

● then a deadlock exists
● then the system is in a safe state
● either deadlock exists or system is in a safe state

9. If deadlocks occur frequently, the detection algorithm must be invoked ________

● rarely
● frequently
● rarely & frequently
 ● none of the mentioned

10. What is the disadvantage of invoking the detection algorithm for every request?

● overhead of the detection algorithm due to consumption of memory

● excessive time consumed in the request to be allocated memory
● considerable overhead in computation time
● all of the mentioned

Week 10:

1. What is Address Binding?

● going to an address in memory

● locating an address with the help of another address
● binding two addresses together to form a new address in a different memory space
● a mapping from one address space to another

2. Binding of instructions and data to memory addresses can be done at ____________

● Compile time
● Load time
● Execution time
● All of the mentioned

3. If the process can be moved during its execution from one memory segment to
another, then binding must be ____________

● delayed until run time

● preponed to compile time
● preponed to load time
● none of the mentioned

4. What is Dynamic loading?

● loading multiple routines dynamically

● loading a routine only when it is called
● loading multiple routines randomly
● none of the mentioned

5. What is the advantage of dynamic loading?

● A used routine is used multiple times

● An unused routine is never loaded
● CPU utilization increases
● All of the mentioned
 6. The idea of overlays is to ____________

● data that are needed at any given time

● enable a process to be larger than the amount of memory allocated to it
● keep in memory only those instructions
● all of the mentioned

7. The ___________ must design and program the overlay structure.

● programmer
● system architect
● system designer
● none of the mentioned

8. The ___________ swaps processes in and out of the memory.

● Memory manager
● CPU
● CPU manager
● User

9. If a higher priority process arrives and wants service, the memory manager can swap
out the lower priority process to execute the higher priority process. When the higher
priority process finishes, the lower priority process is swapped back in and continues
execution. This variant of swapping is sometimes called?

● priority swapping
● pull out, push in
● roll out, roll in
● none of the mentioned

10. If binding is done at assembly or load time, then the process _____ be moved to
different locations after being swapped out and in again.

● can
● must
● can never
● May

Week 11:

1. Physical memory is broken into fixed-sized blocks called ________

● frames
● pages
● backing store
● none of the mentioned

2. Logical memory is broken into blocks of the same size called _________

● frames
● pages
● backing store
● none of the mentioned

3. Every address generated by the CPU is divided into two parts. They are
____________

● frame bit & page number

● page number & page offset
● page offset & frame bit
● frame offset & page offset

4. The __________ is used as an index into the page table.

● frame bit
● page number
● page offset
● frame offset

5. The _____ table contains the base address of each page in physical memory.

● process
● memory
● page
● frame

6. The size of a page is typically ____________

● varied
● power of 2
● power of 4
● none of the mentioned

7. If the size of logical address space is 2 to the power of m, and a page size is 2 to the
power of n addressing units, then the high order _____ bits of a logical address
designate the page number, and the ____ low order bits designate the page offset.

● m, n
● n, m
● m – n, m
● m – n, n

8. With paging there is no ________ fragmentation.

 ● internal
● external
● either type of
● none of the mentioned

9. The operating system maintains a ______ table that keeps track of how many frames
have been allocated, how many are there, and how many are available.

● page
● mapping
● frame
● memory

10. Paging increases the ______ time.

● waiting
● execution
● context – switch
● all of the mentioned

Week 12:

1. Smaller page tables are implemented as a set of _______

● queues
● stacks
● counters
● registers

2. The page table registers should be built with _______

● very low speed logic

● very high speed logic
● a large memory space
● none of the mentioned

3. For larger page tables, they are kept in main memory and a __________ points to
the page table.

● page table base register

● page table base pointer
● page table register pointer
● page table base
4. For every process there is a __________

● page table
● copy of page table
● pointer to page table
● all of the mentioned

5. Time taken in memory access through PTBR is ____________

● extended by a factor of 3
● extended by a factor of 2
● slowed by a factor of 3
● slowed by a factor of 2

6. The address of a page table in memory is pointed by ____________

● stack pointer
● page table base register
● page register
● program counter

7. Program always deals with ____________

● logical address
● absolute address
● physical address
● relative address

8. The page table contains ____________

● base address of each page in physical memory

● page offset
● page size
● none of the mentioned

9. What is compaction?

● a technique for overcoming internal fragmentation

● a paging technique
● a technique for overcoming external fragmentation
● a technique for overcoming fatal error

10. Operating System maintains the page table for ____________

● each process
● each thread
● each instruction
● each address
Week 13:

1. The process of dividing a disk into sectors that the disk controller can read and write,
before a disk can store data is known as ____________

● partitioning
● swap space creation
● low-level formatting
● none of the mentioned

2. The data structure for a sector typically contains ____________

● header
● data area
● trailer
● all of the mentioned

3. The header and trailer of a sector contain information used by the disk controller
such as _________ and _________

● main section & disk identifier

● error correcting codes (ECC) & sector number
● sector number & main section
● disk identifier & sector number

4. The two steps the operating system takes to use a disk to hold its files are _______
and ________

● partitioning & logical formatting

● swap space creation & caching
● caching & logical formatting
● logical formatting & swap space creation

5. The _______ program initializes all aspects of the system, from CPU registers to
device controllers and the contents of main memory, and then starts the operating
system.

● main
● bootloader
● bootstrap
● rom

6. The UNIX system uses a/an ________ stored at the beginning of a some files to
indicate roughly the type of file.
 ● identifier
● extension
● virtual number
● magic number

7. The larger the block size, the ______ the internal fragmentation.

● greater
● lesser
● same
● none of the mentioned

8. In the sequential access method, information in the file is processed ____________

● one disk after the other, record access doesnt matter

● one record after the other
● one text document after the other
● none of the mentioned

9. For a direct access file ____________

● there are restrictions on the order of reading and writing

● there are no restrictions on the order of reading and writing
● access is restricted permission wise
● access is not restricted permission wise

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

● the beginning of the file

● the end of the file
● the last written position in file
● none of the mentioned

Week 14:

1. The index contains ____________

● names of all contents of file

● pointers to each page
● pointers to the various blocks
● all of the mentioned

2. For large files, when the index itself becomes too large to be kept in memory?

● index is called
● an index is created for the index file
● secondary index files are created
● all of the mentioned

3. Management of metadata information is done by ____________

● file-organisation module
● logical file system
● basic file system
● application programs

4. A file control block contains the information about ____________

● file ownership
● file permissions
● location of file contents
● all of the mentioned

5. Which table contains the information about each mounted volume?

● mount table
● system-wide open-file table
● per-process open-file table
● all of the mentioned

6. To create a new file application program calls ____________

● basic file system

● logical file system
● file-organisation module
● none of the mentioned

7. What will happens when a process closes the file?

● per-process table entry is not removed

● system wide entry's open count is decremented
● all of the mentioned
● none of the mentioned

8. What is raw disk?

● disk without file system

● empty disk
● disk lacking logical file system
● disk having file system

9. The data structure used for file directory is called ____________

 ● mount table
● hash table
● file table
● process table

10. In which type of allocation method each file occupy a set of contiguous block on the
disk?

● contiguous allocation
● dynamic-storage allocation
● linked allocation
● indexed allocation

Week 15:

1. If the block of free-space list is free then bit will ____________

● 1
● 0
● any of 0 or 1
● none of the mentioned

2. Which protocol establishes the initial logical connection between a server and a
client?

● transmission control protocol

● user datagram protocol
● mount protocol
● datagram congestion control protocol

3. Management of metadata information is done by ____________

● file-organisation module
● logical file system
● basic file system
● application programs

4. A file control block contains the information about ____________

● file ownership
● file permissions
● location of file contents
● all of the mentioned

5. Which table contains the information about each mounted volume?

● mount table
● system-wide open-file table
● per-process open-file table
● all of the mentioned

6. What is raw disk?

● disk without file system

● empty disk
● disk lacking logical file system
● disk having file system

7. The data structure used for file directory is called ____________

● mount table
● hash table
● file table
● process table

8. In which type of allocation method each file occupy a set of contiguous block on the
disk?

● contiguous allocation
● dynamic-storage allocation
● linked allocation
● indexed allocation

9. If the block of free-space list is free then bit will ____________

● 1
● 0
● any of 0 or 1
● none of the mentioned

10. Which protocol establishes the initial logical connection between a server and a
client?

● transmission control protocol

● user datagram protocol
● mount protocol
● datagram congestion control protocol