8. (a) Sketch the tree with Prüfer code: 1 2130 45 0 (b) Sketch the tree...
Design a Shannon-Fano code and sketch the corresponding coding tree where the alphabet is {a,b,c,d,e,f} with corresponding probabilities {0.5, 0.1, 0.05, 0.05, 0.25, 0.25}
4. Given a network of 8 nodes and the distance between each node as shown in Figure 1: 4 1 7 0 4 4 6 6 Figure 1: Network graph of 8 nodes a) Find the shortest path tree of node 1 to all the other nodes (node 0, 2, 3, 4, 5, 6 and 7) using Dijkstra's algorithm. b) Design the Matlab code to implement Dijkstra's algorithm 4. Given a network of 8 nodes and the distance between each...
Need them in c++ 1. Give the code for the definition of a node for the linked implementation of a tree that contains integer data. 2. In the array implementation of a tree in C, if the data for anode in in index i, what are the indices of its two children? 3. Draw the binary search treethat resultsfor insertingthe following numbers, in the order given, into aninitially empty tree: 64, 14, 23, 84, 67, 2, 8, 73, 89, 47. 4. Describe, in detail, the algorithm for deleting a node from a binary search tree. (make sure you have differentcases fornodes with 0, 1, or 2 children.
4. Sketch the polar curve r = sin? 0. 90° 135° 45° 180° 0° 225° 315° 270°
4. Sketch the polar curve r = sinº 0. 90° 135° 45° 180° 0° 225° 315° 270°
# 1. discuss the relevance of huffman code. give the huffman code and code tree for the following: Algorithm Rocks!
Consider the B+ tree shown in the following as an original tree. 73 85 1 2 5 6 8 1 32 39 41 45 52 58 73 91 99 Answer the following questions: 1) (2 marks) There are currently 18 records in this tree. How many additional records could be added to this tree without changing its height (give the maximum possible number)? (3 marks) Show the B+ tree after inserting a data entry with key 3 into the original...
Insert numbers 4, 8, 7, 9, 0 in order into a tree and ensure that the resulting tree is a binary search tree.
It should be really short and simple to do this. #1 [8 points) Sketch a hash table of size N=11, where the hash function is hash(key) = key mod N and chaining is used to resolve collisions, when the following elements are inserted: 20, 42, 45, 49, 62, 72,95 0 1 2 3 4 5 6 7 8 9 10 What is the size of the largest bucket? — #2 [7 points) Sketch a hash table of size N=11, where...
1. a) Make a binomial tree with for set A - 14 items “0, 1 ,11 ,56 ,88 ,99 ,31 ,34 ,9 , 2, 4, 44, 20, 22” show step by step? and for set B with 4 items “5, 6, 10 , 8” how step by step? b) merge by create binomial tree and show step by step? 2- Insert 2-3 tree "Hopeoiy" show step by step? 3. Insert black-red tree to "Rochestr" step by step ? Please each...