Question: Assume Basic LIS 28 System + Reservation support Branch support Remove preexisting requirement to support Soft Cover copies Challenge Add support for Resource of which

Assume

Basic LIS 28 System +

Reservation support

Branch support

Remove preexisting requirement to support "Soft Cover" copies

Challenge

Add support for "Resource" of which Book is only one type

Logistics:

Each team hands in the answers to the following 2 questions

Include only the names of those team members who have attended team meeting

LIS28 Extension: Other Resources - Details

Santa Clara Libraries lend out more than just copies of books. Today this includes DVD / VHS tapes,

CDs and magazines. In the future copies of other materials may also be lent out (ex: art work).

Any branch can lend out some or all of these types of resources. Each resource has a different

maximum checkout period and daily overdue fine. Exactly like a book copy, every copy of any

resource (ex: an Aladdin DVD) has a unique bar code which must be scanned during the checkout

and return process.

There is also a different per-resource "limit" for the number of copies a borrower may check out. For

example: 4 books, 8 DVD / VHS tapes, 12 CDs and 30 magazines. So while a given borrower might

be restricted from checking out additional book and DVD / VHS tape copies, she might still be

allowed to check out copies of magazines.

A borrower cannot check out anything if she has more than $10 in current overdue charges (across

all resources).

Assume Basic LIS 28 System + Reservation support Branch support Remove preexisting

Chose one architecture below (or suggest a 3rd) and justify your reasoning in detail A. B. Resource Or Resource Type = {Book, DVD, Mag, ..} Book DVD Magazine Painting

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!