Underground Books is a quaint little bookshop in your town still implementing manual inventory system for the books. As a long-time employee proficient in C++ programming, you propose a transition towards digital book inventory system. Write an application in C++ to keep track of the bookshop inventory. The inventory records information in the text file consists of the following data: ISBN Code, author, title, publisher, year published, quantity, price and location. The details of the location include rack and level number. Gather the inventory data on at least 20 books and prepare them in the text file. As each inventory record is read from the file, insert it into a list by using nested array of structures.
After building the list, display a menu with the following options:
Modify the storage structures of book inventory records of your program so that it can store the category/genres information of the particular book.
Search for guest record(s) in the list using the book ID, author or title and print the full details for the record(s). It can match word(s)/number within a string/number, and also print multiple results. This is best explained by the following examples:
- If the ISBN code “9780807092156”, “9780803970533”, and “9780804143097” are in the
list, then searching for “978080” must print all three records (because the number “978080” occurs in all three ISBN Codes).
- If the full name “Dan Ariely” is stored inside the list, searching for either “Dan” or “Ariely” should return the record.
Note that you may need to use strstr() which allows you to locate substring.
Prepare the necessary data file(s) for building the data structure(s) needed in your application according to the format as shown in Appendix A below. You may give additional assumptions for your application.
To make your program more robust and avoid problems at run time, do as much status/error checking as you could in your program. You may also add on more features in your program for enhancement.
This is a group assignment. Form a group of 2 or 3 members, preferably from same programme as yours. Prepare a report (preferable using word processing software and export to portable document format) to answer the questions given above.
Your REPORT SHOULD CONTAIN the following:
Do remember to print the assignment marking sheet and attach as the FIRST PAGE of your report. There will be a link created in WBLE subject page for you to submit softcopy of your report, C++ program file(s) and input text file(s). You are required to upload the soft copy of your works by the deadline. Late submission will not be entertained.
This practical assignment will contribute 20% of your final mark. Refer to the marking sheet for the mark allocations for the report and C++ program. The report will be marked for correctness, completeness, presentation style, and relevant use of diagrams/tables/graphs, etc. And the C++ program will be marked for correctness, completeness, program style, adequate testing and documentation/comments. It’s your responsibility to understand the requirements of the tasks and prepare well for your submission. You will not receive full mark if you do not submit the report and C++ program that is a reasonable attempt and compiles without error. You might be asked questions about the work you submit to ensure that you understand them.
DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma
Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t
Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th
1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of
Get Free Quote!
376 Experts Online