BIT204 Data Structures & Algorithms: Library System Design Report

This report details the design of a library system for Kent Institute, focusing on the application of data structures and algorithms. The system is designed to manage library operations such as adding new items, issuing and returning books, and providing search functionalities. The report analyzes the use of various algorithms, including sorting (specifically quick sort), searching (binary search), inserting, deleting, and merging algorithms, to optimize these operations. The system considers variables, ranges, and key identifiers to efficiently manage the library's inventory. It also discusses the importance of time and space complexities in algorithm efficiency. The report concludes by comparing the proposed system's effectiveness for Kent Institute's size, and suggests how the system might need to be adapted for a larger institution, emphasizing the need for more sophisticated data structures and increased processing power. The solution emphasizes efficient data management and provides a practical application of data structures and algorithms in a real-world scenario.

DATABASE 1
Data Structures and Algorithms
The Name of the Class (Course)
Professor (Tutor)
The Name of the School (University)
The City and State where it is located
The Date

DATABASE 2
Table of Contents
Executive outline.........................................................................................................................................2
Introduction.................................................................................................................................................3
Operations conducted by Library System....................................................................................................6
Algorithms required....................................................................................................................................6
Conclusion.................................................................................................................................................10
References.................................................................................................................................................11

DATABASE 3
Executive outline
Data structures is the organization of information in a very explicit way that allows its
management, access and modification within the memory of a computer. Principally, information
structures are designed to attain a selected task or purpose. Their storage and organization assists
within the retrieval of knowledge in a very productive approach (Prytherch ., 2016.) The
utilization of correct information structures makes a computer perform tasks additional
expeditiously by rising the efficiency of the computer to retrieve information from any position
within the memory.
Algorithms are directions given to a computer to perform a selected task. For information
structures, the algorithms that perform the management and organization of information include;
sorting algorithms, searching, merging, traversing and deleting algorithms. For this algorithms to
work effectively, the algorithms should meet specific properties (Zhu et al., 2015) These
properties involve space and time complexities. Space complexities entail the number of memory
area needed for a rule for its execution and turn out applicable output. The opposite property is
time quality and it entails the amount of a time assigned needed for complete execution of an
algorithm.
Introduction
A program needs to possess an action with success and having met all the properties it ought to
have met with the minimum space within the memory and with the smallest amount time for
complete execution. That is what is referred as an efficient and effective rule or algorithm. Those
that need a great deal of space and time for execution are same with the less effective algorithms
in data structures.

DATABASE 4
The library system Analysis
Library Management System (LMS) is a supervision system for a library and is employed to
trace things owned from the library, orders created, borrowers and borrowed things from the
library, bills paid and management pertaining the library. For the system to work suitably, many
variables should be known thus, on store some better-known or unknown quantities of
information should be arranged systematically for the purpose of identification. These quantities
of knowledge are identified as values and they are assigned with a symbolic name. A number of
variables that are to be utilized in the creating of the library system include;
a) Short
b) Int
c) Long
d) Float
e) Double
The above involves the variables that are essential within the storage of information that is to
be utilized in the execution of the library system software system. These variables are helpful in
holding the essential information of key elements of the library system. These variables are
essential since they are planning to assist in writing a versatile program that is planning to hold
information quickly till it’s time for execution.
A key is an identification that will establish things within the library inventory. The keys ought
to be distinctive and completely different from others for applicable identification. The keys that
are planning to be utilized in LMS include:

DATABASE 5
i. BO111 for books search
ii. DV222 for DVD’s search
iii. JO333 for journal search
iv. OT444 alternative connected library material
The keys used are ranges and also they are the beginning limit for every class. Every class is
going to be listed from the initial key as listed. From these distinctive key identifiers, all
operations are ready to be conducted on the inventory with ease.
Range refers to the higher and lower limits for potential variable values. The values for the
Variables must not exceed the lower and the upper limits thus to avoid the values being out of
range hence not being obsolete.
The ranges that are to be used include;
i. the upper limit
ii. lower limit
The upper limit will provide the maximum limit a value can reach and exceeding that value will
make the value outmoded. The lower limit will provide the threshold to which the values of the
variables that must reach in order to be considered significant values.
The operation the Library should be able to hold at least 2000 different course books, 1700
journals, 850 DVD’s or any other storage devices so as to fully and efficiently serve it users.
This library system is developed for Kent Institute and since there are not many users the above
number of items of the library should be adequate for the normal working of the library.

DATABASE 6
Operations conducted by Library System
The operations conducted by the library should include the normal functioning of the library and
some additional features since the process has been automated (Goodrich, M. T, et al. 2014, 23)
The normal operations include;
i. A book or any other library material should be added to the library with a unique
identification number and the shelf to where it is place properly indicated and put with
proper categorization.
ii. issuing of books and other library related tools to the authorized users of the library. The
users should be legible and should not be having other withheld library materials.
iii. The Library Management System should provide a search method for the users to check
for what they might be looking for in the library. The search should be effective and
provide the users comprehensive information about the items searched for.
iv. The system should keep track of the items given out from the library. Their issuing and
return date should be properly indicated and a means to remind the user of the deadline
should be put into place. This will reduce the overstaying of items by an individual
having a wanted library item.
v. The library system should facilitate other administrative activities such as data processing
and inventory processing.

DATABASE 7
Algorithms required
For the library operations to be performed effectively, there are some algorithms that must be put
in place in the Library system. These algorithms are the ones responsible for smooth working
and automation of library processes and operations. The algorithms that are going to be put into
place include;
1. Sorting algorithm
2. Searching algorithm
3. Inserting algorithm
4. Deleting algorithm
5. Merging algorithm
The first algorithm is the sorting algorithm. What this algorithm solely does is put the
essentials of a list in an order. By order it means that the order must be sensible. The list must
be ordered either numerically, ascending, descending order or any other method that makes
values to be acquired with ease.
Without sorting, the process of acquiring something from a myriad of the rest will be a
cumbersome job. Though sorting also is process and furthermore tidious it is preferable since
after sorting items they can be acquired with simplicity. The best specific sort algorithm is
the quick sort algorithm. The time complexity for quick sort is O(log n) in the best case
scenario and O(n^2) for average case. Average case is considered the best performance for
most inputs hence considered the fastest algorithm. In this library case, a sorting algorithm is
very important in acquiring an item from it. Taking an instance of searching a book from an
unsorted library, getting it would be a very tiring process (Byrne, B. 2013, 67). A sorting

DATABASE 8
algorithm is going to assist in the arranging of books in the shelf for easy accessing and
retrieval. Whichever the method the algorithm would have sorted the books, it will be easier
accessing it compared to going through all the books to get the one an individual want.
Sorting will have reduced the process of looking for a book in the library or any other
material. But the search algorithm is important in getting the information of the precise
location of a book or any other item. A search algorithm is any algorithm that solves the
searching problem. The algorithm uses the information provided to give out the exact
location of the object looked for. The best specific search algorithm is the binary search
algorithm. This algorithm works in a way that it divides a list in two halves. The search list
must be sorted first for the search effective. The search compares the element searched for
with the element at the middle of the list. This process divides until the element searched for
is found. The binary search is effective because it has a time complexity of O(log(n)) for
each search of a list. In this library case, the information must be first fed into the computer
regarding the information of the items. If the item exists, the algorithm points out the location
and if it is not available, the algorithm saves the time for the seeker in going through the
shelves. This makes the algorithm be important in use in the library system.
Inserting algorithm adds a new record to list. The algorithm is very important to the library
system. Items in the library are continually added for studies use. A method of adding the
information to the system must be put in place to enable the other algorithm of sorting and
searching to access it and ease the process of using the library. The algorithm will ease the
process of recording information about an item and integrate the items information with the
other.

DATABASE 9
Deleting information is an inevitable process since when information becomes invaluable, it
has no value to the user and hence its flooding of data to the memory of the computer is not
necessary. Deleting algorithm removes an item from the inventory and hence when a user
looks for it, they are going to be told directly that the item was removed from the inventory.
The algorithm is important in the library system since it is going to save on space memory by
removing data of items that are not required in the library.
Merging algorithm is an additional algorithm that is essential in the working of the library
system. What this algorithm essentially does is combine items from the same sorted list. If a
librarian finds there are some items that need to be merged in case of a request by a user, the
algorithm will come in handy in such scenarios. Items requested by a class or course from
different categories can be merged and lent out from the library hence ease the process of
combining the items together (Toso, R. 2015, 18).
For another university with the increased number of users as per the data provided, the
system would not be effective since it was designed for a smaller institution. With the
increased number of users, the library would require a complex system literally with an
increased sized which can hold a large number of library items for the gargantuan number of
users. This will mean that the library will have more librarians and more inventory. The
library system should have a larger database to hold the inventory information and
borrower’s details. The system requirements should be different from the previous system
since the new system must have faster software and effective hardware. The speed for the
machine should be able to execute information fast since the system will be serving a large
number of users.

DATABASE 10
Conclusion
In conclusion, facts buildings assist in the organization of statistics in the memory of a
computer for quicker access. Algorithms play an extraordinary role in realizing the
operations run with the aid of a system. For this case, the recognition of the library system
was made through the use of several algorithms that are primarily used in data structures.
Library system automates operations in the library that require a lot of manpower to perform.
Large establishments require complicated data structures for operations of their activities.
More space and computer pace with unique kind of hardware are required for whole
awareness of tasks.

DATABASE 11
References
Michalewicz, Z., (2013) Genetic algorithms+ data structures= evolution programs. Springer
Science & Business Media.
Fortin, F. A., Rainville, F. M. D., Gardner, M. A., Parizeau, M., & Gagné, C. (2012). DEAP:
Evolutionary algorithms made easy. Journal of Machine Learning Research, 13(Jul), 2171-2175.
Zhang, M., Zhu, J., Zou, Y., Yan, H., Hao, D. and Liu, C., (2015) March. Educational evaluation
in the PKU SPOC course data structures and algorithms. In Proceedings of the Second (2015)
ACM Conference on Learning@ Scale (pp. 237-240). ACM.
Taieb, F., Stevens, B.H. and Coughlin, R.E. (2017) Urban ananlysis for branch library system
planning. Greenwood publishing company (1972).
Goodrich, M. T., Tamassia, R., & Goldwasser, M. H. (2014). Data structures and algorithms
in Java. John Wiley & Sons.
Byrne, B.M. (2013) Structural equation modeling with LISREL, PRELIS, and SIMPLIS: Basic
concepts, applications, and programming. Psychology Press.
Punjani, A., Rubinstein, J. L., Fleet, D. J., & Brubaker, M. A. (2017). cryoSPARC: algorithms
for rapid unsupervised cryo-EM structure determination. Nature methods, 14(3), 290.
Toso, R.F. and Resende, M.G. (2015) A C++ application programming interface for biased
random-key genetic algorithms. Optimization Methods and Software, 30(1), pp.81-93.
Ilves, K., Harnefors, L., Norrga, S., & Nee, H. P. (2014). Predictive sorting algorithm for modular multilevel
converters minimizing the spread in the submodule capacitor voltages. IEEE Transactions on power
electronics, 30(1), 440-449.
Zhang, X., Tian, Y., Cheng, R. and Jin, Y. (2014) An efficient approach to nondominated sorting
for evolutionary multiobjective optimization. IEEE Transactions on Evolutionary Computation,
19(2), pp.201-213.
Pillow, J. W., Shlens, J., Chichilnisky, E. J., & Simoncelli, E. P. (2013). A model-based spike
sorting algorithm for removing correlation artifacts in multi-neuron recordings. PloS one, 8(5),
e62123.
Hu, H., Wang, Y., & Cai, Y. (2012). Advantages of the enhanced opposite direction searching
algorithm for computing the centroid of an interval type‐2 fuzzy set. Asian Journal of
Control, 14(5), 1422-1430.

DATABASE 12
Zhao, H., & Li, X. (2017). A cost sensitive decision tree algorithm based on weighted class
distribution with batch deleting attribute mechanism. Information Sciences, 378, 303-316.
Kas, M., Wachs, M., Carley, K. M., & Carley, L. R. (2013, August). Incremental algorithm for
updating betweenness centrality in dynamically growing networks. In Proceedings of the 2013
IEEE/ACM international conference on advances in social networks analysis and mining (pp.
33-40). ACM.
Green, O., McColl, R., & Bader, D. A. (2012, June). GPU merge path: a GPU merging
algorithm. In Proceedings of the 26th ACM international conference on Supercomputing (pp.
331-340). ACM.
Prytherch, R. (2016). Harrod's librarians' glossary and reference book: a directory of over
10,200 terms, organizations, projects and acronyms in the areas of information management,
library science, publishing and archive management. Routledge.