Design the system for seller, Data Structure & Algorithms

Your program should include three components selling, buying and managing for the use of sellers, buyers and the Manager, respectively. Provide a menu for a user to enter each component. 

Selling

When a seller has an item to sell, she/he will first check the catalogue to find a suitable category to place the item. Your program should allow the seller to traverse all  available categories level by level from the root to the leaves. Giving the above catalogue as an example, the program will first show the following root category:

Catalogue:

1 Books

2 Movies, Music and Games

3 Home, Garden and Tools

4 Sports & Outdoors

5 Add a new category

6 Add a selling item

7 Quit to main menu
 
If the user chooses Option 1, your program will list the content of subcategory -

Books:
 
Books:
1 Textbooks

2 Audiobooks

3 Magazines

4 Add a new category

5 Add a selling item

6 Quit to main menu
 
If a user chooses a number which points to a selling item, your program should show the information of the item (expect for the information of maximal discounts). If a user chooses "Add a new category", the program should ask for the title of the category and add it into the catalogue. If the user chooses "Add a selling item", the program should ask for the information of the item and add the item into the catalogue under the current level.  

Note that a category can contain either subcategories, selling items or both. For instance, there could be a selling item under Books, which does not belong to any subcategory under this category.

Posted Date: 3/16/2013 6:13:03 AM | Location : United States







Related Discussions:- Design the system for seller, Assignment Help, Ask Question on Design the system for seller, Get Answer, Expert's Help, Design the system for seller Discussions

Write discussion on Design the system for seller
Your posts are moderated
Related Questions
Q. Explain any three methods or techniques of representing polynomials using arrays. Write which method is most efficient or effective for representing the following polynomials.


3. A function to convert a complex number in algebraic form to a complex number in phasor form

Define tractable and intractable problems Problems that can be solved in polynomial time are known as tractable problems, problems that cannot be solved in polynomial time are

Asymptotic notation Let us describe a few functions in terms of above asymptotic notation. Example: f(n) = 3n 3 + 2n 2 + 4n + 3 = 3n 3 + 2n 2 + O (n), as 4n + 3 is of

Implement multiple stacks in a single dimensional array. Write algorithms for various stack operations for them.

advanatges of dynamic data structure in programming

Dequeue (a double ended queue) is an abstract data type alike to queue, where insertion and deletion of elements are allowed at both of the ends. Like a linear queue & a circular q

Write a procedure (make-stack) that produces independent stack objects, using a message-passing style, e.g. (define stack1 (make-stack))  (define stack2 (make-stack)) W

Develop a program that accepts the car registration( hint: LEA 43242010)