Question 1: Adding matrices Write a function that adds two matrices together using list comprehensions. The function should take in two 2D lists of the same dimensions. Try to implement this in one line! def add_matrices (x, y): HHH >>> matrix1 = [[1, 3], [2, 0]] >>> matrix2 = [[-3, 0], [1, 2]] >>>add_matrices (matrix1, matrix2) [[-2, 3], [3, 2]] ... ... >>> matrix4 = [[ 1, -2, 3], [-4, 5, -6]] >>> matrix5 = [[-1, 2, -3], [4, -5, 6]] ... >>>add_matrices (matrix4, matrix5) [[0, 0, 0], [0, 0, 0]] H "*** YOUR CODE HERE ***"

Question 1: Adding matrices Write a function that adds two matrices together using list comprehensions. The function should take in two 2D lists of the same dimensions. Try to implement this in one line! def add_matrices (x, y): HHH >>> matrix1 = [[1, 3], [2, 0]] >>> matrix2 = [[-3, 0], [1, 2]] >>>add_matrices (matrix1, matrix2) [[-2, 3], [3, 2]] ... ... >>> matrix4 = [[ 1, -2, 3], [-4, 5, -6]] >>> matrix5 = [[-1, 2, -3], [4, -5, 6]] ... >>>add_matrices (matrix4, matrix5) [[0, 0, 0], [0, 0, 0]] H "* YOUR CODE HERE *"

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 18PE

See similar textbooks

Similar questions

Consider the following function access_element_by_index that returns the iterator to the element at the index i in the list l. typedef std::list<int> int_list; int_list::iterator access_element_by_index(size_t I, int_list &) { assert( ? ); … } Assume the first element of the list is at the index 0, the second at the index 1, and so on. If the function is required to return an iterator that can be dereferenced, determine the precondition of the function, and write an assertion to validate it. (You don’t need to implement the functions).
1. a function that takes in a list (L), and creates a copy of L. note: The function should return a pointer to the first element in the new L. [iteration and recursion]. 2. a function that takes in 2 sorted linked lists, and merges them into a single sorted list. note: This must be done in-place, and it must run in O(n+m).
1. Suppose you have already developed an SLL ADT. You have to search a specificelement of the linked list. If you find the element in the list then you have to swapits previous node with its next node. Otherwise, simply print the message “Datanot found”. Now write a function in your SLL ADT with this functionality.
Suppose you have two objects of Doubly Linked List D1 and D2. Each object is representing a different Doubly Linked List. Write a function to concatenate both doubly linked lists. The concatenation function must return the address of head node of concatenated Doubly Linked List, and it must take two Node* parameters. You need to keep in mind all exceptional cases for example what if either one of the doubly linked lists is empty? Perform this task on paper, take a clear picture of solution and paste it in answer section.
C++ Create a generic function add_bookends(ls, e) that adds a copy of element e to the front and back of list ls.
in c++ solve this Doubly Linked List question with use class not struct Find and Replace Write the nonmember function int replaceVal(DLList<T> &list, T f, T r) which replaces every occurrence of the value f in the list with the value r. The function should also return the total number of replacements. Example: If the list myList has [ 7, 3, 5, 7, 7, 3, 8, 3] then after calling replaceVal(myList, 7, 5); myList will contain [ 5, 3, 5, 5, 5, 3, 8, 3] The function returns 3.
Please answer it in Python Write a function extrait_pairs that takes as an argument a list l1 and returns the list obtained from l1 keeping only the even integers (and without changing their order). Be careful, l1 must not be modified by the function. Example: extrait_pairs([4, 7, 12, 0, 3]) is [4, 12, 0] and extrait_pairs([21, 17, 3]) is [ ].
Write a function inde which returns the index (start from 1) of the occurrence of a given value. Use helper function. Two functions are enough.inde(1, [1,2,1,1,2,2,1]) → [1,3,4,7] Write a function nele which repeats each element in a list n times. Use helper function. Two functions only.nele([1,2],3) → [1,1,1,2,2,2] Write a function isfact to determine if a positive integer is a factorial number. Do not use any formula such as T(n)=n(n+1)/2. Do it in recursive fashion. Two functions are enough.isfact(120) → true
def remove_occurences[T](xs:List[T], elem: T, n:Int) : List[A] = {} Using the function above, can you show me how to make a polymorphic function in scala where the program removes elem , n number of times from the list. If n > elem then remove all elem from the list For example: remove_occurences(List(4,5,6,7,4),4,1) -> List(5,6,7,4)remove_occurences(List(4,5,6,7,4),4,2) -> List(5,6,7)remove_occurences(List(4,5,6,7,4),2,2) -> List(4,5,6,7,4)
Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that anode of doubly linked list has previous pointer as prev and next pointer as next.void fun(struct node **head_ref){struct node *temp = NULL;struct node *current = *head_ref;while (current != NULL){temp = current->prev;current->prev = current->next;current->next = temp;current = current->prev;}if(temp != NULL )*head_ref = temp->prev;}Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call? Note: solve as soon as possible
C++ Create a generic function average({elements}) that returns the average of all the given elements. For example, average({x, y, z}), returns (x + y + z)/3. The argument is an initializer list that is assumed not to be empty. For the sake of the exercise, don’t use other STL algorithms in the implementation of the function. Write a test driver
Using C languge, implement programmer defined-data types with linked lists. A set of integers may be implemented using a linked list.Implement the following functions given the definition:typedef struct node* nodeptr;typedef struct node{int data;nodeptr next;}Node;typedef Node* Set;Set initialize();- simply initialize to NULLvoid display(Set s);- display on the screen all valid elements of the listSet add(Set s, elem);- simply store elem in the listint contains(Set s, int elem);- search the array elements for the value elemSet getUnion(Set result, Set s1, Set s2);- store in the set result the set resulting from the union of s1 and s2- x is an element of s1 union s2 if x is an element of s1 or x is an element of s2Set intersection(Set result, Set s1, Set s2);- store in the set result the set resulting from the intersection of s1 and s2- x is an element of s1 intersection s2 if x is an element of s1 and x is an element of s2Set difference(Set result, Set s1, Set s2);- store in the set…