Hindu-Arabic decimal numbers use the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9. We form decimal numbers creating strings with these digits, for example 102, 88, 12. 1 0 Recall that, for example, 12 is 1x10 + 2x10 Binary numbers use only 0 and 1. We can create numbers by creating strings with 0s and 1s. Example: 0 1 is expressed as 1 (1x2 )1 0 2 is expressed as 10 (1x2 + 0x2 ) 1 0 3 is expressed as 11 (1x2 + 1x2 ) The first 5 integers are 1, 10, 11, 100, 101 The first 8 integers are expressed as 1, 10, 11, 100, 101, 110, 111, 1000 The first 16 integers are expressed as 1, 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111, 10000 Write a non-member method binaryNumberSequence(int n) that produces the sequence of the first N integers. The method receives as parameter a number n, and returns a Queue<String> with n strings representing the first n integers converted to binary. The elements in the queue come in the increasing sequence order of the number. For example, a call to binaryNumberSequence(5) returns Q = {1, 10, 11, 100, 101}. You MUST create and store the binary number using division, mods, and a queue. LINKEDSTACKED IMPLEMENTATION public class LinkedStack<E> implements Stack<E> { @SuppressWarnings("hiding") private class Node<E> { private E element; private Node<E> next; public Node(E elm, Node<E> next) { this.element = elm; this.next = next; } public Node(E elm) { this(elm, null); } public Node() { this(null, null); } public E getElement() { return element; } public void setElement(E element) { this.element = element; } public Node<E> getNext() { return next; } public void setNext(Node<E> next) { this.next = next; } public void clear() { this.element = null; this.next = null; } } //End of Node Class private Node<E> header; private int currentSize; public LinkedStack() { this.header = new Node<>(); this.currentSize = 0; } @Override public void push(E newEntry) { if(newEntry == null) throw new IllegalArgumentException("Parameter cannot be null"); Node<E> newNode = new Node<>(newEntry, header.getNext()); header.setNext(newNode); currentSize++; } @Override public E pop() { if(isEmpty()) throw new EmptyStackException(); E elm = header.getNext().getElement(); Node<E> rmNode = header.getNext(); header.setNext(rmNode.getNext()); rmNode.clear(); rmNode = null; currentSize--; return elm; } @Override public E top() { if(isEmpty()) throw new EmptyStackException(); return header.getNext().getElement(); } @Override public boolean isEmpty() { return size() == 0; } @Override public int size() { return currentSize; } @Override public void clear() { while(!isEmpty()) pop(); } } BROWSER CLASS @Test public void test1() { String[] input = {"Google", "Facebook", "Instagram", "<", ">"}; String[] expected = {"Google", "Facebook", "Instagram", "Facebook", "Instagram"}; assertArrayEquals(expected, p.browserHistory(input)); } @Test public void test2() { String[] input = {"Google", "Facebook", "Instagram", "<", "<", ">", "Wikipedia", "Reddit", "<.

1. Hindu-Arabic decimal numbers use the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9. We form decimal numbers
creating strings with these digits, for example 102, 88, 12.
Recall that, for example, 12 is 1x10
1
+ 2x10
0
Binary numbers use only 0 and 1. We can create numbers by creating strings with 0s and 1s.
Example:
1 is expressed as 1 (1x2
0
)
2 is expressed as 10 (1x2
1
+ 0x2
0
)
3 is expressed as 11 (1x2
1
+ 1x2
0
)
The first 5 integers are 1, 10, 11, 100, 101
The first 8 integers are expressed as 1, 10, 11, 100, 101, 110, 111, 1000
The first 16 integers are expressed as 1, 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011,
1100, 1101, 1110, 1111, 10000
Write a non-member method binaryNumberSequence(int n) that produces the sequence of the
first N integers.
The method receives as parameter a number n, and returns a Queue<String> with n strings
representing the first n integers converted to binary.
The elements in the queue come in the increasing sequence order of the number. For example, a
call to binaryNumberSequence(5) returns Q = {1, 10, 11, 100, 101}.
You MUST create and store the binary number using division, mods, and a queue.
LINKEDSTACKED IMPLEMENTATION
public class LinkedStack<E> implements Stack<E> {
@SuppressWarnings("hiding")
private class Node<E> {
private E element;
private Node<E> next;
public Node(E elm, Node<E> next) {
this.element = elm;
this.next = next;
}
public Node(E elm) {
this(elm, null);
}
public Node() {
this(null, null);
}
public E getElement() {
return element;
}
public void setElement(E element) {
this.element = element;
}
public Node<E> getNext() {

2. return next;
}
public void setNext(Node<E> next) {
this.next = next;
}
public void clear() {
this.element = null;
this.next = null;
}
} //End of Node Class
private Node<E> header;
private int currentSize;
public LinkedStack() {
this.header = new Node<>();
this.currentSize = 0;
}
@Override
public void push(E newEntry) {
if(newEntry == null)
throw new IllegalArgumentException("Parameter cannot be null");
Node<E> newNode = new Node<>(newEntry, header.getNext());
header.setNext(newNode);
currentSize++;
}
@Override
public E pop() {
if(isEmpty())
throw new EmptyStackException();
E elm = header.getNext().getElement();
Node<E> rmNode = header.getNext();
header.setNext(rmNode.getNext());
rmNode.clear();
rmNode = null;
currentSize--;
return elm;
}
@Override
public E top() {
if(isEmpty())
throw new EmptyStackException();
return header.getNext().getElement();
}

3. @Override
public boolean isEmpty() {
return size() == 0;
}
@Override
public int size() {
return currentSize;
}
@Override
public void clear() {
while(!isEmpty())
pop();
}
}
BROWSER CLASS
@Test
public void test1() {
String[] input = {"Google", "Facebook", "Instagram", "<", ">"};
String[] expected = {"Google", "Facebook", "Instagram", "Facebook", "Instagram"};
assertArrayEquals(expected, p.browserHistory(input));
}
@Test
public void test2() {
String[] input = {"Google", "Facebook", "Instagram", "<", "<", ">", "Wikipedia", "Reddit", "<", "<",
">"};
String[] expected = {"Google", "Facebook", "Instagram", "Facebook", "Google", "Facebook",
"Wikipedia", "Reddit", "Wikipedia", "Facebook", "Wikipedia"};
assertArrayEquals(expected, p.browserHistory(input));
}
@Test
public void test3() {
String[] input = {"Google", "Facebook", "<", "<"};
String[] expected = {"Google", "Facebook", "Google"};
assertArrayEquals(expected, p.browserHistory(input));
}
package lab5.problems;
import java.util.ArrayList;
import java.util.List;

4. import lab5.util.dataStructures.LinkedStack;
import lab5.util.interfaces.Stack;
public class BrowserHistoryProblem {
/**
* TODO EXERCISE 1:
*
* In your Internet browser (e.g. Google Chrome), you can use the "back" and "forward" arrows
* to navigate through your browsing history.
*
* Implement a non-member method called browserHistory(String[] clicks) that takes
* a list of strings called clicks containing a mix of pages visited and back/forward arrow clicks,
* and returns a list of the pages visited in order.
*
* It may be helpful to open a new Google Chrome tab and experiment with using the backward
and forward buttons.
*

5. * Example:
* Assume clicks = {"Google", "Facebook", "Instagram", "<", ">"},
* then a call to browserHistory(clicks) returns {"Google", "Facebook", "Instagram", "Facebook",
"Instagram"}
* because the user went backward to Facebook, then forward to Instagram.
*
* Here are some additional edge cases to consider:
*
* 1) The user may hit the back or forward buttons multiple times in a row.
* 2) If the user tries to click the "back" or "forward" arrow even though
* there is nowhere to go / it is greyed out, keep them on the same page without reloading the
page.
* 3) The user might refresh the page / visit the same page multiple times in a row.
* Count these as a single visit.
* 4) The user might visit the same page multiple times, but not necessarily in a row. Consider
these distinct.
*

6. * Hint: Store the result and its values using an ArrayList<String> (import from java.util) as you
* make your solution and return them as an array of strings using result.toArray(new
String[result.size()])
*
* WARNING: You MUST use a stack, implementations that use indices (or pointers) will receive
ZERO credit.
*
* @param clicks - Array of strings denoting the web pages and clicks user made in their browser
* @return The Array of strings with clicks made with the forward and back buttons replaced with
* the corresponding page
*/
public String[] browserHistory(String[] clicks) {
/*TODO ADD YOUR CODE HERE*/
return new String[0]; // Dummy Return
}
}