This set of MCQ(multiple choice questions) focuses on the NPTEL Operating System Fundamentals Week 10 Answers.
You should practice these questions to improve Operating System Fundamentals needed for various interviews (like company interview, campus interview, walk-in interview), entrance exams, placements and other competitive exams. All the questions in this particular section are based on only “NPTEL Operating System Fundamentals Week 10 Answers“.
Course layout
Week 1: Introduction
Week 2: Processes and Threads – Part I
Week 3: Processes and Threads – Part II
Week 4: Inter-process Communication
Week 5: Concurrency and Synchronization – Part I
Week 6: Concurrency and Synchronization – Part II
Week 7: Deadlock
Week 8: CPU Scheduling
Week 9: Memory Management
Week 10: Virtual Memory – Part I
Week 11: Virtual Memory – Part II
Week 12: File System Processes and Threads – Part I
Operating System Fundamentals NPTEL 2022 Week 10 Assignment Solutions
Q1. In a paging hardware with a TLB, the entire page table and all the pages are in the physical memory. It takes 10 milliseconds to search the TLB and 90 milliseconds to access the physical memory. If the hit ratio is 0.6, the effective memory access time [EAT] in (in milliseconds) is –
a) 120
b) 122
c) 124
d) 118
Answer: b) 122
Q2. The ability to execute partially-loaded program enables –
a) Consumption of less memory by each program while running
b) Requirements of less I/O for loading/swapping programs into memory
c) To run more program at the same time or better CPU utilization
d) All of the above
Answer: d) All of the above
Q3. Which of the following incorrect about demand paging?
a) In pure demand paging, process starts with no pages in memory
b) A given instruction can access multiple pages and page faults
c) Support for page table valid/invalid bit and secondary memory like swap space are required for demand paging
d) None of the above
Answer: d) None of the above
Q4. For implementing demand paging, it is required to –
a) Distinguish between the pages that are in memory and the pages that are on disk
b) Use a variation of valid-invalid scheme for protection
c) Implement new MMU functionality
d) All of the above
Answer: d) All of the above
Q5. Virtual address space does not facilitate the following –
a) System libraries are shared via mapping into virtual address space
b) Process creation is speeded up by sharing pages during fork()
c) Sparse address spaces are left with holes for growth
d) None of the above
Answer: d) None of the above
Q6. Oracle SPARC Solaris uses two hash tables. Which of the following is incorrectly specified about that architecture?
a) Each hash table maps memory addresses from virtual to physical memory
b) Each entry has base address and span
c) Having a single hash table is more efficient than the given two hash table architecture
d) Each entry represents a contiguous area of mapped virtual memory
Answer: c)
Q7. Which of the following is incorrect about virtual memory?
a) It allows address spaces to be shared by several processes
b) It can be implemented via demand paging or segmentation
c) Physical address space is larger than logical address space
d) It let more programs run simultaneously
Answer: c)
Q8. When the valid-invalid bit is set to valid, it means that the associated page –
a) is in the TLB
b) had data in it
c) is in the process’s logical address space
d) is in the system’s physical address space
Answer: d)
Q9. Find out the incorrect statement.
a) Demand paging brings a page into the memory only when it is needed
b) Demand paging can bring entire process into memory at load time
c) Demand paging requires more memory than normal paging
d) None of the above
Answer: c)
Q10. In an inverted page table –
a) There is one entry for each real page of memory
b) It tracks all pages rather than having a page table for each process
c) Consists of virtual address of the page stored in that real memory location with information about the process that owns that page
d) All of the above
Answer: d) All of the above
Previous Course – Week 10 Answers
Q1. The percentage of times a page number is found in the translation lookaside buffer is called as
a. miss percentage
b. hit ratio
c. miss ratio
d. hit miss
Answer. c) miss ratio
Q2. In the translation look aside buffer if the page number is not present then it is called as
a. Buffer miss
b. Translation lookaside buffer(TLB) miss
c. Translation lookaside buffer(TLB) hit
d. None of the above
Answer. b) Translation lookaside buffer(TLB) miss
Q3. Consider a paging hardware with a translation lookaside buffer and assume that the entire page table and all the pages are in the physical memory which takes 20 milliseconds to search the translation lookaside buffer and 90 milliseconds to access the physical memory. Now take the translation lookaside buffer hit ratio as 0.75 then what will be the effective memory access time(EAT) (in milliseconds)
a. 132.5
b. 122
c. 131
d. 200
Answer. a) 132.5
Q4. Every entry in a translation lookaside buffer has a
a. bit value
b. value
c. key
d. constant
Answer. c) Key
Q5. Every address generated by the CPU is divided into two parts which are?
a. frame bit & page number
b. page offset & frame bit
c. page number & page offset
d. frame offset & page offset
Answer. c) page number & page offset
Q6. For every process there is a ?
a. pointer to page table
b. copy of page table
c. page table
d. all of the mentioned
Answer. c) page table
Q7. When does a page fault occur?
a. when a page gives inconsistent data
b. when a page cannot be accessed due to its absence from memory
c. when a page is invisible
d. all of the mentioned
Answer. b) when a page cannot be accessed due to its absence from memory
Q8. Where is the Swap space exists?
a. secondary memory
b. primary memory
c. cpu
d. none of the mentioned
Answer. a) secondary memory
Q9. Virtual memory is implemented by which of the following?
a. bus
b. demand paging
c. virtualization
d. all of the mentioned
Answer. b) demand paging
Q10. Which of the following is the true for virtual memory?
a. Virtual memory is an illustration of extremely large main memory
b. Virtual memory is an a extremely large secondary memory.
c. A type of memory used in powerful computers
d. none of the above
Answer. a) Virtual memory is an illustration of extremely large main memory
NPTEL Operating System Fundamentals Week 11 Answers
Q1. Provided that memory access time is 300 nanoseconds, average page-fault service time is 12 milliseconds, and the page fault rate is 0.0001, find out the factor by which the access time is slowed down.
a. 1500
b. 5
c. 15
d. 500
Answer. b) 5
Q2. Frame allocation algorithm determines –
a. How many frames to give each process
b. Which frames to replace
c. Both a & b
d. None of the above
Answer. c) Both a & b
Q3. Page replacement algorithm
a. Want first access to have lowest page-fault
b. Want re-access to have highest page-fault
c. Change the reference page number
d. None of the above
Answer. a) Want first access to have lowest page-fault
Q4. What is Belady’s anomaly?
a. When we use FIFO for page replacement and more pages does not affect the page fault count
b. When we use FIFO for page replacement and more pages reduces the page fault count
c. When we use FIFO for page replacement and more page leads to more page fault
d. None of the above
Answer. c) When we use FIFO for page replacement and more page leads to more page fault
Q5. Among the following algorithms, which one has the least rate of page fault?
a. FIFO
b. Optimal
c. Least Recently Used
d. Each one has the similar page fault outcome
Answer. b) Optimal
Q6. Which of the following algorithm does not suffer from Belady’s anomaly?
a. FIFO
b. Optimal
c. Least Recently Used
d. Both b & c
Answer. d) Both b & c
Q7. Which of the following Counting algorithms are expensive to use and considers the argument that the page with the smallest count was just brought in and has yet to be used?
a. LFU
b. MFU
c. Both a & b
d. None of the above
Answer. b) MFU
Q8. Which of the following statement is true?
a. The process execution time can vary a lot in replacement than global replacement
b. The memory utilization is better in local replacement as compared to global replacement
c. A process selects a replacement frame from a set of all frames in global replacement while each process selects from only its own set of allocated frames in local replacement.
d. All of the above
Answer. c)
Q9. Which of the following statement is true about trashing?
a. It makes the Operating System think that it needs to increase the degree of multiprogramming
b. It leads to low CPU utilization
c. A process is added to the system
d. All of the above
Answer. d) All of the above
Q10. Which of the following does not help in limiting the effects of thrashing
a. Local page replacement
b. Global page replacement
c. Priority page replacement
d. None of the above
Answer. b) Global page replacement
NPTEL Operating System Fundamentals Week 12 Answers
Q1. If we want to set the following protection for a file, what should be the command for it?
a. chmod 157 file_name
b. chmod 457 file_name
c. chmod 754 file_name
d. chmod 751 file_name
Answer. c) chmod 754 file_name
Q2. Which of the following directory organization links are used to point to both files and subdirectories?
a. General graph directory
b. Acyclic graph directory
c. Tree-structured directory
d. None of the above
Answer. b) Acyclic graph directory
Q3. In sequential access method, how the file pointer is affected by read_next() or write_next() command?
a. It is incremented to the next value
b. It is reduced to the previous value
c. It rests to the 0
d. None of the above
Answer. a) It is incremented to the next value
Q4. In open file locking system, the advisory access policy-
a. Denies the access request depending on the lock held and requested
b. Allows the access request ignoring the lock status
c. The processes look up the status of lock and decide what to do
d. None of the above
Answer. c) The processes look up the status of lock and decide what to do
Q5. Which of the following disk scheduling algorithm should NOT be picked for systems that place heavy load on the disk?
a. SCAN
b. C-SCAN
c. SSTF
d. All of the above
Answer. c) SSTF
Q6. Which of the following disk scheduling algorithm searches in only one direction and the arm goes only as far as the last request before reversing its direction?
a. LOOK
b. C-LOOK
c. SCAN
d. C-SCAN
Answer. b) C-LOOK
Q7. A disk has 200 cylinders (0 to 199). If the initial position of the read-write head is at cylinder 39, calculate the total head movement following SSTF policy for the read request sequence: 25, 112, 84, 188, 2, 154.
a. 233
b. 223
c. 189
d. 179
Answer. b) 223
Q8. A disk has 200 cylinders (0 to 199). If the initial position of the read-write head is at cylinder 39, calculate the total head movement following C-LOOK policy for the read request sequence: 25, 112, 84, 188, 2, 154.
a. 358
b. 368
c. 278
d. 288
Answer. a) 358
Q9. Which of the following is correct about linked allocation?
a. Each block contains pointer to next block
b. Locating a block can take many I/Os and disk seeks
c. Reliability issue arises when one of the pointers gets corrupted
d. All of the above
Answer. d) All of the above
Q10. Select the correct statement about indexed allocation
a. Each of the files has its own index block of pointers to its data blocks
b. Can be accomplished with multilevel index method
c. Dynamic access is possible without external fragmentation
d. All of the above
Answer. d) All of the above
>> Prev- Operating System Fundamentals Week 1 Assignment Solutions
Introduction To Internet Of Things | NPTEL | Assignment Solutions
170+ Grammar quiz: Beginner’s Level questions
Industrial Automation and Control NPTEL assignment solutions
NPTEL Leadership assignment solutions
Java Programming: Coursera quiz answers
Online Web development Test for Hiring and Recruitment
The above question set contains all the correct answers. But in any case, you find any typographical, grammatical or any other error in our site then kindly inform us. Don’t forget to provide the appropriate URL along with error description. So that we can easily correct it.
Thanks in advance.
For discussion about any question, join the below comment section. And get the solution of your query. Also, try to share your thoughts about the topics covered in this particular quiz.