Design and implement a software system, Data Structure & Algorithms

Assignment Help:

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

 


Related Discussions:- Design and implement a software system

Representation of max-heap sequentially, Q. How do we represent a max-heap ...

Q. How do we represent a max-heap sequentially? Explain by taking a valid   example.         Ans: A max heap is also called as a descending heap, of size n is an almos

Insertion of a node into a binary search tree, A binary search tree is cons...

A binary search tree is constructed through the repeated insertion of new nodes in a binary tree structure. Insertion has to maintain the order of the tree. The value to the lef

Data mining, hello, i need help in data mining assignment using sas em and...

hello, i need help in data mining assignment using sas em and crisp-dm

Threaded Binary Tree, If a node in a binary tree is not containing left or ...

If a node in a binary tree is not containing left or right child or it is a leaf node then that absence of child node can be represented by the null pointers. The space engaged by

Linear array, representation of linear array

representation of linear array

Best case, Best Case: If the list is sorted already then A[i] T (n) = ...

Best Case: If the list is sorted already then A[i] T (n) = c1n + c2 (n -1) + c3(n -1) + c4 (n -1)  = O (n), which indicates that the time complexity is linear. Worst Case:

Explain in brief about the container, Explain in brief about the Container ...

Explain in brief about the Container An entity which holds finitely many other entities. Just as containers such as boxes, baskets, bags, pails, cans, drawers, and so for

Algorithm for similar binary tree, Q. The two Binary Trees are said to be s...

Q. The two Binary Trees are said to be similar if they are both empty or if they are both non- empty and left and right sub trees are similar. Write down an algorithm to determine

State the painter algorithm, Painter's Algorithm As the name suggests, ...

Painter's Algorithm As the name suggests, the algorithm follows the standard practice of a painter, who  would paint the background (such as a backdrop) first, then the major d

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