Answer:
The design model is the description of the model to be implemented, the analysis model is the model that links the design and the system or domain model while the domain model is the entire software implementation.
Explanation:
The domain model is the conceptual aspect of software engineering that comprises operational and data features. The analysis model is the schematic description of the system that links the design model to the system domain. The design model is also known as the object model as it shows an abstract representation of the implementation. It helps to test the quality of the software been developed.
The correct answer is True.
Explanation
When we must solve a multiple-choice test or exam, in most cases, we are asked to select only one choice from four or more options. This means we need to know which is the correct answer from the options given to obtain a good grade. Due to this, we must be very precise when responding and paying attention to details because many times the answers are very similar, but only one contains all the elements that answer the question.
One of the most used methods to do this is "eliminating answers" this means we discard answers that we are sure are not possible answers by crossing out these and leaving only the correct answer or a few possible correct answers, in this case, we will need to analyze the remaining answers to select the most appropriate. So, the correct answer is True.
Answer:
Data base
Explanation:
Database holds all your information.
Created a new multilevel list style to add to the gallery
In conclusion there are many different data structures. Each data structure has strengths and weaknesses which affect performance depending on the task. Today, we explored two data structures: arrays and linked lists. Arrays allow random access and require less memory per element (do not need space for pointers) while lacking efficiency for insertion/deletion operations and memory allocation. On the contrary, linked lists are dynamic and have faster insertion/deletion time complexities. However, linked list have a slower search time and pointers require additional memory per element in the list. Figure 10 below summarizes the strength and weakness of arrays and linked lists.
