Question

2 Let S be the concatenated ASCII equivalent of your firstname and your last name. a. Assume the element of S are sets of keys k, build a hash table with bucket size n = 7 using the hash function h(k) =k mod n. Resolve collision by a hybrid of linear probing and separate chaining. [3 marks] b. Write a function for 2a using your chosen programming language. Test your result using S. [3 marks] c. Using S, build a min-heap [3 marks] d. Draw the heap after 3 removals. [3 marks] [Scan and paste solution here if solution involves drawing and writing at the same time] 2 3. [Program codes should be uploaded as a separate file: Use only one programming language throughout] Let A the ASCII code equivalent of your first name only a. Build a Binary Search tree (BST) from A [2 Marks] b. List the inorder, pre-order and post-order traversal of A. [3 Marks] c. implement the Binary search algorithm and test it with the maximum value in A. [5 Marks] [Scan and paste solution here if solution involves drawing and writing at the same time] [Program codes should be uploaded as a separate file: Use only one programming language throughout]

          2
Let S be the concatenated ASCII equivalent of your firstname and your last
name.
a. Assume the element of S are sets of keys k, build a hash table with bucket size n =
7 using the hash function h(k) =k mod n. Resolve collision by a hybrid of linear
probing and separate chaining. [3 marks]
b. Write a function for 2a using your chosen programming language. Test your
result using S. [3 marks]
c. Using S, build a min-heap [3 marks]
d. Draw the heap after 3 removals. [3 marks]
[Scan and paste solution here if solution involves drawing and writing at the same
time]
2
3.
[Program codes should be uploaded as a separate file: Use only one programming
language throughout]
Let A the ASCII code equivalent of your first name only
a. Build a Binary Search tree (BST) from A [2 Marks]
b. List the inorder, pre-order and post-order traversal of A. [3 Marks]
c. implement the Binary search algorithm and test it with the maximum value in A.
[5 Marks]
[Scan and paste solution here if solution involves drawing and writing at the same
time]
[Program codes should be uploaded as a separate file: Use only one programming
language throughout]

2
Let S be the concatenated ASCII equivalent of your firstname and your last
name.
a. Assume the element of S are sets of keys k, build a hash table with bucket size n =
7 using the hash function h(k) =k mod n. Resolve collision by a hybrid of linear
probing and separate chaining. [3 marks]
b. Write a function for 2a using your chosen programming language. Test your
result using S. [3 marks]
c. Using S, build a min-heap [3 marks]
d. Draw the heap after 3 removals. [3 marks]
[Scan and paste solution here if solution involves drawing and writing at the same
time]
2
3.
[Program codes should be uploaded as a separate file: Use only one programming
language throughout]
Let A the ASCII code equivalent of your first name only
a. Build a Binary Search tree (BST) from A [2 Marks]
b. List the inorder, pre-order and post-order traversal of A. [3 Marks]
c. implement the Binary search algorithm and test it with the maximum value in A.
[5 Marks]
[Scan and paste solution here if solution involves drawing and writing at the same
time]
[Program codes should be uploaded as a separate file: Use only one programming
language throughout]

Added by Pablo C.

Question

Please give Ace some feedback