Say you need to determine which data structure best fits your system. For that, you want to differentiate linear and non-linear data structure. What are differences between the two (linear and non-linear structures)? In terms of traversing how different are they (can you traverse your structure in just one run, in either of the structures)? What is the benefit of balancing the trees? Why do you think "binary trees" are essential in algorithm and data strucutre?
Concepts in Designing Database
A database design is the process of data organization based on a database model. The process deals with identifying what data should be stored in a database and how data elements relate to each other.
Entity Relationship Diagram
Complex real-world applications call for large volumes of data. Therefore, it is necessary to build a great database to store data safely and coherently. The ER data model aids in the process of database design. It helps outline the structure of an organization’s database by understanding the real-world interactions of objects related to the data. For example, if a school is tasked to store student information, then analyzing the correlation between the students, subjects, and teachers would help identify how the data needs to be stored.
- Say you need to determine which data structure best fits your system. For that, you want to differentiate linear and non-linear data structure. What are differences between the two (linear and non-linear structures)? In terms of traversing how different are they (can you traverse your structure in just one run, in either of the structures)?
- What is the benefit of balancing the trees?
- Why do you think "binary trees" are essential in
algorithm and data strucutre?
Step by step
Solved in 2 steps
