Site Loader

I, Soundarya Kanchari
(104875555)
confirms that I will keep the content of
this assignment confidential. I confirm that I have not received any
unauthorized assistance in preparing for or writing this assignment. I
acknowledge that a mark of 0 may be assigned for copied work.

 

1.      
I
have generated a random string and I have inserted them into the cuckoo hash
table and calculated the average time for each insertion. The length of my
random string used is 10. Here is the following screenshot of my output.

We Will Write a Custom Essay Specifically
For You For Only $13.90/page!


order now

Output:

 

2.      
This
program is used to find random string in hash table and calculate the average
time for each insertion. The following screenshot shows the output.

Output:

 

3.      
Comparing
the average time for the hash table for the given operation.

Technique

Time taken for Insertion

Time for Searching along with the deletion.

Cuckoo

8751

10139

Quadratic Probing

8660

9468

Separate Chaining

10175

10198

**Note: Time Mentioned is represented in
Nano Seconds.

Cuckoo Hash Table Output:

Quadratic Probing Output:

Separate Chaining Output:

 

As per the complexities, the three techniques are showing almost the same
time for the operations but the insertion is taking less time when compared to
searching and deletion.

4.      
Implemented
4a,4b and 4c for all the trees for the integer keys 1 to 100000.          AVL
TREE:

 

 

BINARY SEARCH TREE:

 

        REDBLACKBST TREE:    

SPLAY TREE:

 

5.      
Implemented
5a,5b and 5c for all the trees.

AVL TREE:

 

BINARY SEARCH TREE:

 

 RED BLACK BST
TREE:

 

SPLAY TREE:

 

6.      
Comparing
all the tables average time insertions, searchings and deletions.

 

 

 

 

 

 

 

Question no 4

Question no 5

Methods

4.Insertion

4.Deletion

4.Search

5.Insertion

5.Deletion

5.Search

Binary Search Tree

163

142

1431

1436357

6503

521859

AVL Tree

176

129

1293

377184

454465

362

Splay Tree

204

256

1057

181

148

1502

Reb Black BST

176

138

1235

447

880

428

 

**Note: Time Mentioned is represented in
Nano Seconds.

The above table shows the Average and
worst cases of Binary search Tree ,AVL Tree,Splay Tree and RedBlack BST Tree.

Binary search tree is better results in
worst case rather than the average case.

In my opinion
RedBlack BST Tree and Splay Tree is useful for real time computation problems
because it is showing good results in average and worst cases.

Post Author: admin

x

Hi!
I'm Erica!

Would you like to get a custom essay? How about receiving a customized one?

Check it out