DATA SCIENCEThis is the Issue From Information DATA SCIENCE AND Examples subject and might you at any point kindly compose the code (PYTHON AND JAVA) for the two Inquiries?What's more, Ought to take care of the issue numerically too.Code is expected for SECOND inquiry Compose the code in python language as it were. 21. Find W for X= [1 ²], y = [¹]such that XW=y.2. Find W₁, W₂, W3 for the following egnation,2Y = W₁ + x₁ W₂ + x₂ W3, where valus of X₁, X₂, and y aregiven in the file providedon the home work assignment via Isidore,FRO x13.853.753.73.73.63.63.63.83.83.853.93.93.73.753.753.83.73.83.73.83.83.753.73.553.63.653.73.753.83.7x23.844.33.73.853.83.753.853.6544.144.14.24.14.14.24.34.13.753.753.653.93.654.14.253.653.753.854.25y7.388.519.527.59.338.288.757.877.187.898.159.18.868.98.879.2698.757.957.657.2788.58.759.218.277.677.939.26Coc

we solve the linear regression model in python using python numpy and sklearn libraries as shown…

is the Issue From Information DATA SCIENCE AND Examples subject and might you at any point kindly compose the code (PYTHON AND JAVA) for the two Inquiries? What's more, Ought to take care of the issue numerically too. Code is expected for SECOND inquiry

is the Issue From Information DATA SCIENCE AND Examples subject and might you at any point kindly compose the code (PYTHON AND JAVA) for the two Inquiries? What's more, Ought to take care of the issue numerically too. Code is expected for SECOND inquiry

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 2PE

See similar textbooks

Similar questions

15.11 LAB: Sorting user IDs C++ Given a main() that reads user IDs (until -1), complete the Quicksort() and Partition() functions to sort the IDs in ascending order using the Quicksort algorithm, and output the sorted IDs one per line. Ex. If the input is: kaylasimms julia myron1994 kaylajones -1 the output is: julia kaylajones kaylasimms myron1994 I can only change the //TODO #include <string>#include <vector>#include <iostream> using namespace std; // TODO: Write the partitioning algorithm - pick the middle element as the// pivot, compare the values using two index variables l and h (low and high),// initialized to the left and right sides of the current elements being sorted,// and determine if a swap is necessaryint Partition(vector<string> &userIDs, int i, int k) { } // TODO: Write the quicksort algorithm that recursively sorts the low and// high partitionsvoid Quicksort(vector<string> &userIDs, int i, int k) { } int main(int argc,…
1.A text file contain birth date of some employees with format dd/mm/yy: 01/06/50 03/06/51 10/02/54 08/01/48 26/08/51 27/04/54 21/09/51 … and so on Read the file using C and find out how many employees with age: –above 51 –between 44 – 51 –between 36 – 43 –between 28 – 35 –below 28 (note : age = now – birth date) Using C Language, modulo, and file processing, Sir, thx.
15.11 LAB: Sorting user IDs C++ Given a main() that reads user IDs (until -1), complete the Quicksort() and Partition() functions to sort the IDs in ascending order using the Quicksort algorithm, and output the sorted IDs one per line. Ex. If the input is: kaylasimms julia myron1994 kaylajones -1 the output is: julia kaylajones kaylasimms myron1994 I can only change the //TODO and please answer in C++ #include <string>#include <vector>#include <iostream> using namespace std; // TODO: Write the partitioning algorithm - pick the middle element as the// pivot, compare the values using two index variables l and h (low and high),// initialized to the left and right sides of the current elements being sorted,// and determine if a swap is necessaryint Partition(vector<string> &userIDs, int i, int k) { } // TODO: Write the quicksort algorithm that recursively sorts the low and// high partitionsvoid Quicksort(vector<string> &userIDs, int i, int k) {…
15.11 LAB: Sorting user IDs C++ Given a main() that reads user IDs (until -1), complete the Quicksort() and Partition() functions to sort the IDs in ascending order using the Quicksort algorithm, and output the sorted IDs one per line. Ex. If the input is: kaylasimms julia myron1994 kaylajones -1 the output is: julia kaylajones kaylasimms myron1994 #include <string>#include <vector>#include <iostream> using namespace std; // TODO: Write the partitioning algorithm - pick the middle element as the// pivot, compare the values using two index variables l and h (low and high),// initialized to the left and right sides of the current elements being sorted,// and determine if a swap is necessaryint Partition(vector<string> &userIDs, int i, int k) { } // TODO: Write the quicksort algorithm that recursively sorts the low and// high partitionsvoid Quicksort(vector<string> &userIDs, int i, int k) { } int main(int argc, char* argv[])…
Correct answer will be upvoted else downvoted. Computer science. We should characterize the expense of a string s as the number of file sets I and j (1≤i<j<|s|) with the end goal that si=sj and si+1=sj+1. You are given two positive integers n and k. Among all strings with length n that contain just the principal k characters of the Latin letters in order, find a string with least conceivable expense. In case there are different such strings with least expense — see as any of them. Input The main line contains two integers n and k (1≤n≤2⋅105;1≤k≤26). Output Print the string s to such an extent that it comprises of n characters, every its character is one of the k first Latin letters, and it has the base conceivable expense among this load of strings. In case there are various such strings — print any of them
20. Suppose a computer program has been initialized such that the following sets have been stored for use in any algorithm: A = {1, 2, 3, ..., 45}B = {-7, -6, -5, ..., 27} Consider the following algorithm, which represents one part of the whole computer program (comments may occur after the # symbol on any line and are not used in computations): #Part 1: computes A - B and its cardinality AminusB = set()for element in A: # this line runs through every element in A if not(element in B): #A - B is the set of elements that are in A and are not in B AminusB.add(element) # Add to AminusB every element in A if the element is also not in B n = len(AminusB) #len() returns the number of elements in the arrayprint(n) What value is printed as a result of executing this algorithm?
5 A. Let * be a new logical connective such that p * q does not hold if and only if p and q are either both false or both true. (i) Write down the truth table for p * q (ii) Write down the truth table for (p * p) * (q * q). (iii) Does the table in (b) coincide with a table in *Truth table available on the given image* (By "Coincide" we mean that the respective columns of T and F values are the same) B. Construct a formula in CNF based on each of the following truth tables: *Truth table available on the given image* C. Compute CNF (NNF ( IMPL_FREE ¬(p → ( ¬ (q ∧ ( ¬p → q))))))
14.13 CIS 2348 LAB: Sorting user IDs Given code that reads user IDs (until -1), complete the quicksort() and partition() functions to sort the IDs in ascending order using the Quicksort algorithm. Increment the global variable num_calls in quicksort() to keep track of how many times quicksort() is called. The given code outputs num_calls followed by the sorted IDs. Ex: If the input is: kaylasimms julia myron1994 kaylajones -1 the output is: 7 julia kaylajones kaylasimms myron1994 Code # Global variable num_calls = 0 # TODO: Write the partitioning algorithm - pick the middle element as the # pivot, compare the values using two index variables l and h (low and high), # initialized to the left and right sides of the current elements being sorted, # and determine if a swap is necessary def partition(user_ids, i, k): # TODO: Write the quicksort algorithm that recursively sorts the low and # high partitions. Add 1 to num_calls each time quisksort() is called def quicksort(user_ids, i,…
please answer question #33. please use (Algorithm 5.7) for the Backtracking Algorithm for the 0-1 Knapsack Problem requirement- - use QueueADT class to store intermediate data. - use some data class to store input data or use text file with option to read it. - use multiple classes as components of your application (like test class, algorithm class, data class) run various inputs and compare run time, etc. please use java language for coding java file - should start java file with YOUR Last Name, Like SmithClubApp, PetrowskiTravelLogApp, for your class short paragraph should include- please answer these questions in the correct order -description of the java file -what it does? -what is the input data? expected output, samples of both
1. Given that F is a direct file with n = 2000 records and that the records are stored in orderof their keys. Determine how any record reads it would take to locate a particular record using:a. Sequential search (average case)b. Binary search (worst case)c. (open) hashing with 200 buckets (average case)d. (open) hashing with 400 buckets (average case) 2. Write the declarations to create a data type called: DICTIONARY that represents an openhashing scheme with 20 buckets
(Reading Phone Numbers with and Overloaded Stream Extraction Operator) In Fig. 18.5,the stream extraction and stream insertion operators were overloaded for input and output of objectsof the PhoneNumber class. Rewrite the stream extraction operator to perform the following errorchecking on input. The operator>> function will need to be reimplemented.a) Input the entire phone number into an array. Test that the proper number of charactershas been entered. There should be a total of 14 characters read for a phone number ofthe form (800) 555-1212. Use ios_base-member-function clear to set failbit for improper input.
Edit this program so that it returns ecg data instead of heart beat in BPM. #include <ArduinoBLE.h> #define BLE_UUID_HEART_RATE_SERVICE "180D"#define BLE_UUID_HEART_RATE_MEASURMENT "2A37"#define ECG_SERV_UUID 0x2D0D#define ECG_MEAS_UUID 0x2D37#define ECG_NUM_CHANS_UUID 0x2D38#define ECG_SAMPLE_SETS_UUID 0x2D39#define ECG_COMMAND_UUID 0x2D3A #define HRM_VALUE_FORMAT_8BIT 0#define HRM_VALUE_FORMAT_16BIT 1#define HRM_SENSOR_CONTACT_NOT_DETECTED ( 2 << 1 )#define HRM_SENSOR_CONTACT_DETECTED ( 3 << 1 ) typedef struct {uint8_t flags;uint8_t heartRate;} heart_rate_measurment_t; union heart_rate_measurment_u{struct {heart_rate_measurment_t values;};uint8_t bytes[ sizeof( heart_rate_measurment_t ) ];}; union heart_rate_measurment_u heartRate = { .values = { .flags = 0, .heartRate = 0 } }; #define BLE_DEVICE_NAME "Arduino HRM"#define BLE_LOCAL_NAME "Arduino HRM" BLEService heartRateService( BLE_UUID_HEART_RATE_SERVICE );BLECharacteristic heartRateCharacteristic(…