1 / 16

ECET 370 assist Endless Education/ecet370assist.com

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>ECET 370 Week 7 Lab 7 Binary Trees <br><br>

cam351
Télécharger la présentation

ECET 370 assist Endless Education/ecet370assist.com

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ECET 370 assist Endless Education/ecet370assist.com FOR MORE CLASSES VISIT www.ecet370assist.com

  2. ECET 370 Entire Course (Devry) • 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

  3. ECET 370 Week 1 iLab Array Based Implementations New Syllabus • 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

  4. ECET 370 Week 1 Lab 1 (Devry) • 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.

  5. ECET 370 Week 2 ilab Linked Lists New Syllabus • 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

  6. ECET 370 Week 2 Lab 2 (Devry) • 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.

  7. ECET 370 Week 3 ilab The Stack and the Queue ADTs New Syllabus • 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. Deliverable

  8. ECET 370 Week 3 Lab 3 Linked Lists (Devry) • 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.

  9. ECET 370 Week 4 ilab The Efficiency of Algorithms and Sorting New Syllabus • 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 textbook. Exercises 2 and 4 require not only software development but also explanations about the results of the experiments that are conducted. Create separate Word documents to provide the details required in the

  10. ECET 370 Week 4 Lab 4 Complexity of Computational Problems (Devry) • 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.

  11. ECET 370 Week 5 ilab Search Techniques and Hashing New Syllabus • 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

  12. ECET 370 Week 5 Lab 5 Search Algorithms and Techniques (Devry) • 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

  13. ECET 370 Week 6 ilab Binary Trees New Syllabus • 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 and name it Week 6 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

  14. ECET 370 Week 7 ilab Collections Framework New Syllabus • 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 folder Week 7 Lab, and drop the resulting zipped folder into the Dropbox. Note that Exercises 2, 3, 4, and 5 require software development. Place only source fil

  15. 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 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 http://java.sun.com/docs/books/tutorial/java/nutsandbolts/_keywords.html

  16. ECET 370 assist Endless Education/ecet370assist.com FOR MORE CLASSES VISIT www.ecet370assist.com

More Related