## Program for Preemptive Priority CPU Scheduling

Implementing priority CPU scheduling. In this problem, we are using Min Heap as the data structure for implementing priority scheduling. In this problem smaller numbers… Read More »

Implementing priority CPU scheduling. In this problem, we are using Min Heap as the data structure for implementing priority scheduling. In this problem smaller numbers… Read More »

Given an array a, your task is to convert it into a non-increasing form such that we can either increment or decrement the array value… Read More »

Consider a Binary Heap of size N. We need to find height of it. Examples: Input : N = 6 Output : 2 () /… Read More »

A skew heap (or self – adjusting heap) is a heap data structure implemented as a binary tree. Skew heaps are advantageous because of their… Read More »

Given an array of elements, sort the array in decreasing order using min heap. Input : arr[] = {5, 3, 10, 1} Output : arr[]… Read More »

Heap Sort is a comparison based sorting technique where we first build Max Heap and then swaps the root element with last element (size times)… Read More »

Given an array of n integers and a number m, find the maximum possible difference between two sets of m elements chosen from given array.… Read More »

In previous post i.e. Set 1 we have discussed that implements these below functions: insert(H, k): Inserts a key ‘k’ to Binomial Heap ‘H’. This… Read More »

Given two equally sized arrays (A, B) and N (size of both arrays). A sum combination is made by adding one element from array A… Read More »

Given an n x n matrix and integer k. Find the k’th smallest element in the given 2D array. Examples: Input : mat = [[10,… Read More »

We have discussed one loss minimization strategy before: Job Sequencing Problem – Loss Minimization. In this article, we will look at another strategy that applies… Read More »

Given n, how many distinct Max Heap can be made from n distinct integers? Examples: Input : n = 3 Output : Assume the integers… Read More »

Given an array arr[] containing n elements. The problem is to find maximum number of distinct elements after removing k elements from the array. Note:… Read More »

Given an n x n matrix, where every row and column is sorted in non-decreasing order. Print all elements of matrix in sorted order. Examples:… Read More »

Given the sequence find the lexicographically smallest (earliest in dictionary order) derangement of . A derangement of S is as any permutation of S such… Read More »