AfterAcademy Tech
In this blog, we will learn about the Producer-Consumer problem in Operating System and we will also learn how to solve this problem. It is used in multi-process synchronization.
16 Nov 2019
Given an array A[] of n integer elements, find the length of the longest subarray with sum equals to 0.
14 Nov 2019
Given a matrix, A of size M x N of 0's and 1's. If an element is 0, set its entire row and column to 0
In this blog, we will learn about semaphores and we will also see the types of semaphore. We will see how semaphores can be used to achieve process synchronization.
In this blog, we will learn about Process Synchronization in Operating System. Process Synchronization is used to deal with critical section problem.
Given the root of a binary tree, check whether it is a binary search tree or not.
Given an array A[] of n elements filled with several integers, some of them being zeroes, you need to move all the zeroes to the end.
In this blog, we will learn about Dispatchers in Operating System and we will also learn the difference between a Scheduler and a Dispatcher.
In this blog, we will learn about various process scheduling algorithms used in Operating System. We will learn about FCFS, SJF, SRTF, Round-Robin, Priority-based, Highest Response Ratio Next, Multilevel Queue, and Multilevel Feedback Queue scheduling.
In this blog, we will learn about Preemptive and Non-Preemptive Scheduling. We will also look at the difference between these two.
