web analytics

Notes

Software doesn’t “wear out”- Explain this comparing with hardware.

Before we learn about why software does not “wear out”, lets learn about the state “wear out”. When something is no longer of any use, it reaches the “wear out” state. That is, it can not perform the function it was built for. For example, a printer reaches “wear out” state it can’t print anymore. This doesn’t include the recycling options. One make use of a dead printer to do anything else but printing. 

What is software and software engineering?

Software is a collection of executable instructions that can be executed by computer devices to perform instructed task or tasks. However, non-executable resources and data can also be referred as software.

Engineering of software is the establishment and use of sound engineering principles in order to obtain economical software that is reliable and work efficiently on real machines.

Explain and Solve : Round Robin (RR) CPU Scheduling Algorithm in C++ with Explanation

If you haven’t read/tried the earlier/other problems then click the links follow: 01. First Come First Served (FCFS). 02. Shortest Job First (SJF).03. Priority Scheduling Round Robin CPU Scheduling Algorithm in C++ with Explanation:  This method is quite same as the FCFS but the difference is the in this case the processor will not process the whole …

Explain and Solve : Round Robin (RR) CPU Scheduling Algorithm in C++ with Explanation Read More »

Explain and Solve : Priority Scheduling CPU Scheduling Algorithm in C++ with Explanation

If you haven’t read/tried the earlier problems then click the links follow: 01. First Come First Served (FCFS). 02. Shortest Job First (SJF).03. Round Robin (RR). Priority Scheduling CPU Scheduling Algorithm in C++ with Explanation:  This method is quite same as the SJF but the difference is that instead of choosing the next process to work …

Explain and Solve : Priority Scheduling CPU Scheduling Algorithm in C++ with Explanation Read More »

Preemptive Shortest Job First (SJF) CPU Scheduling Algorithm in C++ with Explanation

If you haven’t read/tried the earlier problems then click the links follow: 01. First Come First Served (FCFS).02. Round Robin (RR).03. Priority Scheduling. Preemptive Shortest Job First (SJF) CPU Scheduling Algorithm in C++ with Explanation: Preemptive Shortest Job First (SJF) is a CPU scheduling algorithm in which the CPU, at any given time, looks for the job with …

Preemptive Shortest Job First (SJF) CPU Scheduling Algorithm in C++ with Explanation Read More »

Explain and Solve : First Come First Served (FCFS) CPU Scheduling Algorithm in C++ with Explanation

If you haven’t read/tried the earlier problems then click the links follow: 01. Shortest Job First (SJF). 02. Round Robin (RR).03. Priority Scheduling. First Come First Served (FCFS) CPU Scheduling Algorithm in C++ with Explanation:  CPU gets a lot of processes to handle. The problem is shortening the waiting time for a process to reach CPU and …

Explain and Solve : First Come First Served (FCFS) CPU Scheduling Algorithm in C++ with Explanation Read More »

Scroll to Top