Can you this assignment for me?

profileomarazjzq582

 

 

Submit a PDF of your solution. You can either generate your solution electronically or scan your hand-drawn/written solution.  If you scan your solution be sure that the scan is good quality (readable and clear). If the TA cannot read your solution it will not be graded (i.e., you will receive 0 for that question).

 

 

 

The first 5 problems are taken from the current version of the textbook http://opendatastructures.org/ods-java/

 

Problem 1: Exercise 4.1  Illustrate the search paths for 2.5 and 5.5 on the skiplist in Figure 4.1.

 

 

 

Problem 2: Exercise 4.2  Illustrate the addition of the values 0.5 (with a height of 1) and then 3.5 (with a height of 2) to the skiplist in Figure 4.1.

 

 

 

Problem 3: Exercise 4.3  Illustrate the removal of the values 1 and then 3 from the skiplist in Figure 4.1.

 

 

 

Problem 4: Exercise 4.4  Illustrate the execution of $ \mathtt{remove(2)}$ on the SkiplistList in Figure 4.5.

 

 

 

Problem 5: Exercise 4.5  Illustrate the execution of $ \mathtt{add(3,x)}$ on the SkiplistList in Figure 4.5. Assume that$ \mathtt{pickHeight()}$ selects a height of 4 for the newly created node.

 

 

Problem 6: Suppose you have an SEList with blocksize b=8. What is the minimum an maximum number of blocks possible when 

 

  1. There are n=23 elements in the SEList
  2. There are n=716 elements in the SEList
    • 10 years ago
    • 40
    Answer(0)
    Bids(0)