Generalize Huffman's algorithm to ternary codewords (i.e., codewords using the symbols 0, 1, and 2), and write down the corresponding pseudo-code using a priority queue.

What is the basic principle involved in the Datar-Gionis-Indyk-Motwani (DGIM) algorithm? Discuss it with a suitable example

Answer True or False whether a function with growth rate is a member of the set of algorithms that grow with a certain complexity. Draw also the graph.

The code shows an implementation of the Rabin-Karp algorithm in Python. What is the best and worst case of this algorithm? Explain with an example for each case, without going into mathematical details

Develop a piece of code for following four cases and measure the processing time of different inputs starting from 1 to 50. Plot your processing time as a graph and explain the differences. A) g(n) (Recursively)B) g(n) (Iteratively)C) Fibonacci (Recursively) D) Fibonacci (Iteratively)  PLEASE DO PARTS A B C AND D in C/C++!

Implement the BFS algorithm to find the shortest path from S to G from te sketch below.   N.b Please describe all the steps involved in the imoplementation

The following table(picture) presents the implementation of the Dijkstra algorithm on the evaluated graph G with 8 vertices. What do the symbols (0, {a}) and (∞, {x}) in first row mean?

Build a Finite Automaton to generate all strings starting with 1 followed by any combinations of 0's and 1's For example, 101, 11, 10000001 would be generated, but not 00, 0010, 01110, etc.( Please provide with diagram)

Implement the winnow algorithm and use it learn weight for w0 (for bias), w1 and w2 and w3 for x1 , x2 and x3 for the following Boolean function:   Please include all steps for using the algoritm   X1 X2 X3 Y 0 0 0 0 1 1 0 1 0 1 0 0 0 0 1 0 0 1 1 1 1 0 1 1 1 1 1 0