The document outlines the requirements for the ECET 370 Week 2 ILAB focused on linked lists, including an overview and essential exercises. It specifies that students must complete exercises 2, 3, and 4, submitting their .java files in designated subfolders after compressing the whole project folder. Key tasks include modifying a linked list to create a doubly linked list and developing specific methods for list manipulation.

1. DEVRY ECET 370 Week 2 ilab Linked Lists NEW
Check this A+ tutorial guideline at
http://www.uopassignments.com/ecet-370-
devry/ecet-370-week-2-ilab-linked-lists-
recent
For more classes visit
http://www.uopassignments.com/
iLAB OVERVIEW
Scenario and Summary
The purpose of the iLab exercises is to help the
student acquire skills in developing programs that
require the implementation with linked lists of
abstract data types, such as lists and bags.
Deliverables
There are four exercises in this iLab, although not
all of them will be required for submission. Be
sure to read the following instructions carefully.
Exercise 1: No submission is required.

2. Exercise 4 contains Parts a, b, c, d, e, f, g, and h.
Keep in mind that the methods developed for each
of these parts should be within the same bag class.
Create a folder and name it Week 2 iLab. Inside
this folder, create the subfolders Ex2, Ex3, and Ex4.
Place the solution to each of the three exercises
required for submission in the corresponding
subfolder. Compress the folder Week 2 iLab, and
drop the resulting zipped folder into the Dropbox.
Note that Exercises 2, 3, and 4 require software
development. Place in the corresponding folders
only .java files. 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 Linked Lists
Back to Top
Create a project using the classes in "A Simple
LinkedList Class." Compile it, run it, and review the

3. code that is given carefully. This code tests the
LinkedList class provided in the lecture.
Exercise 2: Implementing a Doubly Linked List
Back to Top
Modify the class LinkedList in Exercise 1 to make it
a doubly linked list. Name your class
DoublyLinkedList. Add a method addEnd to add an
integer at the end of the list and a method
displayInReverse to print the list backwards:
void addEnd(int x): create this method to add x to
the end of the list.
void displayInReverse(): create this method to
display the list elements from