Operating System Basics Questions and Answers
Operating System Basics questions with answers are among the most commonly asked in technical interviews and exams. This section covers core OS concepts like process management, memory allocation, file systems, and scheduling algorithms. Practicing programming questions and answers on operating systems helps strengthen your conceptual clarity and practical understanding of computer architecture. Frequently featured in GATE, TCS, Infosys, and Wipro placements, these MCQs provide a balanced mix of theoretical and applied knowledge. Clear explanations make this section an ideal resource for anyone preparing for system-related roles or competitive exams.
Operating System Basics
Showing 10 of
563 questions
551. Relocatable programs
- Cannot be used with fixed partitions
- Can be loaded almost anywhere in memory
- do not need a linker
- Can be loadedonly at one specific location
552. Fixed partitions
- are very common in current operating systems
- are very efficient in memory utilization.
- are very inefficient in memory utilization
- are most used on large mainframe opeating systems.
553. Virtual system swapping
- allocates all of memory to one program
- pages working set pages in and out as a group
- is never as efficient as normal paging
- is used only on systems that are thrashing
554. The term paging refers to
- boosting up the priority of a process in multilevel of queues without feedback
- gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking
- keeping track of the time a page has been in memory for the purpose of LRU repacement
- letting job reside in memory for a certain amount of time, so that the number of pages required can be estimated accurately
555. With a segmentation, if there are 64 segments, and the maximum segment size is 512 words, the length of the logical address in bits is
- 12
- 14
- 15
- 16
556. High paging rate
- may cause high I/O rate
- keeps the systems running well
- is a symptom of too much processor activity
- always creates a slow system
557. The total time to prepare a disk drive mechanism for a block of data to be read from it is
- seek time
- latency
- latency plus seek time
- transmission time
558. Following illustrates Associates memory
- The address of the data is supplied by the user
- Same as the tracks associated with disk memory
- No need for address
- Data is accessed serially
559. A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth across the disk surface servicing all requests in its path, based on
- First come First Served
- Shortest seek time first
- Sean
- None of these
560. Access to moving head disks requires three periods of delay before information is brought into memory. the response that correctly lists the three time delays for the phisical access of data in the order of the relative speed from the slowest to the fastest is
- latency time, cache overhead time, seek time
- Transmission time, latency time, seek time
- Seek time, latency time, transmission time
- Cache overhead time, latency time, seek time