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
1. Write a pseudocode algorithm to print the numbers from 1 to 10, and then from 10 to 1, using exactly one loop. 2. The function contains() takes a food as an argument and tell

#question. merging 4 sorted files containing 50,10,25,15 records will take time?

How sparse matrix stored in the memory of a computer?

Q. Devise a representation for a given list where insertions and deletions can be made at both the ends. Such a structure is called Deque (which means Double ended queue). Write fu


Initially Nodes are inserted in an AVL tree in the same manner as an ordinary binary search tree. Though, the insertion algorithm for any AVL tree travels back along with the pa

Threaded Binary Tree : If a node in a binary tree is not having left or right child or it is a leaf node then that absence of child node is shown by the null pointers. The spac

Instructions Design and test a reference array. Reference array stores the references to user supplied objects of different types. Just think it as a heterogeneous array wh

Define File organization''s and it''s types

Binary Search Tree usage: Write a program to compare the time taken for a search in a skewed tree, a balanced tree, and a random tree. Speci cally, your program should do the