Write a C++ program to perform addition of two hexadecimal numerals each with up to 4 hex digits. If the result of the addition is more than 4 hex digits long, then simply give the output message "Addition overflow" and stop. Use dynamic arrays to store hexadecimal numbers as arrays of characters. Assume the numbers can be of different length (i.e. if adding hex numbers 12ab + 90 (first number is stored as 4 characters in size, second number is stored as 2 characters in size), the second number will then be interpreted as 0090 but the leftmost zeros will not be included in the array (the size of the array variable will be useful here). To perform hex addition, you can convert each individual hex digit to decimal, perform the addition, and then convert to hex, including adding a carry as necessary.

Write a c++ program to add two large integers with up to 300 digits. One approach is to treat each number as array, each of whose elements is a block of digits of that number. For example, the integer 179,534,672,198 might be stored as block[0] =198, block[1] = 672, block[2] = 534, block[3] = 179. Add the two integers (lists), element by element, carrying from one element to the next when necessary. NOTE: You don’t have to use string input for the numbers. {Hint: when does the extraction stop extracting characters from the input buffer? How does the get function work? What character is always placed in the input stream when you press enter } The user will input the numbers using the following format: User input is in bold and underlined. Enter the number using this format(###,###,###) up to 300 digits: 179,534,672,198 Enter the number using this format(###,###,###) up to 300 digits: 564,325 Addition Result: 179,535,236,523 Enter the number using this format(###,###,###) up to 300...

Implement the following function: Code should be written in python.

Write a python function count_matches that, given two strings, counts the number of positions at which the characters are the same. For example, count_matches('conflate', 'banana') returns 2, conflate banana ^ ^ since the n's match at index 1 and the a's match at index 5. The strings to not need to be the same length. The count_matches function does not read input or print output.

Define a function named get_encrypted_list (word) which takes a word as a parameter. The function returns a list of characters. The first element is the first letter from the parameter word and the rest is as a sequence of '*', each '*' representing a letter in the parameter word. Note: you can assume that the parameter word is not empty. For example: Test Result ['h', 1*1 **', '*'] *** guess = get_encrypted_list('hello') print (guess) print (type (guess)) guess = get_encrypted_list('succeed') ['s', '*', print (guess) **']

in C++ solve the following question in the picture :