Data Structure

Question1: (8 marks)
As a conclusion of what you have learnt, and based on some research, you are asked to
compare between Stacks and Queues in terms of the following:
a- What is the principles used to insert/ remove an object in each data structure?
b- State the two major operations used to access data in each data structure.
c- Name one application using each type.
d- Provide at least one valid reference.
Question 2:(12 marks)
You are given a Node class and a List class:
public class Node
{
int data;
Node next;
Node(int d, Node n){
data = d;
next = n;
} }
public class List {
Node header;
}
Write a Java function (method) max2List that takes two lists list1 and list2 of the same
size and returns a list, list3, that will contain the maximum of the data between the
corresponding nodes of lists list1 and list2.
For example:
Notice that this question should be submitted as .java file, zipped with the Pdf file
that includes all answers for both question 1&2

2. Gettysburg

Watch the movie Gettysburg and answer the following questions: 1. why and how did the North win the war in Gettysburg and why and how did the South lose the war in Gettysburg?
2. why was it over 50,000 people who died in the war
3. What happened to Thomas Davee Chamberlain (discuss in half a page)
Make sure to include information about who the president of both the north and south were, how many soldiers fought in both the north and south, discuss briefly about John Buford and Gen. Jeb Stuart (head of calvary for both north and south respectively), Gen Heath, and Gen. George Pickett, etc include relevant dates.