Given 2 integers as 2 lists of their digits, you have to compute their sum and output it as a list of its digits. If the integer is 1234 its corresponding list would be [1, 2, 3, 4]. You can assume the integers are non-negative. Input: [1, 2, 3, 4] [4, 3, 2, 1] output: [5, 5, 5, 5] Explanation: 1234 +たす 4321 =わ 5555 input: [9, 9, 9, 9] [1, 1, 1] output: [1, 0, 1, 1, 0] Explanation: 9999 +たす 111 =わ 10110

Name: Na ID: A Name: 3. An algorithm will be used to identify the maximum value in a list of one or more integers. Consider the two versions of the algorithm below. Algorithm I: Set the value of a variable max to - 1. Iterate through the list of integer values. If a data value is greater than the value of the variable max, set max to the data value. Algorithm II : Set the value of a variable max to the first data value. Iterate through the remaining values in the list of integers. If a data value is greater than the value of the variable max, set max to the data value. Which of the following statements best describes the behavior of the two algorithms? Algorithm I always works correctly, but Algorithm II only works correctly when the maximum value is not the first value Both algorithms work correctly on all input values. а. с. in the list. b. Neither algorithm will correctly identify d. Algorithm II always works correctly, but the maximum value when the input contains both positive and...

2. Design of a 4-bit excess-3 counter and 8-bit Up-Down counter. (1) Fig 2 shows the logic symbol of an universal 4-bit counter, its truth table and Verilog code. Nov please design the Verilog code of a 4-bit excess-3 counter (counter from 3 to 12) based on the cod in Fig 2(a). Please fill the blanks to complete the design. CLOCK CNTR4U CLK CLR LD ENP 11 ENT DO D1 D2 D3 778588 88888 QO Q1 -Q2 -Q3 RCO CLR 1 0 0 0 0 0 0 0 0 Inputs LD ENT ENP 1 0 0 0 0 X 0 X X 0 1 X X 1 1 1 0 1 0 1 0 1 1 1 1 Current State Q3 Q2 Q1 QO Fig 2 X X X X X X X X 0 0 0 0 0 0 1 1 1 X module Vrcntr4u( CLK, CLR, LD, ENP, ENT, D, Q, RCO ); input CLK, CLR, LD, ENP, ENT; input [3:0] D; output reg [3:0] Q; output reg RCO; 0 1 1 1 0 1 1 1 1 X Q <= 4'd0; Q <= D; X 0 1 always (posedge CLK) // Create the counter f-f behavior if (CLR == 1) else if (LD == 1) else if ((ENT-1) && (ENP-1)) Q <- Q + 1; else Q <= Q; Q3* 0 D3 Q3 Q3 always (Q or ENT) // Create RCO combinational output if ((ENT == 1) && (Q == 4'd15)) else RCD = 1;...

PYTHON without def function randomly generate numbers by rolling one die. That is, if your program rolls a die 6000 times, you should get approximately 1000 ones, 1000 twos, etc.? Use a list to count the number of times a die is rolled, given the user wants the die rolled N times. Example Execution #1 Input the number of rolls to make:NUMBER> 6Input the seed for the random number generator:SEED> 0Your 6 rolls follow:OUTPUT 1 occurred 1 timesOUTPUT 2 occurred 0 timesOUTPUT 3 occurred 1 timesOUTPUT 4 occurred 3 timesOUTPUT 5 occurred 1 timesOUTPUT 6 occurred 0 times Example Execution #2 Input the number of rolls to make:NUMBER> 600000Input the seed for the random number generator:SEED> 123456Your 600000 rolls follow:OUTPUT 1 occurred 100340 timesOUTPUT 2 occurred 100016 timesOUTPUT 3 occurred 100186 timesOUTPUT 4 occurred 99931 timesOUTPUT 5 occurred 99858 timesOUTPUT 6 occurred 99669 times

IN PYTHON: Using a function, create a list of 20 numbers randomly between 1-99. With recursive function, you are going to take the numbers from the list, one at a time starting at position 0 and add them together. If the numbers added together equals a user specified sum, stop the program and show the two digits that sum together. If not, remove the first number from the list and add the next two. Continue running the program until you have reached the end of the list. sample output: randomly selected numbers: [61, 6, 78, 3, 64, 22, 11, 9, 34, 99, 31, 56, 43, 8, 77, 27, 93, 47, 58, 20] User input : 86 61 + 6 = 67 FALSE [6, 78, 3, 64, 22, 11, 9, 34, 99, 31, 56, 43, 8, 77, 27, 93, 47, 58, 20] 6 + 78 = 84 FALSE [78, 3, 64, 22, 11, 9, 34, 99, 31, 56, 43, 8, 77, 27, 93, 47, 58, 20] 78 + 3 = 81 FALSE [3, 64, 22, 11, 9, 34, 99, 31, 56, 43, 8, 77, 27, 93, 47, 58, 20] 3 + 64 = 67 FALSE [64, 22, 11, 9, 34, 99, 31, 56, 43, 8, 77, 27, 93, 47, 58, 20] 64 + 22 = 86 TRUE!

Write in Python: (1) Prompt the user to enter four numbers, each corresponding to a person's weight in pounds. Store all weights in a list. Output the list. Ex: Enter weight 1: 236.0 Enter weight 2: 89.5 Enter weight 3: 176.0 Enter weight 4: 166.3 Weights: [236.0, 89.5, 176.0, 166.3] (2) Output the average of the list's elements with two digits after the decimal point. Hint: Use a conversion specifier to output with a certain number of digits after the decimal point. (3) Output the max list element with two digits after the decimal point. Ex: Enter weight 1: 236.0 Enter weight 2: 89.5 Enter weight 3: 176.0 Enter weight 4: 166.3 Weights: [236.0, 89.5, 176.0, 166.3] Average weight: 166.95 Max weight: 236.00 (4) Prompt the user for a number between 1 and 4. Output the weight at the user specified location and the corresponding value in kilograms. 1 kilogram is equal to 2.2 pounds. Ex: Enter a list location (1 - 4): 3 Weight in pounds: 176.00 Weight in kilograms: 80.00 (5) Sort the...

A program in java

When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. This adjustment can be done by normalizing to values between 0 and 1, or throwing away outliers. For this program, adjust the values by dividing all values by the largest value. The input begins with an integer indicating the number of floating-point values that follow. Assume that the list will always contain positive floating-point values. Output each floating-point value with two digits after the decimal point, which can be achieved as follows:print(f'{your_value:.2f}')

In python, Problem Description:You are hosting a party and do not have room to invite all of your friends. You use the following unemotional mathematical method to determine which friends to invite. Number your friends 1, 2, . . . , K and place them in a list in this order. Then perform m rounds. In each round, use a number to determine which friends to remove from the ordered list. The rounds will use numbers r1, r2, . . . , rm. In round i remove all the remaining people in positions that are multiples of ri (that is, ri, 2ri, 3ri, . . .) The beginning of the list is position 1. Output the numbers of the friends that remain after this removal process. Input Specification:The first line of input contains the integer K (1 ≤ K ≤ 100). The second line of input contains the integer m (1 ≤ m ≤ 10), which is the number of rounds of removal. The next m lines each contain one integer. The ith of these lines (1 ≤ i ≤ m) contains ri ( 2 ≤ ri ≤ 100) indicating that every person at a position...

Write a program that asks the user to input 2 lists of numbers, 5 numbers per list. Your program should identify the common numbers in the lists or the numbers that are present in both lists. See sample lists and output below. Input two sets of list with 5 integers each 20·3·59·1·3 1·20·1·4·3 Output list of common numbers present in both list 20·3·1

Integer num_reading is read from input, representing the number of integers to be read next. Read the remaining integers from input and insert each integer at the front of reading_list at position 0.

The program doesn't have to ask the user to input a number

The function sum_evens in python takes a list of integers and returns the sum of all the even integers in the list. For example: Test Result print(sum_evens([1, 5, 2, 5, 3, 5, 4])) 6 print(sum_evens([5, 5, -5, -5])) 0 print(sum_evens([16, 24, 30])) 70