DEVRY ECET 370 Week 3 ilab The Stack and the Queue ADTs NEW

Check this A+ tutorial guideline at

For more classes visit

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

UOP ECET 370 Week 1 Lab 1

Check this A+ tutorial guideline at

For more classes visit

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-defined classes." Compile it, run it, and review the code that is given carefully.

Exercise 2: User-defined methods The function area of the Triangle class is the framework of the actual method. Modify it so that it calculates the area of the triangle. Write a Main class to test your area method. Note: to calculate the area of a triangle from the vertices, first find the distances between each pair of vertices to obtain the length of the sides of the triangle. Then apply Heron’s formula to calculate the area given the length of the sides.

Exercise 3: Shallow versus deep copy Provide an example of shallow copy of objects and an example of deep copy of objects.

Exercise 4: Passing parameters to methods Write a function that swaps two Point objects. Use the code given below: import java.util.*; public class Main { public Main() { Scanner Scanner(System.in); System.out. print("Enter x and y coordinates of first point: "); Point Point (in.nextDouble(), in.nextDouble()); System.out. print("Enter x and y coordinates of second point: "); Point Point (in.nextDouble(), in.nextDouble()); swap(p1, p2); System.out.println(" Compile it, run it, and review the code that is given carefully. Note: The class Point implements the Comparable interface. The Comparable interface contains a single method: compareTo, which is used to compare two objects p and q of the same class type. When calling p.compareTo(q), it returns an integer. If this value is negative it means that p is smaller; if it is equal to zero then , and if the value is positive, it indicates that p is greater than q.

Exercise 8: Implementation of interfaces Using the class Point in the DocSharing area labeled “Using interfaces," write an application that declares an array of Points, fills the array with random points, and finds the smallest point in the array. 
Related Tutorials

UOP ECET 370 Week 2 Lab 2

Check this A+ tutorial guideline at

For more classes visit

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 labeled “User-defined array list." Compile it, run it, and review the code that is given carefully. This code tests the ArrayList class provided in the lecture.

Exercise 2: A user-defined array list Modify the class ArrayList given in the lecture by adding to it the functions listed below for Exercise 2. In each case, the appropriate error message should be generated if an invalid condition occurs. For example, an error message should be generated when trying to insert an item in a given location in the list and the location is out of range. a. ArrayList(int size): create a constructor that sets the size of the array list to the value passed in size (note that the class variable SIZE cannot be final anymore). b. int length(): create this function to determine the number of items in the list (accessor function). c. intgetSize(): create this function to determine the size of the list (accessor function). d. void clear(): create this function to remove all of the items from the list. After this operation, the length of the list is zero. e. void replace(int location, int item): create this function to replace the item in the list at the position specified by location. The item should be replaced with item. f. void insert(int location, int item): create this function to add an item to the list at the position specified by location. g. void remove(int item): create this function to delete an item from the list. All occurrences of item in the list should be removed. h. int get(int location): create a function that returns the element at location. i. public ArrayList copy(): create a function that makes a deep copy to another ArrayList object.

Exercise 3: Using an array-based list Using the class ArrayList completed in the previous exercise, write a program that uses it to store 100 random numbers. Consider that each of these random numbers is an integer in the interval [0, 200]. Write the program in such a way that there are no number duplicates.

Exercise 4: Review of the library class java.util.ArrayList Create a project using the classes in the DocSharing area labeled “Using java.util.ArrayList." Compile it, run it, and review the code that is given carefully. This code is the complete program given in our lecture that tests the library class java.util.ArrayList.

Exercise 5: Using the library class java.util.ArrayList Rewrite Exercise 3 (above) using the class java.util.ArrayList to store the 100 random numbers.

DEVRY ECET 340 Week 7 iLab HVAC Automatic Temperature Controller (100% Score) NEW

Check this A+ tutorial guideline at

For more classes visit

Title: HVAC Controller
I. OBJECTIVES
1.To become familiar with the thermistor
2.To use integrated modular programming techniques in developing the project
3.To write a report document for the HVAC Controller

DEVRY ECET 370 Week 1 iLab Array-Based Implementations NEW

Check this A+ tutorial guideline at

For more classes visit

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

UOP ECET 370 Week 7 ilab Collections Framework NEW

Check this A+ tutorial guideline at

For more classes visit

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, although not all of them will be required for submission. Be sure to read the following instructions carefully.
Exercise 1: No submission is required.

Create a folder and name it Week 7 Lab. Inside this folder, create the subfolders Ex2, Ex3, Ex4, and Ex5. Place the solution to each of the four exercises required for submission in the corresponding subfolder. Compress the folder Week 7 Lab, and drop the resulting zipped folder into the Dropbox.

Note that Exercises 2, 3, 4, and 5 require software 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

Access the software at https://lab.devry.edu .

Microsoft Visual Studio 2012

Access the software at https://lab.devry.edu .

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

UOP ECET 370 Entire Course

Check this A+ tutorial guideline at

For more classes visit

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

DEVRY ECET 370 Week 6 ilab Binary Trees NEW

Check this A+ tutorial guideline at

For more classes visit

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

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.

Exercise 1: No submission is required.

Create a folder and name it Week 6 Lab. Inside this folder, create the subfolders Ex2, Ex3, Ex4, and Ex5. Place the solution to each of the four exercises required for submission in the corresponding subfolder. Compress the folder Week 6 Lab, and place the resulting zipped folder into the Dropbox.

Note that Exercises 2, 3, 4, and 5 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: 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 5 Lab 5 Search Algorithms and Techniques

Check this A+ tutorial guideline at

For more classes visit

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 search methods explained in this week’s lecture: sequential, sorted, and binary search. The Main class uses these three methods. These programs test the code discussed in the lecture. Compile the project, run it, and review the code that is given carefully.

Exercise 2: Search Algorithms and Techniques Expand the project developed in the previous exercise to perform the following experiment: time the three search methods several times each and record the results. Compare the running times of the three search methods (sequential search, sorted search, and binary search) which are obtained during the experiment. What conclusions can be drawn?

Exercise 3: Searching Applications Select one of the following two problems to solve: Problem 1: Design and implement an algorithm that determines whether or not a given array of elements, list1, is completely contained within another given array of elements, list2. Consider two different scenarios: 1) both arrays are sorted; 2) both arrays are unsorted. Problem 2: Design an algorithm that when given a collection of integers in an unsorted array, determines the second smallest number (or second minimum). For example, if the array consists of the values 12, 23, 9, 17, 3, the algorithm should report the value 9, since it is the second smallest number in the array. Write a function that receives an array as a parameter and returns the second smallest number. To test your function, write a program that populates an array with random numbers and then call your function. Exercise 4: Hashing Suppose that the type of key in a hashing application you are implementing is String (Sections 19.6 and 19.7 in our textbook explain hash functions for strings). Design, implement, and test a hash function that converts a key to a hash value. Assume that the size of the hash table is a prime number.

DEVRY ECET 370 Week 2 ilab Linked Lists NEW

Check this A+ tutorial guideline at

For more classes visit

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:

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

UOP ECET 370 Week 4 Lab 4 Complexity of Computational Problems

Check this A+ tutorial guideline at

For more classes visit

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 them, run them, and review the code that is given carefully. These programs test the code discussed in the lecture.

Exercise 2: Efficiency of Algorithms Problem 2 in the Section “Projects” at the end of Chapter 9 in the textbook: find a value of n for which Loop B is faster.

Exercise 3: Recursion Problem 1 in the Section “Projects” at the end of Chapter 10 in the textbook: recursive algorithm to find the square root of a given number.

Exercise 4: Sorting In this week’s lecture, the algorithms quicksort and bubblesort are described and implemented. In DocSharing, under the section labeled “Sorting algorithms," you can find the class ArrayList where these sorting algorithms are implemented. Write a Java program that times both of them for various values of n. Create a table to record the times. Regarding the efficiency of both sorting methods, what conclusion can be reached from this experiment? Note: You can probably save development time by using the program from Week 2 to generate a list of the 1000 smallest prime numbers (in random order). This list could then be used as the input to the sorting algorithms.

DEVRY ECET 370 Week 5 ilab Search Techniques and Hashing NEW

Check this A+ tutorial guideline at

For more classes visit

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, although not all of them will be required for submission. Be sure to read the following instructions carefully.

Exercise 1: No submission is required.

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.

Create a folder and name it Week 5 Lab. 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 5 Lab, and place 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 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

UOP ECET 370 Entire Course

Check this A+ tutorial guideline at

For more classes visit

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

UOP ECET 370 Week 3 Lab 3 Linked Lists

Check this A+ tutorial guideline at

For more classes visit

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 labeled “User-defined linked list." Compile it, run it, and review the code that is given carefully. This code tests the LinkedList class provided in the lecture. Extend the class Main to test the functions isEmpty, search and remove of the class LinkedList.

Exercise 2: A User-Defined Linked List Modify the class LinkedList given in the lecture by adding to it the functions listed below for Exercise 2. In each case, the appropriate error message should be generated if an invalid condition occurs. a. toString(): modify the display function to overload the toString function of the Object class. b. int length(): create this function to determine the number of items in the list (accessor function). c. void clear(): create this function to remove all of the items from the list. After this operation is completed, the length of the list is zero. d. void insertEnd(int item): create this function to insert item at the end of the list. e. void replace(int location, int item): create this function to replace the item in the list at the position specified by location. The item should be replaced with item. f. int get(int location): create a function that returns the element at the position location.

Exercise 3: Using a Linked List This exercise is similar to Exercise 3 in Lab 2, but uses the LinkedList class implemented in Exercise 2 above. That is, using the class LinkedList, write a program that uses it to store 100 random numbers. Again, consider that each of these random numbers is an integer in the interval [0, 200]. Write the program in such a way that there are no number duplicates.

Exercise 4: Review of the Library Class java.util.LinkedList Create a project using the class in the DocSharing area labeled “Using java.util.LinkedList." Compile it, run it, and review the code that is given carefully. This code is the complete program given in our lecture that tests the library class java.util.LinkedList.

Exercise 5: Using the Library Class java.util.LinkedList Rewrite Exercise 3 (above) using the class java.util.LinkedList to store the 100 random numbers. 

DEVRY ECET 370 Week 4 ilab The Efficiency of Algorithms and Sorting NEW

Check this A+ tutorial guideline at

For more classes visit

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 exercises in this lab, although not all of them will be required for submission. Be sure to read the following instructions carefully.

Exercise 1: No submission is required.

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. Place the solution to each of the three exercises required for submission in the corresponding subfolder. Compress the folder Week 4 Lab using a program like WinZip, and place 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 the Lecture Contents

Back to Top

Create three projects, minimum, factorial, and sorting algorithms, using the classes in

• Minimum

UOP ECET 370 Week 7 Lab 7 Binary Trees

Check this A+ tutorial guideline at

For more classes visit

ECET 370 Week 7 Lab 7 Binary Trees

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 code discussed in our lecture.

Exercise 2: An improved BST class Modify the class BinarySearchTree so that it contains the toString method, instead of the display method that was given originally.

Exercise 3: Using a BST in an application Use a binary search tree to implement a dictionary that contains the keywords in the Java language. Test it. Note that you can use the programs from the previous exercises. For a list of the keywords in Java, visit http://java.sun.com/docs/books/tutorial/java/nutsandbolts/_keywords.html.

Exercise 4: Recursion and Binary Trees Write a recursive algorithm that counts the nodes in a binary search tree.