Linux Command Line Basics Quiz

Command Purpose

• The 'LS' command is used to list files and directories in the current directory.
• The 'RMDIR' command is used to remove a directory.
• The 'MKDIR' command is used to create a directory inside another directory.
• The 'CD' command does not have a '-' version; the 'CD' command is used to change the current directory.

Deadlocks

• A common cause of deadlocks in operating systems is the mutual exclusion of resources.
• One way to resolve a deadlock in the context of bridge crossing in traffic is to let one side go first and then the other.
• A computer resource in the context of deadlocks refers to CPU time, memory, I/O devices, etc.
• The sequence of events required to use a resource regarding process executions is: request, allocate, use, and release.
• The condition that is NOT necessary for a deadlock to occur is 'No Mutual Exclusion'.

Deadlock Conditions

• 'No Preemption' in the context of deadlocks in operating systems refers to the inability to take a resource away from a process once it has been allocated.
• The Banker’s Algorithm is used to avoid deadlocks in operating systems by preventing a system from entering an unsafe state.
• The method that is NOT a method for deadlock avoidance in operating systems is 'Resource Preemption'.
• A 'safe state' in the context of deadlock avoidance is a state where it is possible to allocate resources to processes without causing a deadlock.
• The main characteristic of the 'Hold and Wait' condition in the context of deadlocks is that a process is holding a resource and waiting for another resource.
• The condition of 'Mutual Exclusion' in the context of deadlocks is a state where only one process can use a resource at a time.
• 'No Preemption' leads to deadlocks because it prevents resources from being taken away from processes.
• A deadlock occurs when four conditions are met simultaneously: Mutual Exclusion, Hold and Wait, No Preemption, and Circular Wait.
• The term that refers to the situation where a set of waiting processes each hold a resource that is requested by another waiting process in the set is a 'Deadlock'.