An Executive Summary provides a high-level overview of the project-to-date including; results, conclusions, and recommendations. These summaries are written for executives who do not have time to read

Assignment

Student

Class

Date

Professor

WEEK 2

Ordering textbooks (title of the book, student code, year of study)

The new inventory system will be configured with the above credentials before issuing books to students. This is meant for tracking purposes as well as ensuring no books are lost to students. Students will be held accountable for any textbook lost. The inventory system will be attaching student’s unique codes to the books ordered. This will help the University Library in determining the exact number of books that have been issued to students.

Receiving textbooks (searching, sorting)

Before issuing the textbooks, both the searching and sorting processes will have to be run. This is meant for purpose of determining whether the ordered books are available or not. Receiving of books will be determined on whether the books ordered are in the form of softcopy or hardcopy. Moreover, the new textbook inventory system will be using sorting process to determine the books that are at demand among students.

Determining retail price and pricing used textbooks

The new textbook inventory system will be connected to online websites that deal with retail selling of books such as Amazon. This will help in ensuring the University Library purchases books at the best price through comparing different prices in numerous websites. The new textbook inventory system will be designed to automatically decide on the pricing of used books depending on the time when such books have been in use. Pricing of used books can be done using codes. Different codes will be issued based on the period which the book has been in use.

Determining quantity on hand

For purposes of ensuring the campus doesn’t run out of books, the new textbook inventory system will be configured with statistical programs such as Excel. Using these tools, it will be easy to conclude on which books are at high demand. Moreover, the system will be configured with generic algorithm for purposes of determining the quantities of books at hand and provide data for future order decisions.

Recording textbook sales and textbook returns

Textbook sales and returns will be determined using independent codes. After a book is ordered and issued, its code will be recorded automatically on an excel sheet. By the end of the day, the University Library department will only open the excel sheet to determine the number of books that have been ordered and issued. When returning the textbook, student’s identification credentials such as the unique code will be fed on the system with the command “return”. The new system will then request for the book code. After the book code is put into the system, books recorded as issued will disappear and automatically add to the available and unordered books.

The pseudocode for the textbook data and student data structure is defined in the following:

Textbook Data

Title(string)

Author(string)

Condition(int range 1-5)

Price $(float)

ISBN(int)

Timeout(int) – Date

Inventory(int)

DueDate(int)

Returned(T or F)

Student Data Structure

Name(string)

StudentCode(string) this will not be used in calculations and student code may include hyphens or letters so int is not necessary

YearsOfStudy(int)

Balance $(float)

Address(string)

Functions:

Purchase/RentalHistory function will use ISBN and StudentCode for tracking

Payment function will use Student Balance, Price and StudentCode to make payments

LateFee function will use TimeOut to calculate severity of late fee and DueDate;

Returned to determine if a late fee will be applied

Shipping function will use StudentCode, Balance and Address to charge for shipping and

generate shipping information

WEEK 3

RECURSIVE PSEUDOCODE

Using the scenario from above, develop a recursive pseudocode algorithm.

private static void BookSearch(String TextToSearch, Array BookArray)

String BookTitle = Null

if BookTitle is found

return

else if BookArray is empty

return

else

Read BookArray[1]

Search Book Title for TextToSearch

Search Book Chapers for TextToSearch

Search Book Text for TextToSearch

if text found, BookTitle = BookArray title

For each item in BookArray

BookSearch(TextToSerch, BookArray)

WEEK 4

SORT PRIORITIES

Best options to sort University’s library catalogs, lists, and databases

The University’s catalogs, lists, and databases can be sorted effectively by using the methods of sorting like merge sort, insertion sort, quick sort, and bubble sort etc. These sorting options make the processing of the data related to various books in the University’s library much easier and time-saving. Moreover, these options are also suitable for the records of data in the form of lists as the University has to deal with records of various books in its library.

Best options to search through University’s library catalogs, lists, and databases

The best options available for searching various data of University’s library catalogs, lists, and databases are of linear searches and binary searches. The list of data is checked sequentially for the target value in the linear search option whereas the position of the target value is determined in a sorted list in the binary search option.

List of the character sort strings and numerical data searches

The list of character sort strings includes sorting the string by alphabetical order, by reverse alphabetical order, by string length, and by numeric order. Similarly, the numerical data searches are divided into two categories namely linear searches and binary searches.

Arrays, subarrays, and where normalization database links may need to be revised

There are certain cases of arrays and subarrays in which the normalization of database links may need to be performed again so that the processing on such arrays and subarrays can be efficiently performed. The normalization of databases makes the associated processing of library books’ data like entering and retrieving records more easily as well as efficiently.

Pivindex

Pivindex is the local variable used in the method of quicksort which plays a major role in the partitioning of sorted data so that it can be retrieved with much convenience and ease at the time of need.