CBSE NET 2004
OPERATING SYSTEM QUESTION
In which of the following storage replacement strategies, is a program placed in the largest available hole in the memory?
(A) Best fit
(B) First fit
(C) Worst fit
(D) Buddy
Ans :- C
Explanation
First-fit, best-fit and worst-fit are the most common strategies used to select a free hole from the set of available holes.
First-fit : allocate the first hole that is big enough.
Best-fit : Allocate the smallest hole that is big enough.
Worst-fit : Allocate the largest hole.
For more info please visit Operating System section in this website.
Related posts:
- CBSE NET 2004 38
- Cbse net 2004
- CBSE Net 2017
- Ugc net 2017 solved
- NET 4
- NET 1
- Net 28
- Net 26
- Net 50
- Net 49
- Net 48
- Net 46
- Net 44
- Net 40
- Net 39
- Operating System: A List of Video Lectures RGPV Notes
- GATE, Context switch calculation in SRTF algorithm | Prof. Jayesh Umre
- Net 42
- Introduction to Operating Systems
- Different Types of OS
- Characteristics and features of an OS
- Operating sytems services
- System Calls in OS
- File Systems
- How many page faults
- Process State Diagram
- Operating System Scheduler
- FIFO page replacement algorithm
- LRU page replacement algorithms
- Optimal page replacement algorithm
- SRTF shortest remaining time first
- OS 4
- OS 3
- Os 2
- Os 1
- Net 14
- Net 13
- Net 12
- Net 11
- Net 10
- Net 9
- Net 9
- Net 8
- Net 7
- Net 6
- Net 5
- NET 3
- NET 2
- Net 35
- Net 34
- Net 33
- Net 32
- Net 31
- Net 29
- Net 30
- Net 27
- Net 52
- Net 51
- Net 47
- Net 45
- Net 43
- Net 41
- Net 38
- Net 37
- Net 36
- UGC NET November 2017 Paper II
- GATE, Longest Remaining Time First Algorithm | Prof. Jayesh Umre
- GATE SRTF | What is the total waiting time for process P2?
- GATE Calculate Total Waiting Time SRTF algorithm | Prof. Jayesh Umre
- Memory management
- Concept of Threads
- Process concept
- Directory Structure OS
- Contiguous disk space allocation method
- File systems
- Types of os
- Evolution of os
- Functions of os
- Why is operating system a mandatory software?
- UGC NET CS Paper 2 June 2012
- Readers Writes Problem | UGC NET Dec 2018
- Suppose a system has 12 instances | UGC NET Dec 2018
- Data warehouse | UGC NET Dec 2018
- Bankers algorithm problems
- Diploma Linux Unit 3
- RGPV Diploma Linnux Unit 2
- Program to print string in reverse order
- Program to implement while loop in Linux
- Program to implement for loop using sequence keyword in Liux
- Program to implement different types of increment in Linux
- For loop without in keyword in Linux
- Program to implement for loop using in keyword in Linux
- Multiple Processor Scheduling
- What do you mean by Virtual Memory? Write down its advantages?
- Compare Paging and Segmentation?
- What is Process Scheduling, CPU Scheduling, Disk Scheduling? Explain Short, Medium and Long term Scheduler?
- Explain concept of a process with its components ?
- Explain the following in brief Contiguous and Linked list allocation for implementing file system?
- Explain various Disk scheduling algorithms with Illustrations ?
- Define process and thread. What is PCB ? Explain its various entries with their usefulness ?
- Discuss advantages and disadvantages of the Buffer cache ?
- Explain different types of OS with examples of each ?
- What is an Operating System? Write down its desirable characteristics ?
- Define a deadlock ? Write down the conditions responsible for deadlock? How can we recover from deadlock ?
- What are the various services provided by Operating system ?
- What do you mean by PCB? Where is it used? What are its contents? Explain.
- What is Binary and Counting semaphores ?
- What is File? What are the different File attribute and operations?
- What are System call? Explain briefly about various types of system call provided by an Operating System?
- Describe necessary conditions for deadlocks situation to arise.
- What are points to be consider in file system design? Explain linked list allocation in detail?
- Write a Semaphore solution for dining Philosopher’s problem?
- Consider the following page reference string:1,2,3,4,5,3,4,1,2,7,8,7,8,9,7,8,9,5,4,5. How many page faults would occur for the following replacement algorithm, assuming four frames:a) FIFOb) LRU
- Explain CPU schedulers in operating system?
- Write the different state of a process with the help of Process state deagram?
- What is Mutex in operating system?
- Explain Network operating system?
- What do you mean by paging in operating system ?