##
Fitting Shelves Problem
June 25, 2017

Given length of wall w and shelves of two lengths m and n, find the number of each type of shelf to be used and… Read More »

June 25, 2017

Given length of wall w and shelves of two lengths m and n, find the number of each type of shelf to be used and… Read More »

June 17, 2017

Prerequisite : Page Replacement Algorithms In operating systems that use paging for memory management, page replacement algorithm are needed to decide which page needed to… Read More »

June 16, 2017

Prerequisite: Page Replacement Algorithms In operating systems that use paging for memory management, page replacement algorithm are needed to decide which page needed to be… Read More »

June 15, 2017

We have discussed Huffman Encoding in a previous post. In this post decoding is discussed. Examples: Input Data : AAAAAABCCCCCCDDEEEEE Frequencies : A: 6, B:… Read More »

June 12, 2017

In a candy store there are N different types of candies available and the prices of all the N different types of candies are provided.… Read More »

There are N Mice and N holes are placed in a straight line. Each hole can accommodate only 1 mouse. A mouse can stay at… Read More »

April 25, 2017

Greedy is an algorithmic paradigm that builds up a solution piece by piece, always choosing the next piece that offers the most obvious and immediate… Read More »

April 24, 2017

You are given a list of N coins of different denominations. you can pay an amount equivalent to any 1 coin and can acquire that… Read More »

April 22, 2017

Given n objects, with each object has width wi. We need to arrange them in a pyramidal way such that : Total width of ith… Read More »

April 1, 2017

Given two arrays a[] and b[] of equal length n. The task is to pair each element of array a to an element in array… Read More »

March 13, 2017

Given a string with repeated characters, task is rearrange characters in a string so that no two adjacent characters are same. Note : It may… Read More »

March 12, 2017

Given an array of n elements. Consider array as circular array i.e element after an is a1. The task is to find maximum sum of… Read More »

March 6, 2017

Prerequisite : Partition allocation methods Worst Fit allocates a process to the partition which is largest sufficient among the freely available partitions available in the… Read More »

Prerequisite : Partition allocation methods Best fit allocates the process to a partition which is the smallest sufficient partition among the free available partitions. Example:… Read More »

March 4, 2017

Prerequisite : Partition Allocation Methods In the first fit, partition is allocated which is first sufficient from the top of Main Memory. Example : Input… Read More »