ECET370 Inspiring Minds/newtonhelp.com

1
ECET370 Inspiring Minds /newtonhelp.Com
2

• ECET 370 Entire Course
•  
• For more course tutorials visit
• www.newtonhelp.com
•  
• ECET 370 Week 1 Lab 1
• ECET 370 Week 2 Lab 2
• ECET 370 Week 3 Lab 3 Linked Lists

3

• ECET 370 Week 1 iLab Array Based Implementations
  (New Syllabus)
•  
• For more course tutorials visit
• www.newtonhelp.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.

4

•  
• ECET 370 Week 1 Lab 1
•  
• For more course tutorials visit
• www.newtonhelp.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.
•   

5

•  
• ECET 370 Week 2 ilab Linked Lists (New Syllabus)
•  
• For more course tutorials visit
• www.newtonhelp.com
•  
• ECET 370 Week 2 ilab Linked Lists
• iLAB OVERVIEW
• Scenario and Summary
•  

6

•  
•  ECET 370 Week 2 Lab 2
•  
• For more course tutorials visit
• www.newtonhelp.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."

7

•   ECET 370 Week 3 ilab The Stack and the Queue
  ADTs (New Syllabus)
•  
• For more course tutorials visit
• www.newtonhelp.com
•  
• ECET 370 Week 3 ilab The Stack and the Queue ADTs
• iLAB OVERVIEW
• Scenario and Summary

8

• ECET 370 Week 4 ilab The Efficiency of Algorithms
  and Sorting (New Syllabus)
•  
• For more course tutorials visit
• www.newtonhelp.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.

9

•    ECET 370 Week 3 Lab 3 Linked Lists
•  
• For more course tutorials visit
• www.newtonhelp.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."

10

•    ECET 370 Week 4 Lab 4 Complexity of
  Computational Problems
•  
• For more course tutorials visit
• www.newtonhelp.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.

11

•    
• ECET 370 Week 5 ilab Search Techniques and
  Hashing (New Syllabus)
•  
• For more course tutorials visit
• www.newtonhelp.com
•  
• ECET 370 Week 5 ilab Search Techniques and
  Hashing
• iLAB OVERVIEW
• Scenario and Summary
•  

12

•    ECET 370 Week 5 Lab 5 Search Algorithms and
  Techniques
•  
• For more course tutorials visit
• www.newtonhelp.com
•  
• General Instructions
•  
• 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 weeks 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.

13

•     ECET 370 Week 6 ilab Binary Trees (New
  Syllabus)
•  
• For more course tutorials visit
• www.newtonhelp.com
•  
• ECET 370 Week 6 ilab Binary Trees
• iLAB OVERVIEW
• Scenario and Summary

14

•    ECET 370 Week 7 ilab Collections Framework
  (New Syllabus)
•  
• For more course tutorials visit
• www.newtonhelp.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.

15

•   ECET 370 Week 7 Lab 7 Binary Trees
•  
• For more course tutorials visit
• www.newtonhelp.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.

16
ECET 370 Inspiring Minds/newtonhelp.Com