How do I do number 2 this is matlab by the way 2 / 2100% +Write a function called hw3_problem1 that takes a matrix A of positive integers as its sole input. If the assumption is wrong, thefunction returns an empty matrix. Otherwise, the function doubles every odd element of A and returns the resulting matrix. Noticethat the output matrix will have all even elements. For example, the call B = hw3_problem1([1 4; 5 2; 3 1], will make Bequal to [2 4; 10 2; 6 2]. You are not allowed to use loops.1.Write a function called hw3_problem2 that takes an at most two-dimensional matrix A as its sole input. The function returns thelargest element of A. You are not allowed to use the built-in max, min,or sort functions.2.3. Write a function called hw3_problem3 that takes an at most two-dimensional matrix A as its sole input. The function returns arow vector v containing all elements of A that are prime numbers. The elements of v are stored according to row-major orderingof A. You are allowed to use the isprime built-in function.4. Write a function called hw3 problem4 that takes as input an at most two-dimensional matrix A and computes the sum of theelements of A that are in the diagonal or are to the right of it. The diagonal is defined as the set of those elements whose columnand row indexes are the same. For example, if the input is [1 2 3; 4 5 6; 7 8 9], then the function would return 26.Write a function called hw3_problem5 that takes as input an array named X that is a matrix or a vector. The function identifiesthose elements of X that are greater than the sum of their two indexes. For example, if the element X(2,3) is 6, then thatelement would be identified because 6 is greater than 2+3. The output of the function gives the indexes of such elements foundin row-major order. It is a matrix with exactly two columns. The first column contains the row indexes, while the second columncontains the corresponding column indexes. For example, the call indequal to [1 2; 2 1; 3 1]. If no such large element exists, the function returns an empty array.= hw3_problem5([1 4; 5 2; 6 0]), will make ind5.

Algorithm : Step 1 : define the function Step 2 : initialize maximum variable with first matrix…

Answered: Write a function called hw3_problem2…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

in c++ please Write a function called Replace All that cerpts two parameters a matrix of 100 elements of type inter and an interval y. The function must - Replace every positive matrix element by the values +5and Replace every negative matrix element by the value - 5 and - Replace every mero try the value y.
Write in C++ Alice is trying to monitor how much time she spends studying per week. She going through her logs, and wants to figure out which week she studied the least, her total time spent studying, and her average time spent studying per week. To help Alice work towards this goal, write three functions: min(), total(), and average(). All three functions take two parameters: an array of doubles and the number of elements in the array. Then, they make the following computations: min() - returns the minimum value in the array sum() - returns the sum of all the values in the array average() - returns the average of all the values in the array You may assume that the array will be non-empty. Function specifications: Function 1: Finding the minimum hours studied Name: min() Parameters (Your function should accept these parameters IN THIS ORDER): arr double: The input array containing Alice's study hours per week arr_size int: The number of elements stored in the array Return Value:…
Write a function called hw3_problem1 that takes a matrix A of positive integers as its sole input. If the assumption is wrong, the function returns an empty matrix. Otherwise, the function doubles every odd element of A and returns the resulting matrix. Notice that the output matrix will have all even elements. For example, the call B = hw3_problem1([1 4; 5 2; 3 1], will make B equal to [2 4; 10 2; 6 2]. You are not allowed to use loops.
6.24 C++ Define a function named SortVector that takes a vector of integers as a parameter. SortVector() modifies the vector parameter by sorting the elements in descending order (highest to lowest). Then write a main program that reads a list of integers from input, stores the integers (starting from the second integer) in a vector, calls SortVector(), and outputs the sorted vector. The first input integer indicates how many numbers are in the list. Ex: If the input is: 5 10 4 39 12 2 the output is: 39,12,10,4,2,
(a) Write a function matrix_multiply(mat1, mat2) that takes two matrices and returns the result of the matrix multiplication between mat1 and mat2. If the two matrices are not compatible with multiplication, then None should be returned. (b) Write a function print_sums(list1, list2) that takes two equal-length lists of numbers and prints all the sums of the corresponding elements. Thus the first line is the sum of the first element of list1 and the first element of list2, the second line is the sum of the second elements, and so on.
6. Write a function that accepts an array of integers and returns -1 if sorted in ascending order, 1 if sorted in descending order, and 0 if not sorted. To be as efficient as possible, your function should make only one pass through the array.
C++ We have an array (x) of ints: x = {6,2,3,1,6,1,1,7,8} We would like to write a void function, call it newArray, that will update the array so that an element of the array is updated by subtracting the first item to its right that is equal to or less than that element. For example, x = {6,2,3,1,6,1,1,7,8] becomes x{4,1,2,0,5,0,1,7,8} Print the updated array, the sum of the array, and a list of the positions of the items that are not updated. *think of nested loops and the use of the break statement where appropriate
3) A function is implemented with a feature to print a line when x is found in the array A. def better_linear_search(A, x): for i in range(len(A)): if A[i] == x: print(x,"found at",i) return i return -1 What is the output after running code below? better_linear_search([17, 2, 10, 3], 10) better_linear_search([0, 9, 9, 9], 18) better_linear_search([12, 8, 7, 8], 8).
Ocaml 1. Create a function flip val flip : bool array array -> int -> int -> bool array array = <fun> that given a bool matrix and two integers i; j. it negates the values(true!false, false!true) at location i; j in the matrix, as well negatingthe values on the (up to) 4 horizontally/vertically adjacent elements. 2. Create a function print matrix val print_matrix : bool array array -> unit = <fun> that given a bool matrix, it prints it on screen (true !"T", false!"F").
In C++: 1) Write a printRange function which prints all values of an unsorted array (smallest to largest) between A and B inclusive. This function should accept all required data as parameters.ExamplesIf the array is 25 8 13 5 27 6 72 48, A is 20 and B is 40, this function prints 25 27.If the array is 10 1 28 42 18 34 100 125, A is 8 and B is 32, this function prints 10 1 28 18.
Code in C. Solve the code below. Write a function that takes a vector of integers, an integer n representing the number of elements in that vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The sequential search works as follows: you must look at all the elements of the vector until you find the b, from the first to the last. The function must return an integer representing how many elements the function tested until it found b. If it does not find the function, it must return 0. The name of the function must be called "busca_seq". int busca_seq(int vetor[], int n, int b) { //your code } My Code #include<stdio.h> int busca_seq(int vetor[], int n, int b) { int i; for(i = 0; i < n; i++){ if(vetor[i] == b) return (i+1); } { int vet[5],n = 5,b,x; vet[0] = 1; vet[1] = 2; vet[2] = 3; vet[3] = 4; vet[4] = 5; scanf("%d",&b); x = busca_seq(vet,n,b); printf("%d",x); return 0; } }
Code in C. Solve the code below. write a function that receives a vector of integers already sorted in ascending order, an integer n represents the number of elements in this vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The binary search works as follows: you must look for the element in the position exactly in the half of the vector, if for the searched it returns the number of tests done so far, if not for the searched, calculate the midpoint of the half of the vector after assess whether the searched value is greater or less than the value at the middle position. Not finding the value searched, the function must return 0. The name of the function will be called "busca_bin". int busca_bin (int vetor [ ], int n, int b){ #include <stdio.h> int busca_bin(int vetor[] , int n , int a) { int s1 = 0; int s2 = n-1; int pass = 0; int s3; while(s1<s2) { s3 = (s1+s2)/2; pass++;…

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS

Write a function called hw3_problem2 that takes an at most two-dimensional matrix A as its sole input. The function returns the largest element of A. You are not allowed to use the built-in max , min, or sort functions.