Exercise Generate a log-log plot of your period T vs. dynamic mass ma. This is the same plot that you drew on the log-log graphing paper from your materials pack. Perform these steps: 1. Define lists or numpy arrays that contain your experimental data. For example, md= [0.10, 0,15, 0.20] defines a list of dynamic masses 0.1, 0.15 and 0.20 kg, and T = [0.75, 0.83, 0.91] defines a list of periods (in seconds). 2. Generate a log-log plot of T vs. ma that shows your data as points (not lines!) using plt.loglog() with the 'o' option. The dynamic mass should be on the horizontal (x) axis. 3. Add grid lines for both the "major" and "minor" ticks, and both axes. Look up the documentation of plt.grid () to see how this is done. Remember that you can get the documentation for any command by running it in a cell of its own and appending a question mark, e.g. plt.grid?. 4. The axis tick labels will likely show up in scientific notation (e.g. 6 x 10-2). For our values (mostly in the 0.1...1 kg range), this is undesirable. Add a line plt.rcParams ['axes. formatter.min_exponent'] = 2 to your code to fix this. This command tells matplotlib to print all numbers between 10-2 and 102 in normal notation. 5. Don't forget to label the x- and y-axes. Look up your code from the "Projectile Motion" lab if you are unsure how to do this. In [] #define your arrays here # # Dynamic masses #md =

9.). integer array nums and an integer k, return the length of the shortest non-empty subarray of nums with a sum of at least k. If there is no such subarray, return -1. A subarray is a contiguous part of an array.   Example 1: Input: nums = [1], k = 1 Output: 1 Example 2: Input: nums = [1,2], k = 4 Output: -1 Example 3: Input: nums = [2,-1,2], k = 3 Output: 3.

Given an array of integers, find the maximum sum of a contiguous subarray. Write a function called maxSubarraySum that takes an array of integers as input and returns the maximum sum of a contiguous subarray. Example: Input: [1, -3, 2, 1, -1] Output: 3 Explanation: The subarray with the maximum sum is [2, 1], and the sum is 3. You need to implement the maxSubarraySum function. You can use any programming language of your choice.

Matlab: How do I convert a matrix into a cell array? When I try to convert for some reason my cellA and cellB sees  everything as 1 string but I want something like A =  {'File_20210916_5823.tsv', 'File_20210918_5023.tsv'} % Matrices A and B (defined as matrices)A = ['File_20210916_5823.tsv', 'File_20210918_5023.tsv'];B = ['Record_2021_09_16.csv', 'Record_2021_09_18.csv']; % Convert matrices A and B into cell arrays with individual stringscellA = cellstr(A);cellB = cellstr(B);disp(cellA)

Select the for-loop which iterates through all even index values of an array.A. for(int idx = 0; idx < length; idx++)B. for(int idx = 0; idx < length; idx%2)C. for(int idx = 0; idx < length; idx+2)D. for(int idx = 0; idx < length; idx=idx+2)

Write a function to find the maximum sum of a subarray within a given array of integers. The subarray should be contiguous, meaning the elements are adjacent to each other in the array. For example, given the array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum sum of a subarray is 6, which corresponds to the subarray [4, -1, 2, 1]. Write a function named `maxSubarraySum` that takes an array of integers as input and returns the maximum sum of a subarray. Note: If all the elements in the array are negative, the function should return O. Example: Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4] Output: 6 Input: [-1, -2, -3, -4] Output: 0 Write the 'maxSubarraySum` function that solves this problem efficiently.

: You are given an array-like data structure Listy which lacks a sizemethod. It does, however, have an elementAt ( i) method that returns the element at index i in 0( 1) time. If i is beyond the bounds of the data structure, it returns -1. (For this reason, the data structure only supports positive integers.) Given a Listy which contains sorted, positive integers,find the index at which an element x occurs. If x occurs multiple times, you may return any index.