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
create a flowchart that displays the students average score for these quizzes

Determine the precondition of a binary search For instance, precondition of a binary search is that array searched is sorted however checking this precondition is so expensive

Game trees An interesting application of trees is the playing of games such as tie-tac-toe, chess, nim, kalam, chess, go etc. We can picture the sequence of possible moves by m

Post-order Traversal This can be done both iteratively and recursively. The iterative solution would need a change of the in-order traversal algorithm.

What is binary search?   Binary search is most useful when list is sorted. In binary search, element present in middle of the list is determined. If key (the number to search)

Program will demonstrate the insertion of an element at desired position /* Inserting an element into contiguous list (Linear Array) at particular position */ /* contiguous_

In computer programming, Trees are utilized enormously. These can be utilized for developing database search times (binary search trees, AVL trees, 2-3 trees, red-black trees), Gam

find the grammar of regular expression of (a/?)(a/b)?

(1) Sort a list of distinct numbers in ascending order, using the following divide- and-conquer strategy (Quicksort): divide the list of numbers into two lists: one that contains a

Q. Write down an algorithm to evaluate an expression given to you in postfix notation. Show the execution of your algorithm for the following given expression. AB^CD-EF/GH+/+*