ECET 370 Devry Course Tutorial (Devrycart.com)
2 views | +0 today
Follow
Your new post is loading...
Your new post is loading...
Scooped by athikoor
Scoop.it!

ECET 370 Week 3 Lab 3 Linked Lists

ECET 370 Week 3 Lab 3 Linked Lists | ECET 370 Devry Course Tutorial (Devrycart.com) | Scoop.it
Exercises 1, 2, and 3 use the programs in DocSharinglabeled “User-defined linked list."
athikoor's insight:

For more course tutorials visit

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

more...
No comment yet.
Scooped by athikoor
Scoop.it!

ECET 370 Entire Course

ECET 370 Entire Course | ECET 370 Devry Course Tutorial (Devrycart.com) | Scoop.it
ECET 370 Week 1 Lab 1,ECET 370 Week 2 Lab 2
athikoor's insight:

For more course tutorials visit

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

 

more...
No comment yet.
Scooped by athikoor
Scoop.it!

ECET 370 Week 7 Lab 7 Binary Trees

ECET 370 Week 7 Lab 7 Binary Trees | ECET 370 Devry Course Tutorial (Devrycart.com) | Scoop.it
Lecture review: Binary Search Tree Create a project using the classes BinarySearchTree, Node, and Main in the DocSharing area labeled
athikoor's insight:

For more course tutorials visit

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

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.

Exercise 4: Recursion and Binary Trees Write a recursive algorithm that counts the nodes in a binary search tree.

Exercise 5: Using properties of BSTs Write an algorithm getMax to find the maximum value stored in a binary search tree.

 

 

more...
No comment yet.