Ecet370 All Ilabs Week 1 - Week 7

Front 1

ECET370 All Ilabs Week 1 - Week 7
Copy the link:

http://www.homeworkmade.com/ecet-370/ecet370-all-ilabs-week-1-week-7/

Back 1

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

Front 2

ECET370 Week 1 Lab 1
Copy the link:

http://www.homeworkmade.com/ecet-370/ecet370-week-1-lab-1/

Back 2

General Instructions

Exercises 1, 2, 4, and 5 use the programs in DocSharing labeled “User-defined classes."

Exercises 7 and 8 use the programs in DocSharing labeled “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.

Front 3

ECET370 Week 2 Lab 2
Copy the link:

http://www.homeworkmade.com/ecet-370/ecet370-week-2-lab-2/

Back 3

General Instructions

Exercises 1, 2, and 3 use the programs in DocSharing labeled “User-defined array list."

Exercise 4 uses the programs in DocSharing labeled “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.

Front 4

ECET370 Week 3 Lab 3 Linked Lists
Copy the link:

http://www.homeworkmade.com/ecet-370/ecet370-week-3-lab-3-linked-lists/

Back 4

General Instructions

Exercises 1, 2, and 3 use the programs in DocSharing labeled “User-defined linked list."

Exercise 4 uses the programs in DocSharing labeled “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.

Front 5

ECET370 Week 4 Lab 4 Complexity of Computational Problems
Copy the link:

http://www.homeworkmade.com/ecet-370/ecet370-week-4-lab-4-complexity-of-computational-problems/

Back 5

General Instructions

Exercise 1 uses the programs in DocSharing labeled “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.

Front 6

ECET 370 Week 5 Lab 5 Search Algorithms and Techniques
Copy the link:

http://www.homeworkmade.com/ecet-370/ecet-370-week-5-lab-5-search-algorithms-and-techniques/

Back 6

Exercise 1 uses the programs in DocSharing labeled “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? 

Front 7

ECET370 Week 7 Lab 7 Binary Trees
Copy the link:

http://www.homeworkmade.com/ecet-370/ecet370-week-7-lab-7-binary-trees/

Back 7

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