Updates

Updates

Author: careermonk

bin/chapter3linkedlists/ListNode.class

@@ -39,7 +39,7 @@ public void setNext (ListNode node){
 	}
 
 	// Returns the data stored in this node.
-	public int getdata(){
+	public int getData(){
 		return data;
 	}
 

bin/chapter4stacks/FixedSizeArrayStack.class

@@ -0,0 +1,89 @@
+/*Copyright (c) Dec 21, 2014 CareerMonk Publications and others.
+ * E-Mail           	: info@careermonk.com 
+ * Creation Date    	: 2015-01-10 06:15:46 
+ * Last modification	: 2006-05-31 
+               by		: Narasimha Karumanchi 
+ * File Name			: FixedSizeArrayStack.java
+ * Book Title			: Data Structures And Algorithms Made In Java
+ * Warranty         	: This software is provided "as is" without any 
+ * 							warranty; without even the implied warranty of 
+ * 							merchantability or fitness for a particular purpose. 
+ * 
+ */
+
+
+package chapter4stacks;
+public class FixedSizeArrayStack{
+	// Length of the array used to implement the stack.
+	protected int capacity;
+
+	// Default array capacity.
+	public static final int CAPACITY = 10;
+
+	// Array used to implement the stack.
+	protected int[] stackRep;
+
+	// Index of the top element of the stack in the array.
+	protected int top = -1;
+
+	// Initializes the stack to use an array of default length.
+	public FixedSizeArrayStack() {
+		this(CAPACITY); // default capacity
+	}
+
+	// Initializes the stack to use an array of given length.
+	public FixedSizeArrayStack(int cap) {
+		capacity = cap;
+		stackRep = new int[capacity]; // compiler may give warning, but this
+									  // is ok
+	}
+
+	// Returns the number of elements in the stack. This method runs in O(1) time.
+	public int size() {
+		return (top + 1);
+	}
+
+	// Testes whether the stack is empty. This method runs in O(1) time.
+	public boolean isEmpty() {
+		return (top < 0);
+	}
+
+	// Inserts an element at the top of the stack. This method runs in O(1) time.
+	public void push(int data) throws Exception {
+		if (size() == capacity)
+			throw new Exception("Stack is full.");
+		stackRep[++top] = data;
+	}
+
+	// Inspects the element at the top of the stack. This method runs in O(1) time.
+	public int top() throws Exception {
+		if (isEmpty())
+			throw new Exception("Stack is empty.");
+		return stackRep[top];
+	}
+
+	// Removes the top element from the stack. This method runs in O(1) time.
+	public int pop() throws Exception {
+		int data;
+		if (isEmpty())
+			throw new Exception("Stack is empty.");
+		data = stackRep[top];
+		stackRep[top--] = Integer.MIN_VALUE; // dereference S[top] for garbage collection.
+		return data;
+	}
+
+	// Returns a string representation of the stack as a list of elements, with
+	// the top element at the end: [ ... , prev, top ]. This method runs in O(n)
+	// time, where n is the size of the stack.
+	public String toString() {
+		String s;
+		s = "[";
+		if (size() > 0)
+			s += stackRep[0];
+		if (size() > 1)
+			for (int i = 1; i <= size() - 1; i++) {
+				s += ", " + stackRep[i];
+			}
+		return s + "]";
+	}
+}

bin/chapter4stacks/LinkedStack.class

@@ -40,7 +40,7 @@ public void push (int data)  {
 	public int pop() throws EmptyStackException{
 		if (isEmpty())
 			throw new EmptyStackException();
-		int result = top.getdata();
+		int result = top.getData();
 		top = top.getNext();
 		length--;
 		return result;
@@ -53,7 +53,7 @@ public int peek() throws EmptyStackException{
 		if (isEmpty())
 			throw new EmptyStackException(); 
 
-		return top.getdata();
+		return top.getData();
 	}
 
 	// Returns true if this stack is empty and false otherwise. 

bin/chapter5queues/LinkedQueue.class

@@ -0,0 +1,85 @@
+/*Copyright (c) Dec 21, 2014 CareerMonk Publications and others.
+ * E-Mail           	: info@careermonk.com 
+ * Creation Date    	: 2015-01-10 06:15:46 
+ * Last modification	: 2006-05-31 
+               by		: Narasimha Karumanchi 
+ * File Name			: LinkedQueue.java
+ * Book Title			: Data Structures And Algorithms Made In Java
+ * Warranty         	: This software is provided "as is" without any 
+ * 							warranty; without even the implied warranty of 
+ * 							merchantability or fitness for a particular purpose. 
+ * 
+ */
+
+
+package chapter5queues;
+import chapter3linkedlists.*;
+
+public class LinkedQueue{
+	private int length;
+	private ListNode front, rear;
+
+	//  Creates an empty queue.
+	public LinkedQueue(){
+		length = 0;
+		front = rear = null;
+	}
+
+	//  Adds the specified data to the rear of the queue.
+	public void enqueue (int data){
+		ListNode node = new ListNode(data);
+		if (isEmpty())
+			front = node;
+		else
+			rear.setNext (node);
+		rear = node;
+		length++;
+	}
+
+	//  Removes the data at the front of the queue and returns a
+	//  reference to it. Throws an Exception if the
+	//  queue is empty.
+
+	public int dequeue() throws Exception{
+		if (isEmpty())
+			throw new Exception ("queue");
+		int result = front.getData();
+		front = front.getNext();
+		length--;
+		if (isEmpty())
+			rear = null;
+		return result;
+	}
+
+	//  Returns a reference to the data at the front of the queue.
+	//  The data is not removed from the queue.  Throws an
+	//  Exception if the queue is empty.  
+	public int first() throws Exception{
+		if (isEmpty())
+			throw new Exception(); 
+
+		return front.getData();
+	}
+
+	//  Returns true if this queue is empty and false otherwise. 
+	public boolean isEmpty(){
+		return (length == 0);
+	}
+
+	//  Returns the number of elements in this queue.
+	public int size(){
+		return length;
+	}
+
+	//  Returns a string representation of this queue. 
+	public String toString(){
+		String result = "";
+		ListNode current = front;
+		while (current != null){
+			result = result + current.toString() + "\n";
+			current = current.getNext();
+		}
+		return result;
+	}
+}
+