All Tutorials will be E-mailed immediately (automatically) after the Payment and can also be Downloaded by clicking on Tutorial Bucket.
Please Check your Spam Email if you do not get the Tutorial.
Click Here to Submit New Syllabus (If course has changed or if you need help with any other course)
Shopping Cart
Your shopping cart is empty!
Categories
ECET 370 Week 2 ilab Linked Lists (New Syllabus)
$10.00

ECET 370 Week 2 ilab Linked Lists (New Syllabus)

This Tutorial was purchased 4 times & rated A+ by student like you.

 

This Tutorial contains following Attachments

  • ECET 370 NA Week 2 ilab Linked Lists.docx

ECET 370 Week 2 ilab Linked Lists

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.

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 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:

voidaddEnd(int x): create this method to add x to the end of the list. 
voiddisplayInReverse(): create this method to display the list elements from the last item to the first one.

Create a main class to test your DoublyLinkedList class.

Exercise 3: Using a Doubly Linked List

Back to Top

Using the class DoublyLinkedList completed in the previous exercise, write a program to store all the prime numbers up to 100 in a DoublyLinkedList object. The numbers should be stored in such a way that when “display” is invoked, the listing will be shown in increasing order: 2, 3, 5, 7, 11, 13, 17, … .

Exercise 4: Implementing a Bag Class

Back to Top

Create a class bag that uses a linked list 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. booleanisEmpty(): determines whether the bag is empty
  3. void print(): prints the bag elements
  4. intgetLength(): 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. voidremoveOne(String item): removes an item from the bag; only one occurrence of the item should be removed.

int count(String item): counts the number of occurrences of an item in the bag. 

(Note that you can reuse the code in Exercise 1 for the LinkedList class to create your bag class. It will help you to save development time.)

Write a review

Order Id


Order Id will be kept Confidential
Your Name:


Your Review:
Rating:   A   B   C   D   F  

Enter the code in the box below:



Related Tutorials
$12.00

This Tutorial was purchased 5 times & rated A by student like you.

Full set of lab with working programs. Exercise 1: Lecture review: Binary Search Tree Create a project using the classes BinarySearchTree, Node, and Main in the DocSharing area labeled “The BST." Compile the project, run it, and review the code that is given carefully. These programs test the..
$12.00

This Tutorial was purchased 6 times & rated A+ by student like you.

General Instructions Exercise 1 uses the programs in DocSharinglabeled “Search algorithms." Exercise 1: Review of the Lecture Content Create a project using the ArrayList class and the Main class provided in DocSharing. The ArrayList class contains implementations of the first three sea..
$12.00

This Tutorial was purchased 9 times & rated No rating by student like you.

General Instructions Exercise 1 uses the programs in DocSharinglabeled “Minimum," “Factorial,” and “Sorting algorithms." Exercise 1: Review of the Lecture Contents Create projects using the classes in the DocSharing areas labeled “Minimum," “Factorial,” and “Sorting algorithms." Compile t..
$12.00

This Tutorial was purchased 4 times & rated A+ by student like you.

General Instructions Exercises 1, 2, and 3 use the programs in DocSharinglabeled “User-defined linked list." Exercise 4 uses the programs in DocSharinglabeled “Using java.util.LinkedList." Exercise 1: Review of Linked Lists Create a project using the classes in the DocSharing area lab..
$12.00

This Tutorial was purchased 4 times & rated A by student like you.

General Instructions Exercises 1, 2, and 3 use the programs in DocSharinglabeled “User-defined array list." Exercise 4 uses the programs in DocSharinglabeled “Using java.util.ArrayList." Exercise 1: Review of array-based lists Create a project using the classes in the DocSharing area ..
$12.00

This Tutorial was purchased 4 times & rated A+ by student like you.

General Instructions Exercises 1, 2, 4, and 5 use the programs in DocSharinglabeled “User-defined classes." Exercises 7 and 8 use the programs in DocSharinglabeled “Using interfaces." Exercise 1: Review of classes Create a project using the classes in the DocSharing area labeled “User..
$37.00

This Tutorial was purchased 9 times & rated A by student like you.

ECET 370 Week 1 Lab 1 ECET 370 Week 2 Lab 2 ECET 370 Week 3 Lab 3 Linked Lists ECET 370 Week 4 Lab 4 Complexity of Computational Problems ECET 370 Week 5 Lab 5 Search Algorithms and Techniques ECET 370 Week 7 Lab 7 Binary Trees  ..
$9.99

This Tutorial was purchased 3 times & rated A+ by student like you.

ECET 370 Week 1 iLab Array-Based Implementations 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 ..
$9.99

This Tutorial was purchased 3 times & rated A by student like you.

ECET 370 Week 3 ilab The Stack and the Queue ADTs iLAB OVERVIEW Scenario and Summary 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 exerc..
$9.99

This Tutorial was purchased 4 times & rated A+ by student like you.

ECET 370 Week 4 ilab The Efficiency of Algorithms and Sorting iLAB OVERVIEW Scenario and Summary The purpose of the lab exercises is to help the student acquire skills in developing programs that involve algorithm analysis, recursion, and sorting. Deliverables There are four e..
$9.99

This Tutorial was purchased 3 times & rated A by student like you.

ECET 370 Week 5 ilab Search Techniques and Hashing iLAB OVERVIEW Scenario and Summary The purpose of the lab exercises is to help the student acquire skills in developing programs that involve search algorithms and techniques. Deliverables There are four exercises in this lab,..
$9.99

This Tutorial was purchased 3 times & rated No rating by student like you.

ECET 370 Week 6 ilab Binary Trees iLAB OVERVIEW Scenario and Summary The purpose of the lab exercises is to help the student acquire skills in developing programs that involve the use of binary trees. We will be concentrating primarily on binary search trees, or BSTs. Deliverables..
$9.99

This Tutorial was purchased 3 times & rated A+ by student like you.

ECET 370 Week 7 ilab Collections Framework iLAB OVERVIEW Scenario and Summary The purpose of the lab exercises is to help the student acquire skills in developing programs that involve the use of the collections framework. Deliverables There are five exercises in this lab, alt..
Tags:
ECET 370 © 2017 All Rights Reserved.Powered by:Ash Tutorial