Computers and Technology, 11.10.2020 23:01 artbydi

Consider the following relational schema for a library: member(memb_no, name, dob)
books(isbn, title, authors, publisher)
borrowed(memb_no, isbn, date)
Write the following queries in relational algebra.
A. Find the names of members who have borrowed any book published by "McGraw-Hill".
B. Find the names of members who have borrowed all books published by "McGraw-Hill".
C. Find the name and membership number of members who have borrowed more than five different books published by "McGraw-Hill".
D. For each publisher, find the name and membership number of members who have borrowed more than five books of that publisher.
E. Find the average number of books borrowed per member. Take into account that if a member does not borrow any books, then that member does not appear in the borrowed relation at all.

Answers: 2

Show answers

Another question on Computers and Technology

Computers and Technology, 21.06.2019 23:10

Write a method that accepts a string object as an argument and returns the number of words it contains. for instance, if the argument is "four score and seven years ago", the method should return the number 6. demonstrate the method in a program that asks the user to input a string and then passes that string into the method, printing out whatever the method returns.

Answers: 3

Answer

Computers and Technology, 22.06.2019 10:00

Which of the following is true of operations within a spreadsheet program’s built-in functions? a. operations within parentheses, then multiplication and division, and then addition and subtraction are computed. b. operations within parentheses, then addition and subtraction, and then multiplication and division are computed. c. multiplication and division, then addition and subtraction, and then operations within parentheses are computed. d. addition and subtraction, then multiplication and division, and then operations within parentheses are computed

Answers: 2

Answer

Computers and Technology, 22.06.2019 11:30

Communication is the exchange of information. true false

Answers: 2

Answer

Computers and Technology, 22.06.2019 20:00

What is the worst-case complexity of the maxrepeats function? assume that the longest string in the names array is at most 25 characters wide (i.e., string comparison can be treated as o( class namecounter { private: int* counts; int nc; string* names; int nn; public: namecounter (int ncounts, int nnames); int maxrepeats() const; }; int namecounter: : maxrepeats () { int maxcount = 0; for (int i = 0; i < nc; ++i) { int count = 1; for (int j = i+1; j < nc; ++j) { if (names[i] == names[j]) ++count; } maxcount = max(count, maxcount); } return maxcount; }

Answers: 3

Answer

You know the right answer?

Consider the following relational schema for a library: member(memb_no, name, dob)
books(isb...

Questions