ECET 370 Entire Course NEW

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.

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

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

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

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

DEVRY ECET 370 Week 2 ilab Linked Lists NEW
devry/ecet-370-week-2-ilab-linked-lists-
recent
iLAB OVERVIEW
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

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.
this folder, create the subfolders Ex2, Ex3, and Ex4.
subfolder. Compress the folder Week 2 iLab, and
Required Software
Eclipse
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

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

DEVRY ECET 370 Week 3 ilab The Stack and the
Queue ADTs NEW
devry/ecet-370-week-3-ilab-the-stack-and-
the-queue-adts-recent
iLAB OVERVIEW
involve the use of the stack and the queue data
structures.
Deliverables
There are six exercises in this iLab, although not
Exercises 1 and 4: No submissions are required.

this folder, create the subfolders Ex2, Ex3, Ex5, and
Ex6. Place the solution to each of the four exercises
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
iLAB STEPS
Exercise 1: Review of the Stack ADT
Back to Top
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
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.

DEVRY ECET 370 Week 4 ilab The Efficiency of
Algorithms and Sorting NEW
devry/ecet-370-week-4-ilab-the-efficiency-of-
algorithms-and-sorting-recent
iLAB OVERVIEW
The purpose of the lab exercises is to help the
involve algorithm analysis, recursion, and sorting.
Deliverables
There are four exercises in this lab, although not

Note that some of the exercises require sections of
code to be timed. To learn how to time a section of
your source code, please refer to the beginning of
the Projects section in Chapter 4 of our textbook.
Exercises 2 and 4 require not only software
development but also explanations about the
results of the experiments that are conducted.
Create separate Word documents to provide the
details required in these exercises.
Create a folder and name it Week 4 Lab. Inside this
folder, create the subfolders Ex2, Ex3, and Ex4.
subfolder. Compress the folder Week 4 Lab using a
program like WinZip, and place the resulting
zipped folder into the Dropbox.
Required Software
Eclipse

iLAB STEPS
Exercise 1: Review of the Lecture Contents
Back to Top
Create three projects, minimum, factorial, and
sorting algorithms, using the classes in
• Minimum

DEVRY ECET 370 Week 5 ilab Search Techniques
and Hashing NEW
devry/ecet-370-week-5-ilab-search-
techniques-and-hashing-recent
iLAB OVERVIEW
involve search algorithms and techniques.
Deliverables
There are four exercises in this lab, although not

Note that one of the exercises requires sections of
code to be timed. To review how to time a section
of your source code, please refer to the beginning
of the Projects section in Chapter 4 of our
textbook.
Exercise 2 requires not only software development
but also explanations about the results of the
experiments that are conducted. Create a separate
Word document to provide the details required in
the exercise.
folder, create the subfolders Ex2, Ex3, and Ex4.
subfolder. Compress the folder Week 5 Lab, and
place the resulting zipped folder into the Dropbox.
Required Software
Eclipse

iLAB STEPS
Exercise 1: Review of the Lecture Content
Back to Top
Create a project using the ArrayList class and the
Main class in Search Algorithms. The ArrayList
class contains implementations of the first three
search methods explained in this week’s lecture:
sequential, sorted, and binary search. The Main
class uses these three methods. These prog

DEVRY ECET 370 Week 6 ilab Binary Trees NEW
devry/ecet-370-week-6-ilab-binary-trees-
recent
iLAB OVERVIEW
involve the use of binary trees. We will be
concentrating primarily on binary search trees, or
BSTs.
Deliverables
There are five exercises in this lab, although not all
of them will be required for submission. Be sure to
read the following instructions carefully.

folder, create the subfolders Ex2, Ex3, Ex4, and
place the resulting zipped folder into the Dropbox.
Required Software
Eclipse
iLAB STEPS
Exercise 1: Lecture Review—Binary Search Tree
Back to Top
Create a project using the classes
BinarySearchTree, Node, and Main in Binary
Search Tree. Compile the project, run it, and
review the code that is given carefully. These
programs test the code discussed in our lecture.

Exercise 2: An Improved BST Class
Back to Top
Add the toString method to the class
BinarySearchTree in Exercise 1.
Note: The toString method returns a string
representation of the object properties. By
implementing toString, a BinarySearchTree object
can be displayed in a simple way using
System.out.print or System.out.println. For
example, if bst is a BinarySearchTree object, it can
be printed using System.out.println(bst).
Exercise 3: Using a BST in an Application
Back to Top
Create a class SimpleBag that uses a binary search
tree to store the bag items.The class should have
the methods listed below. Create a Main class to
test your SimpleBag class.
1. SimpleBag(): default constructor; creates an
empty bag

UOP ECET 370 Week 7 ilab Collections Framework
NEW
devry/ecet-370-week-7-ilab-collections-
framework-recent
iLAB OVERVIEW
involve the use of the collections framework.
Deliverables
There are five exercises in this lab, although not all
of them will be required for submission. Be sure to
read the following instructions carefully.
folder, create the subfolders Ex2, Ex3, Ex4, and

development. Place only source files in the
corresponding folders. Do not submit other types
of files or folders that are generated by the IDE.
Exercises 2 and 4 should be implemented using
the Java programming language, and Exercises 3
and 5 should be implemented using the C++
programming language. Exercise 1 requires both.
Required Software
Eclipse
Microsoft Visual Studio 2012
iLAB STEPS
Exercise 1: Lecture Review—JCF and STL
Back to Top

Create seven projects, JCF array list, JCF linked list,
JCF sort,JCF stack, STL doubly linked list, STL stack
and queue, and STL vector, using the programs in:
• JCF array list
• JCF linked list

ECET 370 Entire Course NEW

Recommended

Recommended

More Related Content

Similar to ECET 370 Entire Course NEW

Similar to ECET 370 Entire Course NEW (20)

More from shyamuopuop

More from shyamuopuop (20)

Recently uploaded

Recently uploaded (20)

ECET 370 Entire Course NEW