Fix the code Task-2:Amazon wants to reward the customer who has done the most number oftransactions, by providing a gift hamper worth 1000 pesos.Find out the customer who has done the most number of transactions [Note: Oneinvoice number corresponds to one transaction]. The output should the one asbelow:Hurray! The nost nurber of transactions is done by Custoner ID: 17850. He has made 45 transactions. He will be revarded sith ogift hamper worth 1000 pesos Тавk 2In (27):1 a-[)3 b-[]4.5 for i in (Datal.head(200) and Datal.tail(2ee)):if i(-2] not in a:a. append (i[-2])1811b.append(i[3])12else:1415b[a.index(1)]+-i[3]1617 trans-nax(b)1819 cusid-a[b.index(trans)]2821 print ("Hurray! The rost number of transactions is done by Custorer ID:",cusid+". He has made", trans, "transactions. He will EValueErrorTraceback (most recent call last)cipython-input-27-32f53cecsfc9> in cmodule>3 b-[]4----> 5 for i in (Datal.head(280) and Datal.tail(200)):if i[-2] not in a:-\anaconda3\1ib\site-packages\pandas\core\generic.py in _nonzero_(self)efinaldef _nonzero_(self):raise ValueError(f'The truth value of a (type(self)._nane) is ambiguous. ""Use a.empty, a.bool(), a.iten(), a.any() or a.all()."14401441-> 144214431444ValueError: The truth value of a Dataframe is anbiguous. Use a.erpty, a.bool(), a.iten(), a.any() or a.all().

It is defined as an interpreted, object-oriented, high-level programming language with dynamic…

1 a-1 for i in (Datai.head(200) and Datal.tail(200)): if 1(-2] not in a: a. append(i[-2]) b. append(i[3]) else: b[a.index(1)]+[3] 17 trans-rax(b) 19 cusid-a(b.index(trans)] 21 print ("Hurray! The rost number of transactions is done by Custorer 1D:", cuside". He has made", trans, "transactions. He will valuetrror Traceback (most recent call last) ---> s for i in (Datal.head(200) and Datal.tail(200)): if i[-2] nat in a: \anacondalib\site-packages\pandas \core\generic.py in nonzero(self) 1440 efinal def _nonzero_(self): raise Valuetrror 'The truth value of a (type(selfF)._nane) is ambiguous." "Use a.empty, a.bool(), a.item(), a.any() or a.all(). 1441 > 1442 1443 1444

1 a-1 for i in (Datai.head(200) and Datal.tail(200)): if 1(-2] not in a: a. append(i[-2]) b. append(i[3]) else: b[a.index(1)]+[3] 17 trans-rax(b) 19 cusid-a(b.index(trans)] 21 print ("Hurray! The rost number of transactions is done by Custorer 1D:", cuside". He has made", trans, "transactions. He will valuetrror Traceback (most recent call last) ---> s for i in (Datal.head(200) and Datal.tail(200)): if i[-2] nat in a: \anacondalib\site-packages\pandas \core\generic.py in nonzero(self) 1440 efinal def _nonzero_(self): raise Valuetrror 'The truth value of a (type(selfF)._nane) is ambiguous." "Use a.empty, a.bool(), a.item(), a.any() or a.all(). 1441 > 1442 1443 1444

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

4. (a) Suppose the encoding matrix is1−3 − 3 − 40 1 14 3 43Use the encoding matrix above to encode the messageGOOD LUCKUsing 1 for the letter A, 2 for B,….26 for Z and 27 for space.(b) Decode the encoded message(-19, -61, 83, -34, -111, 136, -35, -101, 119,-29,-83,84)using the following decoding matrix10 1 15 − 3 − 1−3 2 13What does the message say?
write or correct assembly language program print value 1,2,3,4 using array dosseg.model small.stack 100h.dataarr DB 1,2,3,4.codemain procmov ax, @datamov ds, axmov si, offset arrmov dx, [si]mov ah,2int 21hMov dx, [si+1]mov ah,2int 21hMov dx, [si+2]mov ah,2int 21hMov dx, [si+3]mov ah,2int 21hmov ah,4chint 21hmain endp We have written some Assembly statements again and again, to avoid repetition we useloop for example following program will print digits from 1 to 6 using loop dosseg.model small.dataarr DB 1,2,3,4,5,6.codemain procmov ax, @datamov ds, axmov si, offset arrmov cx,6loopx:mov dl, [si]add dl,48mov ah,2int 21hmov dl, 44mov ah,2int 21hInc si ; mov dx, [si+1]loop loopxmov ah,4chint 21hmain endpend main
According to the inclusion property of a stack page replacement technique, the group of pages in memory corresponding to n frames is always a subset of the group of pages in memory corresponding to n frames plus one for the same sequence of accesses. Show that OPT and LRU have been proven (recently).
Given an empty hash table of size 7 that uses open addressing, the following sequence of keys is to be inserted: 15 17 8 23 3 5 Insert these keys using each of the following approaches. h(x) = x % 7; linear probing 0 1 2 3 4 5 6 2. h(x) = x % 7; quadratic probing 0 1 2 3 4 5 6 3.h(x) = x % 7; double hashing with stepSize = 5 - (x % 5); 0 1 2 3 4 5 6
14, 9, 51, 69, 75, 2, 1, 6 Provide a function to search 69 in the above BST (Binary Search Tree).
java program : Given the following input keys: 20, 30, 2, 35, 25, 24, 32, 42 and Hash function h(X) = X mod 11, HTSize = 11. Obtain the resulting hash table when open addressing with linear probing is used to resolve collisions. Show the values of hash function for all keys and the hash table.
For the following code fragment.LOOP: LD R1, 0(R2) ;load R1 from address 0+(R2) DADDI R1, R1, #1 ;R1 <– R1 + 1 SD R1, 0, (R2) ;store (R1) at address 0(R2) DADDI R2, R2, #4 ;R2 <– R2 + 4 DSUB R4, R3, R2 ;R4 <– R3 - R2 BNEZ R4, LOOP ;branch to LOOP if (R4) != 0Assume that the initial value of R3 is (R2)+20. Show the timing of this code fragment
Assume one file has r = 10^6 records. Each record takes R = 100 bytes, of which 10 bytes are for the key of record. Suppose the key balues range from 1 to 1,000,000, inclusive. Assume the block size B is 1000 bytes for all files, and that an address (block pointer, tree node poiinter, or data record pointer) takes 10 bytes. How many data block accesses on the average are needed to fetch a record by using linear search?
According to the inclusion property of a stack page replacement technique, for every given sequence of accesses, the set of pages in memory for n frames is always a subset of the set of pages for n + 1 frames. Validate the OPT and LRU (most recently used) stack algorithms.
Subject code- rcs502 Consider a Table T with a key field k. A and B tree of order P denotes the maximum number of record pointers in a B tree. Assume K is 10 bytes long disk block size is 512 Bytes. Record pointer is 8 Bytes and block pointer size is 5 Bytes long in order for each P tree node to fit in a single disk block the maximum value of P. I will downvote,if you do anything wrong
22 Consider a hash table with size m=7, fill the following items in the table if the hash function used is (6k-5) mod m. AAB, ABA,CDF,STW,YZQ,PFG (ASCII code) . Then count the number of collisions and solve the collision ( if possible) using one of the methods studied
The set of pages in memory for n frames is always a subset of the set of pages in memory for n + 1 frames for the same sequence of accesses; this is what is meant by the inclusion property of a stack page replacement mechanism. Convince me that OPT and LRU are true (recently) Algorithms that can be stacked.