ECET 370 Read, Lead, Succeed/uophelpdotcom

1
ECET 370 Read, Lead, Succeed/uophelpdotcom

• For more course tutorials visit
• www.uophelp.com

2
ECET 370 Entire Course (Devry)

• For more course tutorials visit
• www.uophelp.com
•  
•  
• 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 
•  
•  

3
ECET 370 Week 1 Lab 1 (Devry)

• For more course tutorials visit
• www.uophelp.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. Write a Main
  class to test your area method. Note to
  calculate the area of a triangle from the
  vertices, first find the distances between each
  pair of vertices to obtain the length of the
  sides of the triangle. Then apply Herons formula
  to calculate the area given the length of the
  sides.
• Exercise 3 Shallow versus deep copy Provide an
  example of shallow copy of objects and an example
  of deep copy of objects.

4
ECET 370 Week 2 Lab 2 (Devry)

• For more course tutorials visit
• www.uophelp.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 Array List class
  provided in the lecture.
• Exercise 2 A user-defined array list Modify the
  class Array List given in the lecture by adding
  to it the functions listed below for Exercise 2.
  In each case, the appropriate error message
  should be generated if an invalid condition
  occurs. For example, an error message should be
  generated when trying to insert an item in a
  given location in the list and the location is
  out of range. a. Array List (int size) create a
  constructor that sets the size of the array list
  to the value passed in size (note that the class
  variable SIZE cannot be final anymore). b. int
  length() create this function to determine the
  number of items in the list (access or function).
  c. intgetSize() create this function to
  determine the size of the list (accessor
  function). d. void clear() create this function
  to remove all of the items from the list. After
  this operation, the length of the list is zero.
  e. void replace(int location, int item) create
  this function to replace the item in the list at
  the position specified by location. The item
  should be replaced with item. f

5
ECET 370 Week 3 Lab 3 Linked Lists (Devry)

• For more course tutorials visit
• www.uophelp.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 Linked List class
  provided in the lecture. Extend the class Main to
  test the functions is Empty, search and remove of
  the class Linked List.
• Exercise 2 A User-Defined Linked List Modify the
  class Linked List given in the lecture by adding
  to it the

6
ECET 370 Week 4 Lab 4 Complexity of Computational
Problems (Devry)

• For more course tutorials visit
• www.uophelp.com
•   
• 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.
• 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.
• Exercise 3 Recursion Problem 1 in the Section
  Projects at the end of Chapter 10 in the
  textbook recursive algorithm to find the square
  root of a given number. Exercise 4 Sorting In
  this weeks lecture, the algorithms quick sort
  and bubble sort are described and implemented. In
  DocSharing, under the section labeled Sorting

7
ECET 370 Week 5 Lab 5 Search Algorithms and
Techniques (Devry)

• For more course tutorials visit
• www.uophelp.com
•  
•   
• General InstructionsExercise 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
  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.Exercise 2
  Search Algorithms and Techniques Expand the
  project developed in the previous exercise to
  perform the following experiment time the

8
ECET 370 Week 7 Lab 7 Binary Trees (Devry)

• For more course tutorials visit
• www.uophelp.com
•  
•  
• 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.
• Exercise 2 An improved BST class Modify the
  class Binary Search Tree so that it contains the
  to String 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/tutoria
  l/java/nutsandbolts/_keywords.html.
• Exercise 4 Recursion and Binary Trees Write a
  recursive algorithm that counts the nodes in a
  binary search

9
ECET 370 Read, Lead, Succeed/uophelpdotcom

• For more course tutorials visit
• www.uophelp.com