In 2]: Import necessary libraries import pandas as pd import numpy as np In [3]: * * #** GRADED # (a) Determine the shape, number of dimensions and type of #elements in the numpy array arr # (b) Determine the sum of elements in arr # (c) Determine the mean of elements in arr * (d) Create an array of the same shape as arr but filled with zeros # (e) Create an array of the same shape as arr but filled with ones # (f) Create an array of the same shape as arr but where all elements are squared values # (g) Create an array result of shape 3*3 resulting from multiplication of arr with transpose(c arr = np. arange (15).reshape(3, 5) * * In [4]: #** GRADED # The following piece of code creates a DataFrame # (a) Determine the shape of the dataframe # (b) Print out all the columns of the dataframe # (C) Print the 3rd element of the dataframe # (d) Find the average of 'petal_width' where species is 'virginica' # (e) Find the maximum of 'sepal_width' where species is 'setosa' # (f): What is the average value of sepal_length # (g): What is the maximum value of sepal_width # (h): What is the minimum value of petal_width import pandas as pd df = pd. read_csv('https://raw. githubusercontent. com/mwaskom/seaborn-data/master/iri s. csv') df. head(10) #prints the first 10 rows

Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges"what's being bought" are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them"for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e.g., the possible transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e.g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s . so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of events"s of length m and s of length n, each possibly containing an event more than once"and decides in time o(m + n) whether s is a subsequence of s.

Jennifer has to set up a network in a factory with an environment that has a lot of electrical interference. which cable would she prefer to use? jennifer would prefer to use because its metal sheath reduces interference.

Jace needs to answer a question on square roots to win a quiz. how can he use a spreadsheet to find the square root of 786? a. use the functions round and count b. create a table and chart c. use the function sqrt d. use the function now