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
Q. Explain what do we understand by Binary Search Tree (BST)? Make a BST for the following given sequence of the numbers. 45, 32, 90, 21, 78, 65, 87, 132, 90, 96, 41, 74, 92

Graphs are data structures which consist of a set of vertices & a set of edges which connect the vertices. A graph where the edges are directed is called directed graph. Or else, i


Explain about Hidden-surface Hidden-line removal refers to wire-frame diagrams without surface rendering and polygonal surfaces with straight edges. Hidden-surface removal ref

compare and contrast the bubble sort,quick sort,merge sort and radix sort

Write a program to create a hashed file that stores the records currently in the file " data_2013 ". Records should use the same fixed-length schema given previously, and should ag

Q. Draw a B-tree of order 3 for the sequence of keys written below: 2, 4, 9, 8, 7, 6, 3, 1, 5, 10

The Ruby Programming Language Although data structures and algorithms we study aren't tied to any program or programming language, we need to write particular programs in speci

explain collision resloving techniques in hasing

A tree is a non-empty set one component of which is designated the root of the tree while the remaining components are partitioned into non-empty groups each of which is a subtree