ECET 370 ASSIST Teaching Effectively ecet370assistdotcom - PowerPoint PPT Presentation

About This Presentation
Title:

ECET 370 ASSIST Teaching Effectively ecet370assistdotcom

Description:

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 – PowerPoint PPT presentation

Number of Views:9

less

Transcript and Presenter's Notes

Title: ECET 370 ASSIST Teaching Effectively ecet370assistdotcom


1
ECET 370 ASSIST Teaching Effictely/ecet370assistdo
tcom
  • 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
  • ECET 370 Week 7 Lab 7 Binary Trees

3
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.
  • 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.

4
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.

5
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.

6
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.

7
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
    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.

8
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.

9
ECET 370 ASSIST Teaching Effictely/ecet370assistdo
tcom
  • FOR MORE CLASSES VISIT
  • www.ecet370assist.com
Write a Comment
User Comments (0)
About PowerShow.com