A stack is a collection of objects that are inserted and removed using Last in First out Principle (LIFO). User can insert elements into the stack, and can only access or remove the recently inserted object on top of the stack . In this following project, you will implement stack using doubly linked list (deque) as it was explained in the previous lectures. The following Project should have these classes: 1. Class Book: The main Node for the deque stack where it should have the following attributes besides (next, prev nodes): a. Book Id b. Book Name c. Book Author 2. Class BookLists: Where all the main operations are done. Note: you can add more classes if you want but must include the main ones. You need to apply these following operations: 1. AddBook() [push()] : The method Inserts the book object into deque Stack (form the last). 2. RemoveBook() [pop()] : This method extracts an object from the last of the Deque stack and it removes it. If such object does not exist, the method returns null.(from the last) 3. isEmpty() : Return True if deque stack is Empty else return False. 4. DisplayAllBooks() : Print all the books in the deque stack. 5. getListSize(): Return the Size of the Stack.6. insertSortByBookId(): Sorts all books according to the book Id. 7. findByBookId: search for the book according to the book id. 8. findByBookName: search for the book according to the book name.
A stack is a collection of objects that are inserted and removed using Last
in First out Principle (LIFO). User can insert elements into the stack, and
can only access or remove the recently inserted object on top of the stack .
In this following project, you will implement stack using doubly linked list
(deque) as it was explained in the previous lectures.
The following Project should have these classes:
1. Class Book: The main Node for the deque stack where it should
have the following attributes besides (next, prev nodes):
a. Book Id
b. Book Name
c. Book Author
2. Class BookLists: Where all the main operations are done.
Note: you can add more classes if you want but must include the main
ones.
You need to apply these following operations:
1. AddBook() [push()] : The method Inserts the book object into
deque Stack (form the last).
2. RemoveBook() [pop()] : This method extracts an object from the
last of the Deque stack and it removes it. If such object does not
exist, the method returns null.(from the last)
3. isEmpty() : Return True if deque stack is Empty else return False.
4. DisplayAllBooks() : Print all the books in the deque stack.
5. getListSize(): Return the Size of the Stack.6. insertSortByBookId(): Sorts all books according to the book Id.
7. findByBookId: search for the book according to the book id.
8. findByBookName: search for the book according to the book name.
Step by step
Solved in 4 steps with 5 images
