Answer:
True
Explanation:
I just know the answer because I'm a genius hehe
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:
Hope this helps you out Answer: Greater security
Explanation:
Server maintains better relationship with server at everry time. So it gives maximum of security and reliability against unauthorised access
Answer is Bit defender Internet security
B
Answer:
The solution code is written in Python 3:
- def modifyList(listNumber):
- posCount = 0
- negCount = 0
-
- for x in listNumber:
- if x > 0:
- posCount += 1
- else:
- negCount += 1
-
- if(posCount == len(listNumber)):
- listNumber.append(max(listNumber))
-
- if(negCount == len(listNumber)):
- listNumber.append(min(listNumber))
-
- print(listNumber)
-
- modifyList([-1,-99,-81])
- modifyList([1,99,8])
- modifyList([-1,99,-81])
Explanation:
The key step to solve this problem is to define two variables, posCount and negCount, to track the number of positive value and negative value from the input list (Line 2 - 3).
To track the posCount and negCount, we can traverse through the for-loop and create if else statement to check if the current number x is bigger than 0 then increment posCount by 1 otherwise increment negCount (Line 5- 9).
If all number in the list are positive, the posCount should be equal to the length of the input list and the same rule is applied to negCount. If one of them happens, the listNumber will append either the maximum number (Line 11 -12) or append the minimum number (Line 14-15).
If both posCount and negCount are not equal to the list length, the block of code Line 11 -15 will be skipped.
At last we can print the listNumber (Line 17).
If we test our function using the three sets of input list, we shall get the following results:
[-1, -99, -81, -99]
[1, 99, 8, 99]
[-1, 99, -81]
