Task 2In [120]:1 a = [ ]23 b - [ ]45 for i in (Data.head(200) and Datal.tail(200)):6.7if i[-2] not in a:a.append(i[-1])1011b.append(i[-2])1213 else :1415b[a.index(1) + =i[a]1617trans - max[b]1819 cusid =a[b.index(trans(a)) ]2021 print("Hurray. The most number of transactions is done by Customer 10:", cusid+" .He has made ", trans"transactions. He wiFile "kipython-input-120-66585211c59a>", line 15b[a.index(1) + =i[a]SyntaxError: invalid syntax

Here, it is a syntax error. Since += can't be write with spaces. so, here you are writing it with…

1 a -[ ] ab - [ ) s for i in (Data.head(200) and Data1.tail(200)): 16 if i[-2] not in a: a.append(i[-1]) b.append(i[-2]) 3 else : b[a.index(1) + -i[a] trans - max[b] ecusid = a[b.index(trans(a)) ] 1 print("Hurray. The most number of transactions is done by Customer 18:", cusida" .He has made ", trans" , transactions. He wi File "", line 15 b[a.index(1) + -i[a] ntaxError: invalid syntax

1 a -[ ] ab - [ ) s for i in (Data.head(200) and Data1.tail(200)): 16 if i[-2] not in a: a.append(i[-1]) b.append(i[-2]) 3 else : b[a.index(1) + -i[a] trans - max[b] ecusid = a[b.index(trans(a)) ] 1 print("Hurray. The most number of transactions is done by Customer 18:", cusida" .He has made ", trans" , transactions. He wi File "", line 15 b[a.index(1) + -i[a] ntaxError: invalid syntax

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 C++ program that: (1) defines and implements a hash class that constructs a 15 element array (may be implemented using a vector, a deque, or a list, if you prefer, (using the STL implementations), storing strings, using the following hash function: ((first_letter) + (last_letter) - (second_letter))% 15 (2) the driver program should: a. query the user for ten words and store them using the hash technique described above. b. print out the contents of each position of the array (or vector, deque, or whatever you used), showing vacant as well as filled positions. Remember, only 10 of the 15 positions will be filled. c. repeatedly query the user for a target word, hash the word, check for its inclusion in the list of stored words, and report the result. Continue doing this task until the user signals to stop (establish a sentinel condition).
Write a function cmid to count elements of an integer list between 5 and 10. One function only.cmid [12,3,6,4,5,1] → 2
Write the implementations of functionscopy1 and copy2 for copying strings. copy1 uses array index notation. copy2 uses Pointers andPointer Arithmetic.#include <stdio.h>#define SIZE 10void copy1(char* s1, const char* s2); // prototypevoid copy2(char* s1, const char* s2); // prototypeint main(void){char string1[SIZE]; // create array string1char *string2 = "Hello"; // create a pointer to a stringcopy1(string1, string2);printf("string1 = %s\n", string1);char string3[SIZE]; // create array string3char string4[] = "Good Bye"; // create an array containing a stringcopy2(string3, string4);printf("string3 = %s\n", string3);}void copy1(char* s1, const char* s2){//Implement copying string using array index notation}void copy2(char* s1, const char* s2){//Implement copying string using Pointers and Pointer Arithmetic }
Computer Science Consider the perfume dataset in the file, it contains the strength of the smell of 20 perfumes measured by an odor meter throughout 25 seconds, so each second (column) is a new measurement. Write a program to group these perfumes based on the similarity in the strength of their smell. You should use k-means clustering algorithm. The final output of your program should show lists of perfumes, and show outlier perfume's records (if exists).
void func(vector<string>& names){ sort(names.begin(), names.end()); //(a) for(int i = names.size() - 1; i > 0; --i){. //(b) if(names[i] == names[i - 1]){ names[i] = move(names.back()); names.pop_back(); } } } What are the reasons or consequences for the programmer’s choice to loop backwards in the line marked (b), and under what circumstances would the algorithm behave differently if that line were replaced with: for (int i = 1; i < names.size(); ++i) ? What would change?
7. display a value at a specified index in a linked chain of integers For example, display the 3rd element in the chain, display the 10th element in the chain, etc. a.O(log n) b.O(n2) c.O(n) d.O(1) e.none of these is correct
S={0,1,2,3} define a "+" and "-" process to be set of S is create a area
Question 1 5 pts A regular expression is shorthand for a set of strings. For example (b+ba)* ba (a+ab)* represents a set of strings for which the first two elements (when listed in length order with same length strings listed in alphabetical order) are: ba and baa. What are the next three strings in this sequence? Next string: Next after that: Next after that:
251e def intersection (self, source): 252e 253 254 Efficiency: 255 Returns a new set with only the values that appear in both self and source. 256 257 258 Maximum size of target Set is the smaller of the maximum sizes of 259 self and source. 260 Use: target = self.intersection(source) 261 262 Parameters: 263 source - a set (Set) 264 Returns: 265 target - a set containing one copy of all the values that appear in both self and source (Set) 266 267 268 Examples: (1,2,3) intersection (3,2,1) is (1,2,3) (1,2,3) intersection (4,5,6) is () (1,2,3,4,5,6) intersection (0,2,4,6,8) is (2,4,6) 269 270 271 272 273 274
numpy array (([[-13,-38,22,-41,25], [-45,29,14,-34,-49], [26,21,-44,-25,0], [-30,-32,34,-39,-22], [-21,-36,0,18,37], [37,44,46,36,-37]]) Use indexing to extract the following slicers from the array [14,-34,-49], [-44,-25,0], [34,-39,-22] [[-30,-32,34,-39,-22], [-45,29,14,-34,-49], [-21,-36,0,18,37]] [25,34,46,-36]
convert C++ STL code into Python:int main(){ // empty map container map<int, int> gquiz1; // insert elements in random order gquiz1.insert(pair<int, int>(1, 40)); gquiz1.insert(pair<int, int>(2, 30)); gquiz1.insert(pair<int, int>(3, 60)); gquiz1.insert(pair<int, int>(4, 20)); gquiz1.insert(pair<int, int>(5, 50)); gquiz1.insert(pair<int, int>(6, 50)); gquiz1.insert(pair<int, int>(7, 10)); // printing map gquiz1 map<int, int>::iterator itr; cout << "\nThe map gquiz1 is : \n"; cout << "\tKEY\tELEMENT\n"; for (itr = gquiz1.begin(); itr != gquiz1.end(); ++itr) { cout << '\t' << itr->first << '\t' << itr->second << '\n'; } cout << endl; return 0;}