History Class XII Ch. 3 Kinship, Caste and Class (1).pptx
Devry ecet 370 week 1 i lab array
1. DEVRY ECET 370 Week 1 iLab Array-Based
Implementations NEW
Check this A+ tutorial guideline at
http://www.uopassignments.com/ecet-370-
devry/ecet-370-week-1-ilab-array-based-
implementations-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 implementation with arrays of abstract
data types, such as lists and bags.
Note!Software Citation Requirements
This course uses open-source software which must
be cited when used for any student work. Citation
requirements are on theOpen Source Applications
page.
2. Please review the installation instruction files to
complete your assignment
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.
Exercise 4 contains parts a, b, c and continues
through part i. 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 1 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 1 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
3. Access the software at https://lab.devry.edu .
iLAB STEPS
Exercise 1: Review of Array-Based Lists
Back to Top
Create a project using the classes in this zip file
and name it "A Simple ArrayList Class." Compile it,
run it, and review the code that is given carefully.
This code tests the ArrayList class discussed in the
lecture.
Exercise 2: Implementing an Array List
Back to Top
Modify the class ArrayList given in Exercise 1 by
using expandable arrays. That is, if the list is full
when an item is being added to this list, the
elements will be moved to a larger array. The new
array should have twice the size of the original
array.
Exercise 3: Using an Array-Based List
Back to Top
Using the class ArrayList completed in the
previous exercise, write a program to store 1,000
4. random numbers, each in the interval [0, 500]. The
initial size of the array in the class should be set to
100. Print the numbers.
Exercise 4: Implementing a Bag Class
Back to Top
Create a class bag (multiset) that uses an
expandable array to store the bag items. The item
type must be a Java String type; that is, the bag will
store strings of characters. The class should have
the methods listed below. Create a main class to
test your bag class. This main class should fill a bag
with the keywords of the Java language.
1. Bag(): default constructor
2. boolean isEmpty(): determines whether the bag
is empty
3. void print(): prints the bag elements
4. int getLength(): returns the number of items in
the bag
5. void clear(): removes all of the items from the
bag
6. void add(String item): adds an item to the bag
5. 7. void removeOne(String item): removes item
from the bag; only one occurrence of item should
be removed.
8. void removeAll(String item): removes item from
the bag; all occurrences of item should be
removed.
9. int count(String item): counts the number of
occurrences of item in the bag
6. 7. void removeOne(String item): removes item
from the bag; only one occurrence of item should
be removed.
8. void removeAll(String item): removes item from
the bag; all occurrences of item should be
removed.
9. int count(String item): counts the number of
occurrences of item in the bag