As a programmer, you only have to worry about the top element in the queue and the last element. This is because you will enqueue, or add items to the end of the queue, and dequeue, or remove the first, or top, element of the queue. When you add an item to the queue, you…
A queue is a fairly common data storage method. However, unlike many methods of storing data, where we keep the data for the entire runtime of a function or even the entire application, a queue’s data is designed to be consumable. That is, at some point data will enter the queue, and then it will…
There are several ways to program a stack. Using an Array One is in using an array. Here a stack with a max size of the array is created, and an index is used to track the latest element. It can, of course, run out of space, which is known as a stack overflow. This…
Stacks don’t have as much use in computers as a queue, however, when you need to use one, they are very beneficial. Two of the most common uses of stacks are to help with Expression Conversion (Infix to Postfix, Postfix to Prefix, etc.) and especially with the parsing of data. When parsing source files before…
A stack is another data structure which is used by developers. Like a queue, it can be built off of a linked list data structure or an array. However, in many ways, it is the opposite of a Queue in the way it processes itself. A stack works Last In, First Out (LIFO) – either…
Page fault rate is the number of page faults occurring during a number of memory references. If the page fault was designated as f, and the memory reference was listed as t, then the page fault rate can be expressed as P = f/t, where 0 ≤ P ≤ 1. Page faults increase the time to…
The optimal working set of a process is the set of pages that will be needed in the immediate future and thus should be resident in the physical memory. The size of the set will be based upon the size of the process and what it needs. To determine the size of the working window, the OS…
A reference string is the sequence of page numbers referenced by an executing program during a given time interval. Reference strings are used to compare different page replacement algorithms by counting the number of page faults generated. Since page faults are time consuming, the optimal page replacement algorithm selects the page that will not be referenced for the longest…
