operating-system
Operating System Notes in Hindi
Operating System Notes in Hindi - Gate2iit - OS Notes in Hindi for Btech computer science students and BCA, MCA Students and Mtech Students, and GATE Exam Preparation OS Notes in Hindi
HRRN Scheduling in Hindi | CPU Scheduling in Hindi
HRRN Scheduling in Hindi | CPU Scheduling in Hindi - gate2iit | HRRN शेड्यूलिंग में, सभी Available Processes में से, CPU को Highest Response Ratio वाली Process को सौंपा गया है।
Longest Job First Algorithm in Hindi | LRTF Scheduling in Hindi
Longest Job First Algorithm in Hindi | LRTF Scheduling in Hindi - Gate2iit | LJF शेड्यूलिंग में, सभी Available Processes में से, CPU को उस Process को सौंपा जाता है जिसमें सबसे बड़ा Burst Time होता है।
Predicting Burst Time in Hindi | SJF Scheduling in Hindi
Predicting Burst Time in Hindi | SJF Scheduling in Hindi - Gate2iit | सभी Available Processes में से, CPU को सबसे Smallest Burst Time वाली Process को Assign किया गया है। SJF शेड्यूलिंग
SJF Scheduling in Hindi | SRTF in Hindi | CPU Scheduling Notes in Hindi
SJF Scheduling in Hindi | SRTF in Hindi | CPU Scheduling Notes in Hindi - Gate2iit | SJF Scheduling- SJF शेड्यूलिंग में, सभी Available Processes में से, CPU को सबसे छोटी Burst Time
First Come First Serve in Hindi | CPU Scheduling in Hindi
First Come First Serve in Hindi | CPU Scheduling in Hindi | Gate2iit | FCFS Scheduling- FCFS Scheduling में, Ready Queue में सबसे पहले आने वाली Process को सबसे पहले CPU सौंपा जाता है।
Turn Around Time in Hindi | Response Time in Hindi | Waiting Time in Hindi
Various Times Related To Process Arrival Time वह समय है जब एक Process Ready Queue में Enter करती है।।Turn Around Time in Hindi | Response Time in Hindi | Waiting Time in Hindi | Gate2iit
CPU Schedulers in Hindi
CPU Schedulers in Hindi | Schedulers in OS in Hindi | Schedulers in Hindi | OS में Scheduler विशेष System Software हैं। वे विभिन्न तरीकों से Processes को Schedule करने में मदद करते हैं। Gate2iit
Process Control Block in Hindi | Process Attributes in Hindi
Process Control Block in Hindi | Process Attributes in Hindi | Gate2iit | PCB Kya Hai | प्रोसेस कंट्रोल ब्लॉक (PCB) एक Data Structure है जो किसी Particular Process के बारे में Information Store करती है।
Process States in Operating System in Hindi
Process States in Operating System in Hindi | Process States Kya Hota Hai | the Process States in Hindi | प्रत्येक Process अपने Life Cycle में Different States से गुजरती है- New State, Ready State, Run
Batch Operating System in Hindi
Batch Operating System in Hindi | Types of Operating System in Hindi | Operating System ke Prakar | Operating System के प्रकार | बैच ऑपरेटिंग सिस्टम (Batch Operating System) | Batch OS Kya Hai
GATE -1992 | OS | Which of the following is an example of a spooled device?
GATE -1992 | OS | Which of the following is an example of a spooled device? The terminal used to the input data for a program being executed.
GATE - 1992 | OS | A computer system has 6 tape drives, with n process completing for
GATE - 1992 | OS | A computer system has 6 tape drives, with n process completing for them. Each process may need 3 tape drives. The maximum value of n for which the system
GATE - 1992 | OS | At a particular time of computation the value of a counting semaphore
GATE - 1992 | OS | At a particular time of computation the value of a counting semaphore is 7. Then 20 P operations and 15 V operations were completed on this semaphore.
GATE - 1993 | OS | Consider a system having m resources of the same type. These
GATE - 1993 | OS | Consider a system having m resources of the same type. These resources are shared by 3 processes A, B and C, which have peak demands of 3, 4 and 6 respectively.
GATE - 1994 | OS | A memory page containing a heavily used variable that was initialized
GATE - 1994 | OS | A memory page containing a heavily used variable that was initialized very early and is in constant use is removed when
GATE - 1995 | OS | In a virtual memory system the address space specified by the address
GATE - 1995 | OS | In a virtual memory system the address space specified by the address lines of the CUP must be __________ than the physical memory size
GATE - 1995 | OS | Which scheduling policy is most suitable for a time shared operating
GATE - 1995 | OS | Which scheduling policy is most suitable for a time shared operating system? Shortest Job First
GATE - 1995 | OS | Which of the following page replacement algorithms suffers from
GATE - 1995 | OS | Which of the following page replacement algorithms suffers from Belady’s anomaly? Optimal replacement
GATE - 1995 | OS | In a paged segmented scheme of memory management, the segment
GATE - 1995 | OS | In a paged segmented scheme of memory management, the segment table itself must have a page table because
GATE - 1995 | OS | Which of the following statements is true?
GATE - 1995 | OS | Which of the following statements is true? ROM is a Read/Write memory
GATE - 1996 | OS | Four jobs to be executed on a single processor system arrive at time
GATE - 1996 | OS | Four jobs to be executed on a single processor system arrive at time 0+ in the order A, B, C, D. their burst CPU time requirements are 4, 1, 8, 1 time units respectively.
GATE - 1996 | OS | A solution to the Dining Philosophers Problem which avoids deadlock is
GATE - 1996 | OS | A solution to the Dining Philosophers Problem which avoids deadlock is ensure that all philosophers pick up the left fork before the right fork
GATE - 1996 | OS | A 1000 Kbyte memory is managed using variable partitions but to
GATE - 1996 | OS | A 1000 Kbyte memory is managed using variable partitions but to
GATE - 1996 | OS | The correct matching for the following pairs is
GATE - 1996 | OS | The correct matching for the following pairs is A. Activation record 1. Linking loader
GATE - 1996 | OS | Which of the following is an example of spooled device?
GATE - 1996 | OS | Which of the following is an example of spooled device? A line printer used to print the output of a number of jobs.
GATE - 1996 | OS | A critical section is a program segment
GATE - 1996 | OS | A critical section is a program segment which should run in a certain specified amount of time
GATE- 1996 | OS | The process state transition diagram in below figure is representative of
GATE- 1996 | OS | The process state transition diagram in below figure is representative of a batch operating system
GATE - 1997 | OS | Each Process Pi, i= 1…….9 is coded as follows
GATE - 1997 | OS | Each Process Pi, i= 1…….9 is coded as follows repeat P(mutex) {Critical section} V(mutex) forever
GATE - 1997 | OS | An operating system contains 3 user processes each requiring 2 units
GATE - 1997 | OS | An operating system contains 3 user processes each requiring 2 units of resource R. the minimum number of units of r such that no deadlocks will ever arise is
GATE - 1997 | OS | Dirty bit for a page in a page table
GATE - 1997 | OS | Dirty bit for a page in a page table helps avoid unnecessary writes on a paging device
GATE - 1997 | OS | I/O redirection
GATE - 1997 | OS | I/O redirection implies changing the name of a file can be employed to use an existing file as input file for a program
GATE -1997 | OS | Thrashing
GATE -1997 | OS | Thrashing reduces page I/O decreases the degree of multiprogramming
GATE - 1997 | OS | Locality of reference implies that the page reference being made by
GATE - 1997 | OS | Locality of reference implies that the page reference being made by a process will always be to the page used in the previous page reference
GATE - 1998 | OS | If an instruction takes i microseconds and a page fault takes an
GATE - 1998 | OS | If an instruction takes i microseconds and a page fault takes an additional j microseconds, the effective instruction time if on the average a page fault
GATE - 1998 | OS | Consider n processes sharing the CPU in a round-robin fashion.
GATE - 1998 | OS | Consider n processes sharing the CPU in a round-robin fashion. Assuming that each process switch takes s seconds, what must be the quantum size
GATE - 1998 | OS | The overlay tree for a program is as shown below:
GATE - 1998 | OS | The overlay tree for a program is as shown below: What will be the size of the partition (in physical memory) required to load (and run) this program?
GATE - 1998 | OS | A computer has six tape drives, with n processes competing for
GATE - 1998 | OS | A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?
GATE - 1998 | OS | A counting semaphore was initialized to 10. Then 6P (wait) operations
GATE - 1998 | OS | A counting semaphore was initialized to 10. Then 6P (wait) operations and 4V (signal) operations were completed on this semaphore. The resulting value of the semaphore is
GATE - 1998 | OS | When the result of a computation depends on the speed of the
GATE - 1998 | OS | When the result of a computation depends on the speed of the processes involved there is said to be
GATE - 1998 | OS | Which of the following is an example of a spooled device?
GATE - 1998 | OS | Which of the following is an example of a spooled device? The terminal used to enter the input data for the C program being executed
GATE - 1998 | OS | A linker reads four modules whose lengths are 200, 800, 600, and
GATE - 1998 | OS | A linker reads four modules whose lengths are 200, 800, 600, and 500 words, respectively. If they are loaded in that order, what are the relocation constants?
GATE - 1999 | OS | Which of the following actions is/are typically not performed by the
GATE - 1999 | OS | Which of the following actions is/are typically not performed by the operating system when switching context from process A to process B?
GATE - 1999 | OS | Which of the following is/are advantage of virtual memory?
GATE - 1999 | OS | Which of the following is/are advantage of virtual memory? Faster access to memory on an average.
GATE - 1999 | OS | A multi-user, multi-processing operating system cannot be
GATE - 1999 | OS | A multi-user, multi-processing operating system cannot be implemented on hardware that does not support
GATE - 1999 | OS | System calls are usually invoked by using
GATE - 1999 | OS | System calls are usually invoked by using a software interrupt polling an indirect jump
GATE - 1999 | OS | Which of the following disk scheduling strategies is likely to give the
GATE - 1999 | OS | Which of the following disk scheduling strategies is likely to give the best throughput? Farthest cylinder next
GATE - 1999 | OS | Listed below are some operating system abstractions (in the left
GATE - 1999 | OS | Listed below are some operating system abstractions (in the left column) and the hardware components or mechanism (in the right column)
GATE - 2000 | OS | Which of the following is NOT a valid deadlock prevention scheme?
GATE - 2000 | OS | Which of the following is NOT a valid deadlock prevention scheme? Release all resources before requesting a new resource
GATE - 2000 | OS | Suppose the time to service a page fault is on the average 10
GATE - 2000 | OS | Suppose the time to service a page fault is on the average 10 milliseconds, while a memory access takes 1 microsecond. Then a 99.99% hit ratio
GATE - 2000 | OS | A graphics card has on board memory of 1MB. Which of the following
GATE - 2000 | OS | A graphics card has on board memory of 1MB. Which of the following modes can the card not support?
![GATE - 2000 | OS | Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be](https://res.cloudinary.com/dctkncnc5/image/upload/v1645859616/2022-02-26_12_43_03-subject-GovtVacancy_geov2a.png)
GATE - 2000 | OS | Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be
GATE - 2000 | OS | Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be processes. Suppose each process P[i] executes the following:
GATE - 2000 | OS | Which of the following need not necessarily be saved on a context
GATE - 2000 | OS | Which of the following need not necessarily be saved on a context switch between processes?
GATE - 2001 | OS | Consider Peterson’s algorithm for mutual exclusion between two
GATE - 2001 | OS | Consider Peterson’s algorithm for mutual exclusion between two concurrent processes i and j. The program executed by process is shown below
GATE - 2001 | OS | Consider a machine with 64 MB physical memory and a 32-bit virtual
GATE - 2001 | OS | Consider a machine with 64 MB physical memory and a 32-bit virtual address space. If the page size is 4 KB, what is the approximate size of the page table
GATE - 2001 | OS | Which of the following does not interrupt a running process?
GATE - 2001 | OS | Which of the following does not interrupt a running process? A device Timer Scheduler process Power failure
GATE - 2001 | OS | consider a virtual memory system with a FIFO page replacement policy
GATE - 2001 | OS | consider a virtual memory system with a FIFO page replacement policy For an arbitrary page access pattern, increasing the number of page frames in main memory will
GATE - 2001 | OS | Consider a set of n tasks with known runtimes r1, r2, ..., rn to be run on
GATE - 2001 | OS | Consider a set of n tasks with known runtimes r1, r2, ..., rn to be run on a uniprocessor machine. Which of the following processor scheduling algorithms
GATE - 2001 | OS | Which of the following statements is false?
GATE - 2001 | OS | Which of the following statements is false? Virtual memory implements the translation of a program’s address space into physical memory address space
GATE - 2002 | OS | In the index allocation scheme of blocks to a file, the maximum
GATE - 2002 | OS | In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on
GATE - 2002 | OS | Which combination of the following features will suffice to characterize
GATE - 2002 | OS | Which combination of the following features will suffice to characterize an OS as a multi-programmed OS? (a) More than one program may be loaded into the main memory
GATE - 2002 | OS | Dynamic linking can cause security concerns because
GATE - 2002 | OS | Dynamic linking can cause security concerns because Security is dynamic The path for searching dynamic libraries is not known till runtime Linking is insecure
GATE - 2002 | OS | The optimal page replacement algorithm will select the page that
GATE - 2002 | OS | The optimal page replacement algorithm will select the page that Has not been used for the longest time in the past. Will not be used for the longest time in the future.
GATE - 2002 | OS | Which of the following scheduling algorithms is non-preemptive?
GATE - 2002 | OS | Which of the following scheduling algorithms is non-preemptive? Round Robin First-In-First-Out Multilevel Queue Scheduling Multilevel Queue Scheduling with Feedback
GATE - 2003 | OS | Suppose we want to synchronize two concurrent processes
GATE - 2003 | OS | Suppose we want to synchronize two concurrent processes Which of the following will ensure that the output string never contains a substring of the form 01^n0 or 10^n1 where n is odd?
GATE - 2003 | OS | Suppose we want to synchronize two concurrent processes P and Q
GATE - 2003 | OS | Suppose we want to synchronize two concurrent processes P and Q using binary semaphores S and T. The code for the processes P and Q is shown below.
GATE - 2003 | OS | A processor uses 2-level page tables for virtual
GATE - 2003 | OS | A processor uses 2-level page tables for virtual two contiguous code pages starting at virtual address 0x00000000
GATE - 2003 | OS | A processor uses 2-level page tables for virtual to physical address
GATE - 2003 | OS | A processor uses 2-level page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory.
GATE - 2003 | OS | A uni-processor computer system only has two processes, both of
GATE - 2003 | OS | A uni-processor computer system only has two processes, both of which alternate 10 ms CPU bursts with 90 ms I/O bursts. Both the processes were created at nearly the same time.
GATE - 2003 | OS | In a system with 32 bit virtual addresses and 1KB page size, use of
GATE - 2003 | OS | In a system with 32 bit virtual addresses and 1KB page size, use of one-level page tables for virtual to physical address translation is not practical because of
GATE - 2004 | OS | Consider the following schedule S of transactions T1 and T2:
GATE - 2004 | OS | Consider the following schedule S of transactions T1 and T2: T1 T2 Read(A)A = A - 10 Read (A)Temp = 0.2*A Write(A) Read(B) Write(A)Read(B)
GATE - 2004 | OS | In a virtual memory system, size of virtual address is 32-bit, size of
GATE - 2004 | OS | In a virtual memory system, size of virtual address is 32-bit, size of physical address is 30-bit, page size is 4 Kbyte and size of each page table entry is 32-bit
GATE - 2004 | OS | The semaphore variables full, empty and mutex are initialized to 0, n
GATE - 2004 | OS | The semaphore variables full, empty and mutex are initialized to 0, n and 1, respectively. Process P1 repeatedly adds one item at a time to a buffer of size n
GATE - 2004 | OS | A process executes the following segment of code for(i = 1
GATE - 2004 | OS | A process executes the following segment of code for(i = 1; i < = n; i++) fork (); The number of new processes created is
GATE - 2004 | OS | In a certain operating system, deadlock prevention is attempted
GATE - 2004 | OS | In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp
GATE - 2004 | OS | A disk has 200 tracks (numbered 0 through 199). At a given time, it
GATE - 2004 | OS | A disk has 200 tracks (numbered 0 through 199). At a given time, it was servicing the request of reading data from track 120, and at the previous request
GATE - 2004 | OS | The storage area of a disk has innermost diameter of 10 cm and
GATE - 2004 | OS | The storage area of a disk has innermost diameter of 10 cm and outermost diameter of 20 cm. The maximum storage density of the disk is 1400 bits/cm.
GATE - 2004 | OS | In an enhancement of a design of a CPU, the speed of a floating-point
GATE - 2004 | OS | In an enhancement of a design of a CPU, the speed of a floating-point unit has been increased by 20% and the speed of a fixed point unit
GATE - 2004 | OS | A CPU has only three instructions I1, I2 and I3, which use the
GATE - 2004 | OS | A CPU has only three instructions I1, I2 and I3, which use the following signals in time steps T1-T5:
GATE - 2004 | OS | Consider a fully associative cache with 8 cache blocks (numbered 0-7)
GATE - 2004 | OS | Consider a fully associative cache with 8 cache blocks (numbered 0-7) and the following sequence of memory block requests: 4, 3, 25, 8, 19, 6, 25, 8, 16
GATE - 2004 | OS | Consider a pipeline processor with 4 stages s1 to s4. we want to
GATE - 2004 | OS | Consider a pipeline processor with 4 stages s1 to s4. we want to execute the following loop
GATE - 2004 | OS | Which one of the following is NOT shared by the threads of the same
GATE - 2004 | OS | Which one of the following is NOT shared by the threads of the same process?
GATE - 2004 | OS | What is the bit rate of a video terminal unit with 80 characters/line, 8
GATE - 2004 | OS | What is the bit rate of a video terminal unit with 80 characters/line, 8 bits/character and horizontal sweep time of lOOµs (including 20 µs of retrace time)?
GATE - 2004 | OS | A unix-style I-node has 10 direct pointers and one single, one double
GATE - 2004 | OS | A unix-style I-node has 10 direct pointers and one single, one double and one triple indirect pointers. Disk block size is 1 Kbyte, disk block address is 32 bits
GATE - 2004 | OS | Consider two processes P1 and P2 accessing the shared variables X
GATE - 2004 | OS | Consider two processes P1 and P2 accessing the shared variables X and Y protected by two binary semaphores SX and SY respectively
GATE - 2004 | OS | Consider a system with a two-level paging scheme in which a regular
GATE - 2004 | OS | Consider a system with a two-level paging scheme in which a regular memory access takes 150 nanoseconds, and servicing a page fault takes 8 milliseconds
GATE - 2004 | OS | Consider the following set of processes, with the arrival times and the
GATE - 2004 | OS | Consider the following set of processes, with the arrival times and the CPU-burst times given in milliseconds
GATE - 2004 | OS | The minimum number of page frames that must be allocated to a
GATE - 2004 | OS | The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by
GATE - 2004 | OS | Consider an operating system capable of loading and executing a
GATE - 2004 | OS | Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm
GATE - 2004 | OS | Consider the following statements with respect to user-level threads
GATE - 2004 | OS | Consider the following statements with respect to user-level threads and kernel supported threads
GATE - 2005 | OS | A disk has 8 equidistant tracks.
GATE - 2005 | OS | A disk has 8 equidistant tracks. The diameters of the innermost and outermost tracks are 1 cm and 8 cm respectively. The innermost track has a storage
GATE - 2005 | OS | A disk has 8 equidistant tracks. The diameters of the innermost and
GATE - 2005 | OS | A disk has 8 equidistant tracks. The diameters of the innermost and outermost tracks are 1 cm and 8 cm respectively. The innermost track has a storage capacity
GATE - 2005 | OS | Two shared resources R1 and R2 are used by processes P1 and P2.
GATE - 2005 | OS | Two shared resources R1 and R2 are used by processes P1 and P2. Each process has a certain priority for accessing each resource. Let Tij denote the priority
GATE - 2005 | OS | Consider a 2-way set associative cache memory with 4 sets and total
GATE - 2005 | OS | Consider a 2-way set associative cache memory with 4 sets and total 8 cache blocks (0-7) and a main memory with 128 blocks (0-127). What memory blocks
GATE - 2005 | OS | We wish to schedule three processes P1, P2 and P3 on a uniprocessor
GATE - 2005 | OS | We wish to schedule three processes P1, P2, and P3 on a uniprocessor system. The priorities, CPU time requirements, and arrival times of the processes
GATE - 2005 | OS | Two concurrent processes P1 and P2 use four shared resources R1
GATE - 2005 | OS | Two concurrent processes P1 and P2 use four shared resources R1, R2, R3, and R4, as shown below.
GATE - 2005 | OS | Given below is a program which when executed spawns two
GATE - 2005 | OS | Given below is a program which when executed spawns two concurrent processes : semaphore X : = 0 ; /* Process now forks into
GATE - 2005 | OS | Increasing the RAM of a computer typically improves performance
GATE - 2005 | OS | Increasing the RAM of a computer typically improves performance because Virtual memory increases Larger RAMs are faster
GATE - 2005 | OS | Normally user programs are prevented from handling I/O directly by
GATE - 2005 | OS | Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions
GATE - 2005 | OS | Consider the following code fragment if (fork() == 0)
GATE - 2005 | OS | Consider the following code fragment if (fork() == 0) Let u, v be the values printed by the parent process, and x, y be the
GATE - 2006 | OS | The wait and signal operations of a monitor are implemented using
GATE - 2006 | OS | The wait and signal operations of a monitor are implemented using semaphores as follows. In the following
GATE - 2006 | OS | For each of the four processes P1, P2, P3 and P4. The total size in
GATE - 2006 | OS | For each of the four processes P1, P2, P3 and P4. The total size in kilobytes (KB) and the number of segments are given below.
GATE - 2006 | OS | Consider the solution to the bounded buffer producer/consumer
GATE - 2006 | OS | Consider the solution to the bounded buffer producer/consumer problem by using general semaphores S, F, and E. The semaphore S is the mutual exclusion semaphore
GATE - 2006 | OS | The arrival time, priority, and duration of the CPU and I/O bursts for
GATE - 2006 | OS | The arrival time, priority, and duration of the CPU and I/O bursts for each of three processes P1, P2 and P3 are given in the table below. Each process has a CPU burst
GATE - 2006 | OS | The process state transition diagram of an operating system is as given
GATE - 2006 | OS | The process state transition diagram of an operating system is as given
GATE - 2006 | OS | In the working-set strategy, which of the following is done by the
GATE - 2006 | OS | In the working-set strategy, which of the following is done by the operating system to prevent thrashing? It initiates another process if there
GATE - 2006 | OS | A computer system supports 32-bit virtual addresses as well as 32-bit
GATE - 2006 | OS | A computer system supports 32-bit virtual addresses as well as 32-bit physical addresses. Since the virtual address space is of the same size as the physical address space
GATE - 2006 | OS | A CPU generates 32-bit virtual addresses. The page size is 4 KB.
GATE - 2006 | OS | A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB)
GATE - 2006 | OS | The atomic fetch-and-set x, y instruction unconditionally sets the
GATE - 2006 | OS | The atomic fetch-and-set x, y instruction unconditionally sets the memory location x to 1 and fetches the old value of x n y without allowing any intervening
GATE - 2006 | OS | Consider three processes (process id 0, 1, 2 respectively) with
GATE - 2006 | OS | Consider three processes (process id 0, 1, 2 respectively) with compute time bursts 2, 4 and 8 time units. All processes arrive at time zero.
GATE - 2006 | OS | Consider three processes, all arriving at time zero, with total
GATE - 2006 | OS | Consider three processes, all arriving at time zero, with total execution time of 10, 20 and 30 units, respectively. Each process spends the first 20% of execution time
GATE - 2006 | OS | Consider the following snapshot of a system running n processes.
GATE - 2006 | OS | Consider the following snapshot of a system running n processes. Process i is holding xi instances of a resource R, 1 ≤ i ≤ n. Currently, all instances of R are occupied.
GATE - 2006 | OS | Barrier is a synchronization construct where a set of processes synchronizes
GATE - 2006 | OS | Barrier is a synchronization construct where a set of processes synchronizes globally i.e. each process in the set arrives at the barrier and waits for all others to arrive
GATE - 2006 | OS | Barrier is a synchronization construct where a set of processes
GATE - 2006 | OS | Barrier is a synchronization construct where a set of processes synchronizes globally i.e. each process in the set arrives at the barrier and waits
GATE - 2006 | OS | Consider three CPU-intensive processes, which require 10, 20 and 30
GATE - 2006 | OS | Consider three CPU-intensive processes, which require 10, 20 and 30 time units and arrive at times 0, 2 and 6, respectively. How many context switches
GATE - 2007 | OS | The head of a hard disk serves requests following the SSTF
GATE - 2007 | OS | The head of a hard disk serves requests following the SSTF the head changes its direction after servicing every request if the total number of tracks are 2048
GATE - 2007 | OS | The head of a hard disk serves requests following the shortest seek
GATE - 2007 | OS | The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. The head is initially positioned at track number 180.
GATE - 2007 | OS | A demand paging system takes 100 time units to service a page fault
GATE - 2007 | OS | A demand paging system takes 100 time units to service a page fault and 300 time units to replace a dirty page. Memory access time is 1 time unit.
GATE - 2007 | OS | Consider n jobs J1, J2,......Jn such that job Ji has execution time
GATE - 2007 | OS | Consider n jobs J1, J2,......Jn such that job Ji has execution time ti and a non-negative integer weight wi. The weighted mean completion time of the jobs is defined to be
GATE - 2007 | OS | The address sequence generated by tracing a particular program
GATE - 2007 | OS | The address sequence generated by tracing a particular program executing in a pure demand paging system with 100 bytes per page is 0100, 0200, 0430, 0499
GATE - 2007 | OS | Let a memory have four free blocks of sizes 4k, 8k, 20k, 2k. These
GATE - 2007 | OS | Let a memory have four free blocks of sizes 4k, 8k, 20k, 2k. These blocks are allocated following the best-fit strategy. The allocation requests are stored in a queue as shown below.
GATE - 2007 | OS | Processes P1 and P2 use critical_flag in the following routine to
GATE - 2007 | OS | Processes P1 and P2 use critical_flag in the following routine to achieve mutual exclusion. Assume that critical_flag is initialized to FALSE in the main program.
GATE - 2007 | OS | A process has been allocated 3 page frames. Assume that none of the
GATE - 2007 | OS | A process has been allocated 3 page frames. Assume that none of the pages of the process are available in the memory initially. The process makes the following sequence
GATE - 2007 | OS | Two processes, P1 and P2, need to access a critical section of code.
GATE - 2007 | OS | Two processes, P1 and P2, need to access a critical section of code.
GATE - 2007 | OS | A single processor system has three resource types X, Y, and Z, which
GATE - 2007 | OS | A single processor system has three resource types X, Y, and Z, which are shared by three processes. There are 5 units of each resource type.
GATE - 2007 | OS | A virtual memory system uses First In First Out (FIFO) page replacement
GATE - 2007 | OS | A virtual memory system uses First In First Out (FIFO) page replacement policy and allocates a fixed number of frames to a process. Consider the following statements:
GATE - 2007 | OS | An operating system uses Shortest Remaining Time First (SRT)
GATE - 2007 | OS | An operating system uses Shortest Remaining Time First (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes:
GATE - 2007 | OS | Consider the following statements about user level threads and kernel
GATE - 2007 | OS | Consider the following statements about user level threads and kernel level threads. Which one of the following statements is FALSE?
GATE - 2007 | OS | Group 1 contains some CPU scheduling algorithms and Group 2
GATE - 2007 | OS | Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2.
GATE - 2008 | OS | Match the following flag bits used in the context of virtual memory
GATE - 2008 | OS | Match the following flag bits used in the context of virtual memory management on the left side with the different purposes on the right side of the table below.
GATE - 2008 | OS | If the time-slice used in the round-robin scheduling policy is more than
GATE - 2008 | OS | If the time-slice used in the round-robin scheduling policy is more than the maximum time required to execute any process
GATE - 2008 | OS | An operating system implements a policy that requires a process to
GATE - 2008 | OS | An operating system implements a policy that requires a process to release all resources before making a request for another resource. Select the TRUE statement
GATE - 2008 | OS | The following is a code with two threads, producer and consumer
GATE - 2008 | OS | The following is a code with two threads, producer and consumer, that can run in parallel. Further, S and Q are binary semaphores equipped with the standard
GATE - 2008 | OS | A processor uses 36 bit physical addresses and 32 bit virtual addresses
GATE - 2008 | OS | A processor uses 36 bit physical addresses and 32 bit virtual addresses with a page frame size of 4 Kbytes. Each page table entry is of size 4 bytes.
GATE - 2008 | OS | A process executes the following code for (i =0; i < n; i + +) for ( )
GATE - 2008 | OS | A process executes the following code for (i =0; i < n; i + +) for ( ); The total number of child processes created is
GATE - 2008 | OS | Which of the following is NOT true of deadlock prevention and deadlock
GATE - 2008 | OS | Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes?
GATE - 2008 | OS | Which of the following statements about synchronous and asynchronous
GATE - 2008 | OS | Which of the following statements about synchronous and asynchronous I/O is NOT true?
GATE - 2008 | OS | The P and V operations on counting semaphores, where s is a counting
GATE - 2008 | OS | The P and V operations on counting semaphores, where s is a counting semaphore, are defined as follows:
GATE - 2008 | OS | The data blocks of a very large file in the Unix file system are allocated using
GATE - 2008 | OS | The data blocks of a very large file in the Unix file system are allocated using contiguous allocation linked allocation indexed allocation an extension of indexed allocation
GATE - 2009 | OS | A multilevel page table is preferred in comparison to a single level page
GATE - 2009 | OS | A multilevel page table is preferred in comparison to a single-level page table for translating virtual addresses to physical addresses because
GATE - 2009 | OS | The enter_CS() and leave_CS() functions to implement critical section of
GATE - 2009 | OS | The enter_CS() and leave_CS() functions to implement critical section of a process are realized using test-and-set instruction as follows:
GATE - 2009 | OS | In the following process state transition diagram for a uniprocessor system
GATE - 2009 | OS | In the following process state transition diagram for a uniprocessor system, assume that there are always some processes in the ready state:
GATE - 2009 | OS | Consider a disk system with 100 cylinders. The requests to access the
GATE - 2009 | OS | Consider a disk system with 100 cylinders. The requests to access the cylinders occur in the following sequence: 4, 34, 10, 7, 19, 73, 2, 15, 6, 20 Assuming that the
GATE - 2009 | OS | The essential content(s) in each entry of a page table is / are
GATE - 2009 | OS | The essential content(s) in each entry of a page table is / are
GATE - 2009 | OS | In which one of the following page replacement policies, Belady’s anomaly
GATE - 2009 | OS | In which one of the following page replacement policies, Belady’s anomaly may occur?
GATE - 2010 | OS | A system has n resources R0,...,Rn-1,and k processes P0,....Pk-1.
GATE - 2010 | OS | A system has n resources R0,...,Rn-1,and k processes P0,....Pk-1. The implementation of the resource request logic of each process Pi is as follows:
GATE - 2010 | OS | The following program consists of 3 concurrent processes and 3 binary
GATE - 2010 | OS | The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 = 1, S1 = 0, S2 = 0.
GATE - 2010 | OS | A system uses FIFO policy for page replacement. It has 4 page frames with
GATE - 2010 | OS | A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 100 distinct pages in some
GATE - 2010 | OS | Consider the methods used by processes P1 and P2 for accessing their critical
GATE - 2010 | OS | Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables
GATE - 2010 | OS | Which of the following statements are true? Shortest remaining time first
GATE - 2010 | OS | Which of the following statements are true? Shortest remaining time first scheduling may cause starvation Preemptive scheduling may cause starvation
GATE - 2011 | OS | Consider the following table of arrival time and burst time for three processes
GATE - 2011 | OS | Consider the following table of arrival time and burst time for three processes P0, P1, and P2. The pre-emptive shortest job first scheduling algorithm is used.
GATE - 2011 | OS | Let the time taken to switch between user and kernel modes of execution be t1
GATE - 2011 | OS | Let the time taken to switch between user and kernel modes of execution be t1 while the time taken to switch between two processes be t2. Which of the following is TRUE?
GATE - 2011 | OS | A thread is usually defined as a "light weight process" because an operating
GATE - 2011 | OS | A thread is usually defined as a "light weight process" because an operating system (OS) maintains smaller data structures for a thread than for a process.
GATE - 2011 | OS | Let the page fault service time to 10 ms in a computer with average memory
GATE - 2011 | OS | Let the page fault service time to 10 ms in a computer with average memory access time being 20 ns. If one page fault is generated for every 106 memory accesses
GATE - 2012 | OS | Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 On
GATE - 2012 | OS | Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 On a demand paged virtual memory system running on a computer system that main memory size of 3 pages
GATE - 2012 | OS | A file system with 300 GByte disk uses a file descriptor with 8 direct
GATE - 2012 | OS | A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1 indirect block address and 1 doubly indirect block address. The size of each
GATE - 2012 | OS | Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads
GATE - 2012 | OS | Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location X, increments it by the value i, and returns the old value of X. It is used
GATE - 2012 | OS | Consider the 3 processes, P1, P2 and P3 shown in the table.
GATE - 2012 | OS | Consider the 3 processes, P1, P2 and P3 shown in the table. Process Arrival time Time Units Required P1 0 5 P2 1 7 The completion order of the 3 processes under
GATE - 2012 | OS | A process executes the code fork(); fork(); fork(); The total number of child
GATE - 2012 | OS | A process executes the code fork(); fork(); fork(); The total number of child processes created is
GATE - 2013 | OS | A computer uses 46-bit virtual address, 32-bit physical address
GATE - 2013 | OS | A computer uses 46-bit virtual address, 32-bit physical address, and a three-level paged page table organization. The page table base register stores
![GATE - 2013 | OS | A certain computation generates two arrays a and b such that a[i]=f(i)](https://res.cloudinary.com/dctkncnc5/image/upload/v1644652479/2022-02-12_13_24_11-GATE___GATE_CS_2013_dewqa3.png)
GATE - 2013 | OS | A certain computation generates two arrays a and b such that a[i]=f(i)
GATE - 2013 | OS | A certain computation generates two arrays a and b such that a[i]=f(i) for 0 ≤ i < n and b[i]=g(a[i]) for 0 ≤ i < n. Suppose this computation is decomposed into two
GATE - 2013 | OS | A shared variable x, initialized to zero, is operated on by four concurrent
GATE - 2013 | OS | A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments
GATE - 2013 | OS | Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders
GATE - 2013 | OS | Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383) and each cylinder contains 64 sectors (0-63). Data storage capacity in each sector is 512 bytes.
GATE - 2013 | OS | Three concurrent processes X, Y, and Z execute three different code segments
GATE - 2013 | OS | Three concurrent processes X, Y, and Z execute three different code segments that access and update certain shared variables. Process X executes the P operation (i.e., wait)
GATE - 2013 | OS | A scheduling algorithm assigns priority proportional to the waiting time
GATE - 2013 | OS | A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the
GATE - 2014 | OS | The memory access time is 1 nanosecond for a read operation with a hit in
GATE - 2014 | OS | The memory access time is 1 nanosecond for a read operation with a hit in cache, 5 nanoseconds for a read operation with a miss in cache, 2 nanoseconds for a
GATE - 2014 | OS | Consider a paging hardware with a TLB. Assume that the entire page table
GATE - 2014 | OS | Consider a paging hardware with a TLB. Assume that the entire page table and all the pages are in the physical memory. It takes 10 milliseconds to search the TLB and 80 milliseconds
GATE - 2014 | OS | An operating system uses shortest remaining time first scheduling
GATE - 2014 | OS | An operating system uses shortest remaining time first scheduling algorithm for pre-emptive scheduling of processes. Consider the following set of processes with
GATE - 2014 | OS | Consider the basic block given below. a = b + c c = a + d
GATE - 2014 | OS | Consider the basic block given below. a = b + c c = a + d d = b + c e = d - b a = e + b The minimum number of nodes and edges present in the DAG representation
GATE - 2014 | OS | A system contains three programs and each requires three tape
GATE - 2014 | OS | A system contains three programs and each requires three tape units for its operation. The minimum number of tape units which the system must have such that
GATE - 2014 | OS | A computer has twenty physical page frames which contain pages
GATE - 2014 | OS | A computer has twenty physical page frames which contain pages numbered 101 through 120. Now a program accesses the pages numbered 1, 2, …, 100 in that order
GATE - 2014 | OS | Three processes A, B and C each execute a loop of 100 iterations. In each
GATE - 2014 | OS | Three processes A, B and C each execute a loop of 100 iterations. In each iteration of the loop, a process performs a single computation that requires tc CPU milliseconds
GATE - 2014 | OS | Consider the procedure below for the Producer-Consumer problem which
GATE - 2014 | OS | Consider the procedure below for the Producer-Consumer problem which uses semaphores: Which one of the following is TRUE?
GATE - 2014 | OS | A FAT (file allocation table) based file system is being used and the total
GATE - 2014 | OS | A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is 4 bytes in size. Given a 100 × 106 bytes disk on which the file system
GATE - 2014 | OS | Assume that there are 3 page frames which are initially empty. If the page
GATE - 2014 | OS | Assume that there are 3 page frames which are initially empty. If the page reference string is 1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6, the number of page faults using the optimal
GATE - 2014 | OS | Consider the following set of processes that need to be scheduled on a single
GATE - 2014 | OS | Consider the following set of processes that need to be scheduled on a single CPU. All the times are given in milliseconds.
GATE - 2014 | OS | An operating system uses the Banker’s algorithm for deadlock avoidance
GATE - 2014 | OS | An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes
GATE - 2014 | OS | Which one of the following is FALSE? User-level threads are not
GATE - 2014 | OS | Which one of the following is FALSE? User-level threads are not scheduled by the kernel. When a user-level thread is blocked, all other threads of its process are blocked
GATE - 2014 | OS | Suppose a disk has 201 cylinders, numbered from 0 to 200. At some
GATE - 2014 | OS | Suppose a disk has 201 cylinders, numbered from 0 to 200. At some time the disk arm is at cylinder 100, and there is a queue of disk access requests for cylinders 30
GATE - 2015 | OS | For the processes listed in the following table, which of the following
GATE - 2015 | OS | For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?
GATE - 2015 | OS | Consider the following policies for preventing deadlock in a system with mutually
GATE - 2015 | OS | Consider the following policies for preventing deadlock in a system with mutually exclusive resources. I. Processes should acquire all their resources at the beginning of execution.
GATE - 2015 | OS | The maximum number of processes that can be in Ready state for a computer
GATE - 2015 | OS | The maximum number of processes that can be in Ready state for a computer system with n CPUs is n n2 2n Independent of n
GATE - 2015 | OS | A computer system implements 8 kilobyte pages and a 32-bit physical address
GATE - 2015 | OS | A computer system implements 8 kilobyte pages and a 32-bit physical address space. Each page table entry contains a valid bit, a dirty bit, three permission bits, and the translation.
GATE - 2015 | OS | A computer system implements a 40-bit virtual address, page size of 8 kilobytes
GATE - 2015 | OS | A computer system implements a 40-bit virtual address, page size of 8 kilobytes, and a 128-entry translation look-aside buffer (TLB organized into 32 sets each having four ways.
GATE - 2015 | OS | A system has 6 identical resources and N processes competing for them.
GATE - 2015 | OS | A system has 6 identical resources and N processes competing for them. Each process can request at most 2 resources. Which one of the following values of N could lead to a deadlock?
GATE - 2015 | OS | Consider a main memory with five page frames and the following sequence
GATE - 2015 | OS | Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true
GATE - 2015 | OS | Suppose the following disk request sequence (track numbers)
GATE - 2015 | OS | Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position
GATE - 2015 | OS | Consider a uniprocessor system executing three tasks T1, T2, and T3, each of which is composed of an infinite sequence of jobs (or instances)
GATE - 2015 | OS | Consider a uniprocessor system executing three tasks T1, T2, and T3, each of which is composed of an infinite sequence of jobs (or instances)
GATE - 2015 | OS | The following two functions P1 and P2 that share a variable B with
GATE - 2015 | OS | The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently.
GATE - 2016 | OS | Consider a non-negative counting semaphore S. The operation P(S)
GATE - 2016 | OS | Consider a non-negative counting semaphore S. The operation P(S) decrements S, and V(S) increments S. During an execution, 20 P(S) operations and 12 V(S) operations
GATE - 2016 | OS | Consider the following two-process synchronization solution. Process
GATE - 2016 | OS | Consider the following two-process synchronization solution. Process 0 Process 1 Entry: loop while (turn == 1); Entry: loop while (turn == 0); (critical section)
GATE - 2016 | OS | Consider the following processes, with the arrival time and the length
GATE - 2016 | OS | Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive
GATE - 2016 | OS | In which one of the following page replacement algorithms
GATE - 2016 | OS | In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number of allocated frames increases?
GATE - 2016 | OS | Consider the following proposed solution for the critical section problem
GATE - 2016 | OS | Consider the following proposed solution for the critical section problem. There are n processes: P0...P(n-1). In the code, function pmax returns an integer not
GATE - 2016 | OS | Consider a computer system with ten physical page frames.
GATE - 2016 | OS | Consider a computer system with ten physical page frames. The system is provided with an access sequence (a1,a2,…,a20,a1,a2,…,a20), where each ai is a
GATE - 2016 | OS | Consider a disk queue with requests for I/O to blocks on cylinders 47
GATE - 2016 | OS | Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially
GATE - 2016 | OS | Consider a computer system with 40-bit virtual addressing and a page
GATE - 2016 | OS | Consider a computer system with 40-bit virtual addressing and a page size of sixteen kilobytes. If the computer system has a one-level page table per process
GATE - 2016 | OS | Consider an arbitrary set of CPU-bound processes with unequal CPU
GATE - 2016 | OS | Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system.
GATE - 2017 | OS | Consider the set of processes with arrival time (in milliseconds)
GATE - 2017 | OS | Consider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds), and priority (0 is the highest priority)
GATE - 2017 | OS | A system shares 9 tape drives. The current allocation and maximum
GATE - 2017 | OS | A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below:
GATE - 2017 | OS | In a file allocation system, which of the following allocation scheme(s)
GATE - 2017 | OS | In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed?
GATE - 2017 | OS | Which of the following is/are shared by all the threads in a process?
GATE - 2017 | OS | Which of the following is/are shared by all the threads in a process? I. Program counter II. Stack III. Address space IV. Registers
GATE - 2017 | OS | Recall that Belady’s anomaly is that the page-fault rate may increase
GATE - 2017 | OS | Recall that Belady’s anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements:
GATE - 2017 | OS | A multithreaded program P executes with x number of threads and used
GATE - 2017 | OS | A multithreaded program P executes with x number of threads and used y number of locks for ensuring mutual exclusion while operating on shared memory locations.
GATE - 2017 | OS | Consider the following CPU processes with arrival times
GATE - 2017 | OS | Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below: If the pre-emptive shortest remaining time
GATE - 2017 | OS | Threads of a process share
GATE - 2017 | OS | Threads of a process share global variables but not heap. heap but not global variables. neither global variables nor heap. both heap and global variables.
GATE - 2018 | OS | In a system, there are three types of resources: E, F and G. Four
GATE - 2018 | OS | In a system, there are three types of resources: E, F and G. Four processes P0, P1, P2 and P3 execute concurrently. At the outset, the processes have declared their maximum
GATE - 2018 | OS | Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3)
GATE - 2018 | OS | Consider a storage disk with 4 platters (numbered as 0, 1, 2 and 3) 200 cylinders (numbered as 0, 1, … , 199), and 256 sectors per track (numbered as 0, 1, … 255).
GATE - 2018 | OS | Consider the following solution to the producer-consumer synchronization
GATE - 2018 | OS | Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is N. Three semaphores empty, full and mutex are defined
GATE - 2018 | OS | Consider a system with 3 processes that share 4 instances of the same
GATE - 2018 | OS | Consider a system with 3 processes that share 4 instances of the same resource type. Each process can request a maximum of K instances. Resource instances can be requested
GATE - 2018 | OS | Consider a process executing on an operating system that uses demand paging
GATE - 2018 Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is M units if the corresponding memory page
GATE - 2020 | OS | Consider a paging system that uses a 1-level page table residing in main
GATE - 2020 | Consider a paging system that uses a 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.
GATE - 2020 | OS | Consider the following five disk access requests of the form
GATE - 2020 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)
GATE - 2020 | OS | Each of a set of n processes executes the following code using two semaphores
GATE - 2020 Each of a set of n processes executes the following code using two semaphores a and b initialized to 1 and 0, respectively. Assume that count is a shared variable initialized
GATE - 2020 | OS | Consider the following set of processes, assumed to have arrived at time 0.
GATE - 2020 Consider the following set of processes, assumed to have arrived at time 0. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR, assume
GATE - 2020 | OS | Consider the following statements about process state transitions for a system
Consider the following statements about process state transitions for a system using preemptive scheduling. I. A running process can move to ready state. II. A ready process can move to ready state.
GATE - 2020 | Consider allocation of memory to a new process. Assume that
GATE - 2020 | 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.
GATE - 2019 | Consider the following snapshot of a system running n concurrent processes. Process i
GATE - 2019 | Consider the following snapshot of a system running n concurrent processes. Process i is holding Xi instances of a resource R, 1 ≤ i ≤ n. Assume that all instances of R
GATE - 2019 | The index node (inode) of a Unix-like file system has 12 direct, one single-indirect
GATE - 2019 | The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers. The disk block size is 4 kB, and the disk block address is
GATE - 2019 | Consider the following four processes with arrival times (in milliseconds)
GATE - 2019 | Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below:
GATE - 2019 | Assume that in a certain computer, the virtual addresses are 64 bits long
GATE - 2019 | Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable.
GATE - 2019 | The following C program is executed on a Unix/Linux system:
GATE - 2019 The following C program is executed on a Unix/Linux system: #include <unistd.h>. int main ( ) ... int i;. for (i = 0; i < 10; i++). if (i % 2 = = 0) fork ( );. The total number of child processes created is
GATE - 2019 | Consider three concurrent processes P1, P2 and P3 as shown below
GATE - 2019 Consider three concurrent processes P1, P2 and P3 as shown below, which access a shared variable D that has been initialized to 100.