subject

Design solution: The program will have a master book list of all books which is provided in the template file. Some of the books will be available and some are not. A customer would only able to checkout available books. Each of the item in the list contains a title of a book and its availability. You will need to implement a string manipulation logic to find out available books to checkout. The program will have a menu for actions available to the customer. A customer will be able to choose the following options from the menu: 1. display all books: Display all the books in the master book list with its availability information 2. add books to the cart (only available books can be added to the cart): Customer will only be able to add a book that title is in the list and its available. Once added, the status of the books needs to make unavailable. Display the master list after addition. 3. delete a book from cart: Customer will enter the name of the book and the program will look for the book in the checkout list to be deleted from. Once deleted, the master book list needs to be updated so that the deleted book from the list becomes available again. Display the master list after deletion. 4. check out books: Display the list of the books that are being selected by the user. 5. exit/terminate the program. Notes: The customer cart should be implemented as a separate list. Any addition/deletion of items should be done in this list. Books should not be added or deleted from the master book list. The program needs to be case sensitive. Customer can enter the name that can have all small letter but the program should still be able to find the book if in the master list. You need to write a pseudocode for the planning of the program and needs to be submitted inside the template file. Welcome to library checkout system Available options: 1: See menu 2: Add book 3: Delete a book from cart 4: Checkout 5: Exit Enter option: 1 List of books Title Availability Girl With No Name Available Despicable Me Unavailable Journey To The Moon Available The Calculating Stars Unvailable Available options: 1: See menu 2: Add book 3: Delete a book from cart 4: Checkout 5: Exit Enter option: 2 Enter book title to add to cart: Girl with no name Book added: Girl With No Name Current List of books Title Availability Girl With No Name Unavailable Despicable Me Unavailable Journey To The Moon Available The Calculating Stars Unvailable Available options: 1: See menu 2: Add book 3: Delete a book from cart 4: Checkout 5: Exit Enter option: 2 Enter book title to add to cart: Journey to the moon Book added: Journey To The Moon Current List of books Title Availability Girl With No Name Unavailable Despicable Me Unavailable Journey To The Moon Unavailable The Calculating Stars Unvailable Available options: 1: See menu 2: Add book 3: Delete a book from cart 4: Checkout 5: Exit Enter option: 3 Enter book title to delete: Girl with no name Girl With No Name deleted from cart Current List of books *** Title Availability Girl With No Name Available Despicable Me Unavailable Journey To The Moon Unavailable The Calculating Stars Unavailable *** Available options: 1: See menu 2: Add book 3: Delete a book from cart 4: Checkout 5: Exit Enter option: 4 Please return the books within 90 days Your book cart: Journey To The Moon Available options: 1: See menu 2: Add book 3: Delete a book from cart 4: Checkout 5: Exit Enter option: 5 Thanks for using library checkout system

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 23.06.2019 01:30
1. which of the following is a search engine? a) mozilla firefox b)internet explorer c)google d)safari 2. which of the following statements is true? a) all search engines will provide the same results when you enter the same query. b) all search engines use the same amount of advertisements. c) some search engines are also browsers. d) search engines often provide different results, even when you enter the same query.
Answers: 2
question
Computers and Technology, 23.06.2019 10:20
Suppose there is a relation r(a, b, c) with a b+-tree index with search keys (a, b).1. what is the worst-case cost of finding records satisfying 10 < a < 50 using this index, in terms of the number of records n1, retrieved and the height h of the tree? 2. what is the worst-case cost of finding records satisfying 10 < a < 50 and 5 < b < 10 using this index, in terms of the number of records n2 that satisfy this selection, as well as n1 and h defined above? 3. under what conditions on n1 and n2, would the index be an efficient way of finding records satisfying the condition from part (2)?
Answers: 1
question
Computers and Technology, 24.06.2019 01:00
Verify each identity[tex] \frac{csc}{cot \: x \: + \: tan \: x} = cos \: x[/tex]
Answers: 1
question
Computers and Technology, 24.06.2019 06:50
What are the things you are considering before uploading photos on social media?
Answers: 1
You know the right answer?
Design solution: The program will have a master book list of all books which is provided in the temp...
Questions
question
Mathematics, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
question
Geography, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
question
English, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
question
Geography, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
question
English, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
question
English, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
question
Mathematics, 12.09.2020 01:01
Questions on the website: 13722360