07-19-2014, 02:27 PM
[B]CS301 Data Structure GDB Ideal Soultion Spring Semester Fall 2014 Close Date July 24, 2014
GDB Questions:
Your job is to choose appropriate data structure for each of the above data (i.e. Products and Customers) keeping in view their given usage pattern. justify your choice with solid arguments.
Hint:
Scenario 1 - As number of insertion, searching and deletion operation (of products) are same so you can choose either binary tree or hash function for its implementation.
Scenario 2 – As number of insertion is greater than searching and deletion (of customers) so you can choose either singly or doubly linked list for its implementation.[/B]
GDB Questions:
Your job is to choose appropriate data structure for each of the above data (i.e. Products and Customers) keeping in view their given usage pattern. justify your choice with solid arguments.
Hint:
Scenario 1 - As number of insertion, searching and deletion operation (of products) are same so you can choose either binary tree or hash function for its implementation.
Scenario 2 – As number of insertion is greater than searching and deletion (of customers) so you can choose either singly or doubly linked list for its implementation.[/B]