[Solved] CSE 310 Data Structures & Algorithms Midterm Exam I1- Part II

1. [20 Pts] Applicability of Different Data Structures
2. A) Suppose you are given the following data structures and the set of operations that you need to perform while implementing a certain application.

Data Structures : BST, RBT, Linked List, Queue, Heap, unsorted array

Operations : Insert, Find Max.

• [10 Pts] What is the data structure you select? Clearly state the reasons for selection based on the running time and space requirements. Then, state why you have rejected other data structures using the same parameters (running time and space requirements)

• [10 Pts] Now suppose you need perform: Insert, Find Max, find min, delete, and search operations. What is the data structure you select? Clearly state the reasons for selection based on the running time and space requirements. Then, state why you have rejected other data structures using the same parameters (running time and space requirements)

2. [20 Pts] Applicability of Different Data Structures

Suppose you are developing an application that store bank customer information. The application requires performing inserts, deletes, and searches. The customer information includes:

Customer ID : 6 digit int number

Name : string

Account Number : String

Account Balance: double

1. You are given a task of designing this application and two data structures are available for you. Direct access table and hash table that handles collision by chaining. Bank is expected to have 10000 customers. Customer ID is used as the key. Which data structure would you choose? Clearly explain your answer.

1. Suppose you decided to go with hash table that handles collision by chaining, if the load factor is 50, what is the size of the hash-table you would select? Clearly show how you arrived at the answer

1. Write the C++ code that represent the record structure for the implementation (b) above. No need to implement the hash table, only the node structure that implement bank record.