To copy dir3 to dir4 including sub-directories.
See Answer →Use the cat command, and display all the .txt files in the current directory on the screen at one go.
See Answer →Task Scheduler
See Answer →Backup and Restore feature
See Answer →Disk Defragmenter
See Answer →Windows Defender
See Answer →Use the following system maintenance tools:
See Answer →Resolving a Driver Problem Using Recovery Boot Options.
See Answer →: For the following given tasks of Windows 10, write the step-by-step procedure as well as
attach the main screen shots:
(a) Use Cortana.
(b) Configure a printer.
(c) To update the windows operating system with latest updates.
(d) Configure the appearance of Windows,
(e) Arrange the Start Menu and Task bar to your liking and personalize the privacy
settings.
(f) Work with Network and Sharing center
(g) Scheduling file backups.
Write about the features of LuneOS. Also, discuss the process management, memory management and security management functions of LuneOS Mobile Operating System(GNU-General Public Licence
See Answer →Discuss in detail the Process Management, Memory management, I/O management, File management and Security and Protection in WINDOWS 11 Operating System
See Answer →Write a program in C to implement Banker’s Algorithm to avoid Deadlock. Also explain the code briefly.
See Answer →On a disk with 1000 cylinders, numbers 0 to 999, compute the number of tracks the disk arm must move
to satisfy all the requests in the disk queue. Assume that the head is initially at cylinder 123. Suppose the
requests have arrived, forming the following disk queue:123, 874, 692, 475, 105,
376, 499, 542, 789, 645, 12, 923
(i) Perform the computation for the following disk scheduling algorithms:
(a) FCFS (b) SSTF (c) SCAN (d) LOOK
(ii) Depict the corresponding schemes in the form of a diagram.
FIFO replacement b. LRU replacement c. Optimal Mention the merits and demerits of each of the above algorithms.
See Answer →Consider the following page-reference string:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6
How many page faults would occur for the following replacement algorithms, assuming three frames?
Remember all frames are initially empty
Which of the schedules in (a) results in minimal average waiting time (overall processes)?
See Answer →What is the waiting time of each process for each of the scheduling algorithm in
See Answer →What is the turnaround time of each process for each of the scheduling algorithm in (a)?
See Answer →Draw corresponding Gantt charts illustrating the execution of these processes using FCFS, SJF,
SRTN, Priority based scheduling/even-driven scheduling and Round Robin (quantum=2) scheduling
algorithms
The processes are assumed to have arrived in the order P1, P2, P3, P4 and P5 and
See Answer →