CS301 GDB Solution Fall 2018

Suppose you have to build a software for a company. The software should have the capability to store, retrieve, update and delete information about its customers.

A large number of customers visit the company’s store every day and get registered. The date and the time of registration should be recorded automatically for customers at the time of their registration. Their information can be added (as they register), searched (if needed for any purpose), updated (if any change in their status) and removed (if they quit their registration) from the system. The system should have capability to traverse the customers’ records on the basis of the dates and times when they were added into the system.

Considering this scenario, which data structure do you think would work the best when fast insertion of a new customer is the key requirement of the system?

Justify your selection of data structures with strong arguments.

You have the following data structures as options to choose from:

–          Linked List:

–          Binary Search Tree

–          Heap




·         Your answer should not exceed 3 – 4 lines of text in justification of your selected data structure.

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

Download Solution cs301 gdb Solution

This is Solution Idea Plz dont copy paste same it is, otherwise you will be get zero marks

Junaid Asghar