What is thrashing? How it can be controlled?
In this post we are discussing about What is thrashing? How it can be controlled? Thrashing is a phenomenon that occurs in computer systems, particularly in virtual memory systems, when…
Category PYQ’s
Explain the various access methods of files.
In this post we are discussing about Explain the various access methods of files. Access methods in file systems refer to the techniques and strategies used to read and write…
Illustrate how demand paging affects system performance
In this post we are discussing about Illustrate how demand paging affects system performance demand paging affects system performance:-
With a suitable example explain any two methods of implementation of the free space list
In this post we are discussing about With a suitable example explain any two methods of implementation of the free space list i] Bit Vector :- ii] Linked List :…
Explain the various operations performed on files
In this post we are discussing about Explain the various operations performed on files
Consider the following page reference string find LRU and Optimal algorithm note that initially all frames are empty.
In this post we are discussing Consider the following page reference string [ 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1,2,0,1,7,0,1 ] Assuming there…
Explain in detail the components of a Linux operating system
with a neat diagram, Explain in detail the components of a Linux operating system Answer:- Like most UNIX implementations, Linux is composed of three main bodies ofcode; the most important…
Hamiltonian cycle problem
12. Apply backtracking to the problem of finding a Hamiltonian circuit in the graph shown below: Answer:
Hamiltonian cycle problem
11. Define Hamiltonian cycle. Check whether the Hamiltonian cycle exists for the graph given below. Answer:
Backtracking technique to solve the below instance of the subset sum problem.
9. Apply backtracking technique to solve the below instance of the subset sum problem. S={1,3,4,6} d=7 S={5, 10, 12, 13, 15, 18} d=30 Answer: