Given the codeword set 111111 000111 110001 101100 011010  Add another codeword to this set that has distance at least 3 to all other codewords

Write a program to read A[n, n] of numbers, then put 10 instead each evenpositive number.

writ aprogram to find the average of 50 numbers and print the result .

Q5B. Of the missing entries in the truth table, select each that should have an entry of False (F). p q r ¬p ¬p ∧ r ( ¬p ∧ r ) ∨ q  T T T F F T T T F F F (A) T F T F F F T F F F (B) F F T T T T T F T F T F (C) F F T T (D) T F F F T F F   Question 5 options:   A   B   C   D

I am making  a train with some number of cars, that will be printed using Unicode characters. I am I am trying to build this method named getUnicodeString based on its specification. It needs a for-loop to generate the rail cars.Specification:     /**     * Builds a unicode train consisting of an engine,     * followed by getNumCars() railcars, followed by a     * caboose. A train will always have at least an engine     * and a caboose.     *      * @return a Unicode string as described above.     */My code so far: public String getUnicodeString() {        // replace the return statement with your solution        return null;    }}

Write a python code to get the 7 random elements which lies between 1001 and 9999 and which are divisible by 11

Q2. For the following Character and frequencies, which could be the Variable length codes calculated with Huffman Coding? Character Frequency 0.11 0.09 0.24 0.12 E 0.08 F 0.36 Remember, the codes are not necessarily unique but certain properties (like their length) will be preserved assuming there are no points in the algorithm where there are equivalent choices (there aren't for this one).

Up for the count def counting_series (n): The Champernowme word 1234567891011121314151617181920212223., also known as the counting series, is an infinitely long string of digits made up of all positive integers written out in ascending order without any separators. This function should return the digit at position n of the Champernowne word. Position counting again starts from zero for us budding computer scientists. Of course, the automated tester will throw at your function values of n huge enough that those who construct the Champernowne word as an explicit string will run out of both time and space long before receiving the answer. Instead, note how the fractal structure of this infinite sequence starts with 9 single-digit numbers, followed by 90 two-digit numbers, followed by 900 three-digit numbers, and so on. This observation gifts you a pair of seven league boots that allow their wearer skip prefixes of this series in exponential leaps and bounds, instead of having to crawl…

Write a program to display the pattern of inverse right angle triangle such as shown below 54321 5432 543 54 5

Let A= [ 4, 23,14,67,23,87,4,23,23], write Python program to draw the frequency of each number in A.