Publication Tech Interview YouTube Say Hello

Publication

Popular Tags

AfterAcademy Tech

What is Virtual Memory and how is it implemented?

In this blog, we will learn about the concept of Virtual Memory and we will also see how this concept of Virtual Memory can be implemented.

09 Nov 2019

AfterAcademy Tech

Difference between Mutex and Semaphore in Operating System

In this blog, we will learn about the difference between Mutex and Semaphore in the Operating System. We will first learn about Mutex and Semaphore and after that, we will find the difference between them.

09 Nov 2019

AfterAcademy Tech

Sort Characters By Frequency - Interview Problem

You are given a string S and its length L and you need to sort its characters based on their frequency. The characters in the output will be distinct and ordered based on their frequency in S, higher frequency comes first.

08 Nov 2019

AfterAcademy Tech

What is Deadlock and what are its four necessary conditions?

In this blog, we will learn about the concept of deadlock in the Operating System and we will also see what are the four necessary conditions of deadlock. Let's learn.

08 Nov 2019

AfterAcademy Tech

What are Deadlock handling techniques in Operating System?

In this blog, we will learn four techniques of deadlock handling i.e. deadlock prevention, deadlock avoidance, deadlock detection and recovery, and deadlock ignorance. So, let's learn about these.

08 Nov 2019

AfterAcademy Tech

What is Context Switching in Operating System?

In this blog, we will learn about the Context Switching in the Operating System. We will learn all the steps involved in Context Switching and in the end, we will see the advantages and disadvantages of Context Switching also.

06 Nov 2019

AfterAcademy Tech

Find the most frequent element in an array - Interview Problem

Given an array A[] of size n, find the most frequent element in the array, i.e. the element which occurs the most number of times.

05 Nov 2019

AfterAcademy Tech

Find the next greater element for every element in an array - Interview Problem

Given an array A[] of size n, you need to find the next greater element for each element in the array. Return an array that consists of the next greater element of A[i] at index i.

05 Nov 2019

AfterAcademy Tech

What is Long-Term, Short-Term, and Medium-Term Scheduler?

In this blog, we will learn about long-term, short-term, and medium-term schedulers in the Operating System. We will also look at the difference between these three.

05 Nov 2019

AfterAcademy Tech

What is Starvation and Aging?

In this blog, we will learn about the problem that arises in priority scheduling algorithm i.e. starvation and we will also learn the solution of the same i.e. Aging.

04 Nov 2019