3- Write a python method perform_operation that performs the following operation on lists A, B, and C that have only items from data type integer: C[i]= 2A[i]+3B[i]-5 where i is the index that takes values between (0 and length of A -1) and all lists have the same length. Note: Your solution has to be general for any two lists that have integer items and have the same length. Example : Let A= [1, 4, 2, 5] and B= [2, 3, 6, 4] Then C=[3, 12, 17, 17] where: C[0]= 2A[0]+3B[0]-5= 2+6-5= 3 C[1]= 2A[1]+3B[1]-5= 8+9-5= 12 C[2]= 2A[2]+3B[2]-5= 4+18-5= 17 C[3]= 2A[3]+3B[3]-5= 10+12-5= 17

3- Write a python method perform_operation that performs the following operation on lists A, B, and C that have only items from data type integer: C[i]= 2A[i]+3B[i]-5 where i is the index that takes values between (0 and length of A -1) and all lists have the same length. Note: Your solution has to be general for any two lists that have integer items and have the same length. Example : Let A= [1, 4, 2, 5] and B= [2, 3, 6, 4] Then C=[3, 12, 17, 17] where: C[0]= 2A[0]+3B[0]-5= 2+6-5= 3 C[1]= 2A[1]+3B[1]-5= 8+9-5= 12 C[2]= 2A[2]+3B[2]-5= 4+18-5= 17 C[3]= 2A[3]+3B[3]-5= 10+12-5= 17

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

Write a Java application CountryList. In the main method, do the following:1. Create an array list of Strings called countries.2. Add "Canada", "India", "Mexico", "Peru" in that order.3. Use the enhanced for loop to print all countries in the array list, one per line.4. Add "Spain" at index 15. Replace the element at index 2 with "Vietnam". You must use the set method.6. Replace the next to the last element with "Brazil". You must use the set method. You willlose one point if you use 3 in the set method. Do this in a manner that would replace thenext to the last element, no matter the size of the array list.7. Remove the object "Canada" Do not remove at an index. Your code should work if"Canada" was at a different location. There is a version of remove method that willremove a specific object.8. Get and print the first element followed by "***"9. Call method toString() on countries to print all elements on one line.10. Use the enhanced for loop to print all countries in the array list,…
Need help with this: Given the following challenges, use append(), extend(), pop(), and insert()to change the contents of the lists. Suppose that we have the following list: Strawberry, Blueberry, Blackberry, Cranberry Define the list berries with the following elements shown in Snippet 5.11: Strawberry, Blueberry, Blackberry, Cranberry Using the built-in append() method, add the value Raspberry to the list berries. Using the built-in extend() method, extend an empty fruits list from the berries list that you created previously. Insert Mangoes into the fruits list at index 2 using the built-in method insert(). Remove the element at index 1 from the fruits list using the built-in method pop() and replace it with Apples, using the insert() built-in method. Finally, sort the elements in the fruits list by using the built-in method sort() with keyword arguments. Set the key argument to None and the reverse argument to False.
Computer Science Below there are 4 different ways of computing list reversal. One method does not work, why not? Comment each line of the reverse functions. Where does the reversal take place clearly indicate in your comments. #define reverse_method 3 #if reverse_method == 1 void DLinkedList::reverse() { DLinkedList temp; while (!empty()) { Elem s = front(); removeFront(); temp.addFront(s); } swap(*this, temp); } #elif reverse_method == 2 void DLinkedList::reverse() { DLinkedList temp; while (!empty()) { Elem s = front(); removeFront(); temp.addBack(s); } while (!temp.empty()) { Elem s = temp.front(); temp.removeFront(); addFront(s); } } #elif reverse_method == 3 void DLinkedList::reverse() { DLinkedList* temp = new DLinkedList; while (!empty()) { Elem s = front(); removeFront(); temp->addFront(s); } swap(*this, *temp); } #elif reverse_method == 4 void DLinkedList::reverse() { DLinkedList temp; while (!empty()) { Elem s = front(); removeFront(); temp.addFront(s); } while…
Add to LinearProbingHashST a delete()method that deletes a key-value pair by setting the value to null (but not removingthe key) and later removing the pair from the table in resize(). Your primary challenge is to decide when to call resize(). Note : You should overwrite the null value ifa subsequent put() operation associates a new value with the key. Make sure that yourprogram takes into account the number of such tombstone items, as well as the numberof empty positions, in making the decision whether to expand or contract the table
Asap please Project description: Refer to the algorithm for Quicksort given in the link below. 1. Modify the code to implement the quicksort by picking the middle element as the pivot (if there are even number of elements pick the one to the left of middle) and output the list before and after each partition. 2. Print the number of comparisons made with the pivot element. 3. Specify a upper bound in asymptomatic notation for the worst case running time 3. Specify a upper bound in asymptotic notation for the worst-case running time.
True or False For each statement below, indicate whether you think it is True or False. provide a description of your answer for partial credit in case you are incorrect. 3) Given a priority queue implemented as a standard linked list with only a head pointer, insert performing at O(n) and remove at O(1), and the following functions performed (higher numbers represent higher priorities): Insert(“Rick”, 75), Insert(“Carol”, 80), Insert(“Daryl”, 65), Remove(), Insert(“Negan”, 60), Insert(“Maggie”, 25), Remove(), Insert(“Michonne”, 55) a. If Insert(“Eugene”, 40) is called, it will be added as the last node in the linked list b. The linked list from head to the end at this point is Rick, Negan, Michonne, and then Maggie c. Carol was the first element removed from the priority queue
g. Add to LinearProbingHashST a delete()method that deletes a key-value pair by setting the value to null (but not removingthe key) and later removing the pair from the table in resize(). Your primary challenge is to decide when to call resize(). Note : You should overwrite the null value ifa subsequent put() operation associates a new value with the key. Make sure that yourprogram takes into account the number of such tombstone items, as well as the numberof empty positions, in making the decision whether to expand or contract the table.
Create a method that checks whether two sets of integers are equivalent by writing a function to compare them (i.e. contain the same values). The greatest value of each list must be shown if the lists are dissimilar and the procedure is effective.
Suppose a list contains marks earned in the courses CSE110, PHY111, and MAT110 of each student consecutively in a nested list form. Your task is to take a course name as input and sort the list based on the marks obtained in that course to finally print the names of the students in descending order of marks obtained i.e. from the student who earned the highest marks to the student who earned the lowest. For example, the list may look like stu_lst = [ ["Alan", 95, 87, 91], ["Turing", 92, 90, 83], ["Elon", 87, 92, 80], ["Musk", 85, 94, 90] ] where for each nested list, 1st index holds the name of the student, 2nd index is total marks earned in the CSE110 course, 3rd index is PHY111 marks and 4th index is MAT110 marks. [You cannot use python build-in sort() function, you can call your own sort function or copy your code from previous tasks instead] =============================================================== Sample Input 1 MAT110 Sample Output 1 ['Alan', 'Musk', 'Turing', 'Elon']…
Suppose a list contains marks earned in the courses CSE110, PHY111, and MAT110 of each student consecutively in a nested list form. Your task is to take a course name as input and sort the list based on the marks obtained in that course to finally print the names of the students in descending order of marks obtained i.e. from the student who earned the highest marks to the student who earned the lowest. For example, the list may look like stu_lst = [ ["Alan", 95, 87, 91], ["Turing", 92, 90, 83], ["Elon", 87, 92, 80], ["Musk", 85, 94, 90] ] where for each nested list, 1st index holds the name of the student, 2nd index is total marks earned in the CSE110 course, 3rd index is PHY111 marks and 4th index is MAT110 marks. [You cannot use python build-in sort() function, you can call your own sort function or copy your code from previous tasks instead] =============================================================== Sample Input 1 MAT110 Sample Output 1 ['Alan', 'Musk', 'Turing', 'Elon']…
/** * Removes the specified key and its associated value from this symbol table * (if the key is in this symbol table). Takes advantage of the fact that the * keys appear in increasing order to terminate` early when possible. * * @param key the key * @throws IllegalArgumentException if {@code key} is {@code null} */ public void delete(Key key) { // TODO // Change this code to make use of the fact that the list is sorted to // terminate early when possible. // As this code already uses recursion, the private helper function is // already present below, but it will need to be changed to terminate // early when appropriate. if (key == null) throw new IllegalArgumentException("argument to delete() is null"); first = delete(first, key); } // delete key in linked list beginning at Node x // warning: function call stack too large if table is large private Node delete(Node x, Key…
Write a complete Java program that provides two methods named orderList(list) and lastIndexOf(list, targetValue). The first method should sort the elements ascendingly from a-z using Selection Sort Algorithm. The second method should return the last index at which a predetermined target value occurs in the list using Binary Search Algorithm. The method should return -1 if the target value is not found. List size, elements and target value should be read from the user.