Objectives:

The code for the different stack and queue operations in both implementations $($array and linked list$)$ are

discussed in the lectures: and are written in the lectures power point. So the main object of this

assignment is to give the student more practice to increase their understanding of the different

implementation of these operations.

The students also are asked to write by themselves the main methods in the different exercises below;

The Lab procedures:

The following files must be distributed to the students in the Lab

arrayImpOfStack.java $//$ it represents an array implementation of the stack.

pointerImOfStack.java $//$ it represents a Linked List implementation of the stack.

pointerImOfQueue.java $//$ it represents a pointer implementation of the queue.

Then the students by themselves are required to write the code for the following questions

Ex$1)$ Given the file arraylmpOfStack.java then write a main method to read a sequence of numbers

and using the stack operation print them in reverse order.

Ex$2)$ Given the file pointerImOfStack.java then write a main method to read a decimal number and

print its equivalent binary number.

Ex$3)$ Given the file arraylmpOfStack.java then write a main method:

declaring two stack objects S$1,$ S$2$;

reads a sequence of numbers; store the even ones in the stack S$1,$ and store the odd ones in the stack S$2.$

print the even numbers followed by odd ones.

Ex$4)$ Given the file pointerImOfQueue.java then write a main method: to

add some elements into the queue,

reverse the queue contents, $($Hint use an array$)$

print the queue contents.

Note that $Ex4)$ can be Solved using a stack instead of the array