Problem Set 3: Trees and Hashing

Anonymous
timer Asked: Jul 4th, 2018
account_balance_wallet $10

Question description

Overview: This assignment will cover that material on trees and hashing. Provide the solutions for the problems in this assignment a Microsoft Word document. A Power Point file or scanned handwritten drawing for Problem 1(a) is also fine.

Remember to include your name and course number within all files that you submit.

Problem Set 3: Trees and Hashing CS3330 Data Structures and Algorithms Term 5 2018: May 29 – July 29 Dr. Jack Davault Overview: This assignment will cover that material on trees and hashing. Provide the solutions for the problems in this assignment a Microsoft Word document. A Power Point file or scanned handwritten drawing for Problem 1(a) is also fine. Remember to include your name and course number within all files that you submit. 1. [5 points] Trees. Read the assigned chapter and notes for Week 5 located in the Modules area in Canvas. Then answer the following questions: (a) [3 points] Draw an Adelson-Velskii and Landis (AVL) tree for the following nodes: 39, 73, 43, 27, 65, 89, 10, 14, 68, 26, 22, 44, 55, 60, 91, 94. Hint: When you draw your tree, it must an AVL tree instead of just a regular binary tree or a binary search tree (BST). There are a few ways that you can arrange the layout for this tree; however, remember data within the tree must follow the rules of an AVL tree. I recommend that you first draw the tree with links and empty nodes. Then sort the items in the list and place them in the appropriate nodes within the tree so that it forms an AVL tree. (b) [2 points] Briefly explain the advantages of a binary tree in comparison to a linked list. 2. [5 points] Hashing. Read the assigned chapter and notes for Week 6 located in the Modules area in Canvas. Then provide solutions to the following problems: (a) [2 points] Briefly explain what Linear Probing is used for and describe the main problem associated it, along with a simple example of a mathematical function used to implement it. (b) [3 points] Perform an Internet search and briefly discuss in a few paragraphs a computer related algorithm based on hashing. Provide an example with a diagram or table to help illustrate how the algorithm works. List your sources at the end of your paragraphs using APA format. Other Notes: Submit your solutions using the Problem Set 3 link provided in the Assignments area. Please do not hesitate to ask questions in the Ask the Instructor forum or via e-mail.

Tutor Answer

Brialice
School: New York University

...

flag Report DMCA
Review

Anonymous
Awesome! Exactly what I wanted.

Similar Questions
Hot Questions
Related Tags

Brown University





1271 Tutors

California Institute of Technology




2131 Tutors

Carnegie Mellon University




982 Tutors

Columbia University





1256 Tutors

Dartmouth University





2113 Tutors

Emory University





2279 Tutors

Harvard University





599 Tutors

Massachusetts Institute of Technology



2319 Tutors

New York University





1645 Tutors

Notre Dam University





1911 Tutors

Oklahoma University





2122 Tutors

Pennsylvania State University





932 Tutors

Princeton University





1211 Tutors

Stanford University





983 Tutors

University of California





1282 Tutors

Oxford University





123 Tutors

Yale University





2325 Tutors