For more course tutorials visit

ECET 370 Entire Course (Devry) ECET 370 Week 1 Labs 1 ECET 370 Week 2 Labs 2 ECET 370 Week 3 Lab 3 Linked Lists ECET 370 Week 4 Lab 4 Complexities of Computational Problems ECET 370 Week 5 Lab 5 Search Algorithms and Techniques ECET 370 Week 7 Lab 7 Binary Trees 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. ECET 370 Week 1 Lab 1 (Devry)

ECET 370 Week 2 Lab 2 (Devry) Theories on Groups. Of all the theories discussed in Chapter 3 (field, social exchange, learning psychoanalytic, systems, empowerment, and feminist), which one helps you understand best 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 Array List class provided in the lecture. how groups function? In 250 – 300 words, discuss your rationale for selecting this theory and the concepts of the theory that make it seem most relevant to your understanding. 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. ECET 370 Week 3 Lab 3 Linked Lists (Devry)

ECET 370 Week 4 Lab 4 Complexity of Computational Problems (Devry) 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. General Instructions Exercise 1 uses the programs in DocSharing labeled “Search algorithms." Exercise 1: Review of the Lecture Content Create a project using the Array List class and the Main class provided in DocSharing. The Array List 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 ECET 370 Week 5 Lab 5 Search Algorithms and Techniques (Devry)

ECET 370 Week 7 Lab 7 Binary Trees (Devry) Full set of lab with working programs. Exercise 1: Lecture review: Binary Search Tree Create a project using the classes Binary Search Tree, 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.

For more course tutorials visit