* <span>They all engage users with fun or interesting features.
*</span><span>They encourage people to participate.</span>
Answer:
- def process(lst1, lst2):
- newList = []
- for i in range(0, len(lst1)):
- sum = lst1[i] + lst2[i]
- newList.append(sum)
- return newList
-
- list1 = [1, 3, 5, 7, 9]
- list2 = [2, 4, 6, 8, 10]
- print(process(list1, list2))
Explanation:
Firstly, create a function process that takes two input lists (Line 1). In the function, create a new list (Line 2). Use a for loop to traverse through the elements of the two lists and total up the corresponding elements and add the sum to the new list (Line 3 - 5). At last, return the new list (Line 6).
In the main program, create two sample list and use them as arguments to test the function process (Line 8 - 9). We shall get the output [3, 7, 11, 15, 19].
Researchers should carry out investigations on different platforms for providing PHRs, such as mobile phones, so as to complement PHRs.
<h3>What are PHRs?</h3>
PHRs is an acronym for personal health records and it can be defined as an electronic database (repositories) that are designed and developed to assist patients in accessing, managing and sharing their health information in a well-secured, private, and confidential manner.
Researchers carrying out experiments and investigations on different digital platforms that are used for providing PHRs, such as mobile phones, is a provision which should be included in a model privacy and security policy, in order to complement personal health records (PHRs).
Read more on personal health records here: brainly.com/question/15065417
#SPJ1
For a direct mapped cache the general rule is: first figure out the bits of the offset (the right-most bits of the address), then figure out the bits of the index (the next-to right-most address bits), and then the tag is everything left over (on the left side).
One way to think of a direct mapped cache is as a table with rows and columns. The index tells you what row to look at, then you compare the tag for that row, and if it matches, the offsettells you which column to use. (Note that the order you use the parts: index/tag/offset, is different than the order in which you figure out which bits are which: offset/index/tag.)
So in part (a) The block size is 1 word, so you need 0 offset bits (because <span><span><span>20</span>=1</span><span><span>20</span>=1</span></span>). You have 16 blocks, so you need 4 index bits to give 16 different indices (because <span><span><span>24</span>=16</span><span><span>24</span>=16</span></span>). That leaves you with the remaining 28 bits for the tag. You seem to have gotten this mostly right (except for the rows for "180" and "43" where you seem to have missed a few bits, and the row for "181" where you interchanged some bits when converting to binary, I think). You are correct that everything is a miss.
For part (b) The block size is 2 words, so you need 1 offset bit (because <span><span><span>21</span>=2</span><span><span>21</span>=2</span></span>). You have 8 blocks, so you need 3 index bits to give 8 different row indices (because <span><span><span>23</span>=8</span><span><span>23</span>=8</span></span>). That leaves you with the remaining 28 bits for the tag. Again you got it mostly right except for the rows for "180" and "43" and "181". (Which then will change some of the hits and misses.)
<span>a number to be divided by another number.</span>