Program for keep track of the titles of ebooks, Programming Languages

This assignment will just focus on NookyKindle eBook orders.  That is, we'll be keeping track of the titles of eBooks and the number of orders for that particular eBook during a particular time frame (like, since the beginning of the year).

 So, the level one assignment involves using two arrays: (1) an array of Strings to store the titles of the eBooks and (2) an array of ints to store the number of orders for the corresponding eBook during the relevant period of time.  This program is about keeping track of the various eBooks that the NookyKindle eBook Corporation has been selling and keeping track of how well they are doing in terms of sales.

The two arrays mentioned above will be kept "in correspondence".  Thus, suppose the first array is called eBookList and the second array is called numOrderedList.  Then, it will always be the case that numOrderedList[k] will be the total number of orders for the eBook whose title is eBookList[k].  You may assume that a given eBook title only appears once in the array eBookList.  

Your program will involve implementing the following phases (using methods):

1) Data entry phase.  Ask the user for the number of eBook titles to be processed.  Say this value is numEBooks.  Then, you will ask the user for and get numEBooks-many pairs of values.  Each pair will contain the title of the eBook (like "WAR AND PEACE") and the total number of orders for that eBook (like 2).  Note that the book titles should be stored in upper case.  (So, "WAR AND PEACE" and not "War and Peace").  These pairs of values will be stored in the arrays eBookList and numOrderedList.

2) Data sorting phase.  This phase will involve using the bubblesort algorithm to sort the eBook data alphabetically using the (upper-cased!) names in the eBookList array.  As you rearrange the data in the eBookList array (using bubblesort), you will keep the amounts in the numOrderedList array in the correct correspondence, so that numOrderedList[k] will be maintained as the total number of orders for the eBook listed at eBookList[k].   As you swap the eBook titles during bubblesort, the corresponding number of orders will have to be swapped.

3) Data searching phase.  During this phase the user will be given the following prompt for input in a loop:

Enter eBook title or * to quit:

If the user enters '*', then the searching process will come to an end and the program will terminate.  If the user enters anything else, that input data will be treated as the title of an eBook.  The binary search algorithm will then be used to find that eBook in the sorted array, eBookList.  If that eBook is found, then the total number of orders for that eBook will be displayed.  If that eBook is not found, the program will display a message such as:

No data for that eBook was found.

The searching continues until the user enters '*' in response to the "Enter eBook title or * to quit:" prompt.  Note that the searches should not be case-sensitive.  All eBook titles should be stored in the array eBookList in upper case.  Likewise, search keys entered during the searching phase (i.e., the titles of eBooks the user is searching for) should also be upper-cased.

 (Level Two)

For the level two assignment in lieu of using two arrays to store the eBook order data use one array, an array of EBookOrderData objects.  Here is the UML diagram for a simple EBookOrderData class appropriate for this assignment:

EBookOrderData

- title : String

- orders : int

+ EBookOrderData()

+ EBookOrderData(aTitle: String,

    numOrd: int)

+ setTitle(aTitle: String) : void

+ setOrders(numOrd: int) : void

+ getTitle() : String

+ getOrders() : int

The program behavior (from the user's perspective) will be exactly the same as in the level one (non-extra-credit) assignment.  However, as the eBook order data is entered, it will be stored in an array of EBookOrderData objects.  After the data entry phase is completed, the array of EBookOrderData objects will be sorted using the bubblesort algorithm.  The EBookOrderData array will be sorted based on the titles of the eBooks (i.e., using the title field in the EBookOrderData objects in the array).

Then, the program will enter the searching phase.  When the user enters the name of an eBook to be searched for, the binary search algorithm will be used to attempt to find that eBook in the array of EBookOrderData objects.  Again, the program's behavior (from the user's perspective) will be identical to the behavior in the level one assignment.

Posted Date: 2/21/2013 12:14:44 AM | Location : United States







Related Discussions:- Program for keep track of the titles of ebooks, Assignment Help, Ask Question on Program for keep track of the titles of ebooks, Get Answer, Expert's Help, Program for keep track of the titles of ebooks Discussions

Write discussion on Program for keep track of the titles of ebooks
Your posts are moderated
Related Questions
1.   You have been asked to write a computer program that will figure out the total of an order when given the amount of the order ($200) and a sales tax rate of five percent.  I w


i am stuck on array part from getting response of jquery. anyone could help?

I have to create a calorie counter and I am totally lost

1. Write a shell script to locate executable files. This script takes a list of file names from the command line and determines which would be executed had these names been given a

Need support in Mobile app using AngularJS, Cordova (PhoneGap), Ionicframework We need an experienced front-end developer with a obsession for performance in mobile environment.

Problem 6. Demonstrate how and when can you use the commands- vi, cat, chmod, grep, man, pwd, ps, kill, mkdir, rm demonstrating how and when the above 10 commands can be

How to create an ER diagram?

What are Attributes in HTML langauge? A few tags have attributes. An attribute is a name, followed through an = sign, followed by the value. For instance, to make a centered H1

Write a Prolog predicate remove_nth(N,L1,L2) that is true if list L2 is just list L1 with its Nth element removed. If L1 does not have an Nth element then the predicate should fail