Order ready-to-submit essays. No Plagiarism Guarantee!
Note: All our papers are written from scratch by human writers to ensure authenticity and originality.
ECET 370 Week 3 ilab The Stack and the Queue ADTs
iLAB OVERVIEW
Scenario and Summary
Check your essay before you submit. See exactly what your professor sees.
See your AI and plagiarism results before your instructor does.Get the exact same report your professor uses. Trusted by 50,000+ students worldwide.
The purpose of the iLab exercises is to help the student acquire skills in developing programs that involve the use of the stack and the queue data structures.
Deliverables
There are six exercises in this iLab, although not all of them will be required for submission. Be sure to read the following instructions carefully.
Exercises 1 and 4: No submissions are required.
Create a folder and name it Week 3 iLab. Inside this folder, create the subfolders Ex2, Ex3, Ex5, and Ex6. Place the solution to each of the four exercises required for submission in the corresponding subfolder. Compress the folder Week 3 iLab using a program like WinZip, and drop the resulting zipped folder into the Dropbox.
Note that Exercises 2, 3, 5, and 6 require software development. Place only .java files in the corresponding folders. Do not submit the .class files or other files or folders that are generated by the IDE.
Required Software
Eclipse
Access the software at https://lab.devry.edu .
iLAB STEPS
Exercise 1: Review of the Stack ADT
Back to Top
Create a project using the classes in “A Simple Stack Class”. Compile the project, run it, and review the code that is given carefully. This code tests the stack class provided in the lecture.
Exercise 2: An Improved Stack Class
Back to Top
Modify the stack class to include appropriate error messages if invalid conditions occur—for example, trying to pop an item when the stack is empty.
Exercise 3: Using a Stack in an Application
Back to Top
Complete Project 2 at the end of Chapter 5 in our textbook: Write a Java program that uses a stack to test whether an input string is a palindrome. Exercise 11 defines “palindrome” and asks you to describe a solution to this problem. As you can see, you will need to read Exercise 11 to find the meaning of palindrome.
To implement the solution to this problem, use the stack of characters from the previous exercises (1 and 2).
Exercise 4: Review of the Queue ADT
Back to Top
Create a project using the classes in “A Simple Queue Class.” Compile the project, run it, and review the code that is given carefully. This code tests the queue class provided in the lecture.
Exercise 5: An Improved Queue Class
Back to Top
Modify the class queue to include appropriate error messages if invalid conditions occur—for example, trying to dequeue an item when the queue is empty.
Exercise 6: Using a Queue in an Application
Back to Top
Complete Project 4 at the end of Chapter 10 in our textbook:Simulate a small airport with one runway. Airplanes waiting to take off join a queue on the ground. Planes waiting to land join a queue in the air. Only one plane can use the runway at any given time. All planes in the air must land before any plane can take off.
