Operating System

All of the above are known as the file attributes. So, according to the question, this is the correct answer.

There are four conditions which must hold simultaneously for a deadlock to occur. These conditions are as follows:

1. Mutual exclusion
2. Hold and wait
3. No preemption
4. Circular wait

All of the given schedulers are present in an operating system. So, this is the correct choice.

This is the correct choice.

There are 9 types of scheduling algorithms:
• First-come, first-served scheduling (FCFS) algorithm
• Shortest Job First scheduling (SJF) algorithm
• Shortest Remaining time (SRT) algorithm
• Non-preemptive priority scheduling algorithm
• Preemptive priority scheduling algorithm
• Round-Robin scheduling algorithm
• Highest Response Ratio Next (HRRN) algorithm
• Multilevel Feedback Queue scheduling algorithm
• Multilevel Queue scheduling algorithm

The state of the process is defined by the current activity of the process, which may be as follows:
(1) New - new process created
(2) Running - instructions are being executed
(3) Waiting - waiting for some input output
(4) Ready - process waiting to be assigned to a processor
(5) Terminated - process finished

There are 3 types of file allocation methods in an operating system. These are:

1. Contiguous allocation
2. Linked allocation
3. Indexed allocation

This is the correct answer because there are only 6 disk scheduling algorithms in operating system. These are:
First Come-First Serve (FCFS)
Shortest Seek Time First (SSTF)
Elevator (SCAN)
Circular SCAN (C-SCAN)
LOOK
C-LOOK

We are using first come first serve disk scheduling and the disk is at 53 initially. It will then move to 98, then 98 to 183, 183 to 37, 37 to 122, 122 to 14 and so on till 65 to 67. So, the disk movements will be
98 - 53 = 45, 183 - 98 = 85, 183 - 37 = 146, 122 - 37 = 85, 122 - 14 = 108, 124 - 14 = 110, 124 - 65 = 59, 67 - 65 = 2.
Now adding all the results 45 + 85 + 146 + 85 + 108 + 110 + 59 + 2 = 640

This is correct  because shortest seek time first algorithm selects the request with the minimum seek time from the current head position. So, the movement of disk from current position 53 will be like this -
53 -> 65 -> 67 -> 37 -> 14 -> 98 -> 122 -> 124 -> 183.
So, total head movement will be -
65 – 53 = 12
67 - 65 = 2
37 - 67 = 30
37 - 14  = 23
98 -14 = 84
122 - 98 = 24
124 -122 = 2
183 -124 = 59
Total = 12 + 2 + 30 + 23 + 84 + 24 + 2 + 59 = 236 cylinders  
So, this is correct answer.

The formula to calculate the physical address is: Physical address = Logical address + Relocation register value
So physical address is = 346 + 14000 =14346
So, this is the correct answer.

There are 5 types of directory structures in an operating system. These are: 1.) Single level directory structure 2.) Two level directory structure 3.) Tree level directory 4.) Acyclic directory 5.) General graph directory

Yes, it is correct. There is no technique used named index in page replacement. Index technique is used for file allocation methods. 

The formula to calculate the need matrix is - Need = Max - Allocation. But we are given max and need matrices, so the formula to calculate allocation will be - Allocation = Max - Need. So, Max matrix Need Matrix A B C A B C A B C 75 3 - 7 4 3 = 0 1 0, 3 2 2 - 1 2 2 = 2 0 0, 9 0 2 - 6 0 0 = 3 0 2, 2 2 2 - 0 1 1 = 2 1 1, 4 3 3 - 4 3 1 = 0 0 2. Hence, the correct answer is - Allocation matrix A B C 0 1 0 2 0 0 3 0 2 2 1 1 2 1 1 0 0 2.

None of the given algorithms are used in deadlock detection. So, this is the correct answer.