.... How to Find Your Subject Study Group & Join ....   .... Find Your Subject Study Group & Join ....  

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)

[ + VU Study Groups Subject Code Wise ]  [ + COMSATS Virtual Campus Study Groups Subject Code Wise ]

Looking For Something at vustudents.ning.com?Search Here

CS301 - GDB#1 will be launched on January 29, 2018, closing date is January 30, 2018.

Dear Students!


Graded Discussion Board (GDB) will be launched on Monday, January 29, 2018 and it will close on Tuesday, January 30, 2018.

GDB Scenario: 

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.

GDB Questions:

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.

Instructions:

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......


How to Find Your Subject Study Group & Join.

Find Your Subject Study Group & Join.

+ Click Here To Join also Our facebook study Group.


This Content Originally Published by a member of VU Students.

+ Prohibited Content On Site + Report a violation + Report an Issue

+ Safety Guidelines for New + Site FAQ & Rules + Safety Matters

+ Important for All Members Take a Look + Online Safety


Views: 4486

See Your Saved Posts Timeline

Replies to This Discussion

singly linked list

full and final solution click here below link

https://www.youtube.com/watch?v=A1scUt65CA8

would singly linked list be better?

full and final solution click here below link

https://www.youtube.com/watch?v=A1scUt65CA8

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

  • A singly linked list is a linked list where the node contains some data and a pointer to the next node in the list
  • It allows traversal only in one way
  • It uses less memory per node (single pointer)
  • Complexity of insertion and deletion at a known position is O(n)
  • Singly linked list can mostly be used for stacks

gdb cs301 plz

full and final solution click here below link

https://www.youtube.com/watch?v=A1scUt65CA8

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?

RSS

Forum Categorizes

Job's & Careers (Latest Jobs)

Admissions (Latest Admissons)

Scholarship (Latest Scholarships)

Internship (Latest Internships)

VU Study

Other Universities/Colleges/Schools Help

    ::::::::::: More Categorizes :::::::::::

Member of The Month

1. + ! ! ! ! ϝιƴα ^

Venice, Italy

© 2018   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service