Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Questions | Answers | Discussions | Knowledge sharing | Communities & more.
Interprocess communication
Inter-process communication (IPC) is a mechanism that allows processes to communicate with each other and synchronize their actions. The communication between these processes can be seen as a method of co-operation between them. Processes can communicate with each other through both: Shared Memory.Read more
Inter-process communication (IPC) is a mechanism that allows processes to communicate with each other and synchronize their actions. The communication between these processes can be seen as a method of co-operation between them. Processes can communicate with each other through both: Shared Memory. Message passing.
See lessInterprocess communicatio
Inter-process communication (IPC) is a mechanism that allows processes to communicate with each other and synchronize their actions. The communication between these processes can be seen as a method of co-operation between them. Processes can communicate with each other through both: Shared Memory.Read more
Inter-process communication (IPC) is a mechanism that allows processes to communicate with each other and synchronize their actions. The communication between these processes can be seen as a method of co-operation between them. Processes can communicate with each other through both: Shared Memory. Message passing.
See lessThe LRU algorithm
In the field of computer science, "LRU" stands for "Least Recently Used." It is an algorithm that is used to manage the memory of a computer system by identifying and discarding the least recently used items in order to free up space for new items.
In the field of computer science, “LRU” stands for “Least Recently Used.” It is an algorithm that is used to manage the memory of a computer system by identifying and discarding the least recently used items in order to free up space for new items.
See lessThrashing
Thrashing in os is a phenomenon that occurs in computer systems when the system spends an excessive amount of time on page swapping rather than executing useful work. It is caused by a high level of page faults, which happens when the system needs to retrieve a page from the disk because it is not pRead more
Thrashing in os is a phenomenon that occurs in computer systems when the system spends an excessive amount of time on page swapping rather than executing useful work. It is caused by a high level of page faults, which happens when the system needs to retrieve a page from the disk because it is not present in memory.
See lessFork is
It is usually a system call, implemented in the kernel. Fork is the primary method of process creation on Unix-like operating systems. This Question Belongs to Computer Fundamentals >> Operating System.
It is usually a system call, implemented in the kernel. Fork is the primary method of process creation on Unix-like operating systems. This Question Belongs to Computer Fundamentals >> Operating System.
See lessWhich of the following systems software does the job of merging the records from two files into one?
Explanation: A utility program merges the records from two files into one for optimization purposes.
Explanation: A utility program merges the records from two files into one for optimization purposes.
See lessThe strategy of allowing processes that are logically runnable to be temporarily suspended is called
The strategy of allowing process that are logically runnable to be temporarily suspended is called preemptive scheduling. Round Robin is the preemptive process scheduling algorithm. Each process is provided a fix time to execute, it is called a quantum.
The strategy of allowing process that are logically runnable to be temporarily suspended is called preemptive scheduling. Round Robin is the preemptive process scheduling algorithm. Each process is provided a fix time to execute, it is called a quantum.
See lessThe Storage-to-Storage instructions
The Storage-to-Storage instructions 1have both their operands in the main store. 2which perform an operation on a register operand and an operand which is located in the main store, generally leaving the result in the register, expect in the case of store operation when it is also.
The Storage-to-Storage instructions
See less1have both their operands in the main store.
2which perform an operation on a register operand and an operand which is located in the main store, generally leaving the result in the register, expect in the case of store operation when it is also.
The strategy of allowing processes that are logically runnable to be temporarily suspended is called
The strategy of allowing process that are logically runnable to be temporarily suspended is called preemptive scheduling. Round Robin is the preemptive process scheduling algorithm. Each process is provided a fix time to execute, it is called a quantum.
The strategy of allowing process that are logically runnable to be temporarily suspended is called preemptive scheduling. Round Robin is the preemptive process scheduling algorithm. Each process is provided a fix time to execute, it is called a quantum.
See lessWhich of the following refers to the associative memory?
Content Addressable Memory is another name for associative memory (CAM). Explanation: An associative memory may be thought of as a memory unit whose stored data can be recognised for access to the content; access to an associative memory is made via the content of the data rather than through the adRead more
Content Addressable Memory is another name for associative memory (CAM). Explanation: An associative memory may be thought of as a memory unit whose stored data can be recognised for access to the content; access to an associative memory is made via the content of the data rather than through the address.
See less