Read carefully and answer the questions that follow: Suppose we want to create a

Question

Read carefully and answer the questions that follow:

Suppose we want to create an address book which contains names, phone numbers, emails, and other personal information. In the question below, give support to your answer based on the typical operations (for example, finding a person by his/her email) you might use. Explain why the algorithm and/or data structure you use gives a good tradeoff between memory use and runtime complexity. The question below could require nested data structures.

Suppose you have friends who live in various different cities. What data structure could be useful to find these friends efficiently. You can suppose that each friend has a city field associated with them. Give reasoning to your answer. Think about search engines for this question.

Explanation / Answer

Database index iis the datastructure that is used for easy retreival of data from the database.Here they may have additional cost of storage space where index is stored. The index is used to retreive the data from the table without the row-wise search in the system.

In such a datastructure it is easy to to retrieve the data using contact umber or email id .Here the search engine very easy to implement and hence the data can be retrieved quickly without delay of searching since it uses the index search.

Here all the data is stored in the database using some index which reduces the row or column wise search.Hence it is more efficient to implement search.

Related Questions

Navigate

• Browse (All)
• Browse R
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.