Highlights
1 Brief Task Description
You must design and implement a library search system allowing users to search for books bytitle. It should also allow adding new books and removing lost/damaged books from the librarysystem. As the library will have millions of books, you should think about the most appropriatedata structure(s) and algorithms for the search; add and remove functionality.During the design phase, you should analyse the algorithms for searching for a book, adding abook and removing a book from the system.
You should not use any third party libraries or code as a part of your solution and all codeshould be written by you, i.e. not automatically generated. You also shouldn’t use non-standardor operating system dependant libraries in your program (the code should all be standard C++).To achieve a good mark, you should design and implement the data structures yourself. Usingstandard template library (STL) data structures will severely limit the grade you can achieve
Scenario
A library has found their book search system has become slower as their collection of books hasgrown. They need you to design an efficient program which allows searching for books by titleand adding and removing books. You will be provided with a sample of book data in a text file,which must be loaded by your program. It should however, be possible for your program to loaddata from another file, e.g. by using a command line argument of the file name, to allow them tolater load the full list of all books in the collection.
Detailed Description
It is recommended that you complete the tasks in the following order as the later sub-tasks will require the earlier ones.
Set up Project
Create a Git repository and makefile for the project, remember to update the makefile and commit new files to the git repository as you implement/update them.
Plan Software
Design and Implement a Book class to hold the book objects, each book record will have:
• title
• author(s)
• ISBN
• qty available
Design and Implement Data Structure/Algorithm
Design and implement the data structure which will store the Book objects and associated algorithm(s). Analyse the time complexity of the algorithms (this will bneeded in your report).
Test Data Structure
Apply software testing to ensure your book class and data structure and algorithms are all working correctly.
Read Sample Data File
Implement the program to read the sample data from the given file and load it into the data structure.
Implement Menu
Implement a (command line) user interface to allow users to search for books by title; add booksand remove books. When there are no copies of a given book in the system, the book objectshould be removed from the system.
Write Report
Finish writing the report, including the time-complexity analysis and test cases you prepared while designing the software.
This CST2550 - IT Assignment has been solved by our IT Experts at My Uni Paper. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment Experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.
© Copyright 2026 My Uni Papers – Student Hustle Made Hassle Free. All rights reserved.