Design and implement a software system, Data Structure & Algorithms

In this assignment, you are invited to design and implement a software system for catalogue sale. A catalogue is organised in a tree structure. Each node of the catalogue tree represents either an item for sale or a category. The following is an example of such a catalogue:

Books
    Textbooks
      Computer Science
        Data structures Using C++ 
                        Java: How to program 
      Mathematics
        ...
      Social Science
        ...
Audiobooks
    ...
Magazines
    ...
Movies, Music & Games
    Blue-ray
      ...
    Music
      MP3 Downloads
    Video Games
Home, Garden & Tools
    Kitchen & Dining
    Appliances
    ...
Sports & Outdoors
    Exercise & Fitness
      Precor Premium Series 9.31 Treadmill
    Bike & Scooters 
      ...
 
 
There are three roles in the system: sellers, buyers and the Manager.
 
A seller can:

  • Traverse the catalogue
  • Place a sell item under an existing category
  • Create a new subcategory under the root category or any other subcategories

 

Posted Date: 3/16/2013 6:10:35 AM | Location : United States







Related Discussions:- Design and implement a software system, Assignment Help, Ask Question on Design and implement a software system, Get Answer, Expert's Help, Design and implement a software system Discussions

Write discussion on Design and implement a software system
Your posts are moderated
Related Questions
HSV Colour Model Instead of a set of colour primaries, the HSV model uses colour descriptions that have a more intuitive appeal to a user. To give a colour specification, a use

This method is the reverse of FIFO and assumes that each issue of stock is made from latest items received in the enterprises .Thus if the last lot to be received is not sufficient

Explain the term totalling To add up a series numbers the subsequent type of statement must be used: Total = total + number  This literally means (new) total = (old) t

Example which cause problems for some hidden-surface algorithms Some special cases, which cause problems for some hidden-surface algorithms, are penetrating faces and cyclic ov

Merge sort is a sorting algorithm which uses the basic idea of divide and conquers. This algorithm initially divides the array into two halves, sorts them separately and then merge


Example: Insertion of a key 33 into a B-Tree (w/split) Step 1: Search first node for key closet to 33. Key 30 was determined. Step 2: Node pointed through key 30, is se

Elaborate the symbols of abstract data type length(a)-returns the number of characters in symbol a. capitalize(a)-returns the symbol generated from a by making its first cha

List various problem solving techniques. There are two techniques:- 1.  Top down 2.  Bottom- up

This unit discussed about data structure called Arrays. The easiest form of array is a one-dimensional array which may be described as a finite ordered set of homogeneous elements