We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
Study Groups By Subject code Wise (Click Below on your university link & Join Your Subject Group)
Looking For Something at vustudents.ning.com?Search Here
Graded Discussion Board (GDB) will be launched on Monday, January 29, 2018 and it will close on Tuesday, January 30, 2018.
Suppose you are working as a developer in a software house. A task is given to you to build an application for a shopping mall to maintain the inventory of different products. Products are divided into different categories. The number of categories are fixed but products in each category can increase/decrease depend on introducing new products. When new product will arrive it will be added to its category, if product will already in any category then only its quantity will update.
From array, singly linked list and doubly linked list, which data structure you will prefer to use to build required application. Searching of product should be efficient and application should take minimum possible memory. Select data one or more structure(s) of your choice with solid reason to justify your selection.
A concise, coherent and to the point answer is preferred over lengthy comment having irrelevant details. Answers, posted on regular Lesson's MDB or sent through email will NOT be considered in any case.
Please note GDB does not have any grace day. We are giving about a full week to prepare your comments and 48 hours to just post them. GDB comments will not be accepted through email in any case.
Best of Luck!
Share This With Friends......
singly linked list
would singly linked list be better?
Singly linked list date structure I all prefer to use to build required application. Searching of product should be efficient and application should take minimum possible memory. Because
Singly linked list can mostly be used for stacks
gdb cs301 plz
linked list is not best choice for mentioned scenario .
because in linked list we access elements sequentially starting from first node.
in liked list extra memory space for a pointer is required for each elements.
Bro. we have to look for two thing is this scenario. First, the size of memory and the second is the efficiency. Both of these are available in linked lists. More arrays can use large amount of memory, That's why in the given scenario we can use linked lists. And in my opinion the Singly Linked list is best.
what if we use doubly linked list for faster searches?