Check that the set {11; 10; 00; 011;0100; 0101} is a set of codewords of a prefix code and con- struct the corresponding tree. Check that the set {11; 10; 00; 011;0100; 0101} is a set of codewor...
Which of the following set of codewords satisfy the prefix-free property? {0,00, 100, 111} {0, 100, 101, 11} {0, 1, 01, 11} {1,01,000,001
Design (7,3) linear block code with parity check matrix given as H = 0 1 11 0 0 1 1 0 10 1 0 1 1 1 00 0 1 1 a. Find all the corresponding codewords of the code. b. What is the error the error-correcting and error-detection capabilities of the code? c. Find the syndrome for the received vector R = [1101011]. d. Assuming the receiver Maximum likelihood algorithm construct syndrome table for the correctable error patterns
By applying Huffman’s algorithm construct an optimal binary prefix free code for the following letters A, B, I, M,S,X and Z with their corresponding frequencies. Letter A B I M S X z Frequency 12 7 18 10 9 5 2 Construct Huffman Tree by showing all the necessary (5pt) Give the code-word of each character using the Huffman Tree from (a) (5pt)
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...
Have to write the tree into a text file?
JAVA CODE
Binary search tree
This is the tree
public class Buildbst {
private int data;
private Buildbst left;
private Buildbst right;
//Set the binary search tree
public Buildbst(int data)
{
this.data = data;
this.left = null;
this.right =null;
}
public int getData() {
return data;
}
public void
setData(int data) {
this.data = data;
}
public Buildbst getLeft() {
return left;
}
public void setLeft(Buildbst
left) {
this.left = left;...
Check the session I 150 9:30-10:20am SP 11:00-11:50am 1 SR 2:002:50pm A thin rod bent into the shape of an arc of a circle of radius R carries a uniform charge per uni length λ Th Determine the electric field E at the origin 0. e arc subtends a total angle 20o symmetric about theraxis,as shown in Fig, below r.
discrete math
a. Consider the following rooted tree: 7 10 11 12 i. What is the root? (1 marks) ii. What is the height of the tree? (1 marks) iii. What are the children of the vertex 3? (1 marks) a. Draw the directed graph corresponding to the adjacency matrix (2 marks) [1 0 0 ON 1 2 1 b. Using the adjacency matrix in (a) only, determine the number of walks of length 3 from each vertex to each...
Name Chem 321 - Problem Set 6 Due to Dr. Hietbrink by 3:00 on Mon 11-18-19 Circle your class: MWF 11:15, MWF 12:20, TTh 2:00 Student number Score (out of 10) 1. (10 points) Predict the major organic product or products for each of the following. Be sure to include stereochemistry where appropriate. Assume each is in the most appropriate solvent. Remember, "no reaction" may be an answer. a) O, b) DMS HgSO4 H2SO4 НО B2 HCI a)/MOBI b) H
#10 and #11
The least-squares regression Ime for predicting the nbeye pnce rom ue con ph y 4.8904 + 2.8678x. Predict the ribeye price in a month when the corn price was $6.40 per bushel. A)$12.79 per Ib B)$15.30 per lb 9$13.46 per lb D) $18.35 10) For the following data set, compute the coefficient of determination. x 3 7 1 4 6 2 V9 20 21 19 22 12 A) 0.835 B) 0.594 C) 0.165 D) 0.406 11) For...
Automata: solve a - e
2. (10+10+10+10+10-50 points) Agrammar is a 4-tuple G, G-ON,E,11,L$) where N is a finite set of nonterminal symbols Σ is a finite set of terminal symbols is a finite set of rules S is the starting symbol Let N- (S, T s-{a, b, c} s-> ab aT >aaTb aT-ac S is the starting symbol. (a 10 points) Prove that the given grammar G is a context sensitive grammar. (b-10 points) What is the language L-...