Introduction to the Tree ADT.
The student will:
Explain the standard structure of a Tree.
Implement binary trees.
Implement binary search trees.
Implement a Heap.
The student will:
Use recursive algorithms to solve different problems.
Write correct recursive Java code to solve different problems.
The student will:
Explain the differences between pre-order, in-order and post-order traversals.
Implement code to conduct pre-order, in-order and post-order traversals of binary trees.
Quiz 05 Apr 12:00 AM
Outcomes assessed: Learn about and implement the Tree data structure, Understand recursion and how to develop recursive algorithms and programs
This assessment will verify that students understand the basics of binary tree traversal.
Assignment
Outcomes assessed: Learn about and implement the Tree data structure, Understand recursion and how to develop recursive algorithms and programs, Learn about the Java programming language, Use standard libraries or packages as well as advanced object-oriented programming techniques, Be exposed to software engineering techniques, Be exposed to software testing techniques
This assessment will verify that students understand the basics of binary search trees by implementing a Contact organizer.
Quiz 12 Apr 12:00 AM
Outcomes assessed: Learn about and implement the Tree data structure, Understand recursion and how to develop recursive algorithms and programs
This assessment will verify that students understand the basics of Heaps.
Assignment
Outcomes assessed: Learn about and implement the Tree data structure, Understand recursion and how to develop recursive algorithms and programs, Learn about the Java programming language, Use standard libraries or packages as well as advanced object-oriented programming techniques, Be exposed to software engineering techniques, Be exposed to software testing techniques
This assessment will verify that students understand the basics of Huffman trees by by using them to compress and decompress files.