Design the system for seller, Data Structure & Algorithms

Assignment Help:

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.


Related Discussions:- Design the system for seller

Simplifying assumptions of wire frame representation, Simplifying Assumptio...

Simplifying Assumptions of wire frame representation Neglect colour - consider Intensity: For now we shall forget about colour and restrict our discussion just to the intensi

The complexity ladder, The complexity Ladder: T(n) = O(1). It is ca...

The complexity Ladder: T(n) = O(1). It is called constant growth. T(n) does not raise at all as a function of n, it is a constant. For illustration, array access has this c

Psedocodes, write a pseudocode to input the top speed (in km''s/hours) of 5...

write a pseudocode to input the top speed (in km''s/hours) of 5000 cars output the fastest speed and the slowest speed output the average (mean) speed of all the 5000 cars answers

Red-black trees, A Red-Black Tree (RBT) is a type of Binary Search tree wit...

A Red-Black Tree (RBT) is a type of Binary Search tree with one extra bit of storage per node, i.e. its color that can either be red or black. Now the nodes can have any of the col

Advantages of first in first out method, Advantages of First in First out (...

Advantages of First in First out (FIFO) Costing Advantages claimed for first in first  out (FIFO)  costing method are: 1. Materials used are drawn from the cost record in

Complexity of quick sort, Q. What do you mean by the best case complexity o...

Q. What do you mean by the best case complexity of quick sort and outline why it is so. How would its worst case behaviour arise?

Algorithm for inorder traversals, Step-1: For the current node, verify whet...

Step-1: For the current node, verify whether it contain a left child. If it has, then go to step-2 or else go to step-3 Step-2: Repeat step-1 for left child Step-3: Visit (th

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd