ECET 370 ECET370 ECET/370 ENTIRE COURSE HELP – DEVRY UNIVERSITY

Description

ECET 370 ECET370 ECET/370 ENTIRE COURSE HELP – DEVRY UNIVERSITY

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

ECET 370 Week 1 iLab Array Based Implementations (New Syllabus)

ECET 370 Week 2 ilab Linked Lists (New Syllabus)

ECET 370 Week 3 ilab The Stack and the Queue ADTs (New Syllabus)

ECET 370 Week 4 ilab The Efficiency of Algorithms and Sorting (New Syllabus)

ECET 370 Week 5 ilab Search Techniques and Hashing (New Syllabus)

ECET 370 Week 6 ilab Binary Trees (New Syllabus)

ECET 370 Week 7 ilab Collections Framework (New Syllabus)

ECET 370 ECET370 ECET/370 ENTIRE COURSE HELP – DEVRY UNIVERSITY

ECET 370 Week 1 Lab 1

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.

ECET 370 ECET370 ECET/370 ENTIRE COURSE HELP – DEVRY UNIVERSITY

ECET 370 Week 2 Lab 2

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.