160 likes | 178 Views
FOR MORE CLASSES VISIT <br>www.ecet370assist.com<br><br>ECET 370 Week 1 Lab 1<br>ECET 370 Week 2 Lab 2<br>ECET 370 Week 3 Lab 3 Linked Lists<br>ECET 370 Week 4 Lab 4 Complexity of Computational Problems<br>ECET 370 Week 5 Lab 5 Search Algorithms and Techniques<br>
E N D
ECET 370 ASSIST A Guide to career/ecet370assist.com FOR MORE CLASSES VISIT www.ecet370assist.com
ECET 370 Entire Course (Devry) FOR MORE CLASSES VISIT www.ecet370assist.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
ECET 370 Week 1 iLab Array Based Implementations New Syllabus FOR MORE CLASSES VISIT www.ecet370assist.com ECET 370 Week 1 iLab Array-Based Implementations 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
ECET 370 Week 1 Lab 1 (Devry) FOR MORE CLASSES VISIT www.ecet370assist.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.
ECET 370 Week 2 ilab Linked Lists New Syllabus FOR MORE CLASSES VISIT www.ecet370assist.com ECET 370 Week 2 ilab Linked Lists 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
ECET 370 Week 2 Lab 2 (Devry) FOR MORE CLASSES VISIT www.ecet370assist.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.
ECET 370 Week 3 ilab The Stack and the Queue ADTs New Syllabus FOR MORE CLASSES VISIT www.ecet370assist.com ECET 370 Week 3 ilab The Stack and the Queue ADTs 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
ECET 370 Week 3 Lab 3 Linked Lists (Devry) FOR MORE CLASSES VISIT www.ecet370assist.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. Extend the class Main to test the functions isEmpty, search and remove of the class LinkedList.
ECET 370 Week 4 ilab The Efficiency of Algorithms and Sorting New Syllabus FOR MORE CLASSES VISIT www.ecet370assist.com ECET 370 Week 4 ilab The Efficiency of Algorithms and Sorting 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
ECET 370 Week 4 Lab 4 Complexity of Computational Problems (Devry) FOR MORE CLASSES VISIT www.ecet370assist.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. 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.
ECET 370 Week 5 ilab Search Techniques and Hashing New Syllabus FOR MORE CLASSES VISIT www.ecet370assist.com ECET 370 Week 5 ilab Search Techniques and Hashing 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
ECET 370 Week 5 Lab 5 Search Algorithms and Techniques (Devry) FOR MORE CLASSES VISIT www.ecet370assist.com General InstructionsExercise 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.
ECET 370 Week 6 ilab Binary Trees New Syllabus FOR MORE CLASSES VISIT www.ecet370assist.com ECET 370 Week 6 ilab Binary Trees 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
ECET 370 Week 7 ilab Collections Framework New Syllabus FOR MORE CLASSES VISIT www.ecet370assist.com ECET 370 Week 7 ilab Collections Framework 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
ECET 370 Week 7 Lab 7 Binary Trees (Devry) FOR MORE CLASSES VISIT www.ecet370assist.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.
ECET 370 ASSIST A Guide to career/ecet370assist.com FOR MORE CLASSES VISIT www.ecet370assist.com