PYQBOOK

Filter Questions

Found 475 question(s)

Q461 MCQ GATE CS Medium 2 Marks 2020
OS → Secondary Storage
Consider the following five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time. (P, 155), (Q, 85), (R, 110), (S, 30), (T, 115). Assume the head is positioned at cylinder 100. The scheduler follows Shortest Seek Time First scheduling to service the requests. Which one of the following statements is FALSE?
Choose One:
Q462 NAT GATE CS Hard 2 Marks 2020
OS → CPU Scheduling
Consider the following set of processes, assumed to have arrived at time 0. Burst times: P1=8, P2=7, P3=2, P4=4. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume that the processes are scheduled in the order P1, P2, P3, P4. If the time quantum for RR is 4 ms, then the absolute value of the difference between the average turnaround times (in ms) of SJF and RR (round off to 2 decimal places) is
Enter Numerical Answer:
Q463 MCQ GATE CS Medium 1 Mark 2020
OS → Memory Management
Consider allocation of memory to a new process. Assume that none of the existing holes in the memory will exactly fit the process's memory requirement. Hence, a new hole of smaller size will be created if allocation is made in any of the existing holes. Which one of the following statements is TRUE?
Choose One:
Q464 NAT GATE CS Hard 2 Marks 2020
OS → Memory Management
Consider a paging system that uses 1-level page table residing in main memory and a TLB for address translation. Each main memory access takes 100 ns and TLB lookup takes 20 ns. Each page transfer to/from the disk takes 5000 ns. Assume that the TLB hit ratio is 95%, page fault rate is 10%. Assume that for 20% of the total page faults, a dirty page has to be written back to disk before the required page is read in from disk. TLB update time is negligible. The average memory access time in ns (round off to 1 decimal places) is
Enter Numerical Answer:
Q465 MCQ GATE CS Medium 1 Mark 2020
OS → Memory Management
Consider allocation of memory to a new process. Assume that none of the existing holes in the memory will exactly fit the process's memory requirement. Hence, a new hole of smaller size will be created if allocation is made in any of the existing holes. Which one of the following statements is TRUE?
Choose One: