Ecet 370 Devry Course Tutorial / Devrycart

Front 1

ECET 370 Entire Course

Back 1

Published by www.devrycart.com

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

ECET 370 Week 1 Lab 1

Back 2

Published by www.devrycart.com


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.

Front 3

ECET 370 Week 2 Lab 2

Back 3

Published by www.devrycart.com

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.

Front 4

ECET 370 Week 3 Lab 3 Linked Lists

Back 4

Published by www.devrycart.com

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.

Front 5

ECET 370 Week 4 Lab 4 Complexity of Computational Problems

Back 5

Published by www.devrycart.com

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.

Front 6

ECET 370 Week 5 Lab 5 Search Algorithms and Techniques

Back 6

Published by www.devrycart.com

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.

Front 7

ECET 370 Week 7 Lab 7 Binary Trees

Back 7

Published by www.devrycart.com

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.