Answer:
Basic characteristics of OOAD and compression with SAD can be defined as follows:
Explanation:
The Object-oriented analysis is described as a design and analysis system like an application, that uses Oops programming. It is the measurement model, that is the presentation, which became a part of the object-based review.
The features of OOAD can be defined as follows.
- The complex issues are simply solved.
- The operation of very fast recovery.
- The stability in condition changes.
- Its conceptual method for resolving its extremely complex problems.
The difference in OOAD and SAD can be defined as follows:
- The OOAD mainly focuses upon the design of objects, it can be used in highly complex logical systems, whereas the SAD focuses on data analysis systems and processes.
- The OOAD uses the framework to target data, but the SAD is process-oriented. It uses class and UML diagrams, but SSAD uses DFDs to extract the element, it has many limited steps to prepare and execute, but OOAD relies mostly on initial growth. This method is being developed in the course of the process.
Answer:
O(N!), O(2N), O(N2), O(N), O(logN)
Explanation:
N! grows faster than any exponential functions, leave alone polynomials and logarithm. so O( N! ) would be slowest.
2^N would be bigger than N². Any exponential functions are slower than polynomial. So O( 2^N ) is next slowest.
Rest of them should be easier.
N² is slower than N and N is slower than logN as you can check in a graphing calculator.
NOTE: It is just nitpick but big-Oh is not necessary about speed / running time ( many programmers treat it like that anyway ) but rather how the time taken for an algorithm increase as the size of the input increases. Subtle difference.
Answer:
i dont know sorry but answer above lol
Explanation:
Ask your friends if they are doing something wrong with your friends and friends
1. a.
2. d
3. b
I hope this helps
