Skip to main content

Posts

Showing posts with the label queue in java

My Omnidimensional AP Research: From a Simple Number Pattern to a General Power-Sum Formula

My Omnidimensional AP Research: From a Simple Number Pattern to a General Power-Sum Formula By Kumaran Kanniappan My OMNIBAL research explores a question: If we know exactly how a sequence is generated, can we calculate its powered total without visiting every term? For arithmetic progressions, we can express that calculation through a midpoint, symmetry, and reusable moment formulas. In this article, I explain the approach from a simple example to multidimensional arrangements and higher powers, then describe how I would evaluate its practical usefulness. 1. BEGIN WITH A FAMILIAR PATTERN Consider: 3, 5, 7, 9, 11, 13, 15, 17 Each number increases by two. This is an arithmetic progression, or AP. Write it as: a_i = F + h*i, for i = 0,...,X-1 The parameters are: - F: first value. - h: common difference. - X: number of values. For this sequence: F = 3, h = 2, X = 8 Its last value is: L = F + h*(X-1) = 17 Its midpoint is: M = (F+L)/2 = 10 2. THE MIDPOINT REVEALS THE STRUCTURE Pair the valu...

Data Structure and Algorithms : Queue Program in Java

Program: public class queuepgm { private int maxSize; private long[] queArray; private int front; private int rear; private int nItems; public queuepgm(int s) { maxSize = s; queArray = new long[maxSize]; front = 0; rear = -1; nItems = 0; } public void enqueue(long j) { if(rear == maxSize-1) rear = -1; queArray[++rear] = j; nItems++; } public long dequeue() { long temp = queArray[front++]; if(front == maxSize) front = 0; nItems--; return temp; } public long peekFront() {     return queArray[front]; } public boolean isEmpty()       { return (nItems==0); } public boolean isFull() { return (nItems==maxSize); } public int size() { return nItems; } public static void main(String[] args) { queuepgm theQueue = new queuepgm(5); // queue holds 5 items theQueue.enqueue(10); theQueue.enqueue(20); theQueue.enqueue(30); theQueue.enqueue(40); System.out.println("Dequeue Values: FIFO"); while( !theQueue.isEmpty() ) ...