1.Write a program to implement the open addressing linear probing algorithm in JAVA or Python. Test your program with different sets of data and take screenshots for each test. Copy and paste your...

1.

Write a program to implement the open addressing linear probing algorithm in JAVA or Python. Test your program with different sets of data and take screenshots for each test. Copy and paste your code and screenshots into a Word document along with your response to the following:

Perform an asymptotic analysis of your algorithm.

• 
  
  
  Did any collisions occur while testing your data?
  
  
  




• 
  
  
  How can you resolve the collisions?
  
  
  




• 
  
  
  Explain the technique you prefer to use to resolve the open addressing linear probing collision issues.
  
  
  

The Portfolio Activity entry should be a minimum of 500 words and not more than 750 words. Use APA citations and references if you use ideas from the readings or other sources.

2.

Write a code to implement Binary Search Tree (BST). Test your program with the following data= [27, 5, 12, 85, 6, 19, 1, 8, 95, 3]. Traverse your BST as;









a) In-order






b) Pre-order






c) Post-order






Copy the code and screenshots of your output into a Word document and submit it as your Portfolio Assignment with your response to the following question:

• 
  
  
  How do in-order, pre-order, and post-order differ from each other when we traverse BST data?
  
  
  

3.

• 
  
  
  Using a Word document, illustrate the Karp-Rabin algorithm on T= AABAACAADAABAAABAA and P= AABA. Be sure to show each step of the process in your illustration.