Home › Quizzes › Operating Systems: Memory, Process, and File Management

Operating Systems: Memory, Process, and File Management

Comprehensive quiz covering OS concepts including virtual memory, paging, TLB, process scheduling, threads, file systems, and system calls

20 Questions Published
Play Quiz Practise this topic out loud

Questions

Question 1 Multiple Choice (Single Answer)

In a memory scheme, the address of a location is specified by a page address and a displacement within a page, in hexadecimal.

of pages = 16

of words per page = 256

The address of the 11th page, 94th word is 

  1. B5E
  2. A5D
  3. 5EB
  4. E9C
Question 2 Multiple Choice (Single Answer)

Find the valid statement.

  1. Pages that are shared between two or more processes can never be swapped out to the disk.
  2. The allocated portions of memory using a buddy system are all the same size.
  3. Demand paging requires the programmer to take specific action to force the operating system to load a particular virtual memory page.
  4. Prepaging is one possibility for the fetch policy in a virtual memory system.
Question 3 Multiple Choice (Single Answer)

LRU cache replacement is used in

  1. associative cache
  2. direct mapped cache
  3. set-associative
  4. none of these
Question 4 Multiple Choice (Single Answer)

In a paging system with TLB it is observed that for every 10 memory accesses, 9 accesses are successfully found in TLB. Find out effective access time, if memory access is 200 ms and cache access is 10 ms while finding page base address.

  1. 20 ms
  2. 30 ms
  3. 40 ms
  4. None of these
Question 5 Multiple Choice (Single Answer)

The difference between the time you get results and the time of submission is

  1. elapsed
  2. turnaround
  3. system
  4. none of these
Question 6 Multiple Choice (Single Answer)

A paging system is employing HW cache as TLB of 20 ns access time (search time) and physical memory access time is 100 ns. It is observed that the hit ratio is 98%. The effective memory access time is

  1. 120 ns
  2. 122 ns
  3. 220 ns
  4. None of these
Question 7 Multiple Choice (Single Answer)

A currently running process can be put on a ready queue or one of the I/O queues by each of the following except

  1. the process did an illegal memory access
  2. the process issued an I/O request
  3. there was an interrupt
  4. the process issued a system call
Question 8 Multiple Choice (Single Answer)

Find incorrect statement about FAT-32 compared to VFAT.

  1. The FAT-32 system enables users to manage 8 GB volumes with cluster sizes of just 4 kB. For hard drives up to a maximum of 32 GB, the cluster size is 16 kB
  2. FAT-32 also does not limit the number of directories or files in the root directory
  3. FAT-32 supports long file names
  4. None of these
Question 9 Multiple Choice (Single Answer)

When a user program calls a system call

  1. mode changes to system mode
  2. interrupts are enabled
  3. system call number is sued to find out code in system call interrupt vector area
  4. all of these
Question 10 Multiple Choice (Single Answer)

In the burst mode, DMA transfers

  1. entire block
  2. one byte at a time
  3. one record at a time
  4. none of these
Question 11 Multiple Choice (Single Answer)

A two-way set associative memory with 1K is used, then the number of locations are

  1. 1024
  2. 16
  3. 512
  4. None of these
Question 12 Multiple Choice (Single Answer)

Which of the following best describes the threads?

  1. Threads are more cheaper to create and destroy as they don not require allocation of real addresses
  2. Switching of threads is faster
  3. Threads will have their own stack and registers
  4. All of these
Question 13 Multiple Choice (Single Answer)

Which of the following statements is false?

  1. VM implements the translation of a programs address space to physical address space.
  2. VM allows each program to exceed the size of the primary memory.
  3. VM increases degree of multiprogramming.
  4. VM reduces the context switching overhead.
Question 14 Multiple Choice (Single Answer)

When miss occurs, then _____ procedure can respond quicly to CPU.

  1. look-aside
  2. look-through
  3. can’t say
  4. none of these
Question 15 Multiple Choice (Single Answer)

Find the invalid statement.

  1. One useful measure of a system’s ability to handle a large number of jobs is throughput, defined as the total time required to execute the set of jobs.
  2. A process in a blocked state is waiting for an event, but that event is not related to the virtual memory subsystem.
  3. Process state transition diagrams are helpful to understand the ways in which a process and the OS must react to different situations.
  4. A process control block would typically contain information about memory allocations, threads and other information used to manage the process.
Question 16 Multiple Choice (Single Answer)

Consider the following program.
int main(){
int status;
int counter = 1;
if (fork() == 0) {
counter++;
printf(“%d”,counter);
}
else {
if (fork() == 0) {
printf(“5”,);
counter--;
printf(“%d”,counter);
exit(0);
}
else {
if (wait(&status) > 0) {
printf(“6”);
}
}
}
printf(“3”);
exit(0);
}
The output which is not possible from this program is

  1. 253063
  2. 251633
  3. 520633
  4. 506323
Question 17 Multiple Choice (Single Answer)

Disk allocation table

  1. FAT
  2. Open file table
  3. Bit map
  4. None of these
Question 18 Multiple Choice (Single Answer)

Find the odd-one out.

  1. Programmers (assembly) can access all registers in a processor
  2. Programmer (assembly) cannot access all registers in a processor
  3. Some registers are not part of instruction set
  4. None of these
Question 19 Multiple Choice (Single Answer)

Pentium processor the code cache as a TLB of ___ entries.

  1. 16
  2. 32
  3. 64
  4. None of these
Question 20 Multiple Choice (Single Answer)

When Unix opens a file, it selects an unused file descriptor

  1. with the lowest value
  2. that was closed most recently
  3. with the highest value
  4. none of these
← Back to Quizzes