Solve fast as soon asap Question 45In the following code, please note the missing sections labeled ?1?. ?2? and ?3?.function [final] = examQuestion (mat)[m, n,~] = size (mat);final uint8 (zeros( ?1 2));for i = ?2?if mod (1,2) == 1 + odd indexfor 11:nendfinal (1,1,1) mat ((1+1)/2,3,1);final (1,3,2) mat ((1+1)/2,3,2);final (1, 3, 3) mat ((1+1)/2,3,3);?3? + even indexandfor j = 1:nendfinal (i,j, 1) mat (1/2,1,1)/2+mat (1/2+1,1,1)/2;final (1,1,2) mat (1/2,1,2)/2+mat (1/2+1,1,2)/2;final (1,3,3) mat (1/2,1,3)/2+ mat (1/2+1,1,3)/2;endThe final image should be the image in mat with the number if rows increased. Rows should be placed in between existing rows, with element values being the average of the row above and the row below. Which of the following should replace the missing sections?O?1? should be (2'm-1.n.3)?2? should be 1.m3 should be elseifO?1? should be (m2n-1.3)12? should be 1:m13 should be endO ?1? should be (2m-1.2"-13)12? should be 1:2'm-113 should be elseif mod(12)--0?1? should be (2'm-1.n.3)12 should be 1:2'm-113 should be else2 pts

Explanation:?1? should be (2*m-1,n,3)For the first missing part, it is all about sizing up an image…

Answered: Question 45 In the following code,…

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

typedef struct node_t node_t; struct node_t { }; int32_t value; node_t* next; node_t* insert (node_t* list, int32_t v, int32_t* flag); 3) As you may have noticed from MT1, Howie is lazy. He wants you to write the interface for the following implementation of function copy_to_linked_list. He really appreciates your help! /* copy_to_linked_list int32_t copy_to_linked_list (int32_t a[], int32_t size, node_t** list_p) { int32_t flag, i; for (i = 0; i < size; ++i) { *list_p = insert (*list_p, a[i], &flag); if (-1== flag) return -1; } return 0;
In C++ The function below, zeroesToFives takes an array of integers and changes any zeroes in the array to fives and returns the count of array elements that were updated. Write at least ten test cases using assertions for zeroesToFives. You should test at least three boundary/edge cases.
This exercise asks you to define some functions for manipulating linked structures. You should use the Node and TwoWayNode classes, as defined in this chapter. Create a tester module in the testnode.py file that contains your function definitions and your code for testing them. In the testnode.py file, complete the following: Complete the implementation of the length() function (not len). This function expects a singly linked structure as an argument. Returns the number of items in the structure. To test your program run the main() method in the testnode.py file. Your program's output should look like the following: 0: 0 5: 5
Links Bing Remaining Time: 1 hour, 24 minutes, 17 seconds. * Question Completion Status: Р QUESTION 8 bbhosted.cuny.edu/webapps/assessment/take/launch.jsp?course_assessment_id=_2271631_1&course_id=_2 Implement the following: 1) Define a function evenList() with an arbitrary parameter a. P 2) This function accepts any number of integer arguments. 3) evenList() stores all even numbers into a list and returns the list. 4) Call the function with 5, 6, 7, 8, 9, 10 as arguments. 5) Print the result of the function call. Make sure to precisely match the output format below. Write your code in the ANSWER area provided below (must include comments if using code is not covered in the course). Example Output [6, 8, 10] For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). BIUS Paragraph Arial QUESTION 9 Programs s 10pt Click Save and Submit to save and submit. Click Save All Answers to save all answers. く Ev Av
About initial programming in python: Create a function that receives as parameters a list of 4 elements [name,[phone(s)], email, instagram] and a phone number:• If the phone number is in the list, it must be removed.• If not, no updates will be made. Note: phone(s) is within another list. Your function should only return a Boolean value, indicating whether the change was made or not. To find out if the function did the phone deletion correctly, you should check the contents of the list with the contact details you used to test your function after executing it. In the image is the model of parameters, in this case the function must exclude from the list of 4 elements the indicated number '44322456' and return "True".
df.Month.replace(({1:'January', 2:'February', 3:'March',4:'April', 5:'May', 6:'June', 7:'July', 8:'August',9:'September',10:'October',11:'November',12:'December'}), inplace=True)df kindly explain what this code do in phyton
Write a function called count_superheroes () that takes a list (containing the strings 'Spiderman' and 'Hulk') as a parameter and returns the string 'Spiderman' if Spiderman appears more times in the list than the Hulk; returns the string 'Hulk' if the Hulk appears more times in the list than Spiderman; and returns 'even' otherwise. You MUST use a loop in your solution. You must not use string methods or list methods in your solution. If you didn't complete part a), you may assume that you did in order to answer this question. For example: If the list being passed as an argument to function count_superheroes () is: superheros ['Spiderman', 'Hulk', 'Spiderman', 'Hulk', 'Spiderman', 'Spiderman', 'Hulk'] the function will return the string 'Spiderman' (i.e. the string 'Spiderman' appears in the list more times than the 'Hulk'). =
in C++ kth ElementExtend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the deﬁnitions of these functions in the class linkedListType. please, do not copy from any other sources, give me a fresh new code. Thank you
Write a function called rem_duplicate that takes a tuple in the parameter and return a tuple removing all the duplicate values. Then print the returned tuple in the function call. Hints: Unlike lists, tuples are immutable so, the tuple taken as an argument cannot be modified. But list can be modified and lastly for returning the result use type conversion. You need to use membership operators (in, not in) for preventing adding any duplicates values. Example1: Function Call: rem_duplicate((1,1,1,2,3,4,5,6,6,6,6,4,0,0,0)) Output: (1, 2, 3, 4, 5, 6, 0) %3D %3D %3D %3D %3D %3D %3D %3D II %3D %3D %3D %3D %3D %3D %3D %3D %3D %3D %3D %3D %3D %3D %3D II %3D %3D %3D %3D I3D %3D I3D %3D %3D
12 - fx =sort(StudentList!A2:F38,2, true) A C 1 Student ID Surname Forename 10009lAkins Lewis 10026 Allen Mary Explain the formula highlighted above and each of the parts in the formular. In other words, briefly describe in your own words what it does and what the result is. For this question, describe the following parameters in the formula above: - StudentList!A2:F38 is the range of cells (A2:F38) pulled from the sheet labeled Studentlist! - ,2 is - ,true is
The event viewer log categorizes server events. Note any two instances.
Use the function design recipe to develop a function named count_odds. The function takes a list of integers, which may be empty. The function returns the number of odd integers in the list. Automated testing is required Your solutions can use:• the [] operator to get and set list elements (e.g., lst[i] and lst[i] = a)• the in and not in operators (e.g., a in lst)• the list concatenation operator (e.g., lst1 + lst2)• the list replication operator (e.g., lst * n or n * lst)• Python's built-in len, min and max functions, unless otherwise noted.Your solutions cannot use:• list slicing (e.g., lst[i : j] or (lst[i : j] = t)• the del statement (e.g., del lst[0])• Python's built-in reversed and sorted functions.• any of the Python methods that provide list operations, e.g., sum, append, clear, copy, count, extend, index, insert, pop, remove, reverse and sort• list comprehensions

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