computeObjects([objects], func) This method will take in an array of objects and a function, and will return one object. You must check that each value is a number type. You will evaluate the function on the values of the object, if multiple objects have the same key, you will add that value to the current value. The return object will not have any duplicated keys. Example: const first = { x: 2, y: 3}; { a: 70, x: 4, z: 5 }; const third = { x: 0, y: 9, q: 10 }; const second

ANSWER MUST BE IN PYTHON3. METHOD HEADER BELOW.   #!/bin/python3 import math import os import random import re import sys import numpy as np import pandas as pd from sklearn.linear_model import LinearRegression def read_dataframe():     # Return a pandas dataframe from stdin     return pd.read_csv(sys.stdin) def read_matrix():     # Return column names and data as a matrix     df = read_dataframe()     return list(df.columns), df.values def read_list():     # Return column names and data as a list of lists     # Each element in the list corresponds to columns in the data     col_names, val = read_matrix()     return col_names, val.T.tolist() # # Complete the 'main' function below. # # The function is expected to return a STRING. # def main():     # Write your code here if __name__ == '__main__':     fptr = open(os.environ['OUTPUT_PATH'], 'w')     result = main()     fptr.write(result + '\n')     fptr.close()

Question R   .Full explain this question and text typing work only     We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line

You are writing an application. You need a data structure that will allow you to store a large set of distinctive objects. The common operations performed on the set of objects are: lookup, insert, and delete. No traversal will be performed on the data set. The client wants the program to be as efficient as possible. Which of the following data structures should you use in your design?   Question 25 options:   hash table   linked list   heap   binary search tree

Java Programming Try to discuss there are 3 ways to duplicate a Single Array. And make a simple program and prove the Object ID is different.

#If you're not sure how to start, look at the swap_red_blue and blur#examples below. #Problem A: Invert Colorsdef invert(img_matrix):    '''    Purpose:      Inverts the colors in an image by setting each color component to      255 minus its original value.    Input Parameter(s):      A 3D matrix (list of lists of lists) representing an .bmp image      Each element of the matrix represents one row of pixels in the image      Each element of a row represents a single pixel in the image      Each pixel is represented by a list of three numbers between 0 and 255      in the order [red, green, blue]    Return Value:      A 3D matrix of the same dimensions, with the colors of each pixel inverted    '''    #TODO: Finish this function

Question-1 Python Machine Learning Question For the Iris data Use classification Models to predict the species of the flowers kNN Classifier Desicion Tree Classifier Random Forest Classifier Try different hyperparameters to improve the scores Visualize your results       from sklearn.datasets import load_iris dataset_iris = load_iris()   dataset_iris.keys()   dict_keys(['data', 'target', 'frame', 'target_names', 'DESCR', 'feature_names', 'filename', 'data_module'])

A fibonacci series is defined as a series where the number at the current index, is the value of the summation of the index preceding it (index -1) and (index-2). Essentially, for a list fibonacci_numbers which is the fibonacci numbers series, fibonacci_numbers[i] = fibonacci_numbers[i-1] + fibonacci_numbers[i-2] The fibonacci series always begins with 0, and then a 1 follows. So an example for fibonacci series up to the first 7 values would be - 0, 1, 1, 2, 3, 5, 8, 13 Complete the fibonacci(n) function, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: fibonacci(7) is 13 Important Note Use recursion and DO NOT use any loops. Review the Week 9 class recording to see a variation of this solution. def fibonacci(n):    if (n < 0 ):        return -1    else:        return n        fibonacci_numbers = (fibonacci[n - 1] + fibonacci[n - 2])    return fibonacci_numbers(n)   # TODO: Write…

Problem D. Find URLsHTML is a language for representing documents designed to be displayed by a web browser. In many browsers, you can see the HTML source code by right-clicking somewhere on the page and clicking “View Page Source”. If you try this on a web page with links to other websites, you’ll notice that the URL of the link is usually formatted in the following way: href="https://some.website.com/subfolder/more_stuff.txt" Write a function find_url(html) that takes in a string of html text that contains exactly one external link URL formatted as above, and returns just the URL string (in the above example, that would be https://some.website.com/subfolder/more_stuff.txt). You can assume that the only place in the string where the substring href=" occurs is right before the URL, and that the next quotation mark after that point denotes the end of the URL. Hints: ●  The .find method and string slicing will likely make this easier. ●  Remember that in order to use a double quote…

Please DO NOT respond to this question by copy/pasting the code provided elsewhere on the site, none of those work. Thanks. Virtual Memory Lab   This lab project addresses the implementation of page-replacement algorithms in a demand-paging system.   Each process in a demand-paging system has a page table that contains a list of entries. For each logical page of the process, there is an entry in the table that indicates if the page is in memory. If the page is in memory, the memory frame number that page is resident in is indicated. Also, for each page, the time at which the page has arrived in memory, the time at which it has been last referenced, and the number of times the page has been referenced since the page arrived in memory are maintained.   The page table data structure is a simple array of page-table entries (PTEs). Each PTE contains five fields as defined below:    struct PTE {        int is_valid;        int frame_number;        int arrival_timestamp;        int…