Answer:
The picture below with the answer. Hope it helps, have a great day/night and stay safe! Length of the coil,
Answer:
The solution code is written in Python:
- def convertCSV(number_list):
- str_list = []
- for num in number_list:
- str_list.append(str(num))
-
- return ",".join(str_list)
- result = convertCSV([22,33,44])
- print(result)
Explanation:
Firstly, create a function "convertCSV" with one parameter "number_list". (Line 1)
Next, create an empty list and assign it to a new variable <em>str_list</em>. (Line 2)
Use for-loop to iterate through all the number in the <em>number_list</em>.(Line 4). Within the loop, each number is converted to a string using the Python built-in function <em>str() </em>and then use the list append method to add the string version of the number to <em>str_list</em>.
Use Python string<em> join() </em>method to join all the elements in the str_list as a single string. The "," is used as a separator between the elements (Line 7) . At the end return the string as an output.
We can test the function by calling the function and passing [22,33,34] as an argument and we shall see "22,33,44" is printed as an output. (Line 9 - 10)
Answer:
The percentage ductility is 35.5%.
Explanation:
Ductility is the ability of being deform under applied load. Ductility can measure by percentage elongation and percentage reduction in area. Here, percentage reduction in area method is taken to measure the ductility.
Step1
Given:
Diameter of shaft is 10.2 mm.
Final area of the shaft is 52.7 mm².
Calculation:
Step2
Initial area is calculated as follows:


A = 81.713 mm².
Step3
Percentage ductility is calculated as follows:


D = 35.5%.
Thus, the percentage ductility is 35.5%.
Answer:
B probably
Explanation:
Because the prompt doesn't specify what sort of violation it could be anything maybe when they release the metals during the day and so on.
Answer:
insert (array[] , value , currentsize , maxsize )
{
if maxsize <=currentsize
{
return -1
}
index = currentsize-1
while (i>=0 && array[index] > value)
{
array[index+1]=array[index]
i=i-1
}
array[i+1]=value
return 0
}
Explanation:
1: Check if array is already full, if it's full then no component may be inserted.
2: if array isn't full:
- Check parts of the array ranging from last position of range towards initial range and determine position of that initial range that is smaller than the worth to be inserted.
- Right shift every component of the array once ranging from last position up to the position larger than the position at that smaller range was known.
- assign new worth to the position that is next to the known position of initial smaller component.