Data Structures and Algorithms for Library System Analysis

CASE STUDY ANALYSIS 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

CASE STUDY ANALYSIS 2
Contents
Executive summary.................................................................................................... 2
Introduction................................................................................................................ 2
The library system Analysis........................................................................................ 3
Operations conducted by Library System...................................................................5
Algorithms required.................................................................................................... 6
Conclusion.................................................................................................................. 9
References............................................................................................................... 10

CASE STUDY ANALYSIS 3
Executive summary
Data structures refers to the arrangement of data in a particular way that enables its management,
access and modification in the memory of a computer. Mostly data structures are designed to
achieve a specific task or purpose. Their storage and organization assists in the retrieval of
information in a productive way (Michalewicz, Z. 2013, 32) The use of correct data structures
makes a computer perform tasks more efficiently by improving the capability of the computer to
retrieve data from any position in the memory.
Algorithms are instructions given to a computer to perform a specific task. For data structures,
the algorithms that perform the management and organization of data include; sorting
algorithms, searching, merging, traversing and deleting algorithms. For this algorithms to work
effectively, the algorithms must meet specific properties (Zhang, M. 2015, 56) These properties
involve space and time complexities. Space complexities entail the amount of memory space
required for an algorithm for its execution and produce appropriate output. The other property is
time complexity and it entails the amount of time required for complete execution of an
algorithm.
Introduction
For a program to have executed successfully and having met all the properties it should have
executed with the minimum space in the memory and with the least time possible. That is what is
referred as an effective and efficient algorithm. The ones that require a lot of space and time for
execution are said to be less effective in data structures.

CASE STUDY ANALYSIS 4
The library system Analysis
A library system or Library Management System (LMS) is a planning system for a library and is
used to track items owned from the library, orders made, borrowers and borrowed items from the
library, bills paid and all management pertaining the library. For the system to work
appropriately, several variables must be identified so as to store some known or unknown
quantities of data. These quantities of information are referred to as values and they are assigned
with a symbolic name. Some of the variables that are going to be used in the making of the
library system include;
i. Short
ii. Int
iii. Long
iv. Float
v. Double
The following involves the variables that are essential in the storage of data that is going to
be used in the execution of the library system software. These variables are useful in holding the
critical information of key components of the library system. These variables are essential since
they are going to assist in writing a flexible program that is going to hold data temporarily until
it’s time for execution.
A key is a unique identification used to identify items in the library inventory. The keys should
be unique and different from others for appropriate identification. The keys that are going to be
used in the design of the LMS include:
i. B123 for books search